algebra/monoid_f/monoid_set.hpp

• View this file on GitHub
• Last update: 2024-03-24 17:04:51+09:00
• Include: #include "algebra/monoid_f/monoid_set.hpp"

Required by

• algebra/monoid_s_f/monoid_max_index_set.hpp
• algebra/monoid_s_f/monoid_max_set.hpp
• algebra/monoid_s_f/monoid_min_index_set.hpp
• algebra/monoid_s_f/monoid_min_set.hpp
• algebra/monoid_s_f/monoid_sum_size_set.hpp

Verified with

• verify/aoj_dsl/aoj_dsl_2_d_dual_segment_tree.test.cpp
• verify/aoj_dsl/aoj_dsl_2_f_lazy_segment_tree.test.cpp
• verify/aoj_dsl/aoj_dsl_2_i_lazy_segment_tree.test.cpp

Code

#pragma once
// MF
template <class T> struct MonoidSet {
    using F = T;
    static constexpr F composition(F f, F g) { return f == id() ? g : f; }
    static constexpr F id() { return std::numeric_limits<F>::max(); }
};

#line 2 "algebra/monoid_f/monoid_set.hpp"
// MF
template <class T> struct MonoidSet {
    using F = T;
    static constexpr F composition(F f, F g) { return f == id() ? g : f; }
    static constexpr F id() { return std::numeric_limits<F>::max(); }
};

Back to top page