/usr/include/root/TMVA/BinaryTree.h is in libroot-tmva-dev 5.34.30-0ubuntu8.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 | // @(#)root/tmva $Id$
// Author: Andreas Hoecker, Joerg Stelzer, Helge Voss, Kai Voss, Eckhard von Toerne
/**********************************************************************************
* Project: TMVA - a Root-integrated toolkit for multivariate data analysis *
* Package: TMVA *
* Class : BinaryTree *
* Web : http://tmva.sourceforge.net *
* *
* Description: *
* BinaryTree: A base class for BinarySearch- or Decision-Trees *
* *
* Authors (alphabetical): *
* Andreas Hoecker <Andreas.Hocker@cern.ch> - CERN, Switzerland *
* Helge Voss <Helge.Voss@cern.ch> - MPI-K Heidelberg, Germany *
* Kai Voss <Kai.Voss@cern.ch> - U. of Victoria, Canada *
* Eckhard v. Toerne <evt@uni-bonn.de> - U of Bonn, Germany *
* *
* Copyright (c) 2005-2011: *
* CERN, Switzerland *
* U. of Victoria, Canada *
* MPI-K Heidelberg, Germany *
* U. of Bonn, Germany *
* *
* Redistribution and use in source and binary forms, with or without *
* modification, are permitted according to the terms listed in LICENSE *
* (http://tmva.sourceforge.net/LICENSE) *
**********************************************************************************/
#ifndef ROOT_TMVA_BinaryTree
#define ROOT_TMVA_BinaryTree
#ifndef ROOT_TMVA_Version
#include "TMVA/Version.h"
#endif
//////////////////////////////////////////////////////////////////////////
// //
// BinaryTree //
// //
// Base class for BinarySearch and Decision Trees //
// //
//////////////////////////////////////////////////////////////////////////
#include <iosfwd>
#ifndef ROOT_TROOT
#include "TROOT.h"
#endif
#ifndef ROOT_TMVA_Node
#include "TMVA/Node.h"
#endif
// -----------------------------------------------------------------------------
// the actual tree class
// Handles allocation, deallocation, and sorting of nodes.
// the Tree consists of a "root-node" wich might have 0 to 2 daughther nodes
namespace TMVA {
class BinaryTree;
class MsgLogger;
std::ostream& operator<< ( std::ostream& os, const BinaryTree& tree );
std::istream& operator>> ( std::istream& istr, BinaryTree& tree );
class BinaryTree {
friend std::ostream& operator<< ( std::ostream& os, const BinaryTree& tree );
friend std::istream& operator>> ( std::istream& istr, BinaryTree& tree );
public:
// or a tree with Root node "n", any daughters of this node are automatically in the tree
BinaryTree( void );
virtual ~BinaryTree();
virtual Node* CreateNode(UInt_t size=0) const = 0;
virtual BinaryTree* CreateTree() const = 0;
// virtual BinaryTree* CreateFromXML(void* node, UInt_t tmva_Version_Code = TMVA_VERSION_CODE) = 0;
virtual const char* ClassName() const = 0;
// set the root node of the tree
void SetRoot( Node* r ) { fRoot = r; }
// Retrieves the address of the root node
virtual Node* GetRoot() const { return fRoot; }
// get number of Nodes in the Tree as counted while booking the nodes;
UInt_t GetNNodes() const { return fNNodes; }
// count the number of Nodes in the Tree by looping through the tree and updates
// the stored number. (e.g. useful when pruning, as the number count is updated when
// building the tree.
UInt_t CountNodes( Node* n = NULL );
UInt_t GetTotalTreeDepth() const { return fDepth; }
void SetTotalTreeDepth( Int_t depth ) { fDepth = depth; }
void SetTotalTreeDepth( Node* n = NULL );
Node* GetLeftDaughter ( Node* n);
Node* GetRightDaughter( Node* n);
virtual void Print( std::ostream& os ) const;
virtual void Read ( std::istream& istr, UInt_t tmva_Version_Code = TMVA_VERSION_CODE );
virtual void* AddXMLTo(void* parent) const;
virtual void ReadXML(void* node, UInt_t tmva_Version_Code = TMVA_VERSION_CODE );
private:
protected:
Node* fRoot; //the root node of the tree
// the tree only has it's root node, the "daughters" are taken car
// of by the "node" properties of the "root"
// delete a node (and the corresponding event if owned by the tree)
void DeleteNode( Node* );
UInt_t fNNodes; // total number of nodes in the tree (counted)
UInt_t fDepth; // maximal depth in tree reached
static MsgLogger* fgLogger; // message logger, static to save resources
MsgLogger& Log() const { return *fgLogger; }
ClassDef(BinaryTree,0) // Base class for BinarySearch and Decision Trees
};
} // namespace TMVA
#endif
|