Class

spire.math

Above

Related Doc: package math

Permalink

case class Above[A] extends Interval[A] with Product with Serializable

Linear Supertypes
Product, Equals, Interval[A], Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Above
  2. Product
  3. Equals
  4. Interval
  5. Serializable
  6. Serializable
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def &(rhs: Interval[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  4. def *(rhs: A)(implicit ev: Semiring[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  5. def *(rhs: Interval[A])(implicit ev: Semiring[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  6. def +(rhs: A)(implicit ev: AdditiveSemigroup[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  7. def +(rhs: Interval[A])(implicit ev: AdditiveSemigroup[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  8. def -(rhs: A)(implicit ev: AdditiveGroup[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  9. def -(rhs: Interval[A])(implicit ev: AdditiveGroup[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  10. def --(rhs: Interval[A]): List[Interval[A]]

    Permalink
    Definition Classes
    Interval
  11. def /(rhs: A)(implicit ev: Field[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  12. def /(rhs: Interval[A])(implicit ev: Field[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  13. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  14. def \(rhs: Interval[A]): List[Interval[A]]

    Permalink
    Definition Classes
    Interval
  15. def abs(implicit m: AdditiveGroup[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  16. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  17. def bottom(epsilon: A)(implicit r: AdditiveGroup[A]): Option[A]

    Permalink
    Definition Classes
    Interval
  18. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  19. def combine(rhs: Interval[A])(f: (A, A) ⇒ A): Interval[A]

    Permalink
    Definition Classes
    Interval
  20. def contains(t: A): Boolean

    Permalink
    Definition Classes
    Interval
  21. def crosses(t: A): Boolean

    Permalink
    Definition Classes
    Interval
  22. def crossesZero(implicit ev: AdditiveMonoid[A]): Boolean

    Permalink
    Definition Classes
    Interval
  23. def dist(min: A, max: A, epsilon: A)(implicit u: Uniform[A], r: AdditiveGroup[A]): Dist[A]

    Permalink
    Definition Classes
    Interval
  24. def doesNotContain(t: A): Boolean

    Permalink
    Definition Classes
    Interval
  25. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  26. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  27. val flags: Int

    Permalink
  28. def fold[B](f: (Bound[A], Bound[A]) ⇒ B): B

    Permalink
    Definition Classes
    Interval
  29. def foldOver[B](init: B, step: A)(f: (B, A) ⇒ B)(implicit ev: AdditiveMonoid[A], nt: NumberTag[A]): B

    Permalink
    Definition Classes
    Interval
  30. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  31. def hasAbove(t: A): Boolean

    Permalink
    Definition Classes
    Interval
  32. def hasAtOrAbove(t: A): Boolean

    Permalink
    Definition Classes
    Interval
  33. def hasAtOrBelow(t: A): Boolean

    Permalink
    Definition Classes
    Interval
  34. def hasBelow(t: A): Boolean

    Permalink
    Definition Classes
    Interval
  35. def intersect(rhs: Interval[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  36. def intersects(rhs: Interval[A]): Boolean

    Permalink
    Definition Classes
    Interval
  37. def isAt(t: A): Boolean

    Permalink
    Definition Classes
    Interval
  38. def isBounded: Boolean

    Permalink
    Definition Classes
    Interval
  39. final def isClosed(flags: Int): Boolean

    Permalink
    Attributes
    protected[this]
    Definition Classes
    Interval
    Annotations
    @inline()
  40. final def isClosedLower(flags: Int): Boolean

    Permalink
    Attributes
    protected[this]
    Definition Classes
    Interval
    Annotations
    @inline()
  41. final def isClosedUpper(flags: Int): Boolean

    Permalink
    Attributes
    protected[this]
    Definition Classes
    Interval
    Annotations
    @inline()
  42. def isEmpty: Boolean

    Permalink
    Definition Classes
    Interval
  43. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  44. final def isOpen(flags: Int): Boolean

    Permalink
    Attributes
    protected[this]
    Definition Classes
    Interval
    Annotations
    @inline()
  45. final def isOpenLower(flags: Int): Boolean

    Permalink
    Attributes
    protected[this]
    Definition Classes
    Interval
    Annotations
    @inline()
  46. final def isOpenUpper(flags: Int): Boolean

    Permalink
    Attributes
    protected[this]
    Definition Classes
    Interval
    Annotations
    @inline()
  47. def isPoint: Boolean

    Permalink
    Definition Classes
    Interval
  48. def isProperSubsetOf(rhs: Interval[A]): Boolean

    Permalink
    Definition Classes
    Interval
  49. def isProperSupersetOf(rhs: Interval[A]): Boolean

    Permalink
    Definition Classes
    Interval
  50. def isSubsetOf(rhs: Interval[A]): Boolean

    Permalink
    Definition Classes
    Interval
  51. def isSupersetOf(rhs: Interval[A]): Boolean

    Permalink
    Definition Classes
    Interval
  52. def iterator(step: A)(implicit ev: AdditiveMonoid[A], nt: NumberTag[A]): Iterator[A]

    Permalink

    Build an Iterator[A] from an Interval[A] and a (step: A) parameter.

    Build an Iterator[A] from an Interval[A] and a (step: A) parameter.

    A positive 'step' means we are proceeding from the lower bound up, and a negative 'step' means we are proceeding from the upper bound down. In each case, the interval must be bounded on the side we are starting with (though it may be unbound on the opposite side). A zero 'step' is not allowed.

    The step is repeatedly added to the starting parameter as long as the sum remains within the interval. This means that arithmetic error can accumulate (e.g. with doubles). However, this method does overflow checking to ensure that Intervals parameterized on integer types will behave correctly.

    Users who want to avoid using arithmetic error should consider starting with an Interval[Rational], calling iterator with the exact step desired, then mapping to the original type (e.g. Double). For example:

    val ns = Interval.closed(Rational(0), Rational(5)) val it = ns.iterator(Rational(1, 7)).map(_.toDouble)

    This method provides some of the same functionality as Scala's NumericRange class.

    Definition Classes
    Interval
  53. def loop(step: A)(f: (A) ⇒ Unit)(implicit ev: AdditiveMonoid[A], nt: NumberTag[A]): Unit

    Permalink
    Definition Classes
    Interval
  54. val lower: A

    Permalink
  55. def lowerBound: ValueBound[A]

    Permalink
    Definition Classes
    AboveInterval
  56. final def lowerFlag(flags: Int): Int

    Permalink
    Attributes
    protected[this]
    Definition Classes
    Interval
    Annotations
    @inline()
  57. final def lowerFlagToUpper(flags: Int): Int

    Permalink
    Attributes
    protected[this]
    Definition Classes
    Interval
  58. def lowerPairBelow(lower1: A, flags1: Int, lower2: A, flags2: Int): Boolean

    Permalink
    Attributes
    protected[this]
    Definition Classes
    Interval
  59. def mapAroundZero[B](f: (Interval[A]) ⇒ B)(implicit ev: AdditiveMonoid[A]): (B, B)

    Permalink
    Definition Classes
    Interval
  60. def mapBounds[B](f: (A) ⇒ B)(implicit arg0: Order[B]): Interval[B]

    Permalink
    Definition Classes
    Interval
  61. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  62. def nonEmpty: Boolean

    Permalink
    Definition Classes
    Interval
  63. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  64. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  65. def nroot(k: Int)(implicit r: Ring[A], n: NRoot[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  66. def overlap(rhs: Interval[A]): Overlap[A]

    Permalink

    Result of overlapping this interval with another one.

    Result of overlapping this interval with another one. Can be one of the following: - Equal if intervals are equal - Disjoint if intervals are notEmpty don't intersect - PartialOverlap if intervals intersect and neither is a subset of another - Subset if one interval (possibly empty) is a subset of another

    Except for Equal, both original intervals are bound to respective result fields, allowing to determine exact overlap type.

    For example (pseudo-code): { val a = [5, 6] val b = (0, 1)

    // this returns Disjoint(b, a). Note a and b placement here, it means that b is strictly less then a. a.overlap(b) }

    Definition Classes
    Interval
  67. def pow(k: Int)(implicit r: Ring[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  68. def reciprocal(implicit ev: Field[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  69. final def reverseFlags(flags: Int): Int

    Permalink
    Attributes
    protected[this]
    Definition Classes
    Interval
    Annotations
    @inline()
  70. final def reverseLowerFlag(flags: Int): Int

    Permalink
    Attributes
    protected[this]
    Definition Classes
    Interval
    Annotations
    @inline()
  71. final def reverseUpperFlag(flags: Int): Int

    Permalink
    Attributes
    protected[this]
    Definition Classes
    Interval
    Annotations
    @inline()
  72. def split(t: A): (Interval[A], Interval[A])

    Permalink
    Definition Classes
    Interval
  73. def splitAtZero(implicit ev: AdditiveMonoid[A]): (Interval[A], Interval[A])

    Permalink
    Definition Classes
    Interval
  74. def sqrt(implicit r: Ring[A], n: NRoot[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  75. final def swapFlags(flags: Int): Int

    Permalink
    Attributes
    protected[this]
    Definition Classes
    Interval
    Annotations
    @inline()
  76. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  77. def toString(): String

    Permalink
    Definition Classes
    Interval → AnyRef → Any
  78. def top(epsilon: A)(implicit r: AdditiveGroup[A]): Option[A]

    Permalink
    Definition Classes
    Interval
  79. def translate(p: Polynomial[A])(implicit ev: Field[A]): Interval[A]

    Permalink

    Apply the given polynomial to the interval.

    Apply the given polynomial to the interval.

    For every point contained in the interval, this method maps that point through the given polynomial. The resulting interval is the set of all the translated points. I.e.

    result = { p(x) | x ∈ interval }

    Definition Classes
    Interval
  80. def unary_-()(implicit ev: AdditiveGroup[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  81. def unary_~(): List[Interval[A]]

    Permalink
    Definition Classes
    Interval
  82. def union(rhs: Interval[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  83. def upperBound: Unbound[A]

    Permalink
    Definition Classes
    AboveInterval
  84. final def upperFlag(flags: Int): Int

    Permalink
    Attributes
    protected[this]
    Definition Classes
    Interval
    Annotations
    @inline()
  85. final def upperFlagToLower(flags: Int): Int

    Permalink
    Attributes
    protected[this]
    Definition Classes
    Interval
  86. def upperPairAbove(upper1: A, flags1: Int, upper2: A, flags2: Int): Boolean

    Permalink
    Attributes
    protected[this]
    Definition Classes
    Interval
  87. def vmax(rhs: Interval[A])(implicit m: AdditiveMonoid[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  88. def vmin(rhs: Interval[A])(implicit m: AdditiveMonoid[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  89. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  90. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  91. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  92. def |(rhs: Interval[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  93. def ∈:(a: A): Boolean

    Permalink
    Definition Classes
    Interval
  94. def ∉:(a: A): Boolean

    Permalink
    Definition Classes
    Interval
  95. def (rhs: A): Boolean

    Permalink
    Definition Classes
    Interval
  96. def (rhs: A): Boolean

    Permalink
    Definition Classes
    Interval
  97. def (rhs: Interval[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  98. def (rhs: Interval[A]): Interval[A]

    Permalink
    Definition Classes
    Interval
  99. def (rhs: Interval[A]): Boolean

    Permalink
    Definition Classes
    Interval
  100. def (rhs: Interval[A]): Boolean

    Permalink
    Definition Classes
    Interval
  101. def (rhs: Interval[A]): Boolean

    Permalink
    Definition Classes
    Interval
  102. def (rhs: Interval[A]): Boolean

    Permalink
    Definition Classes
    Interval

Inherited from Product

Inherited from Equals

Inherited from Interval[A]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped