cvr::kdTree< T, D, U >::kdTree::element Class Reference

At the leave nodes, a list of elements of this type will contain the points and their corresponding data. More...

#include <cvrKdTree.h>

Inheritance diagram for cvr::kdTree< T, D, U >::kdTree::element:

[legend]

Collaboration diagram for cvr::kdTree< T, D, U >::kdTree::element:

[legend]

List of all members.

Public Member Functions
	element ()
	element (const T &pos, const D &dat)
	element (const element &other)
	~element ()
kdTree< T, D, U >::value_type &	operator[] (const int a)
const kdTree< T, D, U > ::value_type &	operator[] (const int a) const
int	size () const
const std::string &	name () const
kdTree< T, D, U >::element &	copy (const element &other)
kdTree< T, D, U >::element &	operator= (const element &other)
kdTree< T, D, U >::element *	clone () const
kdTree< T, D, U >::element *	newInstance () const
virtual bool	read (ioHandler &handler, const bool complete=true)
virtual bool	write (ioHandler &handler, const bool complete=true) const
Public Attributes
T	point
D	data

---

Detailed Description

template<typename T, typename D = int, class U = euclideanSqrDistantor<T>>
class cvr::kdTree< T, D, U >::element

At the leave nodes, a list of elements of this type will contain the points and their corresponding data.

Implementation must be here due to MS VC++ bug

---

Constructor & Destructor Documentation

template<typename T, typename D = int, class U = euclideanSqrDistantor<T>>

cvr::kdTree< T, D, U >::kdTree::element::element

(

)

Constructor.

template<typename T, typename D = int, class U = euclideanSqrDistantor<T>>

cvr::kdTree< T, D, U >::kdTree::element::element	(	const T &	pos,
		const D &	dat
	)

Constructor.

Parameters:

	pos	n-dimensional vector position of this element
	dat	data contained in this element

template<typename T, typename D = int, class U = euclideanSqrDistantor<T>>

cvr::kdTree< T, D, U >::kdTree::element::element

(

const element &

other

)

Copy constructor.

template<typename T, typename D = int, class U = euclideanSqrDistantor<T>>

cvr::kdTree< T, D, U >::kdTree::element::~element

(

)

destructor

---

Member Function Documentation

template<typename T, typename D = int, class U = euclideanSqrDistantor<T>>

kdTree<T,D,U>::element* cvr::kdTree< T, D, U >::kdTree::element::clone

(

)

const [virtual]

clone function

Implements cvr::ioObject.

template<typename T, typename D = int, class U = euclideanSqrDistantor<T>>

kdTree<T,D,U>::element& cvr::kdTree< T, D, U >::kdTree::element::copy

(

const element &

other

)

[inline]

copy method

template<typename T, typename D = int, class U = euclideanSqrDistantor<T>>

const std::string& cvr::kdTree< T, D, U >::kdTree::element::name

(

)

const [virtual]

Returns the name of this class.

Implements cvr::ioObject.

template<typename T, typename D = int, class U = euclideanSqrDistantor<T>>

kdTree<T,D,U>::element* cvr::kdTree< T, D, U >::kdTree::element::newInstance

(

)

const [virtual]

newInstance function

Implements cvr::ioObject.

template<typename T, typename D = int, class U = euclideanSqrDistantor<T>>

kdTree<T,D,U>::element& cvr::kdTree< T, D, U >::kdTree::element::operator=

(

const element &

other

)

[inline]

copy operator

template<typename T, typename D = int, class U = euclideanSqrDistantor<T>>

const kdTree<T,D,U>::value_type& cvr::kdTree< T, D, U >::kdTree::element::operator[]

(

const int

a

)

const [inline]

shortcut to access the point value at each dimension

template<typename T, typename D = int, class U = euclideanSqrDistantor<T>>

kdTree<T,D,U>::value_type& cvr::kdTree< T, D, U >::kdTree::element::operator[]

(

const int

a

)

[inline]

shortcut to access the point value at each dimension

template<typename T, typename D = int, class U = euclideanSqrDistantor<T>>

virtual bool cvr::kdTree< T, D, U >::kdTree::element::read	(	ioHandler &	handler,
		const bool	complete = true
	)			[virtual]

read the element from the given ioHandler

Parameters:

	handler	the ioHandler to be used
	complete	if true (the default) the enclosing begin/end will be also read, otherwise only the data block will be read.

Returns:

true if write was successful

Reimplemented from cvr::ioObject.

template<typename T, typename D = int, class U = euclideanSqrDistantor<T>>

int cvr::kdTree< T, D, U >::kdTree::element::size

(

)

const [inline]

shortcut to acces the size of the points stored

template<typename T, typename D = int, class U = euclideanSqrDistantor<T>>

virtual bool cvr::kdTree< T, D, U >::kdTree::element::write	(	ioHandler &	handler,
		const bool	complete = true
	)			const [virtual]

write the parameters in the given ioHandler

Parameters:

	handler	the ioHandler to be used
	complete	if true (the default) the enclosing begin/end will be also written, otherwise only the data block will be written.

Returns:

true if write was successful

Reimplemented from cvr::ioObject.

---

Member Data Documentation

template<typename T, typename D = int, class U = euclideanSqrDistantor<T>>

D cvr::kdTree< T, D, U >::kdTree::element::data

data contained in this element.

template<typename T, typename D = int, class U = euclideanSqrDistantor<T>>

T cvr::kdTree< T, D, U >::kdTree::element::point

n-dimensional point representint the position of this element in the n-dimensional space

---

The documentation for this class was generated from the following file:

• cvrKdTree.h