k_d_tree::SortedIndices< Dim > Class Template Reference

#include <k_d_tree.h>

Collaboration diagram for k_d_tree::SortedIndices< Dim >:

Classes
struct	SplitResult

Public Member Functions
	SortedIndices ()
	empty
	SortedIndices (size_t n)
	Identity permutation on all axes.
size_t	size () const
bool	empty () const
SplitResult	split (uint8_t axis, std::vector< bool > &markers) const
Idx *	begin (uint8_t d)
Idx *	end (uint8_t d)
const Idx *	begin (uint8_t d) const
const Idx *	end (uint8_t d) const

Static Public Member Functions
static SortedIndices	newUninitialized (size_t n)
	uninitialized indices

Private Member Functions
	SortedIndices (Points< Dim, Idx > &&indices)

Private Attributes
Points< Dim, Idx >	indices

Constructor & Destructor Documentation

SortedIndices() [1/3]

template<uint8_t Dim>

k_d_tree::SortedIndices< Dim >::SortedIndices ( )

inline

empty

References indices.

Referenced by newUninitialized(), and split().

Here is the caller graph for this function:

SortedIndices() [2/3]

template<uint8_t Dim>

k_d_tree::SortedIndices< Dim >::SortedIndices ( size_t n )

inline

Identity permutation on all axes.

References indices.

SortedIndices() [3/3]

template<uint8_t Dim>

k_d_tree::SortedIndices< Dim >::SortedIndices ( Points< Dim, Idx > && indices )

inlineprivate

References indices.

Member Function Documentation

begin() [1/2]

template<uint8_t Dim>

Idx * k_d_tree::SortedIndices< Dim >::begin ( uint8_t d )

inline

References indices.

Referenced by split().

Here is the caller graph for this function:

begin() [2/2]

template<uint8_t Dim>

const Idx * k_d_tree::SortedIndices< Dim >::begin ( uint8_t d ) const

inline

References indices.

empty()

template<uint8_t Dim>

bool k_d_tree::SortedIndices< Dim >::empty ( ) const

inline

References size().

Here is the call graph for this function:

end() [1/2]

template<uint8_t Dim>

Idx * k_d_tree::SortedIndices< Dim >::end ( uint8_t d )

inline

References indices.

end() [2/2]

template<uint8_t Dim>

const Idx * k_d_tree::SortedIndices< Dim >::end ( uint8_t d ) const

inline

References indices.

newUninitialized()

template<uint8_t Dim>

SortedIndices k_d_tree::SortedIndices< Dim >::newUninitialized ( size_t n )

inlinestatic

uninitialized indices

References SortedIndices().

Referenced by k_d_tree::SortedPoints< Dim, Component >::SortedPoints().

Here is the call graph for this function:

Here is the caller graph for this function:

size()

template<uint8_t Dim>

size_t k_d_tree::SortedIndices< Dim >::size ( ) const

inline

References indices.

Referenced by empty().

Here is the caller graph for this function:

split()

template<uint8_t Dim>

SplitResult k_d_tree::SortedIndices< Dim >::split ( uint8_t axis, std::vector< bool > & markers ) const

inline

Splits the sorted indices in the middle along the specified axis, partitioning them into left (<=), the pivot, and right (>=).

References SortedIndices(), k_d_tree::Points< Dim, Component >::begin(), begin(), and indices.

Referenced by k_d_tree::KdTree< Dim, Component, Id >::init().

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

indices

template<uint8_t Dim>

Points<Dim, Idx> k_d_tree::SortedIndices< Dim >::indices

private

Referenced by SortedIndices(), SortedIndices(), SortedIndices(), begin(), begin(), end(), end(), size(), and split().

---

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

• util/k_d_tree.h