Struct FillGapsIter 

pub struct FillGapsIter<T, I> { /* private fields */ }

An iterator that fills the gaps in a sorted, disjoint set stream.

Present ranges are returned with true, and missing portions of the integer domain are returned with false. The output covers the complete domain from Integer::min_value through Integer::max_value. In other words, this is a total Boolean-valued map stream: true means membership in the input set and false means a gap. The false values are ordinary map values, so the resulting map’s key domain is universal.

This iterator is created by SortedDisjoint::fill_gaps, typically from a set stream such as RangeSetBlaze::ranges. To materialize the result instead of streaming it, use RangeSetBlaze::fill_gaps.

The iterator implements SortedDisjointMap<T, bool>, so it supports the sorted-disjoint map operations and can be collected into a RangeMapBlaze<T, bool>.

Because true and false are ordinary map values, map operators act on the stream’s key ranges; for example, !filled is empty rather than Boolean negation.

For the set and map APIs together, see the Ranges and gaps guide.

Example

use range_set_blaze::{
    CheckSortedDisjoint, RangeMapBlaze, RangeSetBlaze, SortedDisjoint, SortedDisjointMap,
};

// From the streaming layer directly.
let input = CheckSortedDisjoint::new([1..=3, 7..=10]);
let output = input.fill_gaps().collect::<Vec<_>>();
assert_eq!(output[0], (i32::MIN..=0, false));
assert_eq!(output[1], (1..=3, true));
assert_eq!(output[2], (4..=6, false));
assert_eq!(output[3], (7..=10, true));
assert_eq!(output[4], (11..=i32::MAX, false));

// Or explicitly materialize the streaming result into a map.
let set = RangeSetBlaze::from_iter([1_u8..=3, 7..=10]);
let map: RangeMapBlaze<u8, bool> = set.ranges().fill_gaps().into_range_map_blaze();
assert_eq!(map.get(2), Some(&true));
assert_eq!(map.get(5), Some(&false));

Trait Implementations

impl<I: SortedDisjoint<T>, T, R> BitAnd<R> for FillGapsIter<T, I>

where T: Integer, R: SortedDisjointMap<T, bool>,

type Output = IntersectionIterMap<T, bool, R, RangeValuesToRangesIter<T, bool, FillGapsIter<T, I>>>

The resulting type after applying the & operator.

fn bitand(self, other: R) -> Self::Output

Performs the & operation.

impl<I: SortedDisjoint<T>, T, R> BitOr<R> for FillGapsIter<T, I>

where T: Integer, R: SortedDisjointMap<T, bool>,

type Output = UnionIterMap<T, bool, MergeMap<T, bool, FillGapsIter<T, I>, R>>

The resulting type after applying the | operator.

fn bitor(self, other: R) -> Self::Output

Performs the | operation.

impl<I: SortedDisjoint<T>, T, R> BitXor<R> for FillGapsIter<T, I>

where T: Integer, R: SortedDisjointMap<T, bool>,

type Output = SymDiffIterMap<T, bool, MergeMap<T, bool, FillGapsIter<T, I>, R>>

The resulting type after applying the ^ operator.

fn bitxor(self, other: R) -> Self::Output

Performs the ^ operation.

impl<T: Clone, I: Clone> Clone for FillGapsIter<T, I>

fn clone(&self) -> FillGapsIter<T, I>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug, I: Debug> Debug for FillGapsIter<T, I>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T, I> FusedIterator for FillGapsIter<T, I>

where T: Integer, I: SortedDisjoint<T>,

impl<T, I> Iterator for FillGapsIter<T, I>

where T: Integer, I: SortedDisjoint<T>,

type Item = (RangeInclusive<T>, bool)

The type of the elements being iterated over.

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value.

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator.

