|
#include <CGAL/Tree_traits.h>
|
| |
|
the container Data -
the data type. It may consist of
several data slots. Two of these data slots have to be of
type Key.
| |
|
| |
|
the container
Window - the query window type. It may consist of
several data slots. Two of these data slots have to be of
type Key.
| |
|
| |
|
the type
Key of the data
slot this traits class provides access to.
| |
|
| |
|
Data_left_func is a
function object providing an
operator() that takes an argument of type Data
and returns
a (the left) component of type Key.
| |
|
| |
|
Data_right_func is a
function object providing an
operator() that takes an argument of type Data
and returns
a (the right) component of type Key.
| |
|
| |
|
Window_left_func is a function objects that
allow to access the
left data slot of container
Window which has type Key
| |
|
| |
|
Window_right_func is a function objects that
allow to access the
right data slot of container
Window which has type Key
| |
|
| |
|
defines a comparison relation which must
define a strict ordering of the objects of type
Key. If defined, less<Key>
is sufficient.
| |
tree_interval_traits<Data, Window, Key, Data_left_func, Data_right_func, Window_left_func, Window_right_func, Compare> d();
Generation of a tree_point_traits instance. It is a template class
that provides an interface to data items.
|
|
| The data slot of the data item of d of type Key is accessed by function object Data_left_func. |
|
|
| The data slot of the data item of d of type Key is accessed by function object Data_right_func. |
|
|
| The data slot of the data item of w of type Key is accessed by function object Window_left_func. |
|
|
| The data slot of the data item of w of type Key is accessed by function object Window_right_func. |
|
|
| returns Compare(key1, key2). |