1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * |
5 | * |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
7 | * the terms of the Affero GNU General Public License as published by the |
7 | * the terms of the Affero GNU General Public License as published by the |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
9 | * option) any later version. |
9 | * option) any later version. |
10 | * |
10 | * |
11 | * This program is distributed in the hope that it will be useful, |
11 | * This program is distributed in the hope that it will be useful, |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | * GNU General Public License for more details. |
14 | * GNU General Public License for more details. |
15 | * |
15 | * |
16 | * You should have received a copy of the Affero GNU General Public License |
16 | * You should have received a copy of the Affero GNU General Public License |
17 | * and the GNU General Public License along with this program. If not, see |
17 | * and the GNU General Public License along with this program. If not, see |
18 | * <http://www.gnu.org/licenses/>. |
18 | * <http://www.gnu.org/licenses/>. |
19 | * |
19 | * |
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
21 | */ |
21 | */ |
22 | |
22 | |
23 | /* Send bug reports to Raphael Quinet (quinet@montefiore.ulg.ac.be) */ |
23 | /* Send bug reports to Raphael Quinet (quinet@montefiore.ulg.ac.be) */ |
24 | |
24 | |
… | |
… | |
31 | |
31 | |
32 | #include <global.h> |
32 | #include <global.h> |
33 | #include <sproto.h> |
33 | #include <sproto.h> |
34 | #include <sounds.h> |
34 | #include <sounds.h> |
35 | |
35 | |
36 | #include <tr1/unordered_map> |
36 | #include <flat_hash_map.hpp> |
37 | |
37 | |
38 | // the hashtable |
38 | // the hashtable |
39 | typedef std::tr1::unordered_map |
39 | typedef ska::flat_hash_map |
40 | < |
40 | < |
41 | const char *, |
41 | const char *, |
42 | faceidx, |
42 | faceidx, |
43 | str_hash, |
43 | str_hash, |
44 | str_equal, |
44 | str_equal, |
… | |
… | |
99 | |
99 | |
100 | packet sl ("sc"); |
100 | packet sl ("sc"); |
101 | |
101 | |
102 | uint8 *len = sl.cur; |
102 | uint8 *len = sl.cur; |
103 | |
103 | |
104 | sl << uint8 (0) // group length |
104 | sl << uint8 (0) // group length, decoded as BER in clients |
105 | << uint8 (0) // type == one-time effect |
105 | << uint8 (0) // type == one-time effect |
106 | << ber32 (sound) |
106 | << ber32 (sound) |
107 | << sint8 (dx) |
107 | << sint8 (dx) |
108 | << sint8 (dy) |
108 | << sint8 (dy) |
109 | << uint8 (vol); // 0 == silent, 255 max |
109 | << uint8 (vol); // 0 == silent, 255 max |
110 | |
110 | |
111 | *len = sl.cur - len; // patch in group length |
111 | *len = sl.cur - len - 1; // patch in group length |
112 | |
112 | |
113 | send_packet (sl); |
113 | send_packet (sl); |
114 | } |
114 | } |
115 | else if (this->sound) |
115 | else if (this->sound) |
116 | { |
116 | { |