cpp_map 0.2.0

A simple C++ std::map emulator
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

use crate::IsLessThan;
use crate::linkedlist::{HEAD_INDEX, Index, LinkedList, TAIL_INDEX};
use std::fmt;
use std::fmt::Debug;
use std::ops::Deref;
/*// Implement for types that already have Ord
impl<T: Ord> IsLessThan for T {
    fn is_less_than(&self, other: &Self) -> bool {
        self < other
    }
}*/

impl<K, V> Default for LinkedList<K, V>
where
    K: Debug + Clone + IsLessThan,
    V: Debug + Clone,
{
    fn default() -> Self {
        Self {
            head: TAIL_INDEX,
            tail: HEAD_INDEX,
            nodes: vec![],
            free_index_pool: Default::default(),
            #[cfg(feature = "linkedlist_midpoint")]
            mid_point: None,
            #[cfg(feature = "linkedlist_midpoint")]
            mid_point_delta: 0,
        }
    }
}

impl fmt::Display for Index {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(f, "{}", self.0)
    }
}

impl Debug for Index {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(f, "{}", self.0)
    }
}

impl From<Index> for usize {
    fn from(index: Index) -> usize {
        index.0
    }
}

impl PartialEq<usize> for Index {
    #[inline(always)]
    fn eq(&self, other: &usize) -> bool {
        self.0 == *other
    }
}

impl Deref for Index {
    type Target = usize;
    #[inline(always)]
    fn deref(&self) -> &usize {
        &self.0
    }
}