Logo Search packages:      
Sourcecode: blender version File versions  Download package

CONTAINERS


Detailed Description

Abstract class for template containers.

Abstract class for collision objects.


Classes

class  gim_array< T >
 Very simple array container with fast access and simd memory. More...
class  gim_bitset
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_NODE_GET_KEY
 Macro for getting the key. More...
class  gim_hash_table< T >
 A compact hash table implementation. More...
struct  GIM_HASH_TABLE_NODE< T >

Defines

#define GIM_ARRAY_GROW_FACTOR   2
#define GIM_ARRAY_GROW_INCREMENT   2
#define GIM_DEFAULT_HASH_TABLE_NODE_SIZE   4
#define GIM_DEFAULT_HASH_TABLE_SIZE   380
#define GIM_HASH_TABLE_GROW_FACTOR   2
#define GIM_INVALID_HASH   0xffffffff
 A very very high value.
#define GIM_MIN_RADIX_SORT_SIZE   860
 calibrated on a PIII
#define GIM_NUM_PRIME   28
#define GUINT_BIT_COUNT   32
#define GUINT_EXPONENT   5

Functions

GUINT gim_next_prime (GUINT number)
template<typename T>
void gim_sort_hash_node_array (T *array, GUINT array_count)
 Sorting for hash table.

Variables

static const GUINT gim_prime_list [GIM_NUM_PRIME]


Generated by  Doxygen 1.6.0   Back to index