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

plusplus.png
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-20a
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

Ranges

Projection Function Objects

Creator Function Objects

Utilities

Modules

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

Classes

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...
 
struct  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...
 
struct  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...
 
struct  CGAL::value_type_traits< T >
 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. More...
 

Macros

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

Functions

template<class T >
std::array< T, N > CGAL::make_array (const T &...)
 

Macro Definition Documentation

◆ CGAL_ALLOCATOR

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

#include <CGAL/memory.h>

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.

Function Documentation

◆ make_array()

template<class T >
std::array<T, N> CGAL::make_array ( const T &  ...)

#include <CGAL/array.h>

Returns
std::array<T, N> where N is the number of arguments given to the function. The position of each argument in the array is the same as its position in the argument list.

The maximal number of arguments is 6.