range-set-blaze 0.5.0

Integer sets as fast, sorted integer ranges; Maps with integer-range keys; Full set operations
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

use core::iter::{DoubleEndedIterator, FusedIterator};

// ...existing code...

impl<'a, T: Copy + Ord, B: BuildHasher> Iterator for From<'a, T, B> {
    // ...existing code...
}

impl<'a, T: Copy + Ord, B: BuildHasher> FusedIterator for From<'a, T, B> {}

// Only if From uses a double-ended inner collection
impl<'a, T: Copy + Ord, B: BuildHasher> DoubleEndedIterator for From<'a, T, B> {
    fn next_back(&mut self) -> Option<Self::Item> {
        // Assuming that From holds something like a btree_set::Iter that supports DoubleEndedIterator
        self.inner.next_back()
    }
}

impl<'a, T: Copy + Ord, B: BuildHasher> Iterator for Into<'a, T, B> {
    // ...existing code...
}

impl<'a, T: Copy + Ord, B: BuildHasher> FusedIterator for Into<'a, T, B> {}

// Only if Into uses a double-ended inner collection
impl<'a, T: Copy + Ord, B: BuildHasher> DoubleEndedIterator for Into<'a, T, B> {
    fn next_back(&mut self) -> Option<Self::Item> {
        // Assuming that Into holds something like a btree_set::Iter that supports DoubleEndedIterator
        self.inner.next_back()
    }
}