QwAnalysis
|
This module contains the code for performing the treesearch algorithm to generate one treeline. More...
#include "QwTrackingTreeSearch.h"
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cassert>
#include <cstring>
#include <iostream>
#include "QwLog.h"
#include "QwOptions.h"
#include "globals.h"
#include "QwHit.h"
#include "QwDetectorInfo.h"
#include "QwTreeLine.h"
#include "QwTrackingTreeRegion.h"
#include "shortnode.h"
#include "shorttree.h"
Go to the source code of this file.
Functions | |
static int | hashgen (void) |
Variables | |
static int | _hashgen = 1 |
This module contains the code for performing the treesearch algorithm to generate one treeline.
-----------------------------------------------------------------------—*\
PROGRAM: QTR (Qweak Track Reconstruction) AUTHOR: Burnham Stokes besto ORIGINAL HRC AUTHOR Wolfgang Wander kes@ jlab. orgwwc@h erme s.des y.de
MODULE: QwTrackingTreeSearch.c COMMENTS: Brendan Fox foxb@ herm es.de sy.d e
PURPOSE: This module contains the code for performing the treesearch algorithm to generate one treeline. The code first use the hit information for the planes to construct the bit pattern for each tree-planes. Then, it searches through the treesearch database and identifies each treenode in the database which is present in the bit patterns for the tree-planes. These treenodes are then used to generate the link-listed of possible treelines.
CONTENTS: (brief description for now)
(01) wireselection() - this function is called by TsSetPoints. It steps through the hits from the unprimed and primed planes for a tree-plane to decide whether hits should or should not be paired together when the hit pattern for the tree-plane is constructed.
(02) _setpoints() - this function sets the bins in a hit pattern for a range of positions. The range of hit patterns is specified by a start and a stop position in the detector. This function turns on the bins in the hit pattern for each level of the bin-division used in the treesearch algorithm.
(03) _setpoint() - this function sets the bins in the hit pattern for a range of positions around a central point within a specified distance/resolution by calling the _setpoints() function.
(04) setpoint() - this function sets the bins in the hit pattern for a range of positions specified by a center point and a half-distance around the center point by calling the setpoint() function.
(05) TsSetPoint() - this function sets the bins in the hit pattern for a range of positions around a central point within a specified distance/resolution. This function turns on the bins in the hit pattern for each level of the bin-division in the treesearch algorithm.
(06) exists() - this function searches through the link-list of valid treelines to see if the bit pattern for the specified treenode has already been accepted as a valid treeline.
(07) _SearchTreeLines() - this highly recursive function implements the treesearch algorithm. For a specified list of nodenodes, this function examines the attached treenode. If the bit pattern in the treenode does not match the bit pattern from the event, the function looks at the next nodenode. Otherwise, the function will call itself to see if any of the sons of this treenode at the next level of bin-division match the bit pattern from the event. This recursive calling will continue until a treenode at the deepest level of bin-division is located inside the bit pattern from the event. Since the pattern in this treenode is represents a valid treeline for the event, a treeline is constructed from the treenode and then appended to the linked list of treelines being accumulated by the treesearch.
(08) SearchTreeLines() - this function initiates the treesearch for a set of tree-planes by calling the _SearchTreeLines() function described above.
Definition in file QwTrackingTreeSearch.cc.
|
static |
Definition at line 133 of file QwTrackingTreeSearch.cc.
References _hashgen.
Referenced by QwTrackingTreeSearch::_setpoints().
|
static |
Definition at line 131 of file QwTrackingTreeSearch.cc.
Referenced by hashgen().