use std::collections::hash_map::RandomState;
use std::hash::BuildHasher;
use std::hash::Hash;
use super::OrderedIndexMap;
use super::OwnedEntry;
use super::SequenceBounds;
#[must_use = "the iterator removes records only while it is advanced"]
pub struct ExtractRange<'a, K, O, V, S = RandomState> {
pub(super) map: &'a mut OrderedIndexMap<K, O, V, S>,
pub(super) bounds: SequenceBounds<O>,
}
impl<K, O, V, S> Iterator for ExtractRange<'_, K, O, V, S>
where
K: Hash,
O: Ord + Clone,
S: BuildHasher,
{
type Item = OwnedEntry<K, O, V>;
fn next(&mut self) -> Option<Self::Item> {
self.map.assert_healthy();
let (ordered_key, id) = self
.map
.state
.ordered
.range((self.bounds.0.as_ref(), self.bounds.1.as_ref()))
.next()
.map(|(key, id)| (key.clone(), *id))?;
let hash = self.map.hash_builder.hash_one(
&self
.map
.state
.arena
.get(id)
.expect("ordered index must reference an occupied arena slot")
.key,
);
Some(self.map.remove_slot(hash, id, Some(ordered_key)))
}
}
impl<K, O, V, S> DoubleEndedIterator for ExtractRange<'_, K, O, V, S>
where
K: Hash,
O: Ord + Clone,
S: BuildHasher,
{
fn next_back(&mut self) -> Option<Self::Item> {
self.map.assert_healthy();
let (ordered_key, id) = self
.map
.state
.ordered
.range((self.bounds.0.as_ref(), self.bounds.1.as_ref()))
.next_back()
.map(|(key, id)| (key.clone(), *id))?;
let hash = self.map.hash_builder.hash_one(
&self
.map
.state
.arena
.get(id)
.expect("ordered index must reference an occupied arena slot")
.key,
);
Some(self.map.remove_slot(hash, id, Some(ordered_key)))
}
}