#include <KDTreeLinkerAlgo.h>

Public Member Functions
void	build (std::vector< KDTreeNodeInfo< DATA > > &eltList, const KDTreeBox &region)

void	build (std::vector< KDTreeNodeInfoT< DATA, DIM > > &eltList, const KDTreeBoxT< DIM > &region)

void	clear ()

void	clear ()

bool	empty ()

bool	empty ()

	KDTreeLinkerAlgo ()

	KDTreeLinkerAlgo ()

void	search (const KDTreeBox &searchBox, std::vector< DATA > &resRecHitList)

void	search (const KDTreeBoxT< DIM > &searchBox, std::vector< KDTreeNodeInfoT< DATA, DIM > > &resRecHitList)

int	size ()

int	size ()

	~KDTreeLinkerAlgo ()

	~KDTreeLinkerAlgo ()

Private Member Functions
void	addSubtree (const KDTreeNodeT< DATA, DIM > *current)

void	clearTree ()

void	clearTree ()

KDTreeNodeT< DATA, DIM > *	getNextNode ()

int	medianSearch (int low, int high, int treeDepth)

int	medianSearch (int low, int high, int treeDepth)

int	recBuild (int low, int hight, int depth)

KDTreeNodeT< DATA, DIM > *	recBuild (int low, int hight, int depth, const KDTreeBoxT< DIM > &region)

void	recSearch (int current, float dimCurrMin, float dimCurrMax, float dimOtherMin, float dimOtherMax)

void	recSearch (const KDTreeNodeT< DATA, DIM > *current, const KDTreeBoxT< DIM > &trackBox)

Private Attributes
std::vector< DATA > *	closestNeighbour

std::vector< KDTreeNodeInfoT< DATA, DIM > > *	closestNeighbour

std::vector< KDTreeNodeInfo< DATA > > *	initialEltList

std::vector< KDTreeNodeInfoT< DATA, DIM > > *	initialEltList

KDTreeNodes< DATA >	nodePool_

KDTreeNodeT< DATA, DIM > *	nodePool_

int	nodePoolPos_

int	nodePoolSize_

KDTreeNodeT< DATA, DIM > *	root_

Detailed Description

template<typename DATA>
class KDTreeLinkerAlgo< DATA >

Definition at line 13 of file KDTreeLinkerAlgo.h.

Constructor & Destructor Documentation

template<typename DATA , unsigned DIM>

KDTreeLinkerAlgo< DATA, DIM >::KDTreeLinkerAlgo ( )

Definition at line 180 of file KDTreeLinkerAlgo.h.

Referenced by KDTreeLinkerAlgo< DATA >::addSubtree().

180 {}

template<typename DATA , unsigned DIM>

KDTreeLinkerAlgo< DATA, DIM >::~KDTreeLinkerAlgo ( )

Definition at line 183 of file KDTreeLinkerAlgo.h.

References KDTreeLinkerAlgo< DATA >::clear().

Referenced by KDTreeLinkerAlgo< DATA >::addSubtree().

                                           {
   clear();
 }

template<typename DATA>

KDTreeLinkerAlgo< DATA >::KDTreeLinkerAlgo ( )

template<typename DATA>

KDTreeLinkerAlgo< DATA >::~KDTreeLinkerAlgo ( )

Member Function Documentation

template<typename DATA, unsigned DIM>

void KDTreeLinkerAlgo< DATA, DIM >::addSubtree ( const KDTreeNodeT< DATA, DIM > * current )

private

Definition at line 222 of file KDTreeLinkerAlgoT.h.

References KDTreeLinkerAlgo< DATA >::clear(), KDTreeLinkerAlgo< DATA >::clearTree(), KDTreeLinkerAlgo< DATA >::closestNeighbour, KDTreeNodeT< DATA, DIM >::info, KDTreeLinkerAlgo< DATA >::KDTreeLinkerAlgo(), KDTreeNodeT< DATA, DIM >::left, KDTreeLinkerAlgo< DATA >::nodePool_, KDTreeLinkerAlgo< DATA >::nodePoolPos_, KDTreeLinkerAlgo< DATA >::nodePoolSize_, KDTreeNodeT< DATA, DIM >::right, KDTreeLinkerAlgo< DATA >::root_, and KDTreeLinkerAlgo< DATA >::~KDTreeLinkerAlgo().

