\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)

CGAL 4.8 - Handles and Circulators

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level 1 2]

CGAL |
Circulator_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
Circulator_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
Circulator_traits | The circulator traits class distinguishes between circulators and iterators
Container_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
Circulator_tag | A tag for any circulator type
Iterator_tag | A tag for any iterator type
Forward_circulator_tag |
Bidirectional_circulator_tag |
Random_access_circulator_tag |
Circulator_base |
Forward_circulator_base |
Bidirectional_circulator_base |
Random_access_circulator_base |
Forward_circulator_ptrbase | Forward circulator
Bidirectional_circulator_ptrbase | Bidirectional circulator
Random_access_circulator_ptrbase | Random access circulator
BidirectionalCirculator | See Subsection Bidirectional Circulators in the page on Circulators
Circulator | A Circulator is similar to an Iterator, with the difference that it is designed for circular data structures
ConstHandle | A constant handle. Refer to the `Handle` concept for more details
ConstRange | A constant iterator range. Refer to the `Range` concept for more details
ForwardCirculator | See Subsection Forward Circulators in the page on Circulators
Handle | 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
RandomAccessCirculator | See Subsection Random Access Circulators in the page on Circulators
Range | CGAL and the STL heavily use the concepts of iterators and iterator ranges to describe linear sequences of elements, and algorithms operating on these