trait
BooleanAlgebra[A] extends AnyRef
Abstract Value Members
-
abstract
def
and(a: A, b: A): A
-
abstract
def
complement(a: A): A
-
abstract
def
one: A
-
abstract
def
or(a: A, b: A): A
-
abstract
def
zero: A
Concrete Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
imp(a: A, b: A): A
-
final
def
isInstanceOf[T0]: Boolean
-
def
nand(a: A, b: A): A
-
final
def
ne(arg0: AnyRef): Boolean
-
def
nor(a: A, b: A): A
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
nxor(a: A, b: A): A
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
xor(a: A, b: A): A
Inherited from AnyRef
Inherited from Any
A boolean algebra is a structure that defines a few basic operations, namely as conjunction (&), disjunction (|), and negation (~). Both conjunction and disjunction must be associative, commutative and should distribute over each other. Also, both have an identity. Also, they obey the absorption law, that is
x & (y | x) == x
andx | (x & y) == x
.