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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134

use std::{
    marker::PhantomData,
};

use super::{
    super::{
        Map,
        MapNode,
    },
    IntoIter,
    IntoIterEnum,
    EmptyIter,
};



impl<KeyType:Ord, ContentType> Map<KeyType, ContentType> {
    
    pub(crate) fn empty_iter(&mut self) -> EmptyIter<KeyType, ContentType> {
        EmptyIter{
            map: self,
            iter_data: IntoIterEnum::NewIter,
        }
    }
    
}

    

impl<KeyType:Ord, ContentType> IntoIter<KeyType, ContentType> {
    pub(crate) fn new(map:Map<KeyType, ContentType>) -> Self {
        Self{
            map: map,
            iter_data: IntoIterEnum::NewIter,
        }
    }
}



impl<'a, KeyType:Ord, ContentType> Iterator for EmptyIter<'a, KeyType, ContentType> {
    type Item = ();
    
    fn next(&mut self) -> Option<Self::Item> {
        
        match self.iter_data {
            IntoIterEnum::NewIter => {
                let holder = IntoIterEnum::get_first(self.map)?;
                self.map.head = None;
                self.map.size = 0;
                self.iter_data = IntoIterEnum::Iter{next:Some(holder), phantom0:PhantomData, phantom1:PhantomData};
                self.iter_data.next();
                
                MapNode::free_node(holder);
                Some(())
            },
            IntoIterEnum::Iter{
                ..
            } => {
                let holder = self.iter_data.next()?;
                MapNode::free_node(holder);
                Some(())
            },
        }
    }
}



impl<KeyType:Ord, ContentType> Iterator for IntoIter<KeyType, ContentType> {
    type Item = (KeyType, ContentType);
    
    fn next(&mut self) -> Option<Self::Item> {
        match self.iter_data {
            IntoIterEnum::NewIter => {
                let holder = IntoIterEnum::get_first(&mut self.map)?;
                self.map.head = None;
                self.iter_data = IntoIterEnum::Iter{next:Some(holder), phantom0:PhantomData, phantom1:PhantomData};
                self.iter_data.next();
                let holder_box = unsafe{Box::from_raw(holder.as_ptr())};
                Some((holder_box.key, holder_box.content))
            },
            IntoIterEnum::Iter{
                ..
            } => {
                let holder = self.iter_data.next()?;
                let holder_box = unsafe{Box::from_raw(holder.as_ptr())};
                Some((holder_box.key, holder_box.content))
            },
        }
    }
}



#[cfg(test)]
mod test {
    use super::*;
    use crate::test::*;
    
    #[test]
    fn test() {
        let mut avl = Map::<u64,u64>::new();
        
        for elem in 4+0..4+7+5 {
            avl.add(elem, 0).unwrap();
        }
        println!("{:#?}", &avl);
        
        let iter_level = avl.into_iter();
        print_type_of(&iter_level);
        for elem in iter_level {
            println!("{:?}", &elem);
        }
    }
    
    #[test]
    fn empty() {
        let mut avl = Map::<u64,u64>::new();
        
        for elem in 4+0..4+7+5 {
            avl.add(elem, 0).unwrap();
        }
        println!("{:#?}", &avl);
        
        let empty_iter = avl.empty_iter();
        for elem in empty_iter {
            println!("{:?}", elem);
        }
        println!("{:#?}", &avl);
        //todo!();
    }
}