Referenced by KDTreeLinkerAlgo< DATA >::recSearch().

 {
   // By construction, current can't be null
   // assert(current != 0);
 
   if ((current->left == nullptr) && (current->right == nullptr)) // leaf
     closestNeighbour->push_back(current->info);
   else { // node
     addSubtree(current->left);
     addSubtree(current->right);
   }
 }

template<typename DATA>

void KDTreeLinkerAlgo< DATA >::build	(	std::vector< KDTreeNodeInfo< DATA > > &	eltList,
		const KDTreeBox &	region
	)

Definition at line 61 of file KDTreeLinkerAlgo.h.

References KDTreeLinkerAlgo< DATA >::initialEltList, KDTreeLinkerAlgo< DATA >::nodePool_, KDTreeLinkerAlgo< DATA >::recBuild(), and KDTreeLinkerAlgo< DATA >::size().

Referenced by KDTreeLinkerTrackEcal::buildTree(), KDTreeLinkerTrackHcal::buildTree(), KDTreeLinkerPSEcal::buildTree(), HGCalImagingAlgo::findAndAssignClusters(), HGCalCLUEAlgo::makeClusters(), HGCalImagingAlgo::makeClusters(), and psClasses.BuildThread::run().

                                                                                                      {
   if (!eltList.empty()) {
     initialEltList = &eltList;
 
     size_t size = initialEltList->size();
     nodePool_.build(size);
 
     // Here we build the KDTree
     int root = recBuild(0, size, 0);
     assert(root == 0);
 
     initialEltList = nullptr;
   }
 }

template<typename DATA, unsigned DIM>

void KDTreeLinkerAlgo< DATA, DIM >::build	(	std::vector< KDTreeNodeInfoT< DATA, DIM > > &	eltList,
		const KDTreeBoxT< DIM > &	region
	)

Definition at line 86 of file KDTreeLinkerAlgoT.h.

References DIM, KDTreeNodeInfoT< DATA, DIM >::dims, mps_fire::i, KDTreeLinkerAlgo< DATA >::initialEltList, checklumidiff::l, funct::m, pfDeepBoostedJetPreprocessParams_cfi::median, KDTreeLinkerAlgo< DATA >::medianSearch(), KDTreeLinkerAlgo< DATA >::nodePool_, KDTreeLinkerAlgo< DATA >::nodePoolSize_, KDTreeLinkerAlgo< DATA >::recBuild(), KDTreeLinkerAlgo< DATA >::root_, KDTreeLinkerAlgo< DATA >::size(), and std::swap().

 {
   if (!eltList.empty()) {
     initialEltList = &eltList;
     
     size_t size = initialEltList->size();
     nodePoolSize_ = size * 2 - 1;
     nodePool_ = new KDTreeNodeT<DATA,DIM>[nodePoolSize_];
     
     // Here we build the KDTree
     root_ = recBuild(0, size, 0, region);
     
     initialEltList = nullptr;
   }
 }

template<typename DATA , unsigned DIM>

void KDTreeLinkerAlgo< DATA, DIM >::clear ( void )

Definition at line 193 of file KDTreeLinkerAlgo.h.

References KDTreeLinkerAlgo< DATA >::clearTree().

Referenced by KDTreeLinkerAlgo< DATA >::addSubtree(), KDTreeLinkerPSEcal::clear(), KDTreeLinkerTrackEcal::clear(), KDTreeLinkerTrackHcal::clear(), Vispa.Views.WidgetView.WidgetView::closeEvent(), Vispa.Views.BoxDecayView.BoxDecayView::closeEvent(), HGCalImagingAlgo::findAndAssignClusters(), Vispa.Share.FindAlgorithm.FindAlgorithm::findUsingFindDialog(), Vispa.Views.LineDecayView.LineDecayView::setDataObjects(), Vispa.Views.WidgetView.WidgetView::setDataObjects(), BeautifulSoup.Tag::setString(), KDTreeLinkerAlgo< reco::PFRecHit const * >::size(), Vispa.Views.TreeView.TreeView::updateContent(), Vispa.Views.TableView.TableView::updateContent(), Vispa.Views.BoxDecayView.BoxDecayView::updateContent(), Vispa.Views.PropertyView.PropertyView::updateContent(), and KDTreeLinkerAlgo< DATA >::~KDTreeLinkerAlgo().

                                    {
   clearTree();
 }

