Struct DictionaryEntryKey 

pub struct DictionaryEntryKey {
    pub dictionary: DictionaryId,
    pub hash: [u8; 16],
}

Key for dictionary entries: hash(value) -> (id, value) Uses xxh3_128 hash of the value for fixed-size keys

Fields

dictionary: DictionaryId

hash: [u8; 16]

Implementations

impl DictionaryEntryKey

pub fn new(dictionary: DictionaryId, hash: [u8; 16]) -> Self

pub fn encoded( dictionary: impl Into<DictionaryId>, hash: [u8; 16], ) -> EncodedKey

pub fn full_scan(dictionary: DictionaryId) -> EncodedKeyRange

Trait Implementations

impl Clone for DictionaryEntryKey

fn clone(&self) -> DictionaryEntryKey

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for DictionaryEntryKey

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl EncodableKey for DictionaryEntryKey

const KIND: KeyKind = KeyKind::DictionaryEntry

fn encode(&self) -> EncodedKey

fn decode(key: &EncodedKey) -> Option<Self>

impl PartialEq for DictionaryEntryKey

fn eq(&self, other: &DictionaryEntryKey) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for DictionaryEntryKey