CGAL 4.7 - Kinetic Data Structures
|
#include <CGAL/Kinetic/Sort.h>
The class Kinetic::Sort
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.
Kinetic::Ref_counted<T>
Creation | |
Sort (Traits tr) | |
The basic constructor. More... | |
Types | |
typedef unspecified_type | Visitor |
The type of the visitor. More... | |
typedef unspecified_type | Vertex_handle |
The handle used to refer to vertex in the sorted list. More... | |
typedef unspecified_type | Handle |
A reference counted pointer to be used for storing references to the object. More... | |
typedef unspecified_type | Const_handle |
A reference counted pointer to be used for storing references to the object. More... | |
Operations | |
Visitor & | visitor () |
Access the visitor. More... | |
Traits & | traits () |
Access the traits. More... | |
Vertex_handle | insert (Point_key k) |
Insert the point. More... | |
void | erase (Vertex_handle k) |
Erase the point. More... | |
void | swap (Vertex_handle vh, typename Traits::Kinetic_kernel::Compare_x_1::result_type &s) |
Swap the pair of objects with vh as the first element. More... | |
Iterator | begin () |
Begin iterating through the ordered Vertex_handle s (the iterator is convertible to Vertex_handle . More... | |
Iterator | end () |
End iterating through the ordered Vertex_handle s (the iterator is convertible to Vertex_handle . More... | |
typedef unspecified_type CGAL::Kinetic::Sort< Traits, Visitor >::Const_handle |
A reference counted pointer to be used for storing references to the object.
typedef unspecified_type CGAL::Kinetic::Sort< Traits, Visitor >::Handle |
A reference counted pointer to be used for storing references to the object.
typedef unspecified_type CGAL::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
.
typedef unspecified_type CGAL::Kinetic::Sort< Traits, Visitor >::Visitor |
The type of the visitor.
CGAL::Kinetic::Sort< Traits, Visitor >::Sort | ( | Traits | tr | ) |
The basic constructor.
Iterator CGAL::Kinetic::Sort< Traits, Visitor >::begin | ( | ) |
Begin iterating through the ordered Vertex_handle
s (the iterator is convertible to Vertex_handle
.
Iterator CGAL::Kinetic::Sort< Traits, Visitor >::end | ( | ) |
End iterating through the ordered Vertex_handle
s (the iterator is convertible to Vertex_handle
.
void CGAL::Kinetic::Sort< Traits, Visitor >::erase | ( | Vertex_handle | k | ) |
Erase the point.
Vertex_handle CGAL::Kinetic::Sort< Traits, Visitor >::insert | ( | Point_key | k | ) |
Insert the point.
void CGAL::Kinetic::Sort< Traits, Visitor >::swap | ( | Vertex_handle | vh, |
typename Traits::Kinetic_kernel::Compare_x_1::result_type & | s | ||
) |
Swap the pair of objects with vh
as the first element.
The old solver s
is used to compute the next root between the two points being swapped. This method is called by an Event object.
Traits& CGAL::Kinetic::Sort< Traits, Visitor >::traits | ( | ) |
Access the traits.
Visitor& CGAL::Kinetic::Sort< Traits, Visitor >::visitor | ( | ) |
Access the visitor.