KDTreeNodes< DATA > Struct Template Reference

#include <KDTreeLinkerTools.h>

Public Member Functions
void	build (int sizeData)
void	clear ()
bool	empty () const
int	getNextNode ()
constexpr bool	isLeaf (int right) const
bool	isLeafIndex (int index) const
constexpr	KDTreeNodes ()
int	size () const

Public Attributes
std::vector< DATA >	data
std::vector< float >	dimOther
std::vector< float >	median
int	poolPos
int	poolSize
std::vector< int >	right

Detailed Description

template<typename DATA>
struct KDTreeNodes< DATA >

Definition at line 52 of file KDTreeLinkerTools.h.

Constructor & Destructor Documentation

template<typename DATA>

constexpr KDTreeNodes< DATA >::KDTreeNodes ( )

inline

Definition at line 61 of file KDTreeLinkerTools.h.

: poolSize(-1), poolPos(-1) {}

Member Function Documentation

template<typename DATA>

void KDTreeNodes< DATA >::build ( int  sizeData )

inline

Definition at line 80 of file KDTreeLinkerTools.h.

                           {
    poolSize = sizeData*2-1;
    median.resize(poolSize);
    right.resize(poolSize);
    dimOther.resize(poolSize);
    data.resize(poolSize);
  };

template<typename DATA>

void KDTreeNodes< DATA >::clear ( void  )

inline

Definition at line 66 of file KDTreeLinkerTools.h.

               {
    median.clear();
    right.clear();
    dimOther.clear();
    data.clear();
    poolSize = -1;
    poolPos = -1;
  }

template<typename DATA>

bool KDTreeNodes< DATA >::empty ( void  ) const

inline

Definition at line 63 of file KDTreeLinkerTools.h.

{ return poolPos == -1; }

template<typename DATA>

int KDTreeNodes< DATA >::getNextNode ( )

inline

Definition at line 75 of file KDTreeLinkerTools.h.

                    {
    ++poolPos;
    return poolPos;
  }

template<typename DATA>

constexpr bool KDTreeNodes< DATA >::isLeaf ( int  right ) const

inline

Definition at line 88 of file KDTreeLinkerTools.h.

                                         {
    // Valid values of right are always >= 2
    // index 0 is the root, and 1 is the first left node
    // Exploit index values 0 and 1 to mark which of dim1/dim2 is the
    // current one in recSearch() at the depth of the leaf.
    return right < 2;
  }

template<typename DATA>

bool KDTreeNodes< DATA >::isLeafIndex ( int  index ) const

inline

Definition at line 96 of file KDTreeLinkerTools.h.

                                    {
    return isLeaf(right[index]);
  }

template<typename DATA>

int KDTreeNodes< DATA >::size ( void  ) const

inline

Definition at line 64 of file KDTreeLinkerTools.h.

Referenced by ntuple._Collection::__iter__(), and ntuple._Collection::__len__().

{ return poolPos + 1; }

Member Data Documentation

template<typename DATA>

std::vector<DATA> KDTreeNodes< DATA >::data

Definition at line 56 of file KDTreeLinkerTools.h.

Referenced by data_sources.node::__str__(), data_sources.json_list::as_dicts(), data_sources.json_list::as_table(), data_sources.json_list::get_members(), data_sources.json_list::last(), and cuy.FindIssue::startElement().

template<typename DATA>

std::vector<float> KDTreeNodes< DATA >::dimOther

Definition at line 55 of file KDTreeLinkerTools.h.

template<typename DATA>

std::vector<float> KDTreeNodes< DATA >::median

Definition at line 53 of file KDTreeLinkerTools.h.

template<typename DATA>

int KDTreeNodes< DATA >::poolPos

Definition at line 59 of file KDTreeLinkerTools.h.

template<typename DATA>

int KDTreeNodes< DATA >::poolSize

Definition at line 58 of file KDTreeLinkerTools.h.

template<typename DATA>

std::vector<int> KDTreeNodes< DATA >::right

Definition at line 54 of file KDTreeLinkerTools.h.

Referenced by progressbar.Bar::update(), and progressbar.BouncingBar::update().