trait LatticeElementLaw extends MonoidLaw with OrderLaw
Linear Supertypes
Known Subclasses
Ordering
- Alphabetic
- By Inheritance
Inherited
- LatticeElementLaw
- OrderLaw
- EqualLaw
- MonoidLaw
- SemigroupLaw
- AnyRef
- Any
Implicitly
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
+(other: String): String
- Implicit
- This member is added by an implicit conversion from LatticeElementLaw to any2stringadd[LatticeElementLaw] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
-
def
->[B](y: B): (LatticeElementLaw, B)
- Implicit
- This member is added by an implicit conversion from LatticeElementLaw to ArrowAssoc[LatticeElementLaw] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
antisymmetric(f1: L, f2: L): Boolean
- Definition Classes
- OrderLaw
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
associative(f1: L, f2: L, f3: L)(implicit F: Equal[L]): Boolean
- Definition Classes
- SemigroupLaw
-
def
bottomLowerBound(a: L): Boolean
Bottom is the lower bound ∀ a: ⊥ ⊑ a
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate() @throws( ... )
-
def
commutative(f1: L, f2: L): Boolean
- Definition Classes
- EqualLaw
-
def
ensuring(cond: (LatticeElementLaw) ⇒ Boolean, msg: ⇒ Any): LatticeElementLaw
- Implicit
- This member is added by an implicit conversion from LatticeElementLaw to Ensuring[LatticeElementLaw] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: (LatticeElementLaw) ⇒ Boolean): LatticeElementLaw
- Implicit
- This member is added by an implicit conversion from LatticeElementLaw to Ensuring[LatticeElementLaw] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean, msg: ⇒ Any): LatticeElementLaw
- Implicit
- This member is added by an implicit conversion from LatticeElementLaw to Ensuring[LatticeElementLaw] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean): LatticeElementLaw
- Implicit
- This member is added by an implicit conversion from LatticeElementLaw to Ensuring[LatticeElementLaw] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
eqlIsTrue(a: L): Boolean
Equal elements are always eql if they're not bottom.
Equal elements are always eql if they're not bottom. ∀ a: a = bottom ∨ isTrue(eql(a, a))
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from LatticeElementLaw to StringFormat[LatticeElementLaw] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
joinAssociative(a: L, b: L, c: L): Boolean
Join is associative ∀ a, b, c: (a ⊔ b) ⊔ c = a ⊔ (b ⊔ c)
-
def
joinCommutative(a: L, b: L): Boolean
Join is commutative ∀ a, b: a ⊔ b = b ⊔ a
-
def
joinIdempotent(a: L): Boolean
Join is idempotent ∀ a: a ⊔ a = a
-
def
joinSubsumesCompatible(a: L, b: L): Boolean
Join and subsumes are compatible ∀ a, b: a ⊑ b ⇒ a ⊔ b = b
-
def
leftIdentity(a: L)(implicit F: Equal[L]): Boolean
- Definition Classes
- MonoidLaw
-
def
naturality(f1: L, f2: L): Boolean
- Definition Classes
- EqualLaw
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
orderAndEqualConsistent(f1: L, f2: L): Boolean
- Definition Classes
- OrderLaw
-
def
reflexive(f: L): Boolean
- Definition Classes
- EqualLaw
-
def
rightIdentity(a: L)(implicit F: Equal[L]): Boolean
- Definition Classes
- MonoidLaw
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
def
topUpperBound(a: L): Boolean
Top is the upper bound (when defined) ∀ a: a ⊑ ⊤
-
def
transitive(f1: L, f2: L, f3: L): Boolean
- Definition Classes
- EqualLaw
-
def
transitiveOrder(f1: L, f2: L, f3: L): Boolean
- Definition Classes
- OrderLaw
-
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( ... )
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
→[B](y: B): (LatticeElementLaw, B)
- Implicit
- This member is added by an implicit conversion from LatticeElementLaw to ArrowAssoc[LatticeElementLaw] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc