|
CGAL 6.0 - Handles and Circulators
|
| ▼NCGAL | |
| CBidirectional_circulator_base | |
| CBidirectional_circulator_ptrbase | Bidirectional circulator |
| CBidirectional_circulator_tag | |
| CCirculator_base | |
| CCirculator_from_container | The adaptor Circulator_from_container provides a circulator for an STL container C of equal category as the iterator provided by the container |
| CCirculator_from_iterator | The adaptor Circulator_from_iterator converts two iterators of type I, a begin and a past-the-end value, to a circulator of equal category |
| CCirculator_tag | A tag for any circulator type |
| CCirculator_traits | The circulator traits class distinguishes between circulators and iterators |
| CContainer_from_circulator | The adaptor Container_from_circulator is a class that converts any circulator type C to a kind of container class, i.e. a class that provides an iterator and a const_iterator type and two member functions (begin() and end()) that return the appropriate iterators |
| CForward_circulator_base | |
| CForward_circulator_ptrbase | Forward circulator |
| CForward_circulator_tag | |
| CIterator_tag | A tag for any iterator type |
| CRandom_access_circulator_base | |
| CRandom_access_circulator_ptrbase | Random access circulator |
| CRandom_access_circulator_tag | |
| CBidirectionalCirculator | See Subsection Bidirectional Circulators in the page on Circulators |
| CCirculator | A Circulator is similar to an Iterator, with the difference that it is designed for circular data structures |
| CConstHandle | A constant handle. Refer to the Handle concept for more details |
| CConstRange | A constant iterator range. Refer to the Range concept for more details |
| CForwardCirculator | See Subsection Forward Circulators in the page on Circulators |
| CHandle | Most data structures in CGAL use the concept of Handle in their user interface to refer to the elements they store. This concept describes what is sometimes called a trivial iterator. A Handle is akin to a pointer to an object providing the dereference operator operator*() and member access operator->() but no increment or decrement operators like iterators. A Handle is intended to be used whenever the referenced object is not part of a logical sequence |
| CRandomAccessCirculator | See Subsection sectionMinCircleRequ in the page on Circulators |
| CRange | CGAL and the STL heavily use the concepts of iterators and iterator ranges to describe linear sequences of elements, and algorithms operating on these |