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

use core::iter::FusedIterator;

// ...existing code...

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

// FusedIterator is safe for Intersection only if we can guarantee that once next() returns None,
// subsequent calls will continue to return None. This needs to be verified by examining
// the implementation details.
//
// The implementation should be checked to ensure that once either input iterator
// is exhausted, the Intersection iterator will consistently return None.
// impl<'a, T: Copy + Ord, B: BuildHasher> FusedIterator for Intersection<'a, T, B> {}

// Note: DoubleEndedIterator cannot be easily implemented for Intersection
// because it would require backwards iteration through both underlying iterators
// while maintaining the intersection logic