template<typename DATA>

void KDTreeLinkerAlgo< DATA >::clear ( )

template<typename DATA , unsigned DIM>

void KDTreeLinkerAlgo< DATA, DIM >::clearTree ( )

private

Definition at line 188 of file KDTreeLinkerAlgo.h.

References KDTreeLinkerAlgo< DATA >::nodePool_.

Referenced by KDTreeLinkerAlgo< DATA >::addSubtree(), and KDTreeLinkerAlgo< DATA >::clear().

                                        {
   nodePool_.clear();
 }

template<typename DATA>

void KDTreeLinkerAlgo< DATA >::clearTree ( )

private

template<typename DATA>

bool KDTreeLinkerAlgo< DATA >::empty ( )

inline

Definition at line 28 of file KDTreeLinkerAlgo.h.

Referenced by KDTreeLinkerAlgo< DATA >::search(), Vispa.Gui.VispaWidget.TextField::setAutosizeFont(), and Vispa.Gui.VispaWidget.TextField::setAutotruncate().

28 { return nodePool_.empty(); }

KDTreeLinkerAlgo::nodePool_

KDTreeNodes< DATA > nodePool_

Definition: KDTreeLinkerAlgo.h:39

template<typename DATA>

bool KDTreeLinkerAlgo< DATA >::empty ( void )

inline

Definition at line 31 of file KDTreeLinkerAlgoT.h.

31 {return nodePoolPos_ == -1;}

KDTreeLinkerAlgo::nodePoolPos_

int nodePoolPos_

Definition: KDTreeLinkerAlgoT.h:47

template<typename DATA , unsigned DIM>

KDTreeNodeT< DATA, DIM > * KDTreeLinkerAlgo< DATA, DIM >::getNextNode ( )

private

Definition at line 276 of file KDTreeLinkerAlgoT.h.

References KDTreeLinkerAlgo< DATA >::nodePool_, and KDTreeLinkerAlgo< DATA >::nodePoolPos_.

Referenced by KDTreeLinkerAlgo< DATA >::recBuild().

 {
   ++nodePoolPos_;
 
   // The tree size is exactly 2 * nbrElts - 1 and this is the total allocated memory.
   // If we have used more than that....there is a big problem.
   // assert(nodePoolPos_ < nodePoolSize_);
 
   return &(nodePool_[nodePoolPos_]);
 }

template<typename DATA , unsigned DIM>

int KDTreeLinkerAlgo< DATA, DIM >::medianSearch	(	int	low,
		int	high,
		int	treeDepth
	)

private

Definition at line 78 of file KDTreeLinkerAlgo.h.

References KDTreeNodeInfo< DATA >::dim, mps_fire::i, KDTreeLinkerAlgo< DATA >::initialEltList, checklumidiff::l, funct::m, pfDeepBoostedJetPreprocessParams_cfi::median, and std::swap().

Referenced by KDTreeLinkerAlgo< DATA >::build(), and KDTreeLinkerAlgo< DATA >::recBuild().

                                                                          {
   int nbrElts = high - low;
   int median = (nbrElts & 1) ? nbrElts / 2 : nbrElts / 2 - 1;
   median += low;
 
   int l = low;
   int m = high - 1;
 
   while (l < m) {
     KDTreeNodeInfo<DATA> elt = (*initialEltList)[median];
     int i = l;
     int j = m;
 
     do {
       // The even depth is associated to dim1 dimension
       // The odd one to dim2 dimension
       if (treeDepth & 1) {
         while ((*initialEltList)[i].dim[1] < elt.dim[1])
           i++;
         while ((*initialEltList)[j].dim[1] > elt.dim[1])
           j--;
       } else {
         while ((*initialEltList)[i].dim[0] < elt.dim[0])
           i++;
         while ((*initialEltList)[j].dim[0] > elt.dim[0])
           j--;
       }
 
       if (i <= j) {
         std::swap((*initialEltList)[i], (*initialEltList)[j]);
         i++;
         j--;
       }
     } while (i <= j);
     if (j < median)
       l = i;
     if (i > median)
       m = j;
   }
 
   return median;
 }

