Bitwise OR Monoid
(monoid/or.hpp)

• View this file on GitHub
• Last update: 2026-07-21 20:17:47+09:00
• Include: #include "monoid/or.hpp"

Overview

A monoid representing the bitwise OR operation. It is an idempotent monoid, meaning it is compatible with Sparse Tables.

Template Parameters

• T: The underlying integer data type.

Properties

• Operation: Bitwise OR ($a \

  \ b$)

• Identity Element: $0$ (All bits set to 0)

Interface and Complexity

This is a stateless algebra tag. Generic data structures use its public value_type, id(), and op(a, b) members. If the type also provides helpers such as make(...) or inv(x), they are described above or in the documented properties.

Each static operation runs in the cost of the underlying operation shown in the properties. Scalar monoids are $O(1)$; monoids whose value_type stores several items, permutations, or matrices scale with that stored size.

Verified with

• verify/monoid/commutative_flags.test.cpp

Code

#ifndef M1UNE_MONOID_OR_HPP
#define M1UNE_MONOID_OR_HPP 1

namespace m1une {
namespace monoid {

// Monoid for bitwise OR (Range OR).
template <typename T>
struct Or {
    using value_type = T;
    static constexpr bool commutative = true;

    // The identity element for bitwise OR is 0 (all bits 0).
    static constexpr T id() {
        return T(0);
    }

    // Returns the bitwise OR of a and b.
    static constexpr T op(const T& a, const T& b) {
        return a | b;
    }
};

}  // namespace monoid
}  // namespace m1une

#endif  // M1UNE_MONOID_OR_HPP

#line 1 "monoid/or.hpp"



namespace m1une {
namespace monoid {

// Monoid for bitwise OR (Range OR).
template <typename T>
struct Or {
    using value_type = T;
    static constexpr bool commutative = true;

    // The identity element for bitwise OR is 0 (all bits 0).
    static constexpr T id() {
        return T(0);
    }

    // Returns the bitwise OR of a and b.
    static constexpr T op(const T& a, const T& b) {
        return a | b;
    }
};

}  // namespace monoid
}  // namespace m1une

Back to top page