This file contains binary tree and global function template that searches tree for k-nearest neigbors.
Node class template parameter T has to provide these functions: rtype GetVar(UInt_t) const;
Find function template parameter T has to provide these functions: (in addition to above requirements) rtype GetDist(Float_t, UInt_t) const;
where T::GetDist(Float_t, UInt_t) <= T::GetDist(const T &) for any pair of events and any variable number for these events
Public Member Functions | |
Node (const Node *parent, const T &event, Int_t mod) | |
~Node () | |
const Node * | Add (const T &event, UInt_t depth) |
This is Node member function that adds a new node to a binary tree. | |
const T & | GetEvent () const |
UInt_t | GetMod () const |
const Node * | GetNodeL () const |
const Node * | GetNodeP () const |
const Node * | GetNodeR () const |
Float_t | GetVarDis () const |
Float_t | GetVarMax () const |
Float_t | GetVarMin () const |
Double_t | GetWeight () const |
void | Print () const |
void | Print (std::ostream &os, const std::string &offset="") const |
void | SetNodeL (Node *node) |
void | SetNodeR (Node *node) |
Private Member Functions | |
Node () | |
Node (const Node &) | |
const Node & | operator= (const Node &) |
Private Attributes | |
const T | fEvent |
const UInt_t | fMod |
Node * | fNodeL |
const Node * | fNodeP |
Node * | fNodeR |
const Float_t | fVarDis |
Float_t | fVarMax |
Float_t | fVarMin |
#include <TMVA/NodekNN.h>
TMVA::kNN::Node< T >::Node | ( | const Node< T > * | parent, |
const T & | event, | ||
Int_t | mod | ||
) |
TMVA::kNN::Node< T >::~Node |
|
private |
|
private |
const TMVA::kNN::Node< T > * TMVA::kNN::Node< T >::Add | ( | const T & | event, |
UInt_t | depth | ||
) |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
private |
void TMVA::kNN::Node< T >::Print |
void TMVA::kNN::Node< T >::Print | ( | std::ostream & | os, |
const std::string & | offset = "" |
||
) | const |
|
inline |
|
inline |
|
private |
|
private |
|
private |
|
private |
|
private |
|
private |
|
private |
|
private |