BurstTrieBucket< K, V, SIZE > Struct Template Reference Data Structures
#include <bursttriemap.h>
公共成员函数 |
|
Int | GetCount () const |
template<BURSTTRIE_SORT SORT> | |
Bool | Find (K key, Int cnt, Int &result) const |
void | 移除 ( Int index, Int end , Int removeCnt) |
void | Insert ( Int index, Int end ) |
V & | GetValue ( Int index) |
const V & | GetValue ( Int index) const |
Int | GetMemorySize () const |
Public Attributes |
|
K | keys [SIZE] |
AlignedStorage < SIZEOF (V), alignof(V)> | values [SIZE] |
Int GetCount | ( | ) | const |
Bool Find | ( | K | key , |
Int | cnt , | ||
Int & | result | ||
) | const |
void Remove | ( | Int | index , |
Int | end , | ||
Int | removeCnt | ||
) |
void Insert | ( | Int | index , |
Int | end | ||
) |
V& GetValue | ( | Int | index | ) |
const V& GetValue | ( | Int | index | ) | const |
Int GetMemorySize | ( | ) | const |
K keys[SIZE] |
AlignedStorage < SIZEOF (V), alignof(V)> values[SIZE] |