algebra/monoid/monoid_xor.hpp

• View this file on GitHub
• Last update: 2026-04-11 00:41:57+09:00
• Include: #include "algebra/monoid/monoid_xor.hpp"

Required by

• algebra/acted_monoid/acted_monoid_inversion01_flip.hpp
• algebra/acted_monoid/acted_monoid_max01_flip.hpp

Verified with

• segment_tree/test/lazy_segment_tree_inversion01_flip.test.cpp
• segment_tree/test/lazy_segment_tree_max01_flip.test.cpp
• segment_tree/test/segment_tree_xor.test.cpp

Code

#pragma once

template <class T> struct MonoidXor {
    using value_type = T;
    static constexpr T operation(const T& a, const T& b) noexcept {
        return a ^ b;
    }
    static constexpr T identity() noexcept { return T(0); }
    static constexpr T inverse(const T& a) noexcept { return a; }
    static constexpr bool commutative = true;
};

#line 2 "algebra/monoid/monoid_xor.hpp"

template <class T> struct MonoidXor {
    using value_type = T;
    static constexpr T operation(const T& a, const T& b) noexcept {
        return a ^ b;
    }
    static constexpr T identity() noexcept { return T(0); }
    static constexpr T inverse(const T& a) noexcept { return a; }
    static constexpr bool commutative = true;
};

Back to top page