CGAL 6.1 - Halfedge Data Structures

Loading...
Searching...
No Matches
List of all members
CGAL::HalfedgeDS_vector< Traits, HalfedgeDSItems, Alloc > Class Template Reference
Reference Manual » Halfedge Data Structures

`#include <CGAL/HalfedgeDS_vector.h>`

## Definition

template<typename Traits, typename HalfedgeDSItems, typename Alloc>
class CGAL::HalfedgeDS_vector< Traits, HalfedgeDSItems, Alloc >

The class `HalfedgeDS_vector` is a model for the `HalfedgeDS` concept.

`HalfedgeDS_vector` is a vector-based representation with random access iterators that does not support removal.

Is model of
  `HalfedgeDS<Traits,Items,Alloc>`

See also
  `CGAL::HalfedgeDS_default`
  `CGAL::HalfedgeDS_list`
  `HalfedgeDSItems`
  `CGAL::Polyhedron_3<Traits>`
  `CGAL::HalfedgeDS_items_decorator<HDS>`
  `CGAL::HalfedgeDS_decorator<HDS>`
  `CGAL::HalfedgeDS_const_decorator<HDS>`

Implementation

`HalfedgeDS_vector` uses internally the STL `std::vector` container class. We require that we can create a `std::vector::iterator` from a pointer. If this will not be true any longer for any major STL distribution we might switch to an internal implementation of a vector.

The capacity is restricted to the reserved size. Allocations are not possible beyond the capacity without calling reserve again. All handles and iterators are invalidated upon a reserve call that increases the capacity.

`CGAL_ALLOCATOR(int)` is used as default argument for the `Alloc` template parameter.

Examples
  HalfedgeDS/hds_prog_compact.cpp, and HalfedgeDS/hds_prog_vector.cpp.

## Types
typedef random_access_iterator_tag | iterator_category
typedef CGAL::Tag_false | Supports_removal