[go: up one dir, main page]

ordermap 0.5.10

A hash table with consistent order and fast iteration.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20

use super::OrderSet;
use indexmap::set::{IntoIter, Iter};

impl<'a, T, S> IntoIterator for &'a OrderSet<T, S> {
    type Item = &'a T;
    type IntoIter = Iter<'a, T>;

    fn into_iter(self) -> Self::IntoIter {
        self.inner.iter()
    }
}

impl<T, S> IntoIterator for OrderSet<T, S> {
    type Item = T;
    type IntoIter = IntoIter<T>;

    fn into_iter(self) -> Self::IntoIter {
        self.inner.into_iter()
    }
}