identified_vec 0.1.11

Like HashSet but retaining INSERTION order and without `Hash` requirement on the Element type.
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

use std::fmt::Debug;
use std::hash::Hash;

use crate::{IdentifiedVec, IsIdentifiedVec};

/// An owning iterator over the items of an `IdentifiedVec`.
pub struct IdentifiedVecIntoIterator<I, E>
where
    I: Eq + Hash + Clone + Debug,
{
    identified_vec: IdentifiedVec<I, E>,
}

impl<I, E> IdentifiedVecIntoIterator<I, E>
where
    I: Eq + Hash + Clone + Debug,
{
    pub fn new(identified_vec: IdentifiedVec<I, E>) -> Self {
        Self { identified_vec }
    }
}

impl<I, E> Iterator for IdentifiedVecIntoIterator<I, E>
where
    I: Eq + Hash + Clone + Debug,
{
    type Item = E;

    fn next(&mut self) -> Option<Self::Item> {
        if self.identified_vec.len() == 0 {
            return None;
        }
        let result = self.identified_vec.remove_at(0);
        Some(result)
    }
}