stk::search::bih::BihTree< RangeBoundingVolume, COMPARE_MODE > Class Template Reference

Bih tree. More...

#include <BihTree.hpp>

List of all members.

Public Types
typedef RangeBoundingVolume::Key	RangeKey
Public Member Functions
template<class InputIterator >
	BihTree (const InputIterator &first, const InputIterator &last, unsigned max_depth=32, unsigned items_per_leaf=1)
template<class DomainBoundingVolume , class RelationshipContainer >
void	intersect (const DomainBoundingVolume &domain, RelationshipContainer &relations) const
	RelationshipContainer can be std::vector< RangeBoundingVoulme > std::vector< std::pair< DomainBoundingVolume::Key, RangeBoundingVolume::Key> > > std::set< std::pair< DomainBoundingVolume::Key, RangeBoundingVolume::Key> > >
template<class DomainIterator , class RelationshipContainer >
void	intersect (const DomainIterator &first, const DomainIterator &last, RelationshipContainer &relations) const
	RelationshipContainer can be std::vector< RangeBoundingVoulme > std::vector< std::pair< DomainBoundingVolume::Key, RangeBoundingVolume::Key> > > std::set< std::pair< DomainBoundingVolume::Key, RangeBoundingVolume::Key> > >
template<class RelationshipContainer >
void	self_intersect (RelationshipContainer &relations) const
	RelationshipContainer can be std::vector< RangeBoundingVoulme > std::vector< std::pair< RangeBoundingVolume::Key, RangeBoundingVolume::Key> > > std::set< std::pair< RangeBoundingVolume::Key, RangeBoundingVolume::Key> > >
unsigned	depth () const
unsigned	num_nodes () const
Public Attributes
const unsigned	MAX_DEPTH
const unsigned	ITEMS_PER_LEAF
Friends
class	::stk::search::bih::UnitTestBihTree

---

Detailed Description

template<class RangeBoundingVolume, int COMPARE_MODE = stk::search::box::compare::MIDDLE>
class stk::search::bih::BihTree< RangeBoundingVolume, COMPARE_MODE >

Bih tree.

Definition at line 30 of file BihTree.hpp.

---

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

• BihTree.hpp