25 namespace QwTracking {
42 for (
unsigned int i = 0; i <
fSize; i++)
fBit[i] = 0;
45 for (
int i = 0; i < 4; i++)
64 std::string indentation;
65 for (
int i = 0; i < indent; i++) indentation +=
" ";
68 for (
unsigned int i = 0; i <
fSize; i++) {
70 for (
int j = 0; j < (1 << (
fMinLevel + 1)); j++) {
78 for (
int i = 0; recursive && i < 4; i++) {
81 QwOut << indentation <<
"son " << i <<
": ";
82 node->
Print(recursive,indent+1);
95 stream <<
"(" << st.
fMinLevel <<
"," <<
"*" <<
") ";
96 for (
unsigned int i = 0; i < st.
fSize; i++)
97 stream << st.
fBit[i] <<
",";
98 stream <<
" width = " << st.
fWidth;
unsigned int size() const
Get size of the bit array.
int * fBit
Hit pattern, one bin specified per detector layer.
#define QwOut
Predefined log drain for explicit output.
static unsigned int fDefaultSize
Default size.
int fWidth
Width in bins of the hit pattern.
void Print(bool recursive=false, int indent=0)
Print some debugging information.
int fMinLevel
Minimum level at which this node is valid.
A logfile class, based on an identical class in the Hermes analyzer.
shortnode * son[4]
Each tree has four son nodes.
Definition of a shortnode, the short version of a nodenode.
static std::ostream & endl(std::ostream &)
End of the line.
shorttree(unsigned int size=fDefaultSize)
Default constructor.
std::ostream & operator<<(std::ostream &stream, const shortnode &sn)
void Print(bool recursive=false, int indent=0)
Print some debugging information.
static int fDebug
Debug level.