monoid/acted_monoids/range_affine_range_minmax.hpp

• View this file on GitHub
• Last update: 2025-10-01 15:41:05+09:00
• Include: #include "monoid/acted_monoids/range_affine_range_minmax.hpp"

Depends on

• Acted Monoid (monoid/acted_monoid.hpp)
• Monoid (monoid/monoid.hpp)
• Monoid (monoid/monoid.hpp)
• monoid/monoids/affine_monoid.hpp
• monoid/monoids/minmax_monoid.hpp

Required by

• monoid/prim_acted_monoids.hpp

Code

#ifndef M1UNE_ACTED_MONOIDS_RANGE_AFFINE_RANGE_MINMAX_HPP
#define M1UNE_ACTED_MONOIDS_RANGE_AFFINE_RANGE_MINMAX_HPP 1

#include "../acted_monoid.hpp"
#include "../monoids/affine_monoid.hpp"
#include "../monoids/minmax_monoid.hpp"

namespace m1une {

// Acted monoid for range affine transformations and range min/max queries.
template <typename T>
using range_affine_range_minmax_monoid =
    acted_monoid<minmax_monoid<T>, affine_monoid<T>,
                 [](typename affine_monoid<T>::value_type f, typename minmax_monoid<T>::value_type x) {
                     auto v1 = f.first * x.first + f.second;
                     auto v2 = f.first * x.second + f.second;
                     return std::pair<T, T>(std::min(v1, v2), std::max(v1, v2));
                 }>;

}  // namespace m1une

#endif  // M1UNE_ACTED_MONOIDS_RANGE_AFFINE_RANGE_MINMAX_HPP

#line 1 "monoid/acted_monoids/range_affine_range_minmax.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/affine_monoid.hpp"



#include <utility>

#line 7 "monoid/monoids/affine_monoid.hpp"

namespace m1une {

// Affine transformation f(x) = ax + b is represented as (a, b)
// perform f first, then g
// op(f, g)(x) = g(f(x))
template <typename T>
using affine_monoid = monoid<std::pair<T, T>,
                             [](std::pair<T, T> f, std::pair<T, T> g) {
                                 return std::pair<T, T>(f.first * g.first, f.second * g.first + g.second);
                             },
                             []() { return std::pair<T, T>(1, 0); }, false>;

}  // namespace m1une


#line 1 "monoid/monoids/minmax_monoid.hpp"



#include <algorithm>
#include <limits>
#line 7 "monoid/monoids/minmax_monoid.hpp"

#line 9 "monoid/monoids/minmax_monoid.hpp"

namespace m1une {

// Monoid for storing both a minimum and maximum value.
// The operation combines two pairs by taking the component-wise min and max.
template <typename T>
using minmax_monoid =
    monoid<std::pair<T, T>,
           [](std::pair<T, T> a, std::pair<T, T> b) {
               return std::pair<T, T>(std::min(a.first, b.first), std::max(a.second, b.second));
           },
           []() { return std::pair<T, T>(std::numeric_limits<T>::max(), std::numeric_limits<T>::lowest()); }, true>;

}  // namespace m1une


#line 7 "monoid/acted_monoids/range_affine_range_minmax.hpp"

namespace m1une {

// Acted monoid for range affine transformations and range min/max queries.
template <typename T>
using range_affine_range_minmax_monoid =
    acted_monoid<minmax_monoid<T>, affine_monoid<T>,
                 [](typename affine_monoid<T>::value_type f, typename minmax_monoid<T>::value_type x) {
                     auto v1 = f.first * x.first + f.second;
                     auto v2 = f.first * x.second + f.second;
                     return std::pair<T, T>(std::min(v1, v2), std::max(v1, v2));
                 }>;

}  // namespace m1une

Back to top page