CGAL 6.1.1 - STL Extensions for CGAL

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

▼N CGAL |
▼N cpp11 |
C result_of | Alias to the implementation of the `std::result_of` mechanism
▼N cpp98 |
C binary_function | Replacement for `std::binary_function` that is deprecated since C++11, and removed from C++17
C unary_function | Replacement for `std::unary_function` that is deprecated since C++11, and removed from C++17
C Boolean_tag | Depending on `bool value` the class `Boolean_tag` indicates that something is `true` or `false` respectively
C Cast_function_object | The class `Cast_function_object` applies a C-style type cast to its argument
C 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
C Compact | `Compact` is a tag class
C Compact_container | An object of the class `Compact_container` is a container of objects of type `T`
C 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>`
C 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>`
C 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`
C 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
C 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>`
C Const_oneset_iterator | The class `Const_oneset_iterator` defines a `RandomAccessIterator` that always refers to a copy of a specific object of type `T`
C Construct_array | Functor that constructs `std::array<T, N>` where `N` is the number of arguments given to the function
C 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
C Creator_1 | The class `Creator_1` defines types and operations for creating objects from one argument
C Creator_2 | The class `Creator_2` defines types and operations for creating objects from two arguments
C Creator_3 | The class `Creator_3` defines types and operations for creating objects from three arguments
C Creator_4 | The class `Creator_4` defines types and operations for creating objects from four arguments
C Creator_5 | The class `Creator_5` defines types and operations for creating objects from five arguments
C Creator_uniform_2 | The class `Creator_uniform_2` defines types and operations for creating objects from two arguments of the same type
C Creator_uniform_3 | The class `Creator_uniform_3` defines types and operations for creating objects from three arguments of the same type
C Creator_uniform_4 | The class `Creator_uniform_4` defines types and operations for creating objects from four arguments of the same type
C Creator_uniform_5 | The class `Creator_uniform_5` defines types and operations for creating objects from five arguments of the same type
C Creator_uniform_6 | The class `Creator_uniform_6` defines types and operations for creating objects from six arguments of the same type
C Creator_uniform_7 | The class `Creator_uniform_7` defines types and operations for creating objects from seven arguments of the same type
C Creator_uniform_8 | The class `Creator_uniform_8` defines types and operations for creating objects from eight arguments of the same type
C Creator_uniform_9 | The class `Creator_uniform_9` defines types and operations for creating objects from nine arguments of the same type
C Creator_uniform_d | The class `Creator_uniform_d` defines types and operations for creating objects from two arguments of the same type
▼C Default | `Default` is a tag class
C Get | A nested template providing a typedef `type` which equals `Type` if `Parameter` is `Default`, and `Parameter` otherwise
C Lazy_get | A nested template providing a typedef `type` which equals `MetaFct::type` if `Parameter` is `Default`, and `Parameter` otherwise
C Dereference | The class `Dereference` dereferences a pointer (`operator*`)
C 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
C 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
C Emptyset_iterator | The class `Emptyset_iterator` defines an `OutputIterator` that ignores everything written to it
C Fast | `Fast` is a tag class
C Filter_iterator | The iterator adaptor `Filter_iterator` acts as a filter on a given range
C Fourtuple | The `Fourtuple` class stores a homogeneous (same type) fourtuple of objects of type `T`
C Get_address | The class `Get_address` gets the address of an lvalue (`operator&`)
C Identity | The class `Identity` represents the identity function on `Value`
C 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
C In_place_list_base | The node base classes provides pointers to build linked lists
C 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
C Inverse_index | The class `Inverse_index` constructs an inverse index for a given range `[i,j)` of two iterators or circulators of type `IC`
C Iterator_range | `CGAL::Iterator_range` encapsulates two iterators so they fulfill the `ForwardRange` concept
C Join_input_iterator_1 | The class `Join_input_iterator_1` joins an iterator and a creator function object
C Join_input_iterator_2 | The class `Join_input_iterator_2` joins two iterators
C Join_input_iterator_3 | The class `Join_input_iterator_3` joins three iterators
C 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
C Manifold_tag | The class `Manifold_tag` is a tag class used to monitor the surface meshing algorithm
C Manifold_with_boundary_tag | The class `Manifold_with_boundary_tag` is a tag class used to monitor the surface meshing algorithm
C Multiset |
C N_step_adaptor | The adaptor `N_step_adaptor` changes the step width of the iterator or circulator class `I` to `N`
C Non_manifold_tag | The class `Non_manifold_tag` is a tag class used to monitor the surface meshing algorithm
C Null_functor | Class indicating the absence of a functor
C Null_tag | General tag indicating that non of any other possible tags is valid
C Object | Some functions can return different types of objects
C Oneset_iterator | The class `Oneset_iterator` defines an `BidirectionalIterator` that always refers to one specific object of type `T`
C Parallel_if_available_tag | This tag is a convenience typedef to `Parallel_tag` if the third party library Intel TBB has been found and linked, and to `Sequential_tag` otherwise
C Parallel_tag | Tag used to enable concurrency
C Project_facet | The class `Project_facet` calls the member function `facet()` on an instance of type `Node`
C Project_next | The class `Project_next` calls the member function `next()` on an instance of type `Node`
C Project_next_opposite | The class `Project_next_opposite` calls the member functions `next()->opposite()` on an instance of type `Node`
C Project_normal | The class `Project_normal` calls the member function `normal()` on an instance of type `Node`
C Project_opposite_prev | The class `Project_opposite_prev` calls the member functions `opposite()->prev()` on an instance of type `Node`
C Project_plane | The class `Project_plane` calls the member function `plane()` on an instance of type `Node`
C Project_point | The class `Project_point` calls the member function `point()` on an instance of type `Node`
C Project_prev | The class `Project_prev` calls the member function `prev()` on an instance of type `Node`
C Project_vertex | The class `Project_vertex` calls the member function `vertex()` on an instance of type `Node`
C Quadruple | The Quadruple class is an extension of `std::pair`
C Random_access_adaptor | The class `Random_access_adaptor` provides a random access for data structures
C Random_access_value_adaptor | The class `Random_access_value_adaptor` provides a random access for data structures
C Sequential_tag | Tag used to disable concurrency
C Sixtuple | The `Sixtuple` class stores a homogeneous (same type) sixtuple of objects of type `T`
C Spatial_lock_grid_3 | The class `Spatial_lock_grid_3` allows to lock points with coordinates (x, y, z) in a 3D grid
C Threetuple |
▼C Triangulation_simplex_base_with_time_stamp | A base class with a time stamp
C Rebind_TDS |
C Triple | The Triple class is an extension of `std::pair`
C Twotuple | The `Twotuple` class stores a homogeneous (same type) pair of objects of type `T`
C Uncertain | An object of the class `Uncertain` represents an uncertainty on the value of type `T`
C value_type_traits | Class providing the value type of an iterator, and in the case of an output iterator, a type of objects that can be put in it
C value_type_traits< std::back_insert_iterator< Container > > |
C value_type_traits< std::front_insert_iterator< Container > > |
C value_type_traits< std::insert_iterator< Container > > |
C BaseWithTimeStamp | The concept `BaseWithTimeStamp` describes the functionalities an object must provide so that its timestamp is updated by a `CGAL::Compact_container` or a `CGAL::Concurrent_compact_container`
C Descriptor | The concept `Descriptor` allows to describe a unique object in an abstract model
C Hashable | A type `Key` is a model of the concept `Hashable` if the specializations `boost::hash<Key>` and `std::hash<Key>` exist
C 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
C 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`
C ProjectionObject |
C 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