Declaration of the member function that actually performs the reconstruction. 
  124       for (JEvt::const_iterator shower = in.begin(); shower != in.end(); ++shower) {
 
  130         data.reserve(dataL0.size() + dataL1.size());
 
  150         for (buffer_type::const_iterator i = dataL1.begin(); i != dataL1.end(); ++i) {
 
  157         buffer_type::iterator __end = data.end();     
 
  159         for (buffer_type::const_iterator i = dataL0.begin(); i != dataL0.end(); ++i) {
 
  161           if (find_if(data.begin(), __end, bind2nd(equal_to<JDAQModuleIdentifier>(), i->getModuleID())) == __end) {
 
  169         const int NDF = 
getCount(data.begin(), data.end()) - this->step.size();
 
  173           for(
double x = posGrid_m.getLowerLimit(); 
x <= posGrid_m.getUpperLimit(); 
x += 
pos_step_m){
 
  174             for(
double y = posGrid_m.getLowerLimit(); y <= posGrid_m.getUpperLimit(); y += 
pos_step_m){
 
  175               for(
double z = posGrid_m.getLowerLimit(); z <= posGrid_m.getUpperLimit(); z += 
pos_step_m){
 
  176                 for(
double t = timeGrid_ns.getLowerLimit(); t <= timeGrid_ns.getUpperLimit(); t += 
time_step_ns){
 
  180                   this->step.resize(4);
 
  186                   double chi2 = (*this)(vxs, data.begin(), data.end());
 
  189                                    this->value.getT(), shower->getE());
 
const JModuleRouter & router
 
double pos_step_m
step in [m] of position grid 
 
Data structure for direction in three dimensions. 
 
double roadWidth_m
road width [m] 
 
Data structure for vertex fit. 
 
JRange_t pos_grid_m
edges in [m] of the position grid 
 
JTOOLS::JRange< double > JTimeRange
Type definition for time range (unit [ns]). 
 
static const int JSHOWERPOINTSIMPLEX
 
JFit getFit(const JHistory &history, const JTrack3D &track, const double Q, const int NDF, const double energy=0.0, const int status=SINGLE_STAGE)
Get fit. 
 
double getQuality(const double chi2, const int N, const int NDF)
Get quality of fit. 
 
JRange_t TWindow_ns
time window for local coincidences [ns] for events with few prefits 
 
std::vector< hit_type > buffer_type
 
Data structure for vector in three dimensions. 
 
JRange_t time_grid_ns
edges in [ns] of the time grid 
 
double TMaxLocal_ns
time window for local coincidences [ns] 
 
double simplex_step_m
step in [m] of JSimplex minimiser 
 
double simplex_step_ns
step in [ns] of JSimplex minimiser 
 
Data structure for L2 parameters. 
 
double TMax_ns
maximum time for local coincidences [ns] 
 
size_t minPrefitsSize
number of prefits under which an event is treated as a very low energy one 
 
then if[[!-f $DETECTOR]] then JDetector sh $DETECTOR fi cat $WORKDIR trigger_parameters txt<< EOFtrigger3DMuon.enabled=1;trigger3DMuon.numberOfHits=5;trigger3DMuon.gridAngle_deg=1;ctMin=0.0;TMaxLocal_ns=15.0;EOF set_variable TRIGGEREFFICIENCY_TRIGGERED_EVENTS_ONLY INPUT_FILES=() for((i=1;$i<=$NUMBER_OF_RUNS;++i));do JSirene.sh $DETECTOR $JPP_DATA/genhen.km3net_wpd_V2_0.evt.gz $WORKDIR/sirene_ ${i}.root JTriggerEfficiency.sh $DETECTOR $DETECTOR $WORKDIR/sirene_ ${i}.root $WORKDIR/trigger_efficiency_ ${i}.root $WORKDIR/trigger_parameters.txt $JPP_DATA/PMT_parameters.txt INPUT_FILES+=($WORKDIR/trigger_efficiency_ ${i}.root) done for ANGLE_DEG in $ANGLES_DEG[*];do set_variable SIGMA_NS 3.0 set_variable OUTLIERS 3 set_variable OUTPUT_FILE $WORKDIR/matrix\[${ANGLE_DEG}\deg\].root $JPP_DIR/examples/JReconstruction-f"$INPUT_FILES[*]"-o $OUTPUT_FILE-S ${SIGMA_NS}-A ${ANGLE_DEG}-O ${OUTLIERS}-d ${DEBUG}--!fiif[[$OPTION=="plot"]];then if((0));then for H1 in h0 h1;do JPlot1D-f"$WORKDIR/matrix["${^ANGLES_DEG}" deg].root:${H1}"-y"1 2e3"-Y-L TR-T""-\^"number of events [a.u.]"-> o chi2
 
int getCount(const T &hit)
Get hit count. 
 
JPosition3D getPosition(const JFit &fit)
Get position. 
 
double time_step_ns
step in [ns] of time grid 
 
double TMin_ns
minimum time for local coincidences [ns] 
 
double ctMin
minimal cosine space angle between PMT axes 
 
Template specialisation of class JModel to match hit with bright point.