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
32
33
34
35
36
37
38
39
40

use core::iter::FusedIterator;

use core::hash::BuildHasher;
use core::ops::RangeBounds;
use std::collections::BTreeSet;

pub struct RangeSet<T, B> {
    set: BTreeSet<T>,
    hasher: B,
}

pub struct RangeSetIter<'a, T, B> {
    inner: std::collections::btree_set::Iter<'a, T>,
    hasher: &'a B,
}

impl<'a, T: Copy + Ord, B: BuildHasher> Iterator for RangeSetIter<'a, T, B> {
    type Item = &'a T;

    fn next(&mut self) -> Option<Self::Item> {
        self.inner.next()
    }
}

// Safe because BTreeSet iterators are already fused
impl<'a, T: Copy + Ord, B: BuildHasher> FusedIterator for RangeSetIter<'a, T, B> {}

// Safe because BTreeSet iterators already implement ExactSizeIterator
impl<'a, T: Copy + Ord, B: BuildHasher> ExactSizeIterator for RangeSetIter<'a, T, B> {
    fn len(&self) -> usize {
        self.inner.len()
    }
}

// Safe because BTreeSet iterators already implement DoubleEndedIterator
impl<'a, T: Copy + Ord, B: BuildHasher> DoubleEndedIterator for RangeSetIter<'a, T, B> {
    fn next_back(&mut self) -> Option<Self::Item> {
        self.inner.next_back()
    }
}