timed-map 1.7.0

Lightweight map implementation that supports expiring entries and fully compatible with both std and no_std environments.
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

use super::*;
use crate::entry::ExpirableEntry;

#[allow(clippy::enum_variant_names)]
pub(crate) enum GenericMapIter<'a, K, V> {
    BTreeMap(btree_map::Iter<'a, K, V>),
    #[cfg(feature = "std")]
    HashMap(hash_map::Iter<'a, K, V>),
    #[cfg(all(feature = "std", feature = "rustc-hash"))]
    FxHashMap(hash_map::Iter<'a, K, V>),
}

#[allow(clippy::enum_variant_names)]
pub(crate) enum GenericMapIterMut<'a, K, V> {
    BTreeMap(btree_map::IterMut<'a, K, V>),
    #[cfg(feature = "std")]
    HashMap(hash_map::IterMut<'a, K, V>),
    #[cfg(all(feature = "std", feature = "rustc-hash"))]
    FxHashMap(hash_map::IterMut<'a, K, V>),
}

#[allow(clippy::enum_variant_names)]
pub(crate) enum GenericMapIntoIter<K, V> {
    BTreeMap(btree_map::IntoIter<K, V>),
    #[cfg(feature = "std")]
    HashMap(hash_map::IntoIter<K, V>),
    #[cfg(all(feature = "std", feature = "rustc-hash"))]
    FxHashMap(hash_map::IntoIter<K, V>),
}

impl<'a, K, V> Iterator for GenericMapIter<'a, K, V> {
    type Item = (&'a K, &'a V);

    fn next(&mut self) -> Option<Self::Item> {
        match self {
            Self::BTreeMap(iter) => iter.next(),
            #[cfg(feature = "std")]
            Self::HashMap(iter) => iter.next(),
            #[cfg(all(feature = "std", feature = "rustc-hash"))]
            Self::FxHashMap(iter) => iter.next(),
        }
    }
}

impl<'a, K, V> Iterator for GenericMapIterMut<'a, K, V> {
    type Item = (&'a K, &'a mut V);

    fn next(&mut self) -> Option<Self::Item> {
        match self {
            Self::BTreeMap(iter) => iter.next(),
            #[cfg(feature = "std")]
            Self::HashMap(iter) => iter.next(),
            #[cfg(all(feature = "std", feature = "rustc-hash"))]
            Self::FxHashMap(iter) => iter.next(),
        }
    }
}

impl<K, V> Iterator for GenericMapIntoIter<K, V> {
    type Item = (K, V);

    fn next(&mut self) -> Option<Self::Item> {
        match self {
            Self::BTreeMap(iter) => iter.next(),
            #[cfg(feature = "std")]
            Self::HashMap(iter) => iter.next(),
            #[cfg(all(feature = "std", feature = "rustc-hash"))]
            Self::FxHashMap(iter) => iter.next(),
        }
    }
}

pub struct Iter<'a, K, V> {
    pub(crate) inner: GenericMapIter<'a, K, ExpirableEntry<V>>,
    pub(crate) now: u64,
}

impl<'a, K, V> Iterator for Iter<'a, K, V> {
    type Item = (&'a K, &'a V);

    fn next(&mut self) -> Option<Self::Item> {
        loop {
            let (k, v) = self.inner.next()?;
            if !v.is_expired(self.now) {
                return Some((k, v.value()));
            }
        }
    }
}

pub struct IterMut<'a, K, V> {
    pub(crate) inner: GenericMapIterMut<'a, K, ExpirableEntry<V>>,
    pub(crate) now: u64,
}

impl<'a, K, V> Iterator for IterMut<'a, K, V> {
    type Item = (&'a K, &'a mut V);

    fn next(&mut self) -> Option<Self::Item> {
        loop {
            let (k, v) = self.inner.next()?;
            if !v.is_expired(self.now) {
                return Some((k, v.value_mut()));
            }
        }
    }
}

pub struct IntoIter<K, V> {
    pub(crate) inner: GenericMapIntoIter<K, ExpirableEntry<V>>,
    pub(crate) now: u64,
}

impl<K, V> Iterator for IntoIter<K, V> {
    type Item = (K, V);

    fn next(&mut self) -> Option<Self::Item> {
        loop {
            let (k, v) = self.inner.next()?;
            if !v.is_expired(self.now) {
                return Some((k, v.owned_value()));
            }
        }
    }
}