CGAL 4.6.1 - STL Extensions for CGAL
|
Namespaces | |
cpp11 | |
Classes | |
class | 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. More... | |
class | 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> . More... | |
class | Compact_container |
An object of the class Compact_container is a container of objects of type T . More... | |
class | 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> . More... | |
class | Compact |
Compact is a tag class. More... | |
class | Fast |
Fast is a tag class. More... | |
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> . More... | |
class | 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. More... | |
class | Default |
Default is a tag class. More... | |
class | Fourtuple |
The Fourtuple class stores a homogeneous (same type) fourtuple of objects of type T . More... | |
class | Cast_function_object |
The class Cast_function_object applies a C-style type cast to its argument. More... | |
class | 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 . More... | |
class | Creator_1 |
The class Creator_1 defines types and operations for creating objects from one argument. More... | |
class | Creator_2 |
The class Creator_2 defines types and operations for creating objects from two arguments. More... | |
class | Creator_3 |
The class Creator_3 defines types and operations for creating objects from three arguments. More... | |
class | Creator_4 |
The class Creator_4 defines types and operations for creating objects from four arguments. More... | |
class | Creator_5 |
The class Creator_5 defines types and operations for creating objects from five arguments. More... | |
class | Creator_uniform_2 |
The class Creator_uniform_2 defines types and operations for creating objects from two arguments of the same type. More... | |
class | Creator_uniform_3 |
The class Creator_uniform_3 defines types and operations for creating objects from three arguments of the same type. More... | |
class | Creator_uniform_4 |
The class Creator_uniform_4 defines types and operations for creating objects from four arguments of the same type. More... | |
class | Creator_uniform_5 |
The class Creator_uniform_5 defines types and operations for creating objects from five arguments of the same type. More... | |
class | Creator_uniform_6 |
The class Creator_uniform_6 defines types and operations for creating objects from six arguments of the same type. More... | |
class | Creator_uniform_7 |
The class Creator_uniform_7 defines types and operations for creating objects from seven arguments of the same type. More... | |
class | Creator_uniform_8 |
The class Creator_uniform_8 defines types and operations for creating objects from eight arguments of the same type. More... | |
class | Creator_uniform_9 |
The class Creator_uniform_9 defines types and operations for creating objects from nine arguments of the same type. More... | |
class | Creator_uniform_d |
The class Creator_uniform_d defines types and operations for creating objects from two arguments of the same type. More... | |
class | Dereference |
The class Dereference dereferences a pointer (operator* ). More... | |
class | Get_address |
The class Get_address gets the address of an lvalue (operator& ). More... | |
class | Identity |
The class Identity represents the identity function on Value . More... | |
class | Project_facet |
The class Project_facet calls the member function facet() on an instance of type Node . More... | |
class | Project_next |
The class Project_next calls the member function next() on an instance of type Node . More... | |
class | Project_next_opposite |
The class Project_next_opposite calls the member functions next()->opposite() on an instance of type Node . More... | |
class | Project_normal |
The class Project_normal calls the member function normal() on an instance of type Node . More... | |
class | Project_opposite_prev |
The class Project_opposite_prev calls the member functions opposite()->prev() on an instance of type Node . More... | |
class | Project_plane |
The class Project_plane calls the member function plane() on an instance of type Node . More... | |
class | Project_point |
The class Project_point calls the member function point() on an instance of type Node . More... | |
class | Project_prev |
The class Project_prev calls the member function prev() on an instance of type Node . More... | |
class | Project_vertex |
The class Project_vertex calls the member function vertex() on an instance of type Node . More... | |
class | In_place_list_base |
The node base classes provides pointers to build linked lists. More... | |
class | 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. More... | |
class | Const_oneset_iterator |
The class Const_oneset_iterator defines a RandomAccessIterator that always refers to a copy of a specific object of type T . More... | |
class | 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. More... | |
class | 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. More... | |
class | 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. More... | |
class | Emptyset_iterator |
The class Emptyset_iterator defines an OutputIterator that ignores everything written to it. More... | |
class | Filter_iterator |
The iterator adaptor Filter_iterator acts as a filter on a given range. More... | |
class | 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. More... | |
class | Inverse_index |
The class Inverse_index constructs an inverse index for a given range [i,j) of two iterators or circulators of type IC . More... | |
class | Join_input_iterator_1 |
The class Join_input_iterator_1 joins an iterator and a creator function object. More... | |
class | Join_input_iterator_2 |
The class Join_input_iterator_2 joins two iterators. More... | |
class | Join_input_iterator_3 |
The class Join_input_iterator_3 joins two iterators. More... | |
class | N_step_adaptor |
The adaptor N_step_adaptor changes the step width of the iterator or circulator class I to N . More... | |
class | Oneset_iterator |
The class Oneset_iterator defines an BidirectionalIterator that always refers to one specific object of type T . More... | |
class | Random_access_adaptor |
The class Random_access_adaptor provides a random access for data structures. More... | |
class | Random_access_value_adaptor |
The class Random_access_value_adaptor provides a random access for data structures. More... | |
class | Iterator_range |
CGAL::Iterator_range encapsulates two iterators so they fulfill the ForwardRange concept. More... | |
class | 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. More... | |
class | Multiset |
class | Object |
Some functions can return different types of objects. More... | |
class | Sixtuple |
The Sixtuple class stores a homogeneous (same type) sixtuple of objects of type T . More... | |
class | Spatial_lock_grid_3 |
The class Spatial_lock_grid_3 allows to lock points with coordinates (x, y, z) in a 3D grid. More... | |
class | Boolean_tag |
Depending on bool value the class Boolean_tag indicates that something is true or false respectively. More... | |
struct | Null_functor |
Class indicating the absence of a functor. More... | |
struct | Sequential_tag |
Tag used to enable/disable concurrency. More... | |
struct | Parallel_tag |
Tag used to enable/disable concurrency. More... | |
class | Null_tag |
General tag indicating that non of any other possible tags is valid. More... | |
class | Threetuple |
class | Twotuple |
The Twotuple class stores a homogeneous (same type) pair of objects of type T . More... | |
class | Uncertain |
An object of the class Uncertain represents an uncertainty on the value of type T . More... | |
class | Quadruple |
The Quadruple class is an extension of std::pair . More... | |
class | Triple |
The Triple class is an extension of std::pair . More... | |
Typedefs | |
typedef Location_policy< Compact > | Compact_location |
A typedef to Location_policy<Compact> . More... | |
typedef Location_policy< Fast > | Fast_location |
A typedef to Location_policy<Fast> . More... | |
typedef CGAL::Boolean_tag< false > | Tag_false |
The typedef Tag_false is Boolean_tag<false> . More... | |
typedef CGAL::Boolean_tag< true > | Tag_true |
The typedef Tag_true is Boolean_tag<true> . More... | |
Functions | |
template<class InputIterator , class Size , class OutputIterator > | |
OutputIterator | copy_n (InputIterator first, Size n, OutputIterator result) |
template<class ForwardIterator > | |
std::pair< ForwardIterator, ForwardIterator > | min_max_element (ForwardIterator first, ForwardIterator last) |
Computes the minimal and the maximal element of a range. More... | |
template<class ForwardIterator , class CompareMin , class CompareMax > | |
std::pair< ForwardIterator, ForwardIterator > | min_max_element (ForwardIterator first, ForwardIterator last, CompareMin comp_min, CompareMax comp_max) |
Computes the minimal and the maximal element of a range. More... | |
template<class BidirectionalIterator > | |
BidirectionalIterator | predecessor (BidirectionalIterator it) |
template<class ForwardIterator > | |
ForwardIterator | successor (ForwardIterator it) |
template<typename CC_iterator > | |
CC_safe_handle< CC_iterator > | make_cc_safe_handle (CC_iterator iterator) |
The class make_cc_safe_handle function allows to build a CC_safe_handle from an iterator on a Compact_container (or Concurrent_compact_container ). More... | |
template<class F > | |
Compare_to_less< F > | compare_to_less (const F &f) |
Changes a functor returning a Comparison_result to one which returns a bool. More... | |
template<typename T > | |
Iterator_range< T > | make_range (const T &b, const T &e) |
template<typename T > | |
T | range_begin (Iterator_range< T > &x) |
template<typename T > | |
T | range_end (Iterator_range< T > &x) |
template<typename T > | |
T | range_begin (const Iterator_range< T > &x) |
template<typename T > | |
T | range_end (const Iterator_range< T > &x) |
enum | Failure_behaviour { ABORT, EXIT, EXIT_WITH_SUCCESS, CONTINUE, THROW_EXCEPTION } |
typedef void(* | Failure_function )(const char *type, const char *expression, const char *file, int line, const char *explanation) |
Failure_function | set_error_handler (Failure_function handler) |
Failure_function | set_warning_handler (Failure_function handler) |
Failure_behaviour | set_error_behaviour (Failure_behaviour eb) |
Failure_behaviour | set_warning_behaviour (Failure_behaviour eb) |