Enum KeyCompare 

pub enum KeyCompare {
    Default,
    Number,
    Custom(fn(&[u8], &[u8]) -> Ordering),
}

Comparison behavior for Keys.

This determines how the database sorts Keys inside a database Table.

See Key for more info.

Variants

Default

Use the default comparison behavior of the backend.

Currently, both heed and redb use lexicographical comparison by default, i.e. a straight byte comparison.

Number

A by-value number comparison, i.e. 255 < 256.

This behavior is implemented as the default for all number primitives, although some implementations on numbers use KeyCompare::Custom due to internal implementation details of LMDB.

Custom(fn(&[u8], &[u8]) -> Ordering)

A custom sorting function.

The input of the function is 2 Keys in byte form.

Implementations

impl KeyCompare

pub const fn as_compare_fn<K: Key>(self) -> fn(&[u8], &[u8]) -> Ordering

Return Self as a pure comparison function.

The returned function expects 2 Keys in byte form as input.

Trait Implementations

impl Clone for KeyCompare

fn clone(&self) -> KeyCompare

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for KeyCompare

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

Formats the value using the given formatter.

impl Default for KeyCompare

fn default() -> KeyCompare

Returns the “default value” for a type.

impl Hash for KeyCompare

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Copy for KeyCompare

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 16 bytes

Size for each variant:

• Default: 0 bytes
• Number: 0 bytes
• Custom: 8 bytes