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

use super::TrieKey;

macro_rules! impl_unsafe_transform {
    ($($Ty:ty),+) => {
        $(
            impl TrieKey for $Ty
            {
                fn key_bytes(&self) -> &[u8] {
                    // Safety: Transforming core primitives with no padding to slices of bytes is safe
                    unsafe {
                        let p = self as *const Self as *const u8;
                        core::slice::from_raw_parts(p, size_of::<$Ty>())
                    }
                }
            }

            // Done manually instead of with a blanket impl since we can't guarantee there is no padding
            impl TrieKey for [$Ty]
            {
                fn key_bytes(&self) -> &[u8] {
                    // Safety: Transforming slices of core primitives with no padding to slices of bytes is safe
                    unsafe {
                        let sz = core::mem::size_of_val(self);
                        let p = self.as_ptr() as *const u8;
                        core::slice::from_raw_parts(p, sz)
                    }
                }
            }

            // Done manually instead of with a blanket impl since we can't guarantee there is no padding
            impl<const N: usize> TrieKey for [$Ty; N]
            {
                fn key_bytes(&self) -> &[u8] {
                    self.as_slice().key_bytes()
                }
            }
        )+
    }
}

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