|
CGAL 5.1 - STL Extensions for CGAL
|
#include <CGAL/Iterator_range.h>
Inherits pair< I, I >.
CGAL::Iterator_range encapsulates two iterators so they fulfill the ForwardRange concept. The class is essentially a clone of boost::iterator_range, and it additionally is derived from std::pair, so that one can apply boost::tie.
Public Types | |
| typedef I | iterator |
| typedef I | const_iterator |
Public Member Functions | |
| Iterator_range (I b, I e) | |
| Iterator_range (const std::pair< I, I > &ip) | |
| I | begin () const |
| I | end () const |
| std::size_t | size () const |
returns std::distance(begin(), end()) More... | |
| typedef I CGAL::Iterator_range< I >::const_iterator |
| typedef I CGAL::Iterator_range< I >::iterator |
| CGAL::Iterator_range< I >::Iterator_range | ( | I | b, |
| I | e | ||
| ) |
| CGAL::Iterator_range< I >::Iterator_range | ( | const std::pair< I, I > & | ip | ) |
| I CGAL::Iterator_range< I >::begin | ( | ) | const |
| I CGAL::Iterator_range< I >::end | ( | ) | const |
| std::size_t CGAL::Iterator_range< I >::size | ( | ) | const |