A pair of iterators to be used in specialized algorithms instead of the standard first, last construction. More...
#include <algorithm.h>
Inheritance diagram for ThePEG::IteratorRange< Iterator >:
Public Types | |
| typedef std::pair< Iterator, Iterator > | BaseType |
| The underlying representation. More... | |
Public Member Functions | |
| IteratorRange () | |
| Default constructor. More... | |
| IteratorRange (const IteratorRange &ir) | |
| Copy constructor. | |
| IteratorRange (const BaseType &ir) | |
| Constructor taking the underlying pair representation as argument. More... | |
Detailed Description
template<typename Iterator>
struct ThePEG::IteratorRange< Iterator >
A pair of iterators to be used in specialized algorithms instead of the standard first, last construction.
Definition at line 29 of file algorithm.h.
Member Typedef Documentation
template<typename Iterator>
| typedef std::pair<Iterator,Iterator> ThePEG::IteratorRange< Iterator >::BaseType |
The underlying representation.
Definition at line 32 of file algorithm.h.
Constructor & Destructor Documentation
template<typename Iterator>
|
inline |
Default constructor.
Definition at line 35 of file algorithm.h.
template<typename Iterator>
|
inline |
Constructor taking the underlying pair representation as argument.
Definition at line 42 of file algorithm.h.
The documentation for this struct was generated from the following file:
