#include "GIMPACT/core/gim_radixsort.h"Classes | |
| struct | GIM_HASH_TABLE_NODE< T > |
| class | GIM_HASH_NODE_GET_KEY |
| Macro for getting the key. More... | |
| class | GIM_HASH_NODE_CMP_KEY_MACRO |
| Macro for comparing the key and the element. More... | |
| class | GIM_HASH_NODE_CMP_MACRO |
| Macro for comparing Hash nodes. More... | |
| class | gim_hash_table< T > |
| A compact hash table implementation. More... | |
Defines | |
| #define | GIM_INVALID_HASH 0xffffffff |
| A very very high value. | |
| #define | GIM_DEFAULT_HASH_TABLE_SIZE 380 |
| #define | GIM_DEFAULT_HASH_TABLE_NODE_SIZE 4 |
| #define | GIM_HASH_TABLE_GROW_FACTOR 2 |
| #define | GIM_MIN_RADIX_SORT_SIZE 860 |
| calibrated on a PIII | |
| #define | GIM_NUM_PRIME 28 |
Functions | |
| template<typename T> | |
| void | gim_sort_hash_node_array (T *array, GUINT array_count) |
| Sorting for hash table. | |
| GUINT | gim_next_prime (GUINT number) |
Variables | |
| static const GUINT | gim_prime_list [GIM_NUM_PRIME] |
1.5.2