radix_trees 0.2.0

Various radix tree (trie) data structures.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61

use super::TrieKey;
use zerocopy::{Immutable, IntoBytes};

// This cfg is redundant, but it enables displaying that this macro requires the zerocopy feature
// in generated documentation.
#[cfg(feature = "zerocopy")]
#[macro_export]
/// Safely implement [`TrieKey`] for a type which already implements [`IntoBytes`] + [`Immutable`].
///
/// Only available with crate feature `zerocopy`.
macro_rules! impl_from_zerocopy {
    ($($Ty:ty),+) => {
        $(
            impl TrieKey for $Ty
            where
                $Ty: IntoBytes + Immutable,
            {
                fn key_bytes(&self) -> &[u8] {
                    self.as_bytes()
                }
            }
        )+
    }
}

// Primitives
impl_from_zerocopy!(
    bool, char, f32, f64, i8, i16, i32, i64, i128, isize, u8, u16, u32, u64, u128, usize
);

macro_rules! impl_zerocopy_endians {
    ($($Ty:ident),+) => {
        $(
            impl<O> TrieKey for ::zerocopy::byteorder::$Ty<O> {
                fn key_bytes(&self) -> &[u8] {
                    self.as_bytes()
                }
            }
        )+
    }
}

impl_zerocopy_endians!(F32, F64, I16, I32, I64, I128, Isize, U16, U32, U64, U128, Usize);

impl<K: IntoBytes + Immutable + TrieKey> TrieKey for zerocopy::Unalign<K> {
    fn key_bytes(&self) -> &[u8] {
        self.as_bytes()
    }
}

impl<K: IntoBytes + Immutable + TrieKey> TrieKey for [K] {
    fn key_bytes(&self) -> &[u8] {
        self.as_bytes()
    }
}

impl<K: IntoBytes + Immutable + TrieKey, const N: usize> TrieKey for [K; N] {
    fn key_bytes(&self) -> &[u8] {
        self.as_bytes()
    }
}