This provides a very simple, boring adaptor for a begin and end iterator into a range type. More...
#include <iterator>#include <utility>
Include dependency graph for iterator_range.h:
Go to the source code of this file.
Classes | |
| class | llvm::iterator_range< IteratorT > |
| A range adaptor for a pair of iterators. More... | |
Namespaces | |
| llvm | |
| This class represents lattice values for constants. | |
Functions | |
| template<class T > | |
| iterator_range< T > | llvm::make_range (T x, T y) |
| Convenience function for iterating over sub-ranges. More... | |
| template<typename T > | |
| iterator_range< T > | llvm::make_range (std::pair< T, T > p) |
| template<typename T > | |
| iterator_range< decltype(adl_begin(std::declval< T >)))> | llvm::drop_begin (T &&t, int n) |
Detailed Description
This provides a very simple, boring adaptor for a begin and end iterator into a range type.
This should be used to build range views that work well with range based for loops and range based constructors.
Note that code here follows more standards-based coding conventions as it is mirroring proposed interfaces for standardization.
Definition in file iterator_range.h.
