A Boolean rng is a rng whose multiplication is idempotent, that is
a⋅a = a for all elements ''a''. This property also implies a+a = 0
for all ''a'', and a⋅b = b⋅a (commutativity of multiplication).
A Boolean rng is a rng whose multiplication is idempotent, that is
a⋅a = a for all elements ''a''. This property also implies a+a = 0
for all ''a'', and a⋅b = b⋅a (commutativity of multiplication).
Every BoolRng is equivalent to algebra.lattice.GenBool.
See algebra.lattice.GenBoolFromBoolRng for details.
- Companion
- object
Value members
Concrete methods
Inherited methods
Given a sequence of as, compute the sum.
Given a sequence of as, compute the sum.
- Inherited from
- AdditiveMonoid
Given a sequence of as, combine them and return the total.
Given a sequence of as, combine them and return the total.
If the sequence is empty, returns None. Otherwise, returns Some(total).
- Inherited from
- MultiplicativeSemigroup