RE/flex range sets as closed and open-ended set containers. More...
|struct||reflex::range_compare< T >|
|Functor to define a total order on ranges (intervals) represented by pairs. More...|
|class||reflex::Ranges< T >|
|RE/flex Ranges template class. More...|
|class||reflex::ORanges< T >|
|RE/flex ORanges (open-ended, ordinal value range) template class. More...|
RE/flex range sets as closed and open-ended set containers.
Open-ended ranges are more efficient than
std::set when the values stored are adjacent (e.g. integers 2 and 3 are adjacent), since
std::set stores values individually whereas open-ended ranges merges adjacent values into ranges. This lowers storage overhead and reduces insertion, deletion, and search time.