_assign_hash_table_cell(GUINT hashkey) | gim_hash_table< T > | [inline, protected] |
_clear_table_memory() | gim_hash_table< T > | [inline, protected] |
_destroy() | gim_hash_table< T > | [inline, protected] |
_erase_by_index_hash_table(GUINT index) | gim_hash_table< T > | [inline, protected] |
_erase_hash_table(GUINT hashkey) | gim_hash_table< T > | [inline, protected] |
_erase_sorted(GUINT index) | gim_hash_table< T > | [inline, protected] |
_erase_unsorted(GUINT index) | gim_hash_table< T > | [inline, protected] |
_find_avaliable_cell(GUINT hashkey) | gim_hash_table< T > | [inline, protected] |
_find_cell(GUINT hashkey) | gim_hash_table< T > | [inline, protected] |
_insert_hash_table(GUINT hashkey, const T &value) | gim_hash_table< T > | [inline, protected] |
_insert_hash_table_replace(GUINT hashkey, const T &value) | gim_hash_table< T > | [inline, protected] |
_insert_in_pos(GUINT hashkey, const T &value, GUINT pos) | gim_hash_table< T > | [inline, protected] |
_insert_sorted(GUINT hashkey, const T &value) | gim_hash_table< T > | [inline, protected] |
_insert_sorted_replace(GUINT hashkey, const T &value) | gim_hash_table< T > | [inline, protected] |
_insert_unsorted(GUINT hashkey, const T &value) | gim_hash_table< T > | [inline, protected] |
_invalidate_keys() | gim_hash_table< T > | [inline, protected] |
_node_type typedef | gim_hash_table< T > | [protected] |
_rehash() | gim_hash_table< T > | [inline, protected] |
_reserve_table_memory(GUINT newtablesize) | gim_hash_table< T > | [inline, protected] |
_resize_table(GUINT newsize) | gim_hash_table< T > | [inline, protected] |
check_for_switching_to_hashtable() | gim_hash_table< T > | [inline] |
clear() | gim_hash_table< T > | [inline] |
erase_by_index(GUINT index) | gim_hash_table< T > | [inline] |
erase_by_index_unsorted(GUINT index) | gim_hash_table< T > | [inline] |
erase_by_key(GUINT hashkey) | gim_hash_table< T > | [inline] |
find(GUINT hashkey) | gim_hash_table< T > | [inline] |
get_key(GUINT index) const | gim_hash_table< T > | [inline] |
get_value(GUINT hashkey) | gim_hash_table< T > | [inline] |
get_value_by_index(GUINT index) | gim_hash_table< T > | [inline] |
gim_hash_table(GUINT reserve_size=GIM_DEFAULT_HASH_TABLE_SIZE, GUINT node_size=GIM_DEFAULT_HASH_TABLE_NODE_SIZE, GUINT min_hash_table_size=GIM_INVALID_HASH) | gim_hash_table< T > | [inline] |
insert(GUINT hashkey, const T &element) | gim_hash_table< T > | [inline] |
insert_override(GUINT hashkey, const T &element) | gim_hash_table< T > | [inline] |
insert_unsorted(GUINT hashkey, const T &element) | gim_hash_table< T > | [inline] |
is_hash_table() | gim_hash_table< T > | [inline] |
is_sorted() | gim_hash_table< T > | [inline] |
m_hash_table | gim_hash_table< T > | [protected] |
m_min_hash_table_size | gim_hash_table< T > | [protected] |
m_node_size | gim_hash_table< T > | [protected] |
m_nodes | gim_hash_table< T > | [protected] |
m_sorted | gim_hash_table< T > | [protected] |
m_table_size | gim_hash_table< T > | [protected] |
operator[](GUINT index) const | gim_hash_table< T > | [inline] |
operator[](GUINT index) | gim_hash_table< T > | [inline] |
set_sorted(bool value) | gim_hash_table< T > | [inline] |
size() const | gim_hash_table< T > | [inline] |
sort() | gim_hash_table< T > | [inline] |
switch_to_hashtable() | gim_hash_table< T > | [inline] |
switch_to_sorted_array() | gim_hash_table< T > | [inline] |
~gim_hash_table() | gim_hash_table< T > | [inline] |