Anp::FillkNN Class Reference

#include <FillkNN.h>

Inheritance diagram for Anp::FillkNN:

List of all members.

Public Member Functions
	FillkNN ()
virtual	~FillkNN ()
bool	Run (Record &record)
bool	Run (Event &event, const Record &record, bool pass)
void	Config (const Registry &reg)
bool	Init (const Header &)
void	End (const DataBlock &)
Private Types
typedef std::vector< short >	ShortVec
typedef std::map< short, int >	ShortMap
Private Member Functions
bool	Fill (DataIter beg, DataIter end, double weight)
const DataVec	Find (DataIter beg, DataIter end, short keybase) const
double	PidKer (Lit::List::const_iterator beg, Lit::List::const_iterator end) const
const std::vector< float >	Get (DataIter beg, DataIter end, const ShortVec &kvec) const
double	Kernel (const double value) const
Private Attributes
unsigned int	fNAbortFind
unsigned int	fNTrackMiss
unsigned int	fNTrackFill
unsigned int	fNEventMiss
unsigned int	fNEventFill
std::string	fDirName
std::string	fFilePath
int	fMaxNEvent
int	fKeyBase
int	fKeySignal
int	fKeyTruth
int	fTrimDelta
unsigned int	fKNeighbor
unsigned int	fKNeighborMod
bool	fAddAll
bool	fAddEvent
bool	fCreateNew
bool	fPrint
bool	fRegression
bool	fTrim
bool	fUseKernel
bool	fUseTrack
Lit::LikeModule *	fModule
ShortVec	fKeys
ShortVec	fTgts
ShortVec	fTypes
ShortMap	fCount

---

Member Typedef Documentation

typedef std::map<short, int> Anp::FillkNN::ShortMap [private]

Definition at line 58 of file FillkNN.h.

typedef std::vector<short> Anp::FillkNN::ShortVec [private]

Definition at line 57 of file FillkNN.h.

---

Constructor & Destructor Documentation

Anp::FillkNN::FillkNN (   )

Definition at line 33 of file FillkNN.cxx. :fNAbortFind(0), fNTrackMiss(0), fNTrackFill(0), fNEventMiss(0), fNEventFill(0), fDirName("fill_knn"), fFilePath(), fMaxNEvent(0), fKeyBase(5200), fKeySignal(1), fKeyTruth(7000), fTrimDelta(0), fKNeighbor(81), fKNeighborMod(20), fAddAll(false), fAddEvent(true), fCreateNew(false), fPrint(false), fRegression(false), fTrim(true), fUseKernel(false), fUseTrack(true), fModule(0) { }

Anp::FillkNN::~FillkNN (   )  [virtual]

Definition at line 61 of file FillkNN.cxx. References fModule. { if(fModule) { delete fModule; fModule = 0; } }

---

Member Function Documentation

void Anp::FillkNN::Config (  const Registry &  reg  )  [virtual]

