Open Search
    BurstTrieBucket< K, V, SIZE > Struct Template Reference

    #include <bursttriemap.h>

    Public Member Functions

    Int GetCount () const
     
    template<BURSTTRIE_SORT SORT>
    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
     

    Public Attributes

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

    Member Function Documentation

    ◆ 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]