template<typename DATA>

int KDTreeLinkerAlgo< DATA >::medianSearch	(	int	low,
		int	high,
		int	treeDepth
	)

private

template<typename DATA >

int KDTreeLinkerAlgo< DATA >::recBuild	(	int	low,
		int	hight,
		int	depth
	)

private

Definition at line 198 of file KDTreeLinkerAlgo.h.

References KDTreeNodeInfo< DATA >::data, egammaForCoreTracking_cff::depth, KDTreeNodeInfo< DATA >::dim, info(), KDTreeLinkerAlgo< DATA >::medianSearch(), and KDTreeLinkerAlgo< DATA >::nodePool_.

Referenced by KDTreeLinkerAlgo< DATA >::build(), and KDTreeLinkerAlgo< DATA >::recBuild().

                                                                  {
   int portionSize = high - low;
   int dimIndex = depth & 1;
 
   if (portionSize == 1) {  // Leaf case
     int leaf = nodePool_.getNextNode();
     const KDTreeNodeInfo<DATA> &info = (*initialEltList)[low];
     nodePool_.right[leaf] = 0;
     nodePool_.median[leaf] = info.dim[dimIndex];  // dimCurrent
     nodePool_.dimOther[leaf] = info.dim[1 - dimIndex];
     nodePool_.data[leaf] = info.data;
     return leaf;
 
   } else {  // Node case
 
     // The even depth is associated to dim1 dimension
     // The odd one to dim2 dimension
     int medianId = medianSearch(low, high, depth);
     float medianVal = (*initialEltList)[medianId].dim[dimIndex];
 
     // We create the node
     int nodeInd = nodePool_.getNextNode();
     nodePool_.median[nodeInd] = medianVal;
 
     ++depth;
     ++medianId;
 
     // We recursively build the son nodes
     int left = recBuild(low, medianId, depth);
     assert(nodeInd + 1 == left);
     nodePool_.right[nodeInd] = recBuild(medianId, high, depth);
 
     return nodeInd;
   }
 }

template<typename DATA , unsigned DIM>

KDTreeNodeT< DATA, DIM > * KDTreeLinkerAlgo< DATA, DIM >::recBuild	(	int	low,
		int	hight,
		int	depth,
		const KDTreeBoxT< DIM > &	region
	)

private

Definition at line 290 of file KDTreeLinkerAlgoT.h.

References egammaForCoreTracking_cff::depth, DIM, KDTreeBoxT< DIM >::dimmax, KDTreeBoxT< DIM >::dimmin, KDTreeLinkerAlgo< DATA >::getNextNode(), KDTreeLinkerAlgo< DATA >::initialEltList, KDTreeNodeT< DATA, DIM >::left, KDTreeLinkerAlgo< DATA >::medianSearch(), KDTreeLinkerAlgo< DATA >::recBuild(), KDTreeNodeT< DATA, DIM >::right, and KDTreeNodeT< DATA, DIM >::setAttributs().

 {
   int portionSize = high - low;
 
   // By construction, portionSize > 0 can't happend.
   // assert(portionSize > 0);
 
   if (portionSize == 1) { // Leaf case
    
     KDTreeNodeT<DATA,DIM> *leaf = getNextNode();
     leaf->setAttributs(region, (*initialEltList)[low]);
     return leaf;
 
   } else { // Node case
     
     // The even depth is associated to dim1 dimension
     // The odd one to dim2 dimension
     int medianId = medianSearch(low, high, depth);
 
     // We create the node
     KDTreeNodeT<DATA,DIM> *node = getNextNode();
     node->setAttributs(region);
 
 
     // Here we split into 2 halfplanes the current plane
     KDTreeBoxT<DIM> leftRegion = region;
     KDTreeBoxT<DIM> rightRegion = region;
     unsigned thedim = depth % DIM;
     auto medianVal = (*initialEltList)[medianId].dims[thedim];
     leftRegion.dimmax[thedim] = medianVal;
     rightRegion.dimmin[thedim] = medianVal;    
 
     ++depth;
     ++medianId;
 
     // We recursively build the son nodes
     node->left = recBuild(low, medianId, depth, leftRegion);
     node->right = recBuild(medianId, high, depth, rightRegion);
 
     return node;
   }
 }