Reimplemented from Anp::AlgEvent. Definition at line 266 of file FillkNN.cxx. References fAddAll, fAddEvent, fCreateNew, fDirName, fFilePath, fKeyBase, fKeys, fKeySignal, fKeyTruth, fKNeighbor, fKNeighborMod, fMaxNEvent, fPrint, fRegression, fTgts, fTrim, fTrimDelta, fUseKernel, fUseTrack, Registry::Get(), Registry::KeyExists(), Anp::Read(), and reg. { // // Configure self // fKeys = Anp::ReadList<short>(reg, "FillkNNKeyList", ", "); fTgts = Anp::ReadList<short>(reg, "FillkNNTgtList", ", "); // // Read TDirectory name from Registry OR create name from list of keys // Anp::Read(reg, "FillkNNFilePath", fFilePath); Anp::Read(reg, "FillkNNDirName", fDirName); if((fDirName == "fill_knn" || fDirName.empty()) && !fKeys.empty()) { // // Make directory name based on input list of keys // stringstream dname; dname << "knn"; for(ShortVec::const_iterator it = fKeys.begin(); it != fKeys.end(); ++it) { dname << "_" << *it; } fDirName = dname.str(); } // // Read "int" Registry keys, if exist, directly to internal variables // reg.Get("FillkNNMaxNEvent", fMaxNEvent); reg.Get("FillkNNKeyBase", fKeyBase); reg.Get("FillkNNKeySignal", fKeySignal); reg.Get("FillkNNKeyTruth", fKeyTruth); reg.Get("FillkNNTrimDelta", fTrimDelta); int value_int = 0; if(reg.Get("FillkNNKNeighbor", value_int) && value_int >= 0) { fKNeighbor = static_cast<unsigned int>(value_int); } value_int = 0; if(reg.Get("FillkNNKNeighborMod", value_int) && value_int > 0) { fKNeighborMod = static_cast<unsigned int>(value_int); } // // Read "bool" Registry keys, if exist, directly to internal variables // Anp::Read(reg, "FillkNNAddAll", fAddAll); Anp::Read(reg, "FillkNNAddEvent", fAddEvent); Anp::Read(reg, "FillkNN", fCreateNew); Anp::Read(reg, "FillkNNPrint", fPrint); Anp::Read(reg, "FillkNNRegression", fRegression); Anp::Read(reg, "FillkNNTrim", fTrim); Anp::Read(reg, "FillkNNUseKernel", fUseKernel); Anp::Read(reg, "FillkNNUseTrack", fUseTrack); if(reg.KeyExists("PrintConfig")) { cout << "FillkNN::Config" << endl; Anp::PrintList<short>(" KeyList", fKeys); Anp::PrintList<short>(" TgtList", fTgts); cout << " DirName = " << fDirName << endl << " FilePath = " << fFilePath << endl << " MaxNEvent = " << fMaxNEvent << endl << " KeyBase = " << fKeyBase << endl << " KeySignal = " << fKeySignal << endl << " KeyTruth = " << fKeyTruth << endl << " KNeighbor = " << fKNeighbor << endl << " KNeighborMod = " << fKNeighborMod << endl << " AddAll = " << fAddAll << endl << " AddEvent = " << fAddEvent << endl << " CreateNew = " << fCreateNew << endl << " Print = " << fPrint << endl << " Regression = " << fRegression << endl << " Trim = " << fTrim << endl << " TrimDelta = " << fTrimDelta << endl << " UseKernel = " << fUseKernel << endl << " UseTrack = " << fUseTrack << endl; } // // Delete previous kNN module // if(fModule) { delete fModule; } }

void Anp::FillkNN::End (  const DataBlock &   )  [virtual]

Reimplemented from Anp::AlgEvent. Definition at line 462 of file FillkNN.cxx. References fDirName, fFilePath, Fill(), fModule, fNAbortFind, fNEventFill, fNEventMiss, fNTrackFill, fNTrackMiss, and Get(). { if(fModule && fCreateNew) { TFile *file = TFile::Open(fFilePath.c_str(), "UPDATE"); if(file && file -> IsOpen()) { // trim option counts number of events of each type // and trims each event class to have the same // number of events // 7 is number of kd-tree levels that are filled with empty events // in order to optimize kd-tree search algorithm if(fTrim) { fModule -> Fill(7, "trim"); } else { fModule -> Fill(7, ""); } cout << "FillkNN::End - writing prototype to\n " << fFilePath << ":" << fDirName << endl; if(file -> Get(fDirName.c_str())) { const string delname = fDirName + ";1"; file -> Delete(delname.c_str()); cout << "FillkNN::End - deleted TDirectory " << delname << endl; } fModule -> Write(file -> mkdir(fDirName.c_str())); file -> Write(); file -> Close(); } } if(fModule) { delete fModule; fModule = 0; } cout << " NAbortFind = " << fNAbortFind << endl << " NTrackMiss = " << fNTrackMiss << endl << " NTrackFill = " << fNTrackFill << endl << " NEventMiss = " << fNEventMiss << endl << " NEventFill = " << fNEventFill << endl; }

bool Anp::FillkNN::Fill (  DataIter  beg, DataIter  end, double  weight )  [private]

Definition at line 516 of file FillkNN.cxx. References Anp::Data, Anp::DataIter, fCount, find(), fKeys, fKeyTruth, fModule, fTgts, fTrim, and fTrimDelta. Referenced by End(), and Init(). { // // Add variables for new protype // if(!fModule) { cerr << "FillkNN::Fill - knn module does not exist" << endl; return false; } short etype = 0; if(!fRegression) { assert(fKeyTruth < SHRT_MAX && "int to short overflow"); const DataIter fit = std::find(beg, end, static_cast<short>(fKeyTruth)); if(fit == end) { return false; } assert(fit -> Data() < SHRT_MAX && "int to short overflow"); etype = static_cast<short>(fit -> Data()); if(fTrim && fTrimDelta > 0) { // // Get iterator to current event type // ShortMap::iterator cur_it = fCount.insert(ShortMap::value_type(etype, 0)).first; // // Find event type with minimum number of entries // ShortMap::const_iterator min_it = fCount.end(); for(ShortMap::const_iterator cit = fCount.begin(); cit != fCount.end(); ++cit) { if(min_it == fCount.end()) { min_it = cit; } else if(cit -> second < min_it -> second) { min_it = cit; } } if(min_it != fCount.end() && cur_it -> second > fTrimDelta + min_it -> second) { return false; } ++(cur_it -> second); } } const vector<float> dvec = FillkNN::Get(beg, end, fKeys); const vector<float> tvec = FillkNN::Get(beg, end, fTgts); if(dvec.size() != fKeys.size()) { return false; } fModule -> Add(Lit::Event(dvec, weight, etype, tvec)); return true; }

const Anp::DataVec Anp::FillkNN::Find (  DataIter  beg, DataIter  end, short  keybase )  const [private]

Definition at line 589 of file FillkNN.cxx. References count, Anp::Data, Anp::DataVec, find(), fKeys, fKNeighbor, fKNeighborMod, fModule, fTypes, Lit::Event::GetNTgt(), Lit::Event::GetTgt(), Lit::Node::GetType(), Lit::Node::GetWeight(), Lit::Event::GetWeight(), and Lit::LikeModule::Print(). { // // Find knn and fill classification variables // DataVec dvec; if(!fModule) { cerr << "FillkNN::Fill - knn module does not exist" << endl; return dvec; } // // !!!KLUDGE!!! Stop now if knn radius already exists // if(std::find(dvec.begin(), dvec.end(), keybase) != dvec.end()) { ++fNAbortFind; return dvec; } // // Read all required input variables // const vector<float> kvec = FillkNN::Get(beg, end, fKeys); if(kvec.size() != fKeys.size()) { return dvec; } fModule -> Find(Lit::Event(kvec, 1.0, 0), fKNeighbor); if(fPrint) { cout << "Printing kNN result for key " << keybase << endl; fModule -> GetResult().Print(); } const Lit::List &rlist = fModule -> GetResult().GetList(); if(rlist.empty()) { cerr << "FillkNN::Find - kNN result list is empty" << endl; return dvec; } if(fRegression) { double totalw = 0.0; unsigned int icount = 0; vector<double> tvec; for(Lit::List::const_iterator lit = rlist.begin(); lit != rlist.end(); ++lit) { const Lit::Event &event_ = lit->first->GetEvent(); ++icount; totalw += event_.GetWeight(); if(tvec.empty()) { tvec.insert(tvec.end(), event_.GetNTgt(), 0.0); } if(event_.GetNTgt() < 1) { cerr << "FillkNN::Find - target list is empty" << endl; } for(unsigned int ivar = 0; ivar < event_.GetNTgt(); ++ivar) { tvec[ivar] += event_.GetTgt(ivar)*event_.GetWeight(); } // // Continue to next event when modulus is not zero... // if(icount % fKNeighborMod != 0) continue; // // Check total weight sum // if(!(totalw > 0.0)) { cerr << "FillkNN::Find - non positive total weight" << endl; continue; } if(fPrint) { cout << "FillkNN::Find - saving regression result for icount = " << icount << endl; } for(unsigned int ivar = 0; ivar < tvec.size(); ++ivar) { dvec.push_back(Anp::Data(keybase + icount + ivar, tvec[ivar]/totalw)); } } } else { double totalw = 0.0; unsigned int count = 0; map<short, double> pmap; for(Lit::List::const_iterator lit = rlist.begin(); lit != rlist.end(); ++lit) { const Lit::Node &node = *(lit -> first); // // ignore Monte-Carlo event with zero distance (probably same event) // if(!(lit -> second > 0.0)) continue; // // Count weight for each truth category // map<short, double>::iterator pit = pmap.insert(map<short, double>::value_type(node.GetType(), 0.0)).first; pit -> second += node.GetWeight(); totalw += node.GetWeight(); ++count; // // Continue to next event when modulus is not zero... // if(count % fKNeighborMod != 0) continue; if(!(totalw > 0.0)) { cerr << "FillkNN::Find - non positive total weight" << endl; continue; } // // Add knn probability value // for(ShortVec::const_iterator itype = fTypes.begin(); itype != fTypes.end(); ++itype) { const short type = *itype; double prob = 0.0; map<short, double>::const_iterator pit = pmap.find(type); if(pit != pmap.end()) { prob = (pit -> second)/totalw; } if(fAddAll) { dvec.push_back(Anp::Data(keybase + count + type, prob)); } else if(type == fKeySignal) { dvec.push_back(Anp::Data(keybase + count, prob)); } } } // // Add radius of knn neighborhood // dvec.push_back(Anp::Data(keybase, std::sqrt(rlist.back().second))); } return dvec; }

const vector< float > Anp::FillkNN::Get (  DataIter  beg, DataIter  end, const ShortVec &  kvec )  const [private]

Definition at line 817 of file FillkNN.cxx. References Anp::Data, Anp::DataIter, find(), fPrint, and Anp::Corr::Key. Referenced by End(), and Init(). { // extract data with keys matching keys stored in ShortVec kvec // these data elements are first stored in a map to make sure // that data is sorted using keys - thus removing the dependency // on the order in which keys are stored in DataVec, with range // delimited by beg and end iterators map<short, float> fmap; for(DataIter dit = beg; dit != end; ++dit) { if(find(kvec.begin(), kvec.end(), dit -> Key()) != kvec.end()) { if(!fmap.insert(map<short, float>::value_type(dit -> Key(), dit -> Data())).second) { cerr << "FillkNN::Get - failed to add data due to duplicate key" << endl; } } } if(fPrint && !kvec.empty() && fmap.size() != kvec.size()) { cout << "FillkNN::Get - failed to read all keys" << endl; for(unsigned int i = 0; i < kvec.size(); ++i) { map<short, float>::const_iterator fit = fmap.find(kvec[i]); if(fit != fmap.end()) { cout << " (key, data) = (" << kvec[i] << ", " << fit -> second << ")" << endl; } else { cout << " (key, data) = (" << kvec[i] << ", unknown)" << endl; } } } vector<float> fvec; for(map<short, float>::const_iterator it = fmap.begin(); it != fmap.end(); ++it) { fvec.push_back(it -> second); } return fvec; }

bool Anp::FillkNN::Init (  const Header &   )  [virtual]

Reimplemented from Anp::AlgSnarl. Definition at line 365 of file FillkNN.cxx. References fDirName, fFilePath, Fill(), find(), fMaxNEvent, fModule, fTypes, Get(), and Anp::Read(). { // // Configure self and (maybe) create new kNN classification module // if(fModule) { cerr << "FillkNN::Init - knn module already exists" << endl; return true; } else { fModule = new Lit::LikeModule(); } // // Do not read file when creating new knn prototype // if(fCreateNew) return true; cout << "FillkNN::Init - attempting to read prototype from:\n " << fFilePath << ":" << fDirName << endl; TFile *file = TFile::Open(fFilePath.c_str(), "READ"); if(!file || !(file -> IsOpen())) { cerr << "FillkNN::Init - failed to open ROOT file" << endl; return false; } // // Get TDirectory from file // TDirectory *dir = dynamic_cast<TDirectory *>(file -> Get(fDirName.c_str())); if(dir && fModule -> Read(dir, fMaxNEvent)) { // with metric option variables are rescaled to same width // 7 is number of kd-tree levels that are used to split // variables // // Get keys for stored events (eg background=0 and signal=1, etc) // const Lit::EventVec &evec = fModule -> GetEventVec(); for(Lit::EventVec::const_iterator it = evec.begin(); it != evec.end(); ++it) { if(std::find(fTypes.begin(), fTypes.end(), it -> GetType()) == fTypes.end()) { fTypes.push_back(it -> GetType()); } } std::sort(fTypes.begin(), fTypes.end()); for(unsigned int i = 0; i < fTypes.size(); ++i) { if(i == 0) { cout << "FillkNN::Init - prototypes: "; } if(i + 1 != fTypes.size()) { cout << fTypes[i] << ", "; } else { cout << fTypes[i] << endl; } } if(fTrim) { fModule -> Fill(7, "metric trim erase"); } else { fModule -> Fill(7, "metric erase"); } } else { cerr << "FillkNN::Init - failed to read LikeModule" << endl; delete fModule; fModule = 0; } // // Close ROOT file which was opened for reading // file -> Close(); return true; }

double Anp::FillkNN::Kernel (  const double  value  )  const [private]

Definition at line 867 of file FillkNN.cxx. Referenced by PidKer(). { // // return distance using unit normalize kernel: 15*(1-x*x)^2 // const double avalue = std::fabs(value); if(!(avalue < 1.0)) { return 0.0; } const double prod = 1.0 - avalue*avalue; return 15.0*prod*prod/16.0; }

double Anp::FillkNN::PidKer (  Lit::List::const_iterator  beg, Lit::List::const_iterator  end )  const [private]

Definition at line 761 of file FillkNN.cxx. References Lit::Node::GetType(), Lit::Node::GetWeight(), and Kernel(). { // // // double maxradius = -1.0; for(Lit::List::const_iterator lit = beg; lit != end; ++lit) { if(maxradius < lit -> second) { maxradius = lit -> second; } } if(!(maxradius > 0.0)) { cerr << "FillkNN::PidKer - maximum radius is not positive" << endl; return -100.0; } maxradius = 1.0/std::sqrt(maxradius); double count_signal = 0.0, count_all = 0.0; for(Lit::List::const_iterator lit = beg; lit != end; ++lit) { const Lit::Node &node = *(lit -> first); const double weight = Kernel(std::sqrt(lit -> second)*maxradius) * node.GetWeight(); if(weight < 0.0) { cerr << "FillkNN::PidKer - negative event weight " << weight << endl; continue; } count_all += weight; if(node.GetType() == fKeySignal) { count_signal += weight; } } if(count_all > 0.0) { return count_signal/count_all; } cerr << "FillkNN:: PidKer - total event count is not positive" << endl; return -100.0; }

bool Anp::FillkNN::Run (  Event &  event, const Record &  record, bool  pass )  [virtual]

Implements Anp::AlgEvent. Definition at line 184 of file FillkNN.cxx. References Anp::Event::Add(), Anp::Data, Anp::Event::DataBeg(), Anp::Event::DataEnd(), Anp::DataVec, Lit::Find(), fKeyBase, Anp::Corr::Key, Anp::LongestTrack(), Anp::Record::TrackEnd(), Anp::TrackIter, and Anp::Event::Weight(). { // // Compute kNN variable for events // if(!pass || !fModule) return true; if(fUseTrack) { const TrackIter track = Anp::LongestTrack(event, record); if(track == record.TrackEnd()) { return true; } if(fCreateNew) { if(FillkNN::Fill(track -> DataBeg(), track -> DataEnd(), event.Weight())) { ++fNTrackFill; } else { ++fNTrackMiss; } } else { const DataVec dvec = FillkNN::Find(track -> DataBeg(), track -> DataEnd(), fKeyBase); if(dvec.empty()) { ++fNTrackMiss; } else { ++fNTrackFill; } for(DataVec::const_iterator dit = dvec.begin(); dit != dvec.end(); ++dit) { event.Add(dit -> Key(), dit -> Data()); } } } else { if(fCreateNew) { if(FillkNN::Fill(event.DataBeg(), event.DataEnd(), event.Weight())) { ++fNEventFill; } else { ++fNEventMiss; } } else { const DataVec dvec = FillkNN::Find(event.DataBeg(), event.DataEnd(), fKeyBase); if(dvec.empty()) { ++fNEventMiss; } else { ++fNEventFill; } for(DataVec::const_iterator dit = dvec.begin(); dit != dvec.end(); ++dit) { event.Add(dit -> Key(), dit -> Data()); } } } return true; }

bool Anp::FillkNN::Run (  Record &  record  )  [virtual]

Implements Anp::AlgSnarl. Definition at line 71 of file FillkNN.cxx. References Anp::Data, Anp::DataVec, Anp::Record::EventBegIterator(), Anp::Record::EventEndIterator(), Anp::EventIterator, fCreateNew, Lit::Find(), fKeyBase, Anp::Corr::Key, Anp::LongestTrack(), Anp::Record::TrackBegIterator(), Anp::Record::TrackEnd(), Anp::Record::TrackEndIterator(), Anp::TrackIter, and Anp::TrackIterator. { // // Compute kNN variable for events and/or tracks // if(!fModule) return true; map<short, const DataVec> dmap; if(fUseTrack) { for(TrackIterator itrack = record.TrackBegIterator(); itrack != record.TrackEndIterator(); ++itrack) { if(fCreateNew) { if(FillkNN::Fill(itrack -> DataBeg(), itrack -> DataEnd(), itrack -> Weight())) { ++fNTrackFill; } else { ++fNTrackMiss; } } else { const DataVec dvec = FillkNN::Find(itrack -> DataBeg(), itrack -> DataEnd(), fKeyBase); if(dvec.empty()) { ++fNTrackMiss; } else { ++fNTrackFill; } for(DataVec::const_iterator dit = dvec.begin(); dit != dvec.end(); ++dit) { itrack -> Add(dit -> Key(), dit -> Data()); } if(!dmap.insert(map<short, const DataVec>::value_type(itrack -> TrackIndex(), dvec)).second) { cerr << "FillkNN::Run - duplicate track index " << itrack -> TrackIndex() << endl; } } } } for(EventIterator event = record.EventBegIterator(); event != record.EventEndIterator(); ++event) { if(fUseTrack) { if(!fCreateNew && fAddEvent) { const TrackIter track = Anp::LongestTrack(*event, record); if(track == record.TrackEnd()) { continue; } const map<short, const DataVec>::const_iterator dit = dmap.find(track -> TrackIndex()); if(dit == dmap.end()) { cerr << "FillkNN::Run - failed to find track index " << track -> TrackIndex() << endl; continue; } const DataVec &dvec = dit -> second; for(DataVec::const_iterator dit = dvec.begin(); dit != dvec.end(); ++dit) { event -> Add(dit -> Key(), dit -> Data()); } } } else if(fCreateNew) { if(FillkNN::Fill(event -> DataBeg(), event -> DataEnd(), event -> Weight())) { ++fNEventFill; } else { ++fNEventMiss; } } else { const DataVec dvec = FillkNN::Find(event -> DataBeg(), event -> DataEnd(), fKeyBase); if(dvec.empty()) { ++fNEventMiss; } else { ++fNEventFill; } for(DataVec::const_iterator dit = dvec.begin(); dit != dvec.end(); ++dit) { event -> Add(dit -> Key(), dit -> Data()); } } } return true; }

---

Member Data Documentation

bool Anp::FillkNN::fAddAll [private]

Definition at line 92 of file FillkNN.h. Referenced by Config().

bool Anp::FillkNN::fAddEvent [private]

Definition at line 93 of file FillkNN.h. Referenced by Config().

ShortMap Anp::FillkNN::fCount [private]

Reimplemented from Anp::Base. Definition at line 106 of file FillkNN.h. Referenced by Fill().

bool Anp::FillkNN::fCreateNew [private]

Definition at line 94 of file FillkNN.h. Referenced by Config(), and Run().

std::string Anp::FillkNN::fDirName [private]

Definition at line 80 of file FillkNN.h. Referenced by Config(), End(), and Init().

std::string Anp::FillkNN::fFilePath [private]

Definition at line 81 of file FillkNN.h. Referenced by Config(), End(), and Init().

int Anp::FillkNN::fKeyBase [private]

Definition at line 84 of file FillkNN.h. Referenced by Config(), and Run().

ShortVec Anp::FillkNN::fKeys [private]

Definition at line 103 of file FillkNN.h. Referenced by Config(), Fill(), and Find().

int Anp::FillkNN::fKeySignal [private]

Definition at line 85 of file FillkNN.h. Referenced by Config().

int Anp::FillkNN::fKeyTruth [private]

Definition at line 86 of file FillkNN.h. Referenced by Config(), and Fill().

unsigned int Anp::FillkNN::fKNeighbor [private]

Definition at line 89 of file FillkNN.h. Referenced by Config(), and Find().

unsigned int Anp::FillkNN::fKNeighborMod [private]

Definition at line 90 of file FillkNN.h. Referenced by Config(), and Find().

int Anp::FillkNN::fMaxNEvent [private]

Definition at line 83 of file FillkNN.h. Referenced by Config(), and Init().

Lit::LikeModule* Anp::FillkNN::fModule [private]

Definition at line 101 of file FillkNN.h. Referenced by End(), Fill(), Find(), Init(), and ~FillkNN().

unsigned int Anp::FillkNN::fNAbortFind [mutable, private]

Definition at line 74 of file FillkNN.h. Referenced by End().

unsigned int Anp::FillkNN::fNEventFill [private]

Definition at line 78 of file FillkNN.h. Referenced by End().

unsigned int Anp::FillkNN::fNEventMiss [private]

Definition at line 77 of file FillkNN.h. Referenced by End().

unsigned int Anp::FillkNN::fNTrackFill [private]

Definition at line 76 of file FillkNN.h. Referenced by End().

unsigned int Anp::FillkNN::fNTrackMiss [private]

Definition at line 75 of file FillkNN.h. Referenced by End().

bool Anp::FillkNN::fPrint [private]

Definition at line 95 of file FillkNN.h. Referenced by Config(), and Get().

bool Anp::FillkNN::fRegression [private]

Definition at line 96 of file FillkNN.h. Referenced by Config().

ShortVec Anp::FillkNN::fTgts [private]

Definition at line 104 of file FillkNN.h. Referenced by Config(), and Fill().

bool Anp::FillkNN::fTrim [private]

Definition at line 97 of file FillkNN.h. Referenced by Config(), and Fill().

int Anp::FillkNN::fTrimDelta [private]

Definition at line 87 of file FillkNN.h. Referenced by Config(), and Fill().

ShortVec Anp::FillkNN::fTypes [private]

Definition at line 105 of file FillkNN.h. Referenced by Find(), and Init().

bool Anp::FillkNN::fUseKernel [private]

Definition at line 98 of file FillkNN.h. Referenced by Config().

bool Anp::FillkNN::fUseTrack [private]

Definition at line 99 of file FillkNN.h. Referenced by Config().

---

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

• FillkNN.h
• FillkNN.cxx

---