vistle::PointVisitationFunctor< Scalar, Index > Class Template Reference

#include <core/cellalgorithm.h>

Inheritance diagram for vistle::PointVisitationFunctor< Scalar, Index >:

Collaboration diagram for vistle::PointVisitationFunctor< Scalar, Index >:

Public Member Functions
	PointVisitationFunctor (const Vector &point)
bool	checkBounds (const Scalar *min, const Scalar *max)
Order	operator() (const typename Celltree::Node &node)
Public Member Functions inherited from vistle::Celltree< Scalar, Index, NumDimensions >::VisitFunctor
bool	checkBounds (const Scalar *min, const Scalar *max)
	check whether the celltree is within bounds min and max, otherwise no traversal More...
Order	operator() (const Node &node)
	return whether and in which order to visit children of a node More...

Additional Inherited Members
Public Types inherited from vistle::Celltree< Scalar, Index, NumDimensions >::VisitFunctor
enum	Order {   None = 0 , RightFirst = 1 , RightSecond = 2 , Left = 4 ,   Right = RightFirst , LeftRight = Left | RightSecond , RightLeft = Left | RightFirst }

Constructor & Destructor Documentation

PointVisitationFunctor()

template<typename Scalar , typename Index >

vistle::PointVisitationFunctor< Scalar, Index >::PointVisitationFunctor ( const Vector &  point )

inline

Member Function Documentation

checkBounds()

template<typename Scalar , typename Index >

bool vistle::PointVisitationFunctor< Scalar, Index >::checkBounds ( const Scalar *  min, const Scalar *  max  )

inline

operator()()

template<typename Scalar , typename Index >

Order vistle::PointVisitationFunctor< Scalar, Index >::operator() ( const typename Celltree::Node &  node )

inline

---

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

• core/cellalgorithm.h