Range affine / Range min-max
(Mylib/AlgebraicStructure/MonoidAction/affine_min_max.cpp)

• View this file on GitHub
• Last update: 2021-04-23 23:44:44+09:00

Operations

Requirements

Notes

Problems

References

Code

#pragma once

namespace haar_lib {
  template <typename MonoidUpdate, typename MonoidGet>
  struct affine_min_max {
    using monoid_get        = MonoidGet;
    using monoid_update     = MonoidUpdate;
    using value_type_get    = typename MonoidGet::value_type;
    using value_type_update = typename MonoidUpdate::value_type;

    value_type_get operator()(const value_type_get &a, const value_type_update &b, int) const {
      value_type_get ret;
      if (b.first >= 0) {
        if (a.min) ret.min = b.first * (a.min.value()) + b.second;
        if (a.max) ret.max = b.first * (a.max.value()) + b.second;
      } else {
        if (a.min) ret.max = b.first * (a.min.value()) + b.second;
        if (a.max) ret.min = b.first * (a.max.value()) + b.second;
      }

      return ret;
    }
  };
}  // namespace haar_lib

#line 2 "Mylib/AlgebraicStructure/MonoidAction/affine_min_max.cpp"

namespace haar_lib {
  template <typename MonoidUpdate, typename MonoidGet>
  struct affine_min_max {
    using monoid_get        = MonoidGet;
    using monoid_update     = MonoidUpdate;
    using value_type_get    = typename MonoidGet::value_type;
    using value_type_update = typename MonoidUpdate::value_type;

    value_type_get operator()(const value_type_get &a, const value_type_update &b, int) const {
      value_type_get ret;
      if (b.first >= 0) {
        if (a.min) ret.min = b.first * (a.min.value()) + b.second;
        if (a.max) ret.max = b.first * (a.max.value()) + b.second;
      } else {
        if (a.min) ret.max = b.first * (a.min.value()) + b.second;
        if (a.max) ret.min = b.first * (a.max.value()) + b.second;
      }

      return ret;
    }
  };
}  // namespace haar_lib

Back to top page