CGAL 6.2 - Handles and Circulators

Loading...
Searching...
No Matches
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]

▼N CGAL |
C Bidirectional_circulator_base |
C Bidirectional_circulator_ptrbase | Bidirectional circulator
C Bidirectional_circulator_tag |
C Circulator_base |
C 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
C 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
C Circulator_tag | A tag for any circulator type
C Circulator_traits | The circulator traits class distinguishes between circulators and iterators
C 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
C Forward_circulator_base |
C Forward_circulator_ptrbase | Forward circulator
C Forward_circulator_tag |
C Iterator_tag | A tag for any iterator type
C Random_access_circulator_base |
C Random_access_circulator_ptrbase | Random access circulator
C Random_access_circulator_tag |
C BidirectionalCirculator | See Subsection Bidirectional Circulators in the page on Circulators
C Circulator | A Circulator is similar to an Iterator, with the difference that it is designed for circular data structures
C ConstHandle | A constant handle. Refer to the `Handle` concept for more details
C ConstRange | A constant iterator range. Refer to the `Range` concept for more details
C ForwardCirculator | See Subsection Forward Circulators in the page on Circulators
C 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
C RandomAccessCirculator | See Subsection sectionMinCircleRequ in the page on Circulators
C 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