… | |
… | |
24 | #include "../config.h" |
24 | #include "../config.h" |
25 | #include "rxvt.h" |
25 | #include "rxvt.h" |
26 | |
26 | |
27 | #ifdef KEYSYM_RESOURCE |
27 | #ifdef KEYSYM_RESOURCE |
28 | |
28 | |
29 | #include <cstring> |
29 | #include <string.h> |
30 | |
30 | |
31 | #include "rxvtperl.h" |
31 | #include "rxvtperl.h" |
32 | #include "keyboard.h" |
32 | #include "keyboard.h" |
33 | |
33 | |
34 | /* an intro to the data structure: |
34 | /* an intro to the data structure: |
… | |
… | |
168 | |
168 | |
169 | void |
169 | void |
170 | keyboard_manager::register_done () |
170 | keyboard_manager::register_done () |
171 | { |
171 | { |
172 | unsigned int i, index, hashkey; |
172 | unsigned int i, index, hashkey; |
173 | vector <keysym_t *> sorted_keymap; |
|
|
174 | uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket |
173 | uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket |
175 | |
174 | |
176 | memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
175 | memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
177 | |
176 | |
178 | // determine hash bucket size |
177 | // determine hash bucket size |
… | |
… | |
190 | index += hash_bucket_size [i - 1]; |
189 | index += hash_bucket_size [i - 1]; |
191 | hash [i] = index; |
190 | hash [i] = index; |
192 | } |
191 | } |
193 | |
192 | |
194 | // and allocate just enough space |
193 | // and allocate just enough space |
195 | sorted_keymap.insert (sorted_keymap.begin (), index + hash_bucket_size [i - 1], 0); |
194 | simplevec <keysym_t *> sorted_keymap (index + hash_bucket_size [i - 1], 0); |
196 | |
195 | |
197 | memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
196 | memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
198 | |
197 | |
199 | // fill in sorted_keymap |
198 | // fill in sorted_keymap |
200 | // it is sorted in each bucket |
199 | // it is sorted in each bucket |