| 
    CGAL 4.7 - Halfedge Data Structures 
   | 
 
#include <CGAL/HalfedgeDS_default.h>
The class HalfedgeDS_default is a model for the HalfedgeDS concept. 
The second template parameter HalfedgeDSItems has a default argument CGAL::HalfedgeDS_items_2. The third template parameter Alloc uses the CGAL default allocator as default setting. HalfedgeDS_default is a list-based representation with bidirectional iterators that supports removal.
HalfedgeDS<Traits,Items,Alloc> CGAL::HalfedgeDS_list CGAL::HalfedgeDS_vector HalfedgeDSItems CGAL::HalfedgeDS_items_2 CGAL::Polyhedron_3<Traits> CGAL::HalfedgeDS_items_decorator<HDS> CGAL::HalfedgeDS_decorator<HDS> CGAL::HalfedgeDS_const_decorator<HDS>Implementation
Currently, HalfedgeDS_default is derived from CGAL::HalfedgeDS_list<Traits>. The copy constructor and the assignment operator need \( O(n)\) time with \( n\) the total number of vertices, halfedges, and faces. 
Types | |
| typedef bidirectional_iterator_tag | iterator_category | 
| typedef CGAL::Tag_true | Supports_removal | 
| typedef bidirectional_iterator_tag CGAL::HalfedgeDS_default< Traits, HalfedgeDSItems, Alloc >::iterator_category | 
| typedef CGAL::Tag_true CGAL::HalfedgeDS_default< Traits, HalfedgeDSItems, Alloc >::Supports_removal |