Navigation: Up, Table of Contents, Bibliography, Index, Title Page

## CGAL::Search_traits<NT,Point,CartesianIterator,ConstructCartesianIterator,ConstructMinVertex,ConstructMaxVertex>

### Definition

The class Search_traits<NT,Point,CartesianIterator,ConstructCartesianIterator,ConstructMinVertex,ConstructMaxVertex> can be used as a template parameter of the kd tree and the search classes. It is a mere wrapper for the geometric types needed by these classes.

#include <CGAL/Search_traits.h>

### Is Model for the Concept

SearchTraits.

### Types

NT | FT; | The number type of the coordinates.
Point | Point_d; | Point type.
CartesianIterator | Cartesian_const_iterator_d;
|  | An iterator over the coordinates.
ConstructCartesianIterator
| Construct_Cartesian_const_iterator_d;
|  | A functor with two function operators, which return the begin and past the end iterator for the Cartesian coordinates. The functor for begin has as argument a Point_d. The functor for the past the end iterator, has as argument a Point_d and an int.
ConstructMinVertex | Construct_min_vertex_d;
|  | Functor with operator to construct the vertex with lexicographically smallest coordinates of an object of type Iso_box_d.
Kernel::ConstructMaxVertex
| Construct_max_vertex_d;
|  | Functor with operator to construct the vertex with lexicographically largest coordinates of an object of type Iso_box_d.

### See Also

Search_traits_2<Kernel>
Search_traits_3<Kernel>
Search_traits_d<Kernel>

Next: Sliding_fair<Traits, SpatialSeparator>

Navigation: Table of Contents, Bibliography, Index, Title Page

The CGAL Project . Tue, December 21, 2004 .