hibit_tree 0.1.0-beta.1

Hierarchical bitmap tree. Integer-key map that can intersect FAST.
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

/// Means of converting T/&T to value.
/// 
/// Allows to store/pass reference or value generically.
/// In conjunction with [Borrow] can be used as something like C++'s &&T 
/// (forwarding reference), that can be taken by ref or value.
/// 
/// Everything zero overhead.
/// 
/// [Borrow]: [borrow::Borrow]
pub trait Take<T>{
    /// Takes self as T.
    /// 
    /// # Panics
    /// 
    /// Panics at compile-time if Self is &T.
    fn take(self) -> T;
    
    /// Returned Option variant can
    /// be used for compile-time switch. 
    fn try_take(self) -> Option<T>;
    
    /// Return self as is for T, clone for &T.
    fn take_or_clone(self) -> T where T: Clone;
}

impl<T> Take<T> for T{
    #[inline]
    fn take(self) -> T{
        self
    }
    
    #[inline]
    fn try_take(self) -> Option<T>{
        Some(self)
    }
    
    #[inline]
    fn take_or_clone(self) -> T{
        self
    }
}

impl<T> Take<T> for &T{
    #[inline]
    fn take(self) -> T{
        const{ panic!("Trying to take &T by value.") }
    }
    
    #[inline]
    fn try_take(self) -> Option<T>{
        None
    }
    
    #[inline]
    fn take_or_clone(self) -> T where T: Clone{
        self.clone()
    }
}