template<typename DATA >

void KDTreeLinkerAlgo< DATA >::recSearch	(	int	current,
		float	dimCurrMin,
		float	dimCurrMax,
		float	dimOtherMin,
		float	dimOtherMax
	)

private

Definition at line 131 of file KDTreeLinkerAlgo.h.

References KDTreeLinkerAlgo< DATA >::closestNeighbour, pfDeepBoostedJetPreprocessParams_cfi::median, KDTreeLinkerAlgo< DATA >::nodePool_, and std::swap().

Referenced by KDTreeLinkerAlgo< DATA >::recSearch(), and KDTreeLinkerAlgo< DATA >::search().

                                                                                            {
   // Iterate until leaf is found, or there are no children in the
   // search window. If search has to proceed on both children, proceed
   // the search to left child via recursion. Swap search window
   // dimension on alternate levels.
   while (true) {
     int right = nodePool_.right[current];
     if (nodePool_.isLeaf(right)) {
       float dimCurr = nodePool_.median[current];
 
       // If point inside the rectangle/area
       // Use intentionally bit-wise & instead of logical && for better
       // performance. It is faster to always do all comparisons than to
       // allow use of branches to not do some if any of the first ones
       // is false.
       if ((dimCurr >= dimCurrMin) & (dimCurr <= dimCurrMax)) {
         float dimOther = nodePool_.dimOther[current];
         if ((dimOther >= dimOtherMin) & (dimOther <= dimOtherMax)) {
           closestNeighbour->push_back(nodePool_.data[current]);
         }
       }
       break;
     } else {
       float median = nodePool_.median[current];
 
       bool goLeft = (dimCurrMin <= median);
       bool goRight = (dimCurrMax >= median);
 
       // Swap dimension for the next search level
       std::swap(dimCurrMin, dimOtherMin);
       std::swap(dimCurrMax, dimOtherMax);
       if (goLeft & goRight) {
         int left = current + 1;
         recSearch(left, dimCurrMin, dimCurrMax, dimOtherMin, dimOtherMax);
         // continue with right
         current = right;
       } else if (goLeft) {
         ++current;
       } else if (goRight) {
         current = right;
       } else {
         break;
       }
     }
   }
 }

template<typename DATA, unsigned DIM>

void KDTreeLinkerAlgo< DATA, DIM >::recSearch	(	const KDTreeNodeT< DATA, DIM > *	current,
		const KDTreeBoxT< DIM > &	trackBox
	)

private

Definition at line 162 of file KDTreeLinkerAlgoT.h.

