|
Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
Go to the source code of this file.
Data Structures | |
| class | ext::iterator_range< Iterator > |
| Implementation of iterator_range, i.e. pair of iterators. The class provides most notably begin and end methods to allow the class be used in foreach context. More... | |
Namespaces | |
| namespace | ext |
Functions | |
| template<typename Iter > | |
| iterator_range< Iter > | ext::make_iterator_range (Iter begin, Iter end) |
| Helper to create iterator_range from two iterators. More... | |
| template<class Container > | |
| auto | ext::range (Container &&cont) -> decltype(std::forward< Container >(cont).range()) |