#include <node.h>
Definition at line 24 of file node.h.
◆ TYPE
| Enumerator |
|---|
| HISTOGRAM | |
| DIRECTORY | |
| DUFF | |
Definition at line 28 of file node.h.
◆ node()
| node::node |
( |
node * | n = 0, |
|
|
const std::string & | d = "", |
|
|
TObject * | t = 0 ) |
|
inline |
Definition at line 32 of file node.h.
32 :
34 if ( t!=0 )
mname =
t->GetName();
35 mhirate = std::pair<std::string, double>(
"", 0);
36 }
std::pair< std::string, double > mhirate
◆ ~node()
◆ addrate() [1/2]
| void node::addrate |
( |
const std::pair< std::string, double > & | r | ) |
|
|
inline |
◆ addrate() [2/2]
| void node::addrate |
( |
const std::string & | s, |
|
|
double | r ) |
|
inline |
Definition at line 63 of file node.h.
63 {
64 addrate( std::pair<std::string, double>( s,
r ) );
65 }
void addrate(const std::string &s, double r)
◆ depth()
| const std::string & node::depth |
( |
| ) |
const |
|
inline |
◆ name() [1/2]
| const std::string & node::name |
( |
| ) |
const |
|
inline |
◆ name() [2/2]
| void node::name |
( |
const std::string & | n | ) |
|
|
inline |
◆ object() [1/2]
| TObject * node::object |
( |
| ) |
|
|
inline |
◆ object() [2/2]
| const TObject * node::object |
( |
| ) |
const |
|
inline |
◆ parent() [1/2]
◆ parent() [2/2]
◆ path() [1/2]
| const std::string & node::path |
( |
| ) |
const |
|
inline |
◆ path() [2/2]
| void node::path |
( |
const std::string & | p | ) |
|
|
inline |
◆ rate()
| const std::pair< std::string, double > & node::rate |
( |
| ) |
const |
|
inline |
◆ stype()
| std::string node::stype |
( |
| ) |
const |
|
inline |
Definition at line 54 of file node.h.
54 {
57 return "DUFF";
58 };
virtual TYPE type() const
◆ type() [1/2]
| virtual TYPE node::type |
( |
| ) |
const |
|
inlinevirtual |
◆ type() [2/2]
| void node::type |
( |
TYPE | t | ) |
|
|
inline |
◆ elements
| T std::vector< T >::elements |
|
inherited |
◆ mdepth
◆ mhirate
| std::pair<std::string, double> node::mhirate |
◆ mname
◆ mobj
◆ mparent
◆ mpath
◆ mtype
The documentation for this class was generated from the following file: