bursttriemap.h File Reference

Classes
class	PointerBurstTriePool< NODE, BUCKET >
class	ElementPool< T, INDEX >
class	ArrayBurstTriePool< NODE, BUCKET >
struct	BurstTrieNode< GROUP_BITS, INDEX >
struct	BurstTrieBucket< K, V, SIZE >
struct	BurstTrieBucket< K, UnitType, SIZE >
class	BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
class	BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >::IteratorBase
class	BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >::NonConstIteratorBase
class	BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >::IteratorTemplate< CONSTITERATOR, SUPER >
class	BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >::EntryIteratorBase< CONSTITERATOR >
class	BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >::KeyIteratorBase< CONSTITERATOR >
class	BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >::ValueIteratorBase< CONSTITERATOR >
class	BurstTrieMapSelector< GROUP_BITS, BUCKET_SIZE, SORT, POOL >
class	BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >

Namespaces
	maxon

Enumerations
enum class	BURSTTRIE_SORT {   NONE ,   LINEAR_SEARCH ,   BINARY_SEARCH }

Functions
enum maxon::BURSTTRIE_SORT	MAXON_ENUM_LIST (BURSTTRIE_SORT)

Variables
	NONE
	LINEAR_SEARCH
	BINARY_SEARCH

Variable Documentation

NONE

NONE

Bucket entries won't be sorted at all. If a correct ordering of the entries isn't needed, this is generally the fastest option.

LINEAR_SEARCH

LINEAR_SEARCH

Bucket entries will be sorted according to their keys. But for searching, they will be scanned in linear order nevertheless. Given small bucket sizes, this is typically faster than a binary search.

BINARY_SEARCH

BINARY_SEARCH

Bucket entries will be sorted according to their keys, and lookup will be done with a binary search. This will be faster than a linear search only for large bucket sizes which in general are not recommended.