![]() |
ROOT
6.06/09
Reference Guide
|
#include <time.h>#include <iostream>#include <stdlib.h>#include <vector>#include "assert.h"#include "Math/KDTree.h"#include "Math/TDataPoint.h"
Include dependency graph for newKDTreeTest.cxx:Go to the source code of this file.
Functions | |
| template<class _DataPoint > | |
| void | CreatePseudoData (const unsigned long int nPoints, std::vector< const _DataPoint * > &vDataPoints) |
| template<class _DataPoint > | |
| void | DeletePseudoData (std::vector< const _DataPoint * > &vDataPoints) |
| template<class _DataPoint > | |
| ROOT::Math::KDTree< _DataPoint > * | BuildTree (const std::vector< const _DataPoint * > &vDataPoints, const unsigned int iBucketSize) |
| template<class _DataPoint > | |
| bool | CheckBasicTreeProperties (const ROOT::Math::KDTree< _DataPoint > *pTree, const std::vector< const _DataPoint * > &vDataPoints) |
| template<class _DataPoint > | |
| bool | CheckBinBoundaries (const ROOT::Math::KDTree< _DataPoint > *pTree) |
| template<class _DataPoint > | |
| bool | CheckEffectiveBinEntries (const ROOT::Math::KDTree< _DataPoint > *pTree) |
| template<class _DataPoint > | |
| bool | CheckFindBin (const ROOT::Math::KDTree< _DataPoint > *pTree) |
| template<class _DataPoint > | |
| bool | CheckNearestNeighborSearches (const ROOT::Math::KDTree< _DataPoint > *pTree, const std::vector< const _DataPoint * > &vDataPoints) |
| template<class _DataPoint > | |
| bool | CheckTreeClear (ROOT::Math::KDTree< _DataPoint > *pTree, const std::vector< const _DataPoint * > &vDataPoints) |
| int | main () |
| ROOT::Math::KDTree<_DataPoint>* BuildTree | ( | const std::vector< const _DataPoint * > & | vDataPoints, |
| const unsigned int | iBucketSize | ||
| ) |
Definition at line 42 of file newKDTreeTest.cxx.
Referenced by TMVA::DecisionTree::BuildTree(), main(), and TMVA::RuleFit::MakeForest().
| bool CheckBasicTreeProperties | ( | const ROOT::Math::KDTree< _DataPoint > * | pTree, |
| const std::vector< const _DataPoint * > & | vDataPoints | ||
| ) |
Definition at line 66 of file newKDTreeTest.cxx.
Referenced by main().
| bool CheckBinBoundaries | ( | const ROOT::Math::KDTree< _DataPoint > * | pTree | ) |
Definition at line 105 of file newKDTreeTest.cxx.
Referenced by main().
| bool CheckEffectiveBinEntries | ( | const ROOT::Math::KDTree< _DataPoint > * | pTree | ) |
Definition at line 139 of file newKDTreeTest.cxx.
Referenced by main().
| bool CheckFindBin | ( | const ROOT::Math::KDTree< _DataPoint > * | pTree | ) |
Definition at line 154 of file newKDTreeTest.cxx.
Referenced by main().
| bool CheckNearestNeighborSearches | ( | const ROOT::Math::KDTree< _DataPoint > * | pTree, |
| const std::vector< const _DataPoint * > & | vDataPoints | ||
| ) |
Definition at line 192 of file newKDTreeTest.cxx.
Referenced by main().
| bool CheckTreeClear | ( | ROOT::Math::KDTree< _DataPoint > * | pTree, |
| const std::vector< const _DataPoint * > & | vDataPoints | ||
| ) |
Definition at line 301 of file newKDTreeTest.cxx.
Referenced by main().
| void CreatePseudoData | ( | const unsigned long int | nPoints, |
| std::vector< const _DataPoint * > & | vDataPoints | ||
| ) |
Definition at line 18 of file newKDTreeTest.cxx.
Referenced by main().
| void DeletePseudoData | ( | std::vector< const _DataPoint * > & | vDataPoints | ) |
Definition at line 32 of file newKDTreeTest.cxx.
Referenced by main().
| int main | ( | ) |
Definition at line 337 of file newKDTreeTest.cxx.