\( \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 - STL Extensions for CGAL

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 3]

boost |
range_iterator |
range_mutable_iterator |
range_const_iterator |
range_iterator< CGAL::Iterator_range< T > > |
range_mutable_iterator< CGAL::Iterator_range< T > > |
range_const_iterator< CGAL::Iterator_range< T > > |
CGAL |
cpp11 |
array | An object of the class `cpp11::array` represents an array of elements of type `T`, the number of which is specified by the second template argument
result_of | Alias to the tr1 implementation from boost of the `result_of` mechanism
tuple | An object of the class `cpp11::tuple` represents a heterogeneous tuple of elements of the types specified in parameters, which are in variadic number
CC_safe_handle | The class `CC_safe_handle` is a helper class that stores an iterator on a `Compact_container` (or `Concurrent_compact_container`) and is able to know if the pointee has been erased after the creation of the `CC_safe_handle` instance
Compact_container_base | The class `Compact_container_base` can be used as a base class for your own type `T`, so that `T` can be used directly within `Compact_container<T, Allocator>`
Compact_container | An object of the class `Compact_container` is a container of objects of type `T`
Compact_container_traits | The traits class `Compact_container_traits` provides the way to access the internal pointer required for `T` to be used in a `Compact_container<T, Allocator>`
Compact | `Compact` is a tag class
Fast | `Fast` is a tag class
Concurrent_compact_container_traits | The traits class `Concurrent_compact_container_traits` provides the way to access the internal pointer required for `T` to be used in a `Concurrent_compact_container<T, Allocator>`
Concurrent_compact_container | An object of the class `Concurrent_compact_container` is a container of objects of type `T`, which allows to call `insert` and `erase` operations concurrently
Default | `Default` is a tag class
Get | A nested template providing a typedef `type` which equals `Type` if `Parameter` is `Default`, and `Parameter` otherwise
Fourtuple | The `Fourtuple` class stores a homogeneous (same type) fourtuple of objects of type `T`
Cast_function_object | The class `Cast_function_object` applies a C-style type cast to its argument
Compare_to_less | The class `Compare_to_less` is used to convert a functor which returns a `Comparison_result` to a predicate (returning bool) : it will return true iff the return value of `F` is `SMALLER`
Creator_1 | The class `Creator_1` defines types and operations for creating objects from one argument
Creator_2 | The class `Creator_2` defines types and operations for creating objects from two arguments
Creator_3 | The class `Creator_3` defines types and operations for creating objects from three arguments
Creator_4 | The class `Creator_4` defines types and operations for creating objects from four arguments
Creator_5 | The class `Creator_5` defines types and operations for creating objects from five arguments
Creator_uniform_2 | The class `Creator_uniform_2` defines types and operations for creating objects from two arguments of the same type
Creator_uniform_3 | The class `Creator_uniform_3` defines types and operations for creating objects from three arguments of the same type
Creator_uniform_4 | The class `Creator_uniform_4` defines types and operations for creating objects from four arguments of the same type
Creator_uniform_5 | The class `Creator_uniform_5` defines types and operations for creating objects from five arguments of the same type
Creator_uniform_6 | The class `Creator_uniform_6` defines types and operations for creating objects from six arguments of the same type
Creator_uniform_7 | The class `Creator_uniform_7` defines types and operations for creating objects from seven arguments of the same type
Creator_uniform_8 | The class `Creator_uniform_8` defines types and operations for creating objects from eight arguments of the same type
Creator_uniform_9 | The class `Creator_uniform_9` defines types and operations for creating objects from nine arguments of the same type
Creator_uniform_d | The class `Creator_uniform_d` defines types and operations for creating objects from two arguments of the same type
Dereference | The class `Dereference` dereferences a pointer (`operator*`)
Get_address | The class `Get_address` gets the address of an lvalue (`operator&`)
Identity | The class `Identity` represents the identity function on `Value`
Project_facet | The class `Project_facet` calls the member function `facet()` on an instance of type `Node`
Project_next | The class `Project_next` calls the member function `next()` on an instance of type `Node`
Project_next_opposite | The class `Project_next_opposite` calls the member functions `next()->opposite()` on an instance of type `Node`
Project_normal | The class `Project_normal` calls the member function `normal()` on an instance of type `Node`
Project_opposite_prev | The class `Project_opposite_prev` calls the member functions `opposite()->prev()` on an instance of type `Node`
Project_plane | The class `Project_plane` calls the member function `plane()` on an instance of type `Node`
Project_point | The class `Project_point` calls the member function `point()` on an instance of type `Node`
Project_prev | The class `Project_prev` calls the member function `prev()` on an instance of type `Node`
Project_vertex | The class `Project_vertex` calls the member function `vertex()` on an instance of type `Node`
In_place_list_base | The node base classes provides pointers to build linked lists
In_place_list | An object of the class `In_place_list` represents a sequence of items of type `T` that supports bidirectional iterators and allows constant time insert and erase operations anywhere within the sequence
Const_oneset_iterator | The class `Const_oneset_iterator` defines a `RandomAccessIterator` that always refers to a copy of a specific object of type `T`
Counting_iterator | The iterator adaptor `Counting_iterator` adds a counter to the internal iterator of type `Iterator` and defines equality of two instances in terms of this counter
Dispatch_or_drop_output_iterator | The class `Dispatch_or_drop_output_iterator` defines an `OutputIterator` that contains a tuple of output iterators, and dispatches among those based on the type of the value type which is put in it
Dispatch_output_iterator | The class `Dispatch_output_iterator` defines an `OutputIterator` that contains a tuple of output iterators, and dispatches among those based on the type of the value type which is put in it
Emptyset_iterator | The class `Emptyset_iterator` defines an `OutputIterator` that ignores everything written to it
Filter_iterator | The iterator adaptor `Filter_iterator` acts as a filter on a given range
Insert_iterator | The output iterator `Insert_iterator` is similar to `std::insert_iterator`, but differs in that it calls the `insert()` function of the container without the iterator additional argument
Inverse_index | The class `Inverse_index` constructs an inverse index for a given range `[i,j)` of two iterators or circulators of type `IC`
Join_input_iterator_1 | The class `Join_input_iterator_1` joins an iterator and a creator function object
Join_input_iterator_2 | The class `Join_input_iterator_2` joins two iterators
Join_input_iterator_3 | The class `Join_input_iterator_3` joins two iterators
N_step_adaptor | The adaptor `N_step_adaptor` changes the step width of the iterator or circulator class `I` to `N`
Oneset_iterator | The class `Oneset_iterator` defines an `BidirectionalIterator` that always refers to one specific object of type `T`
Random_access_adaptor | The class `Random_access_adaptor` provides a random access for data structures
Random_access_value_adaptor | The class `Random_access_value_adaptor` provides a random access for data structures
Iterator_range | `CGAL::Iterator_range` encapsulates two iterators so they fulfill the `ForwardRange` concept
Location_policy | `Location_policy` is a policy class which can be used to specify a trade-off between memory usage and time complexity for the point location strategy used in a data-structure
Multiset |
Object | Some functions can return different types of objects
Sixtuple | The `Sixtuple` class stores a homogeneous (same type) sixtuple of objects of type `T`
Spatial_lock_grid_3 | The class `Spatial_lock_grid_3` allows to lock points with coordinates (x, y, z) in a 3D grid
Boolean_tag | Depending on `bool value` the class `Boolean_tag` indicates that something is `true` or `false` respectively
Null_functor | Class indicating the absence of a functor
Sequential_tag | Tag used to enable/disable concurrency
Parallel_tag | Tag used to enable/disable concurrency
Null_tag | General tag indicating that non of any other possible tags is valid
Threetuple |
Twotuple | The `Twotuple` class stores a homogeneous (same type) pair of objects of type `T`
Uncertain | An object of the class `Uncertain` represents an uncertainty on the value of type `T`
Quadruple | The Quadruple class is an extension of `std::pair`
Triple | The Triple class is an extension of `std::pair`
Descriptor | The concept `Descriptor` allows to describe a unique object in an abstract model
Hashable | A type `Key` is a model of the concept `Hashable` if the specializations `boost::hash<Key>` and `std::hash<Key>` exist
Index | The concept `Index` is a refinement of `Descriptor` which must be convertible from and to `std::size_t`, and must be incrementable and decrementable
ObjectWithEraseCounter | The concept `ObjectWithEraseCounter` describes the functionalities an object must provide so that its erase counter is updated by a `CGAL::Compact_container` or a `CGAL::Concurrent_compact_container`
ProjectionObject |
SurjectiveLockDataStructure | The concept `SurjectiveLockDataStructure` describes functionalities of a data structure whose goal is to lock objects in a multi-threaded environment. Such data structures are intended to be used by concurrent algorithms