Trait RedbKey

pub trait RedbKey: RedbValue {
    // Required method
    fn compare(data1: &[u8], data2: &[u8]) -> Ordering;
}

Required Methods

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

Compare data1 with data2

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementations on Foreign Types

impl RedbKey for &str

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl RedbKey for &[u8]

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl RedbKey for bool

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl RedbKey for char

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl RedbKey for i8

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl RedbKey for i16

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl RedbKey for i32

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl RedbKey for i64

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl RedbKey for i128

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl RedbKey for u8

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl RedbKey for u16

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl RedbKey for u32

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl RedbKey for u64

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl RedbKey for u128

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl RedbKey for ()

fn compare(_data1: &[u8], _data2: &[u8]) -> Ordering

impl<T0: RedbKey, T1: RedbKey> RedbKey for (T0, T1)

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl<T0: RedbKey, T1: RedbKey, T2: RedbKey> RedbKey for (T0, T1, T2)

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl<T0: RedbKey, T1: RedbKey, T2: RedbKey, T3: RedbKey> RedbKey for (T0, T1, T2, T3)

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl<T0: RedbKey, T1: RedbKey, T2: RedbKey, T3: RedbKey, T4: RedbKey> RedbKey for (T0, T1, T2, T3, T4)

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl<T0: RedbKey, T1: RedbKey, T2: RedbKey, T3: RedbKey, T4: RedbKey, T5: RedbKey> RedbKey for (T0, T1, T2, T3, T4, T5)

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl<T0: RedbKey, T1: RedbKey, T2: RedbKey, T3: RedbKey, T4: RedbKey, T5: RedbKey, T6: RedbKey> RedbKey for (T0, T1, T2, T3, T4, T5, T6)

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl<T0: RedbKey, T1: RedbKey, T2: RedbKey, T3: RedbKey, T4: RedbKey, T5: RedbKey, T6: RedbKey, T7: RedbKey> RedbKey for (T0, T1, T2, T3, T4, T5, T6, T7)

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl<T0: RedbKey, T1: RedbKey, T2: RedbKey, T3: RedbKey, T4: RedbKey, T5: RedbKey, T6: RedbKey, T7: RedbKey, T8: RedbKey> RedbKey for (T0, T1, T2, T3, T4, T5, T6, T7, T8)

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl<T0: RedbKey, T1: RedbKey, T2: RedbKey, T3: RedbKey, T4: RedbKey, T5: RedbKey, T6: RedbKey, T7: RedbKey, T8: RedbKey, T9: RedbKey> RedbKey for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl<T0: RedbKey, T1: RedbKey, T2: RedbKey, T3: RedbKey, T4: RedbKey, T5: RedbKey, T6: RedbKey, T7: RedbKey, T8: RedbKey, T9: RedbKey, T10: RedbKey> RedbKey for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl<T0: RedbKey, T1: RedbKey, T2: RedbKey, T3: RedbKey, T4: RedbKey, T5: RedbKey, T6: RedbKey, T7: RedbKey, T8: RedbKey, T9: RedbKey, T10: RedbKey, T11: RedbKey> RedbKey for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl<T: RedbKey> RedbKey for Option<T>

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

impl<const N: usize> RedbKey for &[u8; N]

fn compare(data1: &[u8], data2: &[u8]) -> Ordering

Implementors