Packages

c

spire.optional.intervalGeometricPartialOrder

IntervalGeometricPartialOrder

class IntervalGeometricPartialOrder[A] extends PartialOrder[Interval[A]]

Interval partial order defined as follows:

Involving empty intervals:

- if I and J are empty, then I === J. - if I (resp. J) is empty and J (resp. I) is non-empty, the ordering is undefined (preserving antisymmetry).

For non-empty intervals:

- I === J is standard Eq semantics (I, J are intersubstituable) - I < J if all x \in I, y \in J have x < y - I > J if all x \in I, y \in J have x > y

Linear Supertypes
PartialOrder[Interval[A]], Eq[Interval[A]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IntervalGeometricPartialOrder
  2. PartialOrder
  3. Eq
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new IntervalGeometricPartialOrder()(implicit arg0: Order[A])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def eqv(x: Interval[A], y: Interval[A]): Boolean

    Returns true if x and y are equivalent, false otherwise.

    Returns true if x and y are equivalent, false otherwise.

    Definition Classes
    IntervalGeometricPartialOrder → PartialOrder → Eq
  9. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  11. def gt(x: Interval[A], y: Interval[A]): Boolean
    Definition Classes
    PartialOrder
  12. def gteqv(x: Interval[A], y: Interval[A]): Boolean
    Definition Classes
    PartialOrder
  13. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  14. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  15. def lt(x: Interval[A], y: Interval[A]): Boolean
    Definition Classes
    PartialOrder
  16. def lteqv(x: Interval[A], y: Interval[A]): Boolean
    Definition Classes
    PartialOrder
  17. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. def neqv(x: Interval[A], y: Interval[A]): Boolean

    Returns false if x and y are equivalent, true otherwise.

    Returns false if x and y are equivalent, true otherwise.

    Definition Classes
    Eq
  19. final def notify(): Unit
    Definition Classes
    AnyRef
  20. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  21. def on[B](f: (B) ⇒ Interval[A]): PartialOrder[B]

    Defines a partial order on B by mapping B to A using f and using As order to order B.

    Defines a partial order on B by mapping B to A using f and using As order to order B.

    Definition Classes
    PartialOrder → Eq
  22. def partialCompare(i: Interval[A], j: Interval[A]): Double

    Result of comparing x with y.

    Result of comparing x with y. Returns NaN if operands are not comparable. If operands are comparable, returns a Double whose sign is: - negative iff x < y - zero iff x === y - positive iff x > y

    Definition Classes
    IntervalGeometricPartialOrder → PartialOrder
  23. def pmax(x: Interval[A], y: Interval[A]): Option[Interval[A]]

    Returns Some(x) if x >= y, Some(y) if x < y, otherwise None.

    Returns Some(x) if x >= y, Some(y) if x < y, otherwise None.

    Definition Classes
    PartialOrder
  24. def pmin(x: Interval[A], y: Interval[A]): Option[Interval[A]]

    Returns Some(x) if x <= y, Some(y) if x > y, otherwise None.

    Returns Some(x) if x <= y, Some(y) if x > y, otherwise None.

    Definition Classes
    PartialOrder
  25. def reverse: PartialOrder[Interval[A]]

    Defines a partial order on A where all arrows switch direction.

    Defines a partial order on A where all arrows switch direction.

    Definition Classes
    PartialOrder
  26. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  27. def toString(): String
    Definition Classes
    AnyRef → Any
  28. def tryCompare(x: Interval[A], y: Interval[A]): Option[Int]

    Result of comparing x with y.

    Result of comparing x with y. Returns None if operands are not comparable. If operands are comparable, returns Some[Int] where the Int sign is: - negative iff x < y - zero iff x == y - positive iff x > y

    Definition Classes
    PartialOrder
  29. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from PartialOrder[Interval[A]]

Inherited from Eq[Interval[A]]

Inherited from AnyRef

Inherited from Any

Ungrouped