Juggler
Juggling algorithms and event processing using gaudi framework
|
#include <Range.hpp>
Public Member Functions | |
Range (Iterator b, Iterator e) | |
Range (Range &&)=default | |
Range (const Range &)=default | |
~Range ()=default | |
Range & | operator= (Range &&)=default |
Range & | operator= (const Range &)=default |
Iterator | begin () const |
Iterator | end () const |
bool | empty () const |
std::size_t | size () const |
Range (Iterator b, Iterator e) | |
Range (Range &&)=default | |
Range (const Range &)=default | |
~Range ()=default | |
Range & | operator= (Range &&)=default |
Range & | operator= (const Range &)=default |
Iterator | begin () const |
Iterator | end () const |
bool | empty () const |
std::size_t | size () const |
Range (Iterator b, Iterator e) | |
Range (Range &&)=default | |
Range (const Range &)=default | |
~Range ()=default | |
Range & | operator= (Range &&)=default |
Range & | operator= (const Range &)=default |
Iterator | begin () const |
Iterator | end () const |
bool | empty () const |
std::size_t | size () const |
A wrapper around a pair of iterators to simplify range-based loops.
Some standard library algorithms return pairs of iterators to identify a sub-range. This wrapper simplifies the iteration and should be used as follows:
for (auto x : makeRange(std::equal_range(...)) { ... }
|
inline |
|
default |
|
default |
|
default |
|
inline |
|
default |
|
default |
|
default |
|
inline |
|
default |
|
default |
|
default |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
default |
|
default |
|
default |
|
default |
|
default |
|
default |
|
inline |
|
inline |
|
inline |