Bullet Collision Detection & Physics Library
|
#include "gim_radixsort.h"
Go to the source code of this file.
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... | |
Macros | |
#define | GIM_INVALID_HASH 0xffffffff |
A very very high value. More... | |
#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 More... | |
#define | GIM_NUM_PRIME 28 |
Functions | |
template<typename T > | |
void | gim_sort_hash_node_array (T *array, GUINT array_count) |
Sorting for hash table. More... | |
GUINT | gim_next_prime (GUINT number) |
Variables | |
static const GUINT | gim_prime_list [GIM_NUM_PRIME] |
#define GIM_DEFAULT_HASH_TABLE_NODE_SIZE 4 |
Definition at line 40 of file gim_hash_table.h.
#define GIM_DEFAULT_HASH_TABLE_SIZE 380 |
Definition at line 39 of file gim_hash_table.h.
#define GIM_HASH_TABLE_GROW_FACTOR 2 |
Definition at line 41 of file gim_hash_table.h.
#define GIM_INVALID_HASH 0xffffffff |
A very very high value.
Definition at line 38 of file gim_hash_table.h.
#define GIM_MIN_RADIX_SORT_SIZE 860 |
calibrated on a PIII
Definition at line 43 of file gim_hash_table.h.
#define GIM_NUM_PRIME 28 |
Definition at line 151 of file gim_hash_table.h.
Definition at line 163 of file gim_hash_table.h.
void gim_sort_hash_node_array | ( | T * | array, |
GUINT | array_count | ||
) |
Sorting for hash table.
switch automatically between quicksort and radixsort
Definition at line 132 of file gim_hash_table.h.
|
static |
Definition at line 153 of file gim_hash_table.h.