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

keys [SIZE]
AlignedStorage < SIZEOF (V), alignof(V)>  values [SIZE]

成员函数文档编制

◆  GetCount()

Int GetCount ( ) const

◆  Find()

Bool Find ( key ,
Int   cnt ,
Int result  
) const

◆  Remove()

void Remove ( Int   index ,
Int   end ,
Int   removeCnt  
)

◆  Insert()

void Insert ( Int   index ,
Int   end  
)

◆  GetValue() [1/2]

V& GetValue ( Int   index )

◆  GetValue() [2/2]

const V& GetValue ( Int   index ) const

◆  GetMemorySize()

Int GetMemorySize ( ) const

Member Data Documentation

◆  keys

K keys[SIZE]

◆  values

AlignedStorage < SIZEOF (V), alignof(V)> values[SIZE]