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

use std::iter::{ExactSizeIterator, FusedIterator};

use crate::arena::{Arena, Index};

/// See [`Arena::drain`][Arena::drain].

pub struct Drain<'a, T> {
    pub(crate) arena: &'a mut Arena<T>,
    pub(crate) slot: u32,
}

impl<'a, T> Iterator for Drain<'a, T> {
    type Item = (Index, T);

    fn next(&mut self) -> Option<Self::Item> {
        loop {
            // If there are no entries remaining in the arena, we should always

            // return None. Using this check instead of comparing with the

            // arena's size allows us to skip any trailing empty entries.

            if self.arena.is_empty() {
                return None;
            }

            // slot may overflow if the arena's underlying storage contains more

            // than 2^32 elements, but its internal length value was not

            // changed, as it overflowing would panic before reaching this code.

            let slot = self.slot;
            self.slot = self
                .slot
                .checked_add(1)
                .unwrap_or_else(|| panic!("Overflowed u32 trying to drain Arena"));

            // If this entry is occupied, this method will mark it as an empty.

            // Otherwise, we'll continue looping until we've drained all

            // occupied entries from the arena.

            if let Some((index, value)) = self.arena.remove_entry_by_slot(slot) {
                return Some((index, value));
            }
        }
    }

    fn size_hint(&self) -> (usize, Option<usize>) {
        (self.arena.len(), Some(self.arena.len()))
    }
}

impl<'a, T> FusedIterator for Drain<'a, T> {}
impl<'a, T> ExactSizeIterator for Drain<'a, T> {}

#[cfg(test)]
mod test {
    use crate::Arena;

    use std::collections::HashSet;

    #[test]
    fn drain() {
        let mut arena = Arena::with_capacity(2);
        let one = arena.insert(1);
        let two = arena.insert(2);

        let mut drained_pairs = HashSet::new();
        let mut drain = arena.drain();
        assert_eq!(drain.size_hint(), (2, Some(2)));

        drained_pairs.insert(drain.next().unwrap());
        assert_eq!(drain.size_hint(), (1, Some(1)));

        drained_pairs.insert(drain.next().unwrap());
        assert_eq!(drain.size_hint(), (0, Some(0)));

        assert_eq!(drain.next(), None);
        assert_eq!(drain.next(), None);
        assert_eq!(drain.size_hint(), (0, Some(0)));

        assert_eq!(arena.len(), 0);
        assert_eq!(arena.capacity(), 2);
        assert_eq!(drained_pairs.len(), 2);
        assert!(drained_pairs.contains(&(one, 1)));
        assert!(drained_pairs.contains(&(two, 2)));

        // We should still be able to use the arena after this.

        let one_prime = arena.insert(1);
        let two_prime = arena.insert(2);

        assert_eq!(arena.len(), 2);
        assert_eq!(arena.capacity(), 2);
        assert_eq!(arena.get(one_prime), Some(&1));
        assert_eq!(arena.get(two_prime), Some(&2));
        assert_eq!(arena.get(one), None);
        assert_eq!(arena.get(two), None);
    }
}