te::sam::kdtree::AdaptativeIndex< KdTreeNode > Member List

This is the complete list of members for te::sam::kdtree::AdaptativeIndex< KdTreeNode >, including all inherited members.

AdaptativeIndex(const te::gm::Envelope &mbr, const std::size_t &bucketSize=12)	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	inline
AdaptativeIndex(const AdaptativeIndex &rhs)	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	private
average(std::vector< std::pair< kdKey, kdDataItem > > &dataSet, const char &discriminator) const	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	inlineprivate
build(std::vector< std::pair< kdKey, kdDataItem > > &dataSet)	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	inline
build(std::vector< std::pair< kdKey, kdDataItem > > &dataSet, double averageValue, const te::gm::Envelope &mbr)	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	inlineprivate
clear()	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	inline
erase(KdTreeNode *node)	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	inlineprivate
getBucketSize() const	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	inline
getMBR() const	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	inline
isEmpty() const	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	inline
kdData typedef	te::sam::kdtree::AdaptativeIndex< KdTreeNode >
kdDataItem typedef	te::sam::kdtree::AdaptativeIndex< KdTreeNode >
kdKey typedef	te::sam::kdtree::AdaptativeIndex< KdTreeNode >
kdNode typedef	te::sam::kdtree::AdaptativeIndex< KdTreeNode >
m_bucketSize	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	private
m_mbr	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	private
m_root	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	private
m_size	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	private
nearestNeighborSearch(const kdKey &key, std::vector< kdDataItem > &report, std::vector< double > &sqrDists, const std::size_t &k) const	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	inline
nearestNeighborSearch(KdTreeNode *node, const kdKey &key, std::vector< kdDataItem > &report, std::vector< double > &sqrDists, te::gm::Envelope &e) const	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	inlineprivate
operator=(const AdaptativeIndex &rhs)	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	private
search(const te::gm::Envelope &e, std::vector< KdTreeNode * > &report) const	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	inline
search(const te::gm::Envelope &e, std::vector< kdDataItem > &report) const	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	inline
search(const te::gm::Envelope &e, KdTreeNode *node, std::vector< KdTreeNode * > &report) const	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	inlineprivate
setBucketSize(const std::size_t &size)	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	inline
setMBR(const te::gm::Envelope &mbr)	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	inline
size() const	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	inline
update(KdTreeNode *node, const kdKey &key, std::vector< kdDataItem > &report, std::vector< double > &sqrDists, te::gm::Envelope &e) const	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	inlineprivate
~AdaptativeIndex()	te::sam::kdtree::AdaptativeIndex< KdTreeNode >	inline