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

use std::{
    ops::{
        Index,
        IndexMut,
    },
    cmp::Ordering,
};


#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum Side {
    Left,
    Right
}

#[derive(Debug, Default)]
pub struct BinarySon<U> {
    content:[U; 2]
}

impl TryFrom<Ordering> for Side {
    type Error = ();
    
    fn try_from(value: Ordering) -> Result<Self, Self::Error> {
        match value {
            Ordering::Less => Ok(Side::Left),
            Ordering::Greater => Ok(Side::Right),
            Ordering::Equal => Err(()),
        }
    }
}

impl Side {
    pub(crate) fn complement(self) -> Self {
        match self {
            Side::Left => Side::Right,
            Side::Right => Side::Left,
        }
    }
}

impl<U:Clone> Clone for BinarySon<U> {
    fn clone(&self) -> Self {
        Self{
            content:[self.content[0].clone(), self.content[0].clone()]
        }
    }
}

impl<U:Copy> Copy for BinarySon<U> {}


impl<U> Index<Side> for BinarySon<U> {
    type Output = U;
    fn index(&self, index: Side) -> &Self::Output {
        match index {
            Side::Left => &self.content[0],
            Side::Right => &self.content[1],
        }
    }
}

impl<U> IndexMut<Side> for BinarySon<U> {
    fn index_mut(&mut self, index: Side) -> &mut Self::Output {
        match index {
            Side::Left => &mut self.content[0],
            Side::Right => &mut self.content[1],
        }
    }
}

#[cfg(feature = "into_precomputed")]
pub use into_precomputed::*;

#[cfg(feature = "into_precomputed")]
mod into_precomputed {
    
}


#[cfg(test)]
mod test{
    use super::*;
    
    #[test]
    fn struct_conversions() {
        assert_eq!(Side::try_from(Ordering::Less).unwrap(), Side::Left);
        assert_eq!(Side::try_from(Ordering::Greater).unwrap(), Side::Right);
        println!("hola");
    }
}