Findlet for constructing result paths out of a list of states, which are connected with weighted relations.
More...
|
| TreeSearcher () |
| Construct this findlet and add the subfindlet as listener.
|
|
void | exposeParameters (ModuleParamList *moduleParamList, const std::string &prefix) final |
| Expose the parameters of the subfindlet.
|
|
void | apply (const std::vector< AState > &seededStates, std::vector< AState > &hitStates, const std::vector< TrackFindingCDC::WeightedRelation< AState >> &relations, std::vector< AResult > &results) final |
| Main function of this findlet: traverse a tree starting from a given seed states. More...
|
|
virtual std::string | getDescription () |
| Brief description of the purpose of the concret findlet.
|
|
virtual void | apply (ToVector< AIOTypes > &... ioVectors)=0 |
| Main function executing the algorithm.
|
|
void | initialize () override |
| Receive and dispatch signal before the start of the event processing.
|
|
void | beginRun () override |
| Receive and dispatch signal for the beginning of a new run.
|
|
void | beginEvent () override |
| Receive and dispatch signal for the start of a new event.
|
|
void | endRun () override |
| Receive and dispatch signal for the end of the run.
|
|
void | terminate () override |
| Receive and dispatch Signal for termination of the event processing.
|
|
template<class AState, class AStateRejecter, class AResult>
class Belle2::TreeSearcher< AState, AStateRejecter, AResult >
Findlet for constructing result paths out of a list of states, which are connected with weighted relations.
At each step, the states are again tested using a state rejector, which also knows the current path of states.
This rejector is allowed to alter the states, so using a cellular automaton it is assured, that the states are traversed in the correct order without overriding each other. It is however crucial, that the relations do not create cycles in the graph!
Definition at line 37 of file TreeSearcher.dcl.h.