class SetLattice[A] extends GenBool[Set[A]]
- Alphabetic
- By Inheritance
- SetLattice
- GenBool
- BoundedJoinSemilattice
- DistributiveLattice
- Lattice
- MeetSemilattice
- JoinSemilattice
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new SetLattice()
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
and(lhs: Set[A], rhs: Set[A]): Set[A]
- Definition Classes
- SetLattice → GenBool
-
def
asBoolRing: BoolRng[Set[A]]
Every generalized Boolean algebra is also a
BoolRng
, with multiplication defined asand
and addition defined asxor
.Every generalized Boolean algebra is also a
BoolRng
, with multiplication defined asand
and addition defined asxor
.- Definition Classes
- GenBool
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
dual: Lattice[Set[A]]
This is the lattice with meet and join swapped
This is the lattice with meet and join swapped
- Definition Classes
- Lattice
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isZero(a: Set[A])(implicit ev: Eq[Set[A]]): Boolean
- Definition Classes
- BoundedJoinSemilattice
-
def
join(a: Set[A], b: Set[A]): Set[A]
- Definition Classes
- GenBool → JoinSemilattice
-
def
joinPartialOrder(implicit ev: Eq[Set[A]]): PartialOrder[Set[A]]
- Definition Classes
- JoinSemilattice
-
def
joinSemilattice: BoundedSemilattice[Set[A]]
- Definition Classes
- BoundedJoinSemilattice → JoinSemilattice
-
def
meet(a: Set[A], b: Set[A]): Set[A]
- Definition Classes
- GenBool → MeetSemilattice
-
def
meetPartialOrder(implicit ev: Eq[Set[A]]): PartialOrder[Set[A]]
- Definition Classes
- MeetSemilattice
-
def
meetSemilattice: Semilattice[Set[A]]
- Definition Classes
- MeetSemilattice
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
or(lhs: Set[A], rhs: Set[A]): Set[A]
- Definition Classes
- SetLattice → GenBool
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
without(lhs: Set[A], rhs: Set[A]): Set[A]
The operation of relative complement, symbolically often denoted
a\b
(the symbol for set-theoretic difference, which is the meaning of relative complement in the lattice of sets).The operation of relative complement, symbolically often denoted
a\b
(the symbol for set-theoretic difference, which is the meaning of relative complement in the lattice of sets).- Definition Classes
- SetLattice → GenBool
-
def
xor(a: Set[A], b: Set[A]): Set[A]
Logical exclusive or, set-theoretic symmetric difference.
Logical exclusive or, set-theoretic symmetric difference. Defined as
a\b ∨ b\a
.- Definition Classes
- GenBool
-
def
zero: Set[A]
- Definition Classes
- SetLattice → BoundedJoinSemilattice