\( \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.7 - STL Extensions for CGAL
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
STL Extensions for CGAL Reference

Michael Hoffmann, Lutz Kettner, Sylvain Pion, and Ron Wein
CGAL is designed in the spirit of the generic programming paradigm to work together with the Standard Template Library (STL). This package provides non-geometric STL-like algorithms and datastructures that are not in the STL standard, as well as functions to change the failure behaviour of assertions.

Introduced in: CGAL 1.0
BibTeX: cgal:hkpw-se-15b
License: LGPL

Classified Reference Pages

Doubly-Connected List Managing Items in Place

Compact Container

Multiset with Extended Functionality

Generic Algorithms

Iterators and Iterator/Circulator Adaptors


Projection Function Objects

Creator Function Objects



 Generic Algorithms
 Compact Container
 Projection Function Objects
 Creator Function Objects
 Doubly-Connected List Managing Items in Place
 Iterators and Iterator/Circulator Adaptors
 Assertions and Failure Behaviour


class  CGAL::cpp11::array< T, int >
 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. More...
class  CGAL::CC_safe_handle< CC_iterator >
 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  CGAL::Concurrent_compact_container_traits< T >
 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  CGAL::Default
 Default is a tag class. More...
class  CGAL::Iterator_range< I >
 CGAL::Iterator_range encapsulates two iterators so they fulfill the ForwardRange concept. More...
class  CGAL::Multiset< Type, Compare, Allocator >
class  CGAL::Object
 Some functions can return different types of objects. More...
struct  CGAL::cpp11::result_of< F >
 Alias to the tr1 implementation from boost of the result_of mechanism. More...
class  CGAL::Spatial_lock_grid_3< Grid_lock_tag >
 The class Spatial_lock_grid_3 allows to lock points with coordinates (x, y, z) in a 3D grid. More...
class  CGAL::cpp11::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. More...


#define CGAL_ALLOCATOR(T)   std::allocator< T >
 A define for the allocator used by CGAL. More...

Macro Definition Documentation

#define CGAL_ALLOCATOR (   T)    std::allocator< T >

A define for the allocator used by CGAL.

This is only defined if there is no user defined version before memory.h is included the first time.

#include <CGAL/memory.h>