monoids/left.hpp

• View this file on GitHub
• Last update: 2019-12-27 19:16:13+09:00
• Include: #include "monoids/left.hpp"

Required by

• monoids/left_action.hpp

Verified with

• data_structure/dual_segment_tree.range_update_query.test.cpp

Code

#pragma once
#include <utility>

template <class T>
struct left_monoid {
    // typedef std::optional<T> value_type;
    typedef std::pair<bool, T> value_type;
    value_type unit() const { return std::make_pair(false, T()); }
    value_type mult(value_type a, value_type b) const { return a.first ? a : b; }
};

#line 2 "monoids/left.hpp"
#include <utility>

template <class T>
struct left_monoid {
    // typedef std::optional<T> value_type;
    typedef std::pair<bool, T> value_type;
    value_type unit() const { return std::make_pair(false, T()); }
    value_type mult(value_type a, value_type b) const { return a.first ? a : b; }
};

Back to top page