G3D::KDTree< T, BoundsFunc, HashFunc, EqualsFunc >::Iterator Class Reference

#include <KDTree.h>

Public Member Functions
bool	operator!= (const Iterator &other) const
bool	operator== (const Iterator &other) const
Iterator &	operator++ ()
const T &	operator* () const
T *	operator-> () const
	operator T * () const

Private Member Functions
	Iterator (const typename Table< Member, Node * >::Iterator &it)
Iterator	operator++ (int)

Private Attributes
Table< Member, Node * >::Iterator	it

Friends
class	TreeType

Detailed Description

template<class T, class BoundsFunc = BoundsTrait<T>, class HashFunc = HashTrait<T>, class EqualsFunc = EqualsTrait<T>>
class G3D::KDTree< T, BoundsFunc, HashFunc, EqualsFunc >::Iterator

C++ STL style iterator variable. See begin(). Overloads the -> (dereference) operator, so this acts like a pointer to the current member.

Constructor & Destructor Documentation

template<class T , class BoundsFunc = BoundsTrait<T>, class HashFunc = HashTrait<T>, class EqualsFunc = EqualsTrait<T>>

G3D::KDTree< T, BoundsFunc, HashFunc, EqualsFunc >::Iterator::Iterator ( const typename Table< Member, Node * >::Iterator &  it )

inlineprivate

: it(it) {}

Member Function Documentation

template<class T , class BoundsFunc = BoundsTrait<T>, class HashFunc = HashTrait<T>, class EqualsFunc = EqualsTrait<T>>

G3D::KDTree< T, BoundsFunc, HashFunc, EqualsFunc >::Iterator::operator T * ( ) const

inline

 {
 return &(it->key.handle->value);
 }

template<class T , class BoundsFunc = BoundsTrait<T>, class HashFunc = HashTrait<T>, class EqualsFunc = EqualsTrait<T>>

bool G3D::KDTree< T, BoundsFunc, HashFunc, EqualsFunc >::Iterator::operator!= ( const Iterator &  other ) const

inline

 {
 return !(*this == other);
 }

template<class T , class BoundsFunc = BoundsTrait<T>, class HashFunc = HashTrait<T>, class EqualsFunc = EqualsTrait<T>>

const T& G3D::KDTree< T, BoundsFunc, HashFunc, EqualsFunc >::Iterator::operator* ( ) const

inline

 {
 return it->key.handle->value;
 }

template<class T , class BoundsFunc = BoundsTrait<T>, class HashFunc = HashTrait<T>, class EqualsFunc = EqualsTrait<T>>

Iterator& G3D::KDTree< T, BoundsFunc, HashFunc, EqualsFunc >::Iterator::operator++ ( )

inline

Pre increment.

 {
 ++it;
 return *this;
 }

template<class T , class BoundsFunc = BoundsTrait<T>, class HashFunc = HashTrait<T>, class EqualsFunc = EqualsTrait<T>>

Iterator G3D::KDTree< T, BoundsFunc, HashFunc, EqualsFunc >::Iterator::operator++ ( int  )

private

Post increment (slower than preincrement). Intentionally unimplemented to prevent slow code.

template<class T , class BoundsFunc = BoundsTrait<T>, class HashFunc = HashTrait<T>, class EqualsFunc = EqualsTrait<T>>

T* G3D::KDTree< T, BoundsFunc, HashFunc, EqualsFunc >::Iterator::operator-> ( ) const

inline

 {
 return &(it->key.handle->value);
 }

template<class T , class BoundsFunc = BoundsTrait<T>, class HashFunc = HashTrait<T>, class EqualsFunc = EqualsTrait<T>>

bool G3D::KDTree< T, BoundsFunc, HashFunc, EqualsFunc >::Iterator::operator== ( const Iterator &  other ) const

inline

 {
 return it == other.it;
 }

Friends And Related Function Documentation

template<class T , class BoundsFunc = BoundsTrait<T>, class HashFunc = HashTrait<T>, class EqualsFunc = EqualsTrait<T>>

friend class TreeType

friend

Member Data Documentation

template<class T , class BoundsFunc = BoundsTrait<T>, class HashFunc = HashTrait<T>, class EqualsFunc = EqualsTrait<T>>

Table<Member, Node*>::Iterator G3D::KDTree< T, BoundsFunc, HashFunc, EqualsFunc >::Iterator::it

private

---

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

• dep/g3dlite/include/G3D/KDTree.h