slice_map 0.2.7

A generic container to store a single type of data into unevenly sized slices.
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
135

use alloc::boxed::Box;
use slotmap::{Key, SecondaryMap, SlotMap, SparseSecondaryMap};

/// Trait to abstract operations on storage of slices
pub trait SliceStorage<K, V>: Default {
    fn insert(&mut self, value: V) -> K;
    fn remove(&mut self, key: K) -> Option<V>;
    fn get(&self, key: K) -> Option<&V>;
    fn iter(&self) -> Box<dyn Iterator<Item = (K, &V)> + '_>;
    fn values(&self) -> Box<dyn Iterator<Item = &V> + '_>;
    fn values_mut(&mut self) -> Box<dyn Iterator<Item = &mut V> + '_>;
    fn is_empty(&self) -> bool;
}

impl<K, V> SliceStorage<K, V> for SlotMap<K, V>
where
    K: Key,
{

    #[inline(always)]
    fn insert(&mut self, value: V) -> K {
        self.insert(value)
    }

    #[inline(always)]
    fn remove(&mut self, key: K) -> Option<V> {
        self.remove(key)
    }

    #[inline(always)]
    fn get(&self, key: K) -> Option<&V> {
        self.get(key)
    }

    #[inline(always)]
    fn iter(&self) -> Box<dyn Iterator<Item = (K, &V)> + '_> {
        Box::new(self.iter())
    }

    #[inline(always)]
    fn values(&self) -> Box<dyn Iterator<Item = &V> + '_> {
        Box::new(self.values())
    }

    #[inline(always)]
    fn values_mut(&mut self) -> Box<dyn Iterator<Item = &mut V> + '_> {
        Box::new(self.values_mut())
    }

    #[inline(always)]
    fn is_empty(&self) -> bool {
        self.is_empty()
    }
}

impl<K, V> SliceStorage<K, V> for SecondaryMap<K, V>
where
    K: Key,
{
    #[inline(always)]
    fn insert(&mut self, _value: V) -> K {
        panic!("SecondaryMap does not support insert; keys must be pre-created")
    }

    #[inline(always)]
    fn remove(&mut self, key: K) -> Option<V> {
        self.remove(key)
    }

    #[inline(always)]
    fn get(&self, key: K) -> Option<&V> {
        self.get(key)
    }

    #[inline(always)]
    fn iter(&self) -> Box<dyn Iterator<Item = (K, &V)> + '_> {
        Box::new(self.iter())
    }

    #[inline(always)]
    fn values(&self) -> Box<dyn Iterator<Item = &V> + '_> {
        Box::new(self.values())
    }

    #[inline(always)]
    fn values_mut(&mut self) -> Box<dyn Iterator<Item = &mut V> + '_> {
        Box::new(self.values_mut())
    }

    #[inline(always)]
    fn is_empty(&self) -> bool {
        self.is_empty()
    }
}


impl<K, V> SliceStorage<K, V> for SparseSecondaryMap<K, V>
where
    K: Key,
{
    #[inline(always)]
    fn insert(&mut self, _value: V) -> K {
        panic!("SecondaryMap does not support insert; keys must be pre-created")
    }

    #[inline(always)]
    fn remove(&mut self, key: K) -> Option<V> {
        self.remove(key)
    }

    #[inline(always)]
    fn get(&self, key: K) -> Option<&V> {
        self.get(key)
    }

    #[inline(always)]
    fn iter(&self) -> Box<dyn Iterator<Item = (K, &V)> + '_> {
        Box::new(self.iter())
    }

    #[inline(always)]
    fn values(&self) -> Box<dyn Iterator<Item = &V> + '_> {
        Box::new(self.values())
    }

    #[inline(always)]
    fn values_mut(&mut self) -> Box<dyn Iterator<Item = &mut V> + '_> {
        Box::new(self.values_mut())
    }

    #[inline(always)]
    fn is_empty(&self) -> bool {
        self.is_empty()
    }
}