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
136
137
138
139
|
// This file is part of ICU4X. For terms of use, please see the file
// called LICENSE at the top level of the ICU4X source tree
// (online at: https://github.com/unicode-org/icu4x/blob/main/LICENSE ).
use litemap::store::*;
use litemap::testing::check_store_full;
use std::cmp::Ordering;
/// A Vec wrapper that leverages the default function impls from `Store`
#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
struct VecWithDefaults<T>(Vec<T>);
type MapF<K, V> = fn(&(K, V)) -> (&K, &V);
#[inline]
fn map_f<K, V>(input: &(K, V)) -> (&K, &V) {
(&input.0, &input.1)
}
type MapFMut<K, V> = fn(&mut (K, V)) -> (&K, &mut V);
#[inline]
fn map_f_mut<K, V>(input: &mut (K, V)) -> (&K, &mut V) {
(&input.0, &mut input.1)
}
impl<K, V> StoreConstEmpty<K, V> for VecWithDefaults<(K, V)> {
const EMPTY: VecWithDefaults<(K, V)> = VecWithDefaults(Vec::new());
}
impl<K, V> Store<K, V> for VecWithDefaults<(K, V)> {
#[inline]
fn lm_len(&self) -> usize {
self.0.as_slice().len()
}
// leave lm_is_empty as default
#[inline]
fn lm_get(&self, index: usize) -> Option<(&K, &V)> {
self.0.as_slice().get(index).map(map_f)
}
// leave lm_last as default
#[inline]
fn lm_binary_search_by<F>(&self, mut cmp: F) -> Result<usize, usize>
where
F: FnMut(&K) -> Ordering,
{
self.0.as_slice().binary_search_by(|(k, _)| cmp(k))
}
}
impl<K: Ord, V> StoreFromIterable<K, V> for VecWithDefaults<(K, V)> {
fn lm_sort_from_iter<I: IntoIterator<Item = (K, V)>>(iter: I) -> Self {
let v: Vec<_> = Vec::lm_sort_from_iter(iter);
Self(v)
}
}
impl<K, V> StoreMut<K, V> for VecWithDefaults<(K, V)> {
#[inline]
fn lm_with_capacity(capacity: usize) -> Self {
Self(Vec::with_capacity(capacity))
}
#[inline]
fn lm_reserve(&mut self, additional: usize) {
self.0.reserve(additional)
}
#[inline]
fn lm_get_mut(&mut self, index: usize) -> Option<(&K, &mut V)> {
self.0.as_mut_slice().get_mut(index).map(map_f_mut)
}
#[inline]
fn lm_push(&mut self, key: K, value: V) {
self.0.push((key, value))
}
#[inline]
fn lm_insert(&mut self, index: usize, key: K, value: V) {
self.0.insert(index, (key, value))
}
#[inline]
fn lm_remove(&mut self, index: usize) -> (K, V) {
self.0.remove(index)
}
#[inline]
fn lm_clear(&mut self) {
self.0.clear()
}
// leave lm_retain as default
}
impl<'a, K: 'a, V: 'a> StoreIterable<'a, K, V> for VecWithDefaults<(K, V)> {
type KeyValueIter = core::iter::Map<core::slice::Iter<'a, (K, V)>, MapF<K, V>>;
#[inline]
fn lm_iter(&'a self) -> Self::KeyValueIter {
self.0.as_slice().iter().map(map_f)
}
}
impl<'a, K: 'a, V: 'a> StoreIterableMut<'a, K, V> for VecWithDefaults<(K, V)> {
type KeyValueIterMut = core::iter::Map<core::slice::IterMut<'a, (K, V)>, MapFMut<K, V>>;
type KeyValueIntoIter = std::vec::IntoIter<(K, V)>;
#[inline]
fn lm_iter_mut(&'a mut self) -> Self::KeyValueIterMut {
self.0.as_mut_slice().iter_mut().map(map_f_mut)
}
#[inline]
fn lm_into_iter(self) -> Self::KeyValueIntoIter {
IntoIterator::into_iter(self.0)
}
// leave lm_extend_end as default
// leave lm_extend_start as default
}
impl<A> std::iter::FromIterator<A> for VecWithDefaults<A> {
fn from_iter<I: IntoIterator<Item = A>>(iter: I) -> Self {
Self(Vec::from_iter(iter))
}
}
impl<K, V> StoreFromIterator<K, V> for VecWithDefaults<(K, V)> {}
#[test]
fn test_default_impl() {
check_store_full::<VecWithDefaults<(u32, u64)>>();
}
|
