use core::iter::{ExactSizeIterator, FusedIterator};
use core::slice;
use crate::arena::{Entry, Index};
pub struct Iter<'a, T> {
pub(crate) len: u32,
pub(crate) slot: u32,
pub(crate) inner: slice::Iter<'a, Entry<T>>,
}
impl<'a, T> Iterator for Iter<'a, T> {
type Item = (Index, &'a T);
fn next(&mut self) -> Option<Self::Item> {
loop {
if self.len == 0 {
return None;
}
let slot = self.slot;
self.slot = self
.slot
.checked_add(1)
.unwrap_or_else(|| unreachable!("Overflowed u32 trying to iterate Arena"));
match self.inner.next()? {
Entry::Empty(_) => (),
Entry::Occupied(occupied) => {
self.len = self
.len
.checked_sub(1)
.unwrap_or_else(|| unreachable!("Underflowed u32 trying to iterate Arena"));
let index = Index {
slot,
generation: occupied.generation,
};
return Some((index, &occupied.value));
}
}
}
}
fn size_hint(&self) -> (usize, Option<usize>) {
(self.len as usize, Some(self.len as usize))
}
}
impl<'a, T> FusedIterator for Iter<'a, T> {}
impl<'a, T> ExactSizeIterator for Iter<'a, T> {}
#[cfg(all(test, feature = "std"))]
mod test {
use crate::Arena;
use std::collections::HashSet;
#[test]
fn iter() {
let mut arena = Arena::with_capacity(2);
let one = arena.insert(1);
let two = arena.insert(2);
let mut pairs = HashSet::new();
let mut iter = arena.iter();
assert_eq!(iter.size_hint(), (2, Some(2)));
pairs.insert(iter.next().unwrap());
assert_eq!(iter.size_hint(), (1, Some(1)));
pairs.insert(iter.next().unwrap());
assert_eq!(iter.size_hint(), (0, Some(0)));
assert_eq!(iter.next(), None);
assert_eq!(iter.next(), None);
assert_eq!(iter.size_hint(), (0, Some(0)));
assert!(pairs.contains(&(one, &1)));
assert!(pairs.contains(&(two, &2)));
}
}