fn next_chunk<const N: usize>( &mut self, ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>

where Self: Sized,

🔬This is a nightly-only experimental API. (iter_next_chunk)

Advances the iterator and returns an array containing the next N values.

fn count(self) -> usize

where Self: Sized,

Consumes the iterator, counting the number of iterations and returning it.

fn last(self) -> Option<Self::Item>

where Self: Sized,

Consumes the iterator, returning the last element.

fn advance_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

🔬This is a nightly-only experimental API. (iter_advance_by)

Advances the iterator by n elements.

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator.

fn step_by(self, step: usize) -> StepBy<Self>

where Self: Sized,

Creates an iterator starting at the same point, but stepping by the given amount at each iteration.

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>

where Self: Sized, U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence.

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>

where Self: Sized, U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs.

fn intersperse(self, separator: Self::Item) -> Intersperse<Self>

where Self: Sized, Self::Item: Clone,

🔬This is a nightly-only experimental API. (iter_intersperse)

Creates a new iterator which places a copy of separator between items of the original iterator.

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>

where Self: Sized, G: FnMut() -> Self::Item,

🔬This is a nightly-only experimental API. (iter_intersperse)

Creates a new iterator which places an item generated by separator between items of the original iterator.

fn map<B, F>(self, f: F) -> Map<Self, F>

where Self: Sized, F: FnMut(Self::Item) -> B,

Takes a closure and creates an iterator which calls that closure on each element.

fn for_each<F>(self, f: F)

where Self: Sized, F: FnMut(Self::Item),

Calls a closure on each element of an iterator.

fn filter<P>(self, predicate: P) -> Filter<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator which uses a closure to determine if an element should be yielded.

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>

where Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both filters and maps.

fn enumerate(self) -> Enumerate<Self>

where Self: Sized,

Creates an iterator which gives the current iteration count as well as the next value.

fn peekable(self) -> Peekable<Self>

where Self: Sized,

Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See their documentation for more information.

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that skips elements based on a predicate.

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that yields elements based on a predicate.

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>

where Self: Sized, P: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both yields elements based on a predicate and maps.

fn skip(self, n: usize) -> Skip<Self>

where Self: Sized,

Creates an iterator that skips the first n elements.

fn take(self, n: usize) -> Take<Self>

where Self: Sized,

Creates an iterator that yields the first n elements, or fewer if the underlying iterator ends sooner.

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>

where Self: Sized, F: FnMut(&mut St, Self::Item) -> Option<B>,

An iterator adapter which, like fold, holds internal state, but unlike fold, produces a new iterator.

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>

where Self: Sized, U: IntoIterator, F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure.

fn flatten(self) -> Flatten<Self>

where Self: Sized, Self::Item: IntoIterator,

Creates an iterator that flattens nested structure.

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>

where Self: Sized, F: FnMut(&[Self::Item; N]) -> R,

🔬This is a nightly-only experimental API. (iter_map_windows)

Calls the given function f for each contiguous window of size N over self and returns an iterator over the outputs of f. Like slice::windows(), the windows during mapping overlap as well.

fn fuse(self) -> Fuse<Self>

where Self: Sized,

Creates an iterator which ends after the first None.

fn inspect<F>(self, f: F) -> Inspect<Self, F>

where Self: Sized, F: FnMut(&Self::Item),

Does something with each element of an iterator, passing the value on.

fn by_ref(&mut self) -> &mut Self

where Self: Sized,

Creates a “by reference” adapter for this instance of Iterator.

fn collect<B>(self) -> B

where B: FromIterator<Self::Item>, Self: Sized,

Transforms an iterator into a collection.

fn try_collect<B>( &mut self, ) -> <<Self::Item as Try>::Residual as Residual<B>>::TryType

where Self: Sized, Self::Item: Try, <Self::Item as Try>::Residual: Residual<B>, B: FromIterator<<Self::Item as Try>::Output>,

🔬This is a nightly-only experimental API. (iterator_try_collect)

Fallibly transforms an iterator into a collection, short circuiting if a failure is encountered.

fn collect_into<E>(self, collection: &mut E) -> &mut E

where E: Extend<Self::Item>, Self: Sized,

🔬This is a nightly-only experimental API. (iter_collect_into)

Collects all the items from an iterator into a collection.

fn partition<B, F>(self, f: F) -> (B, B)

where Self: Sized, B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it.

fn is_partitioned<P>(self, predicate: P) -> bool

where Self: Sized, P: FnMut(Self::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_is_partitioned)

Checks if the elements of this iterator are partitioned according to the given predicate, such that all those that return true precede all those that return false.

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R

where Self: Sized, F: FnMut(B, Self::Item) -> R, R: Try<Output = B>,

An iterator method that applies a function as long as it returns successfully, producing a single, final value.

fn try_for_each<F, R>(&mut self, f: F) -> R

where Self: Sized, F: FnMut(Self::Item) -> R, R: Try<Output = ()>,

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error.

fn fold<B, F>(self, init: B, f: F) -> B

where Self: Sized, F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, returning the final result.

fn reduce<F>(self, f: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Self::Item,

Reduces the elements to a single one, by repeatedly applying a reducing operation.

fn try_reduce<R>( &mut self, f: impl FnMut(Self::Item, Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType

where Self: Sized, R: Try<Output = Self::Item>, <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (iterator_try_reduce)

Reduces the elements to a single one by repeatedly applying a reducing operation. If the closure returns a failure, the failure is propagated back to the caller immediately.

fn all<F>(&mut self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate.

fn any<F>(&mut self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate.

fn find<P>(&mut self, predicate: P) -> Option<Self::Item>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Searches for an element of an iterator that satisfies a predicate.

fn find_map<B, F>(&mut self, f: F) -> Option<B>

where Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Applies function to the elements of iterator and returns the first non-none result.

fn try_find<R>( &mut self, f: impl FnMut(&Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType

where Self: Sized, R: Try<Output = bool>, <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (try_find)

Applies function to the elements of iterator and returns the first true result or the first error.

fn position<P>(&mut self, predicate: P) -> Option<usize>

where Self: Sized, P: FnMut(Self::Item) -> bool,

Searches for an element in an iterator, returning its index.

fn max(self) -> Option<Self::Item>

where Self: Sized, Self::Item: Ord,

Returns the maximum element of an iterator.

fn min(self) -> Option<Self::Item>

where Self: Sized, Self::Item: Ord,

Returns the minimum element of an iterator.

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>

where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the specified function.

fn max_by<F>(self, compare: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the maximum value with respect to the specified comparison function.

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>

where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the specified function.

fn min_by<F>(self, compare: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the minimum value with respect to the specified comparison function.

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)

where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers.

fn copied<'a, T>(self) -> Copied<Self>

where T: Copy + 'a, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements.

fn cloned<'a, T>(self) -> Cloned<Self>

where T: Clone + 'a, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements.

fn cycle(self) -> Cycle<Self>

where Self: Sized + Clone,

Repeats an iterator endlessly.

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>

where Self: Sized,

🔬This is a nightly-only experimental API. (iter_array_chunks)

Returns an iterator over N elements of the iterator at a time.

fn sum<S>(self) -> S

where Self: Sized, S: Sum<Self::Item>,

Sums the elements of an iterator.

fn product<P>(self) -> P

where Self: Sized, P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements.

fn cmp<I>(self, other: I) -> Ordering

where I: IntoIterator<Item = Self::Item>, Self::Item: Ord, Self: Sized,

Lexicographically compares the elements of this Iterator with those of another.

fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

🔬This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

fn partial_cmp<I>(self, other: I) -> Option<Ordering>

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Lexicographically compares the PartialOrd elements of this Iterator with those of another. The comparison works like short-circuit evaluation, returning a result without comparing the remaining elements. As soon as an order can be determined, the evaluation stops and a result is returned.

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

fn eq<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are equal to those of another.

fn eq_by<I, F>(self, other: I, eq: F) -> bool

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)

Determines if the elements of this Iterator are equal to those of another with respect to the specified equality function.

fn ne<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are not equal to those of another.

fn lt<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically less than those of another.

fn le<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically less or equal to those of another.

fn gt<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically greater than those of another.

fn ge<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another.

fn is_sorted(self) -> bool

where Self: Sized, Self::Item: PartialOrd,

Checks if the elements of this iterator are sorted.

fn is_sorted_by<F>(self, compare: F) -> bool

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> bool,

Checks if the elements of this iterator are sorted using the given comparator function.

fn is_sorted_by_key<F, K>(self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> K, K: PartialOrd,

Checks if the elements of this iterator are sorted using the given key extraction function.

impl<I: SortedDisjoint<T>, T> Not for FillGapsIter<T, I>

where T: Integer,

type Output = NotIter<T, RangeValuesToRangesIter<T, bool, FillGapsIter<T, I>>>

The resulting type after applying the ! operator.

fn not(self) -> Self::Output

Performs the unary ! operation.

impl<I: SortedDisjoint<T>, T> SortedDisjointMap<T, bool> for FillGapsIter<T, I>

where T: Integer,

fn fill_gaps(self) -> FillGapsIterMap<T, VC, Self>

where Self: Sized,

Fills the gaps in this sorted, disjoint map stream with None values.

fn into_sorted_disjoint(self) -> RangeValuesToRangesIter<T, VC, Self>

where Self: Sized,

Converts a SortedDisjointMap iterator into a SortedDisjoint iterator.

fn union<R>(self, other: R) -> UnionMergeMap<T, VC, Self, R::IntoIter>

where R: IntoIterator<Item = Self::Item>, R::IntoIter: SortedDisjointMap<T, VC>, Self: Sized,

Given two SortedDisjointMap iterators, efficiently returns a SortedDisjointMap iterator of their union.

fn intersection<R>(self, other: R) -> IntersectionMap<T, VC, Self, R::IntoIter>

where R: IntoIterator<Item = Self::Item>, R::IntoIter: SortedDisjointMap<T, VC>, Self: Sized,

Given two SortedDisjointMap iterators, efficiently returns a SortedDisjointMap iterator of their intersection.

fn map_and_set_intersection<R>( self, other: R, ) -> IntersectionIterMap<T, VC, Self, R::IntoIter>

where R: IntoIterator<Item = RangeInclusive<T>>, R::IntoIter: SortedDisjoint<T>, Self: Sized,

Given a SortedDisjointMap iterator and a SortedDisjoint iterator, efficiently returns a SortedDisjointMap iterator of their intersection.

fn difference<R>(self, other: R) -> DifferenceMap<T, VC, Self, R::IntoIter>

where R: IntoIterator<Item = Self::Item>, R::IntoIter: SortedDisjointMap<T, VC>, Self: Sized,

Given two SortedDisjointMap iterators, efficiently returns a SortedDisjointMap iterator of their set difference.

fn map_and_set_difference<R>( self, other: R, ) -> IntersectionIterMap<T, VC, Self, NotIter<T, R::IntoIter>>

where R: IntoIterator<Item = RangeInclusive<T>>, R::IntoIter: SortedDisjoint<T>, Self: Sized,

Given a SortedDisjointMap iterator and a SortedDisjoint iterator, efficiently returns a SortedDisjointMap iterator of their set difference.

fn complement(self) -> NotIter<T, RangeValuesToRangesIter<T, VC, Self>>

where Self: Sized,

Returns the complement of a SortedDisjointMap’s keys as a SortedDisjoint iterator.

fn complement_with( self, v: &VC::Value, ) -> RangeToRangeValueIter<'_, T, VC::Value, NotIter<T, impl SortedDisjoint<T>>>

where Self: Sized,

Returns the complement of a SortedDisjointMap’s keys, associating each range with the provided value v. The result is a SortedDisjointMap iterator.

fn symmetric_difference<R>( self, other: R, ) -> SymDiffMergeMap<T, VC, Self, R::IntoIter>

where R: IntoIterator<Item = Self::Item>, R::IntoIter: SortedDisjointMap<T, VC>, Self: Sized, VC: ValueCarrier,

Given two SortedDisjointMap iterators, efficiently returns a SortedDisjointMap iterator of their symmetric difference.

fn equal<R>(self, other: R) -> bool

where R: IntoIterator<Item = Self::Item>, R::IntoIter: SortedDisjointMap<T, VC>, Self: Sized,

Given two SortedDisjointMap iterators, efficiently tells if they are equal. Unlike most equality testing in Rust, this method takes ownership of the iterators and consumes them.

fn is_empty(self) -> bool

where Self: Sized,

Returns true if the SortedDisjointMap contains no elements.

fn is_universal(self) -> bool

where Self: Sized,

Returns true if the map contains all possible integers.

fn into_range_map_blaze(self) -> RangeMapBlaze<T, VC::Value>

where Self: Sized,

Create a RangeMapBlaze from a SortedDisjointMap iterator.

impl<I: SortedDisjoint<T>, T> SortedStartsMap<T, bool> for FillGapsIter<T, I>

where T: Integer,

impl<I: SortedDisjoint<T>, T, R> Sub<R> for FillGapsIter<T, I>

where T: Integer, R: SortedDisjointMap<T, bool>,

type Output = IntersectionIterMap<T, bool, FillGapsIter<T, I>, NotIter<T, RangeValuesToRangesIter<T, bool, R>>>

The resulting type after applying the - operator.

fn sub(self, other: R) -> Self::Output

Performs the - operation.