CGAL::Kinetic::Sort< Traits, Visitor > Class Template Reference

#include <CGAL/Kinetic/Sort.h>

Definition

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.

See also

Kinetic::Ref_counted<T>

Examples:

Kinetic_data_structures/Kinetic_sort.cpp.

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_handles (the iterator is convertible to Vertex_handle. More...
Iterator	end ()
	End iterating through the ordered Vertex_handles (the iterator is convertible to Vertex_handle. More...

Member Typedef Documentation

template<typename Traits , typename Visitor >

typedef unspecified_type CGAL::Kinetic::Sort< Traits, Visitor >::Const_handle

A reference counted pointer to be used for storing references to the object.

template<typename Traits , typename Visitor >

typedef unspecified_type CGAL::Kinetic::Sort< Traits, Visitor >::Handle

A reference counted pointer to be used for storing references to the object.

template<typename Traits , typename Visitor >

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.

template<typename Traits , typename Visitor >

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

The type of the visitor.

Constructor & Destructor Documentation

template<typename Traits , typename Visitor >

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

(

Traits

tr

)

The basic constructor.

Member Function Documentation

template<typename Traits , typename Visitor >

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

(

)

Begin iterating through the ordered Vertex_handles (the iterator is convertible to Vertex_handle.

template<typename Traits , typename Visitor >

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

(

)

End iterating through the ordered Vertex_handles (the iterator is convertible to Vertex_handle.

template<typename Traits , typename Visitor >

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

(

Vertex_handle

k

)

Erase the point.

template<typename Traits , typename Visitor >

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

(

Point_key

k

)

Insert the point.

template<typename Traits , typename Visitor >

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.

template<typename Traits , typename Visitor >

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

(

)

Access the traits.

template<typename Traits , typename Visitor >

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

(

)

Access the visitor.