segtree: monoid BitOrOper/BitAndOper/BitXorOper

Author: mizar

src/lib.rs

@@ -29,7 +29,9 @@ pub use modint::{
     ModInt1000000007, ModInt998244353, Modulus, RemEuclidU32, StaticModInt,
 };
 pub use scc::SccGraph;
-pub use segtree::{Additive, Max, Min, Monoid, Multiplicative, Segtree};
+pub use segtree::{
+    Additive, BitAndOper, BitOrOper, BitXorOper, Max, Min, Monoid, Multiplicative, Segtree,
+};
 pub use string::{
     lcp_array, lcp_array_arbitrary, suffix_array, suffix_array_arbitrary, suffix_array_manual,
     z_algorithm, z_algorithm_arbitrary,

src/segtree.rs

@@ -3,7 +3,7 @@ use crate::internal_type_traits::{BoundedAbove, BoundedBelow, One, Zero};
 use std::cmp::{max, min};
 use std::convert::Infallible;
 use std::marker::PhantomData;
-use std::ops::{Add, Mul};
+use std::ops::{Add, BitAnd, BitOr, BitXor, Mul, Not};
 
 // TODO Should I split monoid-related traits to another module?
 pub trait Monoid {
@@ -68,6 +68,48 @@ where
     }
 }
 
+pub struct BitOrOper<S>(Infallible, PhantomData<fn() -> S>);
+impl<S> Monoid for BitOrOper<S>
+where
+    S: Copy + BitOr<Output = S> + Default,
+{
+    type S = S;
+    fn identity() -> Self::S {
+        S::default()
+    }
+    fn binary_operation(a: &Self::S, b: &Self::S) -> Self::S {
+        *a | *b
+    }
+}
+
+pub struct BitAndOper<S>(Infallible, PhantomData<fn() -> S>);
+impl<S> Monoid for BitAndOper<S>
+where
+    S: Copy + BitAnd<Output = S> + Not<Output = S> + Default,
+{
+    type S = S;
+    fn identity() -> Self::S {
+        !S::default()
+    }
+    fn binary_operation(a: &Self::S, b: &Self::S) -> Self::S {
+        *a & *b
+    }
+}
+
+pub struct BitXorOper<S>(Infallible, PhantomData<fn() -> S>);
+impl<S> Monoid for BitXorOper<S>
+where
+    S: Copy + BitXor<Output = S> + Default,
+{
+    type S = S;
+    fn identity() -> Self::S {
+        S::default()
+    }
+    fn binary_operation(a: &Self::S, b: &Self::S) -> Self::S {
+        *a ^ *b
+    }
+}
+
 impl<M: Monoid> Default for Segtree<M> {
     fn default() -> Self {
         Segtree::new(0)