RecoJets/FFTJetAlgorithms/src/LinInterpolatedTable1D.cc - master - githubmirror/cmssw

RecoJets/FFTJetAlgorithms/src/LinInterpolatedTable1D.cc
81 строка3 KB
Mircho Rodozov
clang format
17 июл 2020, 18:45
17 июл 2020, 18:45f0b288d
#include <memory>

#include "RecoJets/FFTJetAlgorithms/interface/LinInterpolatedTable1D.h"

namespace fftjetcms {
  LinInterpolatedTable1D::LinInterpolatedTable1D(const double c)
      : data_(2, c),
        xmin_(0.0),
        xmax_(1.0),
        binwidth_(1.0),
        npoints_(2U),
        leftExtrapolationLinear_(false),
        rightExtrapolationLinear_(false),
        monotonous_(false),
        monotonicityKnown_(true) {}

  bool LinInterpolatedTable1D::operator==(const LinInterpolatedTable1D& r) const {
    return xmin_ == r.xmin_ && xmax_ == r.xmax_ && binwidth_ == r.binwidth_ && npoints_ == r.npoints_ &&
           leftExtrapolationLinear_ == r.leftExtrapolationLinear_ &&
           rightExtrapolationLinear_ == r.rightExtrapolationLinear_ && data_ == r.data_;
  }

  bool LinInterpolatedTable1D::isMonotonous() const {
    if (!monotonicityKnown_) {
      monotonous_ = true;
      const double delta = data_[npoints_ - 1U] - data_[0];
      if (delta == 0.0)
        monotonous_ = false;
      const double sg = delta > 0.0 ? 1.0 : -1.0;
      for (unsigned i = 1; i < npoints_ && monotonous_; ++i)
        if ((data_[i] - data_[i - 1]) * sg <= 0.0)
          monotonous_ = false;
      monotonicityKnown_ = true;
    }
    return monotonous_;
  }

  std::unique_ptr<LinInterpolatedTable1D> LinInterpolatedTable1D::inverse(const unsigned npoints,
                                                                          const bool leftExtrapolationLinear,
                                                                          const bool rightExtrapolationLinear) const {
    if (!isMonotonous())
      return std::unique_ptr<LinInterpolatedTable1D>(nullptr);

    std::vector<std::pair<double, double> > points;
    points.reserve(npoints_);

    if (data_[npoints_ - 1U] > data_[0]) {
      points.push_back(std::pair<double, double>(data_[0], xmin_));
      for (unsigned i = 1; i < npoints_ - 1U; ++i)
        points.push_back(std::pair<double, double>(data_[i], xmin_ + i * binwidth_));
      points.push_back(std::pair<double, double>(data_[npoints_ - 1U], xmax_));
    } else {
      points.push_back(std::pair<double, double>(data_[npoints_ - 1U], xmax_));
      for (unsigned i = npoints_ - 2U; i > 0; --i)
        points.push_back(std::pair<double, double>(data_[i], xmin_ + i * binwidth_));
      points.push_back(std::pair<double, double>(data_[0], xmin_));
    }

    return std::make_unique<LinInterpolatedTable1D>(points, npoints, leftExtrapolationLinear, rightExtrapolationLinear);
  }

  double LinInterpolatedTable1D::operator()(const double& x) const {
    if (x <= xmin_) {
      if (leftExtrapolationLinear_)
        return data_[0] + (data_[1] - data_[0]) * ((x - xmin_) / binwidth_);
      else
        return data_[0];
    } else if (x >= xmax_) {
      if (rightExtrapolationLinear_)
        return data_[npoints_ - 1U] - (data_[npoints_ - 2U] - data_[npoints_ - 1U]) * ((x - xmax_) / binwidth_);
      else
        return data_[npoints_ - 1U];
    } else {
      const unsigned ux = static_cast<unsigned>((x - xmin_) / binwidth_);
      if (ux >= npoints_ - 1U)
        return data_[npoints_ - 1U];
      const double delta = x - (ux * binwidth_ + xmin_);
      return data_[ux] + (data_[ux + 1U] - data_[ux]) * delta / binwidth_;
    }
  }
}  // namespace fftjetcms