References KDTreeLinkerAlgo< DATA >::addSubtree(), KDTreeLinkerAlgo< DATA >::closestNeighbour, DIM, KDTreeBoxT< DIM >::dimmax, KDTreeBoxT< DIM >::dimmin, mps_fire::i, KDTreeNodeT< DATA, DIM >::info, KDTreeNodeT< DATA, DIM >::left, KDTreeLinkerAlgo< DATA >::recSearch(), and KDTreeNodeT< DATA, DIM >::right.

 {
   /*
   // By construction, current can't be null
   assert(current != 0);
 
   // By Construction, a node can't have just 1 son.
   assert (!(((current->left == 0) && (current->right != 0)) ||
         ((current->left != 0) && (current->right == 0))));
   */
     
   if ((current->left == nullptr) && (current->right == nullptr)) {//leaf case
   
     // If point inside the rectangle/area
     bool isInside = true;
     for( unsigned i = 0; i < DIM; ++i ) {
       const auto thedim = current->info.dims[i];
       isInside *= thedim >= trackBox.dimmin[i] && thedim <= trackBox.dimmax[i];
     }
     if( isInside ) closestNeighbour->push_back(current->info);
 
   } else {
 
     bool isFullyContained = true;
     bool hasIntersection = true;
     //if region( v->left ) is fully contained in the rectangle
     for( unsigned i = 0; i < DIM; ++i ) {
       const auto regionmin = current->left->region.dimmin[i];
       const auto regionmax = current->left->region.dimmax[i];
       isFullyContained *= ( regionmin >= trackBox.dimmin[i] && 
                 regionmax <= trackBox.dimmax[i]    );
       hasIntersection *= ( regionmin < trackBox.dimmax[i] && regionmax > trackBox.dimmin[i]);
     }
     if( isFullyContained ) {
       addSubtree(current->left);
     } else if ( hasIntersection ) {
       recSearch(current->left, trackBox); 
     }    
     // reset flags
     isFullyContained = true;
     hasIntersection = true;
     //if region( v->right ) is fully contained in the rectangle
     for( unsigned i = 0; i < DIM; ++i ) {
       const auto regionmin = current->right->region.dimmin[i];
       const auto regionmax = current->right->region.dimmax[i];
       isFullyContained *= ( regionmin >= trackBox.dimmin[i] && 
                 regionmax <= trackBox.dimmax[i]    );
       hasIntersection *= ( regionmin < trackBox.dimmax[i] && regionmax > trackBox.dimmin[i]);
     }
     if( isFullyContained ) {
       addSubtree(current->right);
     } else if ( hasIntersection ) {
       recSearch(current->right, trackBox); 
     }    
   }
 }

template<typename DATA>

void KDTreeLinkerAlgo< DATA >::search	(	const KDTreeBox &	searchBox,
		std::vector< DATA > &	resRecHitList
	)

Definition at line 122 of file KDTreeLinkerAlgo.h.

References KDTreeLinkerAlgo< DATA >::closestNeighbour, KDTreeBox::dim1max, KDTreeBox::dim1min, KDTreeBox::dim2max, KDTreeBox::dim2min, KDTreeLinkerAlgo< DATA >::empty(), and KDTreeLinkerAlgo< DATA >::recSearch().

Referenced by HGCalCLUEAlgo::calculateLocalDensity(), HGCalImagingAlgo::calculateLocalDensity(), HGCalImagingAlgo::findAndAssignClusters(), BeautifulSoup.SoupStrainer::search(), KDTreeLinkerPSEcal::searchLinks(), KDTreeLinkerTrackHcal::searchLinks(), and KDTreeLinkerTrackEcal::searchLinks().

                                                                                        {
   if (!empty()) {
     closestNeighbour = &recHits;
     recSearch(0, trackBox.dim1min, trackBox.dim1max, trackBox.dim2min, trackBox.dim2max);
     closestNeighbour = nullptr;
   }
 }

template<typename DATA, unsigned DIM>

void KDTreeLinkerAlgo< DATA, DIM >::search	(	const KDTreeBoxT< DIM > &	searchBox,
		std::vector< KDTreeNodeInfoT< DATA, DIM > > &	resRecHitList
	)

Definition at line 149 of file KDTreeLinkerAlgoT.h.

References KDTreeLinkerAlgo< DATA >::closestNeighbour, KDTreeLinkerAlgo< DATA >::recSearch(), and KDTreeLinkerAlgo< DATA >::root_.

 {
   if (root_) {
     closestNeighbour = &recHits;
     recSearch(root_, trackBox);
     closestNeighbour = nullptr;
   }
 }

template<typename DATA>

int KDTreeLinkerAlgo< DATA >::size ( void )

inline

Definition at line 32 of file KDTreeLinkerAlgo.h.

Referenced by ntupleDataFormat._Collection::__iter__(), ntupleDataFormat._Collection::__len__(), and KDTreeLinkerAlgo< DATA >::build().

32 { return nodePool_.size(); }

KDTreeLinkerAlgo::nodePool_

KDTreeNodes< DATA > nodePool_

Definition: KDTreeLinkerAlgo.h:39

template<typename DATA>

int KDTreeLinkerAlgo< DATA >::size ( void )

inline

Definition at line 35 of file KDTreeLinkerAlgoT.h.

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

35 { return nodePoolPos_ + 1;}

KDTreeLinkerAlgo::nodePoolPos_

int nodePoolPos_

Definition: KDTreeLinkerAlgoT.h:47

Member Data Documentation

template<typename DATA>

std::vector<DATA>* KDTreeLinkerAlgo< DATA >::closestNeighbour

private

Definition at line 41 of file KDTreeLinkerAlgo.h.

Referenced by KDTreeLinkerAlgo< DATA >::addSubtree(), KDTreeLinkerAlgo< DATA >::recSearch(), and KDTreeLinkerAlgo< DATA >::search().

template<typename DATA>

std::vector<KDTreeNodeInfoT<DATA,DIM> >* KDTreeLinkerAlgo< DATA >::closestNeighbour

private

Definition at line 51 of file KDTreeLinkerAlgoT.h.

template<typename DATA>

std::vector<KDTreeNodeInfo<DATA> >* KDTreeLinkerAlgo< DATA >::initialEltList

private

Definition at line 42 of file KDTreeLinkerAlgo.h.

Referenced by KDTreeLinkerAlgo< DATA >::build(), KDTreeLinkerAlgo< DATA >::medianSearch(), and KDTreeLinkerAlgo< DATA >::recBuild().

template<typename DATA>

std::vector<KDTreeNodeInfoT<DATA,DIM> >* KDTreeLinkerAlgo< DATA >::initialEltList

private

Definition at line 52 of file KDTreeLinkerAlgoT.h.

template<typename DATA>

KDTreeNodes<DATA> KDTreeLinkerAlgo< DATA >::nodePool_

private

Definition at line 39 of file KDTreeLinkerAlgo.h.

Referenced by KDTreeLinkerAlgo< DATA >::addSubtree(), KDTreeLinkerAlgo< DATA >::build(), KDTreeLinkerAlgo< DATA >::clearTree(), KDTreeLinkerAlgo< reco::PFRecHit const * >::empty(), KDTreeLinkerAlgo< DATA >::getNextNode(), KDTreeLinkerAlgo< DATA >::recBuild(), KDTreeLinkerAlgo< DATA >::recSearch(), and KDTreeLinkerAlgo< reco::PFRecHit const * >::size().

template<typename DATA>

KDTreeNodeT<DATA,DIM>* KDTreeLinkerAlgo< DATA >::nodePool_

private

Definition at line 45 of file KDTreeLinkerAlgoT.h.

template<typename DATA>

int KDTreeLinkerAlgo< DATA >::nodePoolPos_

private

Definition at line 47 of file KDTreeLinkerAlgoT.h.

Referenced by KDTreeLinkerAlgo< DATA >::addSubtree(), KDTreeLinkerAlgo< reco::PFRecHit const * >::empty(), KDTreeLinkerAlgo< DATA >::getNextNode(), and KDTreeLinkerAlgo< reco::PFRecHit const * >::size().

template<typename DATA>

int KDTreeLinkerAlgo< DATA >::nodePoolSize_

private

Definition at line 46 of file KDTreeLinkerAlgoT.h.

Referenced by KDTreeLinkerAlgo< DATA >::addSubtree(), and KDTreeLinkerAlgo< DATA >::build().

template<typename DATA>

KDTreeNodeT<DATA,DIM>* KDTreeLinkerAlgo< DATA >::root_

private

Definition at line 42 of file KDTreeLinkerAlgoT.h.

Referenced by KDTreeLinkerAlgo< DATA >::addSubtree(), KDTreeLinkerAlgo< DATA >::build(), and KDTreeLinkerAlgo< DATA >::search().

Public Member Functions

Private Member Functions

Private Attributes

Detailed Description

template<typename DATA> class KDTreeLinkerAlgo< DATA >

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation

template<typename DATA>
class KDTreeLinkerAlgo< DATA >