\( \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.5.2 - 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 12]
oNCGAL
|oCCirculator_from_containerThe adaptor Circulator_from_container provides a circulator for an STL container C of equal category as the iterator provided by the container
|oCCirculator_from_iteratorThe adaptor Circulator_from_iterator converts two iterators of type I, a begin and a past-the-end value, to a circulator of equal category
|oCCirculator_traitsThe circulator traits class distinguishes between circulators and iterators
|oCContainer_from_circulatorThe 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
|oCCirculator_tagA tag for any circulator type
|oCIterator_tagA tag for any iterator type
|oCForward_circulator_tag
|oCBidirectional_circulator_tag
|oCRandom_access_circulator_tag
|oCCirculator_base
|oCForward_circulator_base
|oCBidirectional_circulator_base
|oCRandom_access_circulator_base
|oCForward_circulator_ptrbaseForward circulator
|oCBidirectional_circulator_ptrbaseBidirectional circulator
|\CRandom_access_circulator_ptrbaseRandom access circulator
oCBidirectionalCirculatorSee Subsection Bidirectional Circulators in the page on Circulators
oCCirculatorA Circulator is similar to an Iterator, with the difference that it is designed for circular data structures
oCConstRangeA constant iterator range. Refer to the Range concept for more details
oCForwardCirculatorSee Subsection Forward Circulators in the page on Circulators
oCHandleMost 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
oCRandomAccessCirculatorSee Subsection Random Access Circulators in the page on Circulators
\CRangeCGAL and the STL heavily use the concepts of iterators and iterator ranges to describe linear sequences of elements, and algorithms operating on these