DAF.h

/* Copyright 2013, Ludwig-Maximilians Universität München,
   Authors: Tobias Schlüter & Johannes Rauch
 
   This file is part of GENFIT.
 
   GENFIT is free software: you can redistribute it and/or modify
   it under the terms of the GNU Lesser General Public License as published
   by the Free Software Foundation, either version 3 of the License, or
   (at your option) any later version.
 
   GENFIT is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU Lesser General Public License for more details.
 
   You should have received a copy of the GNU Lesser General Public License
   along with GENFIT.  If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef genfit_DAF_h
#define genfit_DAF_h
 
#include "AbsKalmanFitter.h"
 
#include <vector>
#include <map>
#include <memory>
 
 
namespace genfit {
 
  class DAF : public AbsKalmanFitter {
 
  private:
 
    DAF(const DAF&);
    DAF& operator=(genfit::DAF const&);
 
  public:
 
    DAF(std::tuple<double, double, int> annealingScheme, int minIter, int maxIter, int minIterForPval, bool useRefKalman = true,
        double deltaPval = 1e-3, double deltaWeight = 1e-3, double probCut = 1e-3);
    DAF(bool useRefKalman = true, double deltaPval = 1e-3, double deltaWeight = 1e-3);
    DAF(AbsKalmanFitter* kalman, double deltaPval = 1e-3, double deltaWeight = 1e-3);
    ~DAF() {};
 
    void processTrackWithRep(Track* tr, const AbsTrackRep* rep, bool resortHits = false) override;
 
    void setProbCut(const double prob_cut);
 
    void addProbCut(const double prob_cut, const int measDim);
 
    const std::vector<double>& getBetas() const {return betas_;}
 
    void setAnnealingScheme(double bStart, double bFinal, unsigned int nSteps);
 
    void setAnnealingScheme(double bStart, double bFinal, unsigned int nSteps, unsigned int minIter, unsigned int  maxIter);
 
    void setMaxIterations(unsigned int n) override {maxIterations_ = n; betas_.resize(maxIterations_, betas_.back());}
 
    void setConvergenceDeltaWeight(double delta) {deltaWeight_ = delta;}
 
    AbsKalmanFitter* getKalman() const {return kalman_.get();}
 
    virtual void setMaxFailedHits(int val) override {getKalman()->setMaxFailedHits(val);}
 
    virtual void setDebugLvl(unsigned int lvl = 1) override {AbsFitter::setDebugLvl(lvl); if (lvl > 1) getKalman()->setDebugLvl(lvl - 1);}
 
  private:
 
    bool calcWeights(Track* trk, const AbsTrackRep* rep, double beta);
 
    int minIterForPval_; //minimum number of iterations before checking pvalue convergence criterion
    double deltaWeight_; // convergence criterium
    std::vector<double> betas_;   // Temperatures, NOT inverse temperatures.
    double chi2Cuts_[7];  // '7' assumes tracks are helices with one
    // parameter, i.e. we're living in 3D space,
    // where time may be used in the fit.  Zeroth
    // entry is not used.
 
    std::unique_ptr<AbsKalmanFitter> kalman_;
 
  public:
 
    ClassDefOverride(DAF, 2)
 
  };
 
}  /* End of namespace genfit */
#endif //genfit_DAF_h