SORTED_ARRAY_STRUCTURES

Sorted array data management. The hash table has the indices to the corresponding m_nodes array. More...

Functions
bool	gim_hash_table::_erase_sorted (GUINT index)
bool	gim_hash_table::_erase_unsorted (GUINT index)
	faster, but unsorted
void	gim_hash_table::_insert_in_pos (GUINT hashkey, const T &value, GUINT pos)
	Insert in position ordered.
GUINT	gim_hash_table::_insert_sorted (GUINT hashkey, const T &value)
	Insert an element in an ordered array.
GUINT	gim_hash_table::_insert_sorted_replace (GUINT hashkey, const T &value)
GUINT	gim_hash_table::_insert_unsorted (GUINT hashkey, const T &value)
	Fast insertion in m_nodes array.

---

Detailed Description

Sorted array data management. The hash table has the indices to the corresponding m_nodes array.

---

Function Documentation

template<class T>

bool gim_hash_table< T >::_erase_sorted

(

GUINT

index

)

[inline, protected, inherited]

template<class T>

bool gim_hash_table< T >::_erase_unsorted

(

GUINT

index

)

[inline, protected, inherited]

faster, but unsorted

template<class T>

void gim_hash_table< T >::_insert_in_pos	(	GUINT	hashkey,
		const T &	value,
		GUINT	pos
	)			[inline, protected, inherited]

Insert in position ordered.

Also checks if it is needed to transform this container to a hash table, by calling check_for_switching_to_hashtable

template<class T>

GUINT gim_hash_table< T >::_insert_sorted	(	GUINT	hashkey,
		const T &	value
	)			[inline, protected, inherited]

Insert an element in an ordered array.

template<class T>

GUINT gim_hash_table< T >::_insert_sorted_replace	(	GUINT	hashkey,
		const T &	value
	)			[inline, protected, inherited]

template<class T>

GUINT gim_hash_table< T >::_insert_unsorted	(	GUINT	hashkey,
		const T &	value
	)			[inline, protected, inherited]

Fast insertion in m_nodes array.

---