Ranges: pair of begin and end iterators, which can be initialized from containers, provide useful methods such as map, filter and concat which only manipulate iterators, and can be used with ranged-for.
More...
#include <util/invariant.h>
#include <functional>
#include <memory>
#include <type_traits>
+ Include dependency graph for range.h:
+ This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Iterator which applies some given function
f after each increment and returns its result on dereference.
More...
Iterator which only stops at elements for which some given function
f is true.
More...
On increment, increments a first iterator and when the corresponding end iterator is reached, starts to increment a second one.
More...
Zip two ranges to make a range of pairs.
More...
A range is a pair of a begin and an end iterators.
More...
Utility function to make equal_range method of multimap easier to use by returning a ranget object.
Detailed Description
Ranges: pair of begin and end iterators, which can be initialized from containers, provide useful methods such as map, filter and concat which only manipulate iterators, and can be used with ranged-for.
Definition in file range.h.
Function Documentation
◆ equal_range()
Utility function to make equal_range method of multimap easier to use by returning a ranget object.
For instance, we can write: for(auto value : equal_range(map, key).filter(...).map(...)) {...}.
Definition at line 539 of file range.h.
◆ make_range() [1/2]
◆ make_range() [2/2]
ranget< iteratort > make_range
(
iteratort
begin,
iteratort
end
)
