Bounded max monoid
(Mylib/AlgebraicStructure/Monoid/bounded_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
#include <algorithm>
#include <limits>

namespace haar_lib {
  template <typename T>
  struct bounded_max_monoid {
    using value_type = T;

    value_type operator()() const { return std::numeric_limits<T>::lowest(); }
    value_type operator()(const value_type &a, const value_type &b) const {
      return std::max(a, b);
    }
  };
}  // namespace haar_lib

#line 2 "Mylib/AlgebraicStructure/Monoid/bounded_max.cpp"
#include <algorithm>
#include <limits>

namespace haar_lib {
  template <typename T>
  struct bounded_max_monoid {
    using value_type = T;

    value_type operator()() const { return std::numeric_limits<T>::lowest(); }
    value_type operator()(const value_type &a, const value_type &b) const {
      return std::max(a, b);
    }
  };
}  // namespace haar_lib

Back to top page