Declaration of the operator that performs the reconstruction.
87 const double STANDARD_DEVIATIONS = 3.0;
107 copy(dataL1.begin(), dataL1.end(), back_inserter(dataL0));
110 for (buffer_type::const_iterator i = buffer.begin(); i != buffer.end(); ++i) {
111 if (find_if(dataL1.begin(), dataL1.end(), match_t(*i,
TMaxExtra_ns)) == dataL1.end()) {
112 dataL0.push_back(*i);
116 for (buffer_type::const_iterator
root = dataL1.begin();
root != dataL1.end(); ++
root) {
122 for (buffer_type::const_iterator i = dataL0.begin(); i != dataL0.end(); ++i) {
124 if((
root->getModuleIdentifier() != i->getModuleIdentifier() ) && matching(*i)){
134 double chi2 = numeric_limits<double>::max();
135 int NDF =
distance(
data.begin(), __end1) - JEstimator_t::NUMBER_OF_PARAMETERS;
141 double ymin = numeric_limits<double>::max();
143 buffer_type::iterator __end2 = __end1;
146 JEstimator_t::NUMBER_OF_PARAMETERS; ++
n, --__end2) {
153 fit(
data.begin(), __end2);
161 NDF =
distance(
data.begin(), __end2) - JEstimator_t::NUMBER_OF_PARAMETERS;
169 ymin -= STANDARD_DEVIATIONS * STANDARD_DEVIATIONS;
174 const int number_of_outliers =
distance(
data.begin(), __end1) - JEstimator_t::NUMBER_OF_PARAMETERS - 1;
176 buffer_type::iterator __end2 = __end1;
178 for (
int n = 0;
n <= number_of_outliers; ++
n) {
182 fit(
data.begin(), __end2);
185 NDF =
distance(
data.begin(), __end2) - JEstimator_t::NUMBER_OF_PARAMETERS;
192 buffer_type::iterator imax = __end2;
194 for (buffer_type::iterator i =
data.begin() + 1; i != __end2; ++i) {
204 if (ymax > STANDARD_DEVIATIONS * STANDARD_DEVIATIONS) {
206 swap(*imax, *__end2);
220 size_t solutions = out.size();
222 for(
size_t i=0; i < solutions; i++){
227 if (
x != 0 ||
y != 0 || z != 0 || t != 0) {
std::vector< T >::difference_type distance(typename std::vector< T >::const_iterator first, typename PhysicsEvent::const_iterator< T > second)
Specialisation of STL distance.
Linear fit of bright point (position and time) between hits (objects with position and time).
Data structure for vertex fit.
Data structure for position in three dimensions.
Data structure for normalised vector in positive z-direction.
Auxiliary class to convert binary JMatch operator and given hit to unary match operator.
static const struct JTRIGGER::JHitR1::compare compare
static const int JSHOWERPREFIT
void copy(const Head &from, JHead &to)
Copy header from from to to.
double getChi2(const double P)
Get chi2 corresponding to given probability.
size_t getCount(const array_type< T > &buffer, const JCompare_t &compare)
Count number of unique values.
This name space includes all other name spaces (except KM3NETDAQ, KM3NET and ANTARES).
double getQuality(const double chi2, const int N, const int NDF)
Get quality of fit.
JPosition3D getPosition(const JFit &fit)
Get position.
bool qualitySorter(const JFit &first, const JFit &second)
Comparison of fit results.
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.
JBinder2nd< JHit_t > JBind2nd(const JMatch< JHit_t > &match, const JHit_t &second)
Auxiliary method to create JBinder2nd object.
static const struct JTRIGGER::clusterizeWeight clusterizeWeight
double sigma_ns
time resolution [ns]
int factoryLimit
factory limit for combinatorics
int numberOfOutliers
maximum number of outliers
int time_grid_ns
edge [ns] of the time grid
int pos_step_m
step in [m] of position grid
int pos_grid_m
edge [m] of the position grid
double DMax_m
maximal distance to optical module [m]
double ctMin
minimal cosine space angle between PMT axes
size_t numberOfGrids
number of prefits to be used to build a grid around
double TMaxLocal_ns
time window for local coincidences [ns]
double TMaxExtra_ns
time window for extra coincidences [ns]
size_t numberOfL1
minimal number of L1
int time_step_ns
step in [ns] of time grid
Data structure for L2 parameters.