monoid/acted_monoids/range_update_range_min.hpp
Depends on
Required by
Code
#ifndef M1UNE_ACTED_MONOIDS_RANGE_UPDATE_RANGE_MIN_HPP
#define M1UNE_ACTED_MONOIDS_RANGE_UPDATE_RANGE_MIN_HPP 1
#include "../acted_monoid.hpp"
#include "../monoids/min_monoid.hpp"
#include "../monoids/update_monoid.hpp"
namespace m1une {
template <typename T, T identity>
using range_update_range_max = acted_monoid<min_monoid<T>, update_monoid<T, identity>, [](T x, T a) {
if (a == identity) return x;
return a;
}>;
} // namespace m1une
#endif // M1UNE_ACTED_MONOIDS_RANGE_UPDATE_RANGE_MIN_HPP
#line 1 "monoid/acted_monoids/range_update_range_min.hpp"
#line 1 "monoid/acted_monoid.hpp"
#include <concepts>
#include <functional>
#include <type_traits>
#line 1 "monoid/monoid.hpp"
#line 7 "monoid/monoid.hpp"
namespace m1une {
template <typename T, auto operation, auto identity, bool commutative>
struct monoid {
static_assert(std::is_invocable_r_v<T, decltype(operation), T, T>, "operation must work as T(T, T)");
static_assert(std::is_invocable_r_v<T, decltype(identity)>, "identity must work as T()");
using value_type = T;
static constexpr auto op = operation;
static constexpr auto id = identity;
static constexpr bool is_commutative = commutative;
};
template <typename T>
concept Monoid = requires(typename T::value_type v) {
typename T::value_type;
{ T::op(v, v) } -> std::same_as<typename T::value_type>;
{ T::id() } -> std::same_as<typename T::value_type>;
{ T::is_commutative } -> std::convertible_to<bool>;
};
} // namespace m1une
#line 9 "monoid/acted_monoid.hpp"
namespace m1une {
template <Monoid Data, Monoid Act, auto mapping>
struct acted_monoid {
using data_monoid = Data;
using act_monoid = Act;
using data_type = typename Data::value_type;
using act_type = typename Act::value_type;
static_assert(std::is_invocable_r_v<data_type, decltype(mapping), act_type, data_type>,
"mapping must work as data_type(act_type, data_type)");
static constexpr auto data_op = Data::op;
static constexpr auto data_id = Data::id;
static constexpr bool data_is_commutative = Data::is_commutative;
static constexpr auto act_op = Act::op;
static constexpr auto act_id = Act::id;
static constexpr bool act_is_commutative = Act::is_commutative;
static constexpr auto apply = mapping;
};
template <typename T>
concept ActedMonoid = requires(typename T::data_type d, typename T::act_type a) {
typename T::data_monoid;
typename T::act_monoid;
typename T::data_type;
typename T::act_type;
requires Monoid<typename T::data_monoid>;
requires Monoid<typename T::act_monoid>;
{ T::apply(a, d) } -> std::same_as<typename T::data_type>;
};
} // namespace m1une
#line 1 "monoid/monoids/min_monoid.hpp"
#include <algorithm>
#include <limits>
#line 8 "monoid/monoids/min_monoid.hpp"
namespace m1une {
template <typename T>
using min_monoid =
monoid<T, [](T a, T b) { return std::min(a, b); }, []() { return std::numeric_limits<T>::max(); }, true>;
} // namespace m1une
#line 1 "monoid/monoids/update_monoid.hpp"
#line 5 "monoid/monoids/update_monoid.hpp"
namespace m1une {
template <typename T, T identity>
using update_monoid = monoid<T,
[](T a, T b) {
if (b == identity) return a;
return b;
},
[]() { return identity; }, false>;
} // namespace m1une
#line 7 "monoid/acted_monoids/range_update_range_min.hpp"
namespace m1une {
template <typename T, T identity>
using range_update_range_max = acted_monoid<min_monoid<T>, update_monoid<T, identity>, [](T x, T a) {
if (a == identity) return x;
return a;
}>;
} // namespace m1une
Back to top page