gavl 0.1.5

A fast implementation for a map and a set using an AVL tree
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

#[allow(unused_imports)]
pub use precomputed_feature::*;

#[cfg(all(not(feature = "into_precomputed"), not(doc)))]
mod precomputed_feature {
    
    #[derive(Debug, Default)]
    pub(crate) struct FeatureField();
    
}

#[cfg(any(feature = "into_precomputed", doc))]
mod precomputed_feature {
    use super::{
        super::{
            structs::{
                BinarySon
            },
        }
    };
    
    #[derive(Debug, Default)]
    pub(crate) struct FeatureField{
        pub index: usize,
        pub son_index: BinarySon<Option<usize>>,
    }
    
    
    /// # Dependant on feature into_precomputed 
    /// 
    /// This is the data structure returned by the `.into_iter_precomputed()` this saved to an
    /// array will directly give a structure ready for binary search
    #[derive(Debug)]
    pub struct PrecomputedIterNode<KeyType:Ord, ContentType>{
        pub key: KeyType,
        pub content: ContentType,
        pub head: bool,
        pub prev_index: Option<usize>,
        pub next_index: Option<usize>,
    }

    impl<KeyType:Ord+Clone, ContentType:Clone> Clone for PrecomputedIterNode<KeyType, ContentType>{
        fn clone(&self) -> Self {
            Self{
                key:self.key.clone(),
                content:self.content.clone(),
                head:self.head.clone(),
                prev_index:self.prev_index.clone(),
                next_index:self.next_index.clone(),
            }
        }
    }

    impl<KeyType:Ord+Copy, ContentType:Copy> Copy for PrecomputedIterNode<KeyType, ContentType>{}

    
}