Navigation: Up   Table of Contents   Package Overview   Bibliography   Index   Title   Acknowledging CGAL

CGAL::Kinetic::Sort<Traits, Visitor>

Definition

The class Kinetic::Sort<Traits, Visitor> maintains a sorted list of objects. It is the simplest kinetic data structure provided and is a good place to start when looking at the basics of implementing a kinetic data structure.

The Kinetic::SortVisitor can be used to monitor what is happening.

#include <CGAL/Kinetic/Sort.h>

Creation

Kinetic::Sort<Traits, Visitor> s ( Traits tr);
The basic constructor.

Types

Kinetic::Sort<Traits, Visitor>::Visitor
The type of the visitor.


Kinetic::Sort<Traits, Visitor>::Traits
The traits type.


Kinetic::Sort<Traits, Visitor>::Vertex_handle
The handle used to refer to vertex in the sorted list. Derefernecing this returns a Key into the ActiveObjectsTable.


Kinetic::Sort<Traits, Visitor>::Handle
A reference counted pointer to be used for storing references to the object.


Kinetic::Sort<Traits, Visitor>::Const_handle
A reference counted pointer to be used for storing references to the object.

Operations

Visitor& s.visitor () Access the visitor.

Traits& s.traits () Access the traits.

Vertex_handle s.insert ( Point_key k) Insert the point.

void s.erase ( Vertex_handle k) Erase the point.

Iterator s.begin () Begin iterating through the ordered Vertex_handles (the iterator is convertible to Vertex_handle.

Iterator s.end () End iterating through the ordered Vertex_handles (the iterator is convertible to Vertex_handle.

See Also

Kinetic::Ref_counted<T>

Next: Kinetic::Sort_visitor_base
Navigation: Up   Table of Contents   Package Overview   Bibliography   Index   Title   Acknowledging CGAL
CGAL Open Source Project. Release 3.7. 14 October 2010.