Crate ranges

Expand description

§Ranges

This crate provides a generic alternative to core/std ranges, set-operations to work with them and a range set that can efficiently store them with the least amount of memory possible.

§Features

From implementations for all core/std ranges
open ranges like (3, 10]
support for RangeBounds<T>
iterators (even for unbound ranges when the domain has a minimum)
Display implementations for single and set ranges (with format argument pass-through)
Operators like | and ^ for their respective operation
Domain implementations for types like bool and char

Structs§

GenericIterator: A stateful Iterator over a GenericRange<T>, yielding T.
GenericRange: A generic analog to core/std ranges.
Ranges: A range set storing GenericRanges in the most memory-optimal fashion possible.

Enums§

Arrangement: This enum represents all possible arrangements of two GenericRanges.
OperationResult: Result of a unary or binary operation.
Relation: This enum represents all possible arrangements of two GenericRanges. The original values were moved, possibly modified, and then stored.

Traits§

Domain: Provides otherwise unknown information about the type it is being implemented for.
Iterable: Domain-driven trait required to implement iterators on discrete types.