case class Below[A] extends Interval[A] with Product with Serializable
- Alphabetic
- By Inheritance
- Below
- Product
- Equals
- Interval
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def &(rhs: Interval[A])(implicit o: Order[A]): Interval[A]
- Definition Classes
- Interval
- def *(rhs: A)(implicit o: Order[A], ev: Semiring[A]): Interval[A]
- Definition Classes
- Interval
- def *(rhs: Interval[A])(implicit o: Order[A], ev: Semiring[A]): Interval[A]
- Definition Classes
- Interval
- def +(rhs: A)(implicit ev: AdditiveSemigroup[A]): Interval[A]
- Definition Classes
- Interval
- def +(rhs: Interval[A])(implicit o: Order[A], ev: AdditiveSemigroup[A]): Interval[A]
- Definition Classes
- Interval
- def -(rhs: A)(implicit ev: AdditiveGroup[A]): Interval[A]
- Definition Classes
- Interval
- def -(rhs: Interval[A])(implicit o: Order[A], ev: AdditiveGroup[A]): Interval[A]
- Definition Classes
- Interval
- def --(rhs: Interval[A])(implicit o: Order[A]): List[Interval[A]]
- Definition Classes
- Interval
- def /(rhs: A)(implicit o: Order[A], ev: Field[A]): Interval[A]
- Definition Classes
- Interval
- def /(rhs: Interval[A])(implicit o: Order[A], ev: Field[A]): Interval[A]
- Definition Classes
- Interval
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def \(rhs: Interval[A])(implicit o: Order[A]): List[Interval[A]]
- Definition Classes
- Interval
- def abs(implicit o: Order[A], m: AdditiveGroup[A]): Interval[A]
- Definition Classes
- Interval
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def bottom(epsilon: A)(implicit r: AdditiveGroup[A]): Option[A]
- Definition Classes
- Interval
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def combine(rhs: Interval[A])(f: (A, A) => A)(implicit o: Order[A]): Interval[A]
- Definition Classes
- Interval
- def contains(t: A)(implicit o: Order[A]): Boolean
- Definition Classes
- Interval
- def crosses(t: A)(implicit o: Order[A]): Boolean
- Definition Classes
- Interval
- def crossesZero(implicit o: Order[A], ev: AdditiveMonoid[A]): Boolean
- Definition Classes
- Interval
- def dist(min: A, max: A, epsilon: A)(implicit u: Uniform[A], r: AdditiveGroup[A]): Dist[A]
- Definition Classes
- Interval
- def doesNotContain(t: A)(implicit o: Order[A]): Boolean
- Definition Classes
- Interval
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- val flags: Int
- def fold[B](f: (Bound[A], Bound[A]) => B): B
- Definition Classes
- Interval
- def foldOver[B](init: B, step: A)(f: (B, A) => B)(implicit o: Order[A], ev: AdditiveMonoid[A], nt: NumberTag[A]): B
- Definition Classes
- Interval
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hasAbove(t: A)(implicit o: Order[A]): Boolean
- Definition Classes
- Interval
- def hasAtOrAbove(t: A)(implicit o: Order[A]): Boolean
- Definition Classes
- Interval
- def hasAtOrBelow(t: A)(implicit o: Order[A]): Boolean
- Definition Classes
- Interval
- def hasBelow(t: A)(implicit o: Order[A]): Boolean
- Definition Classes
- Interval
- def intersect(rhs: Interval[A])(implicit o: Order[A]): Interval[A]
- Definition Classes
- Interval
- def intersects(rhs: Interval[A])(implicit o: Order[A]): Boolean
- Definition Classes
- Interval
- def isAt(t: A)(implicit o: Eq[A]): Boolean
- Definition Classes
- Interval
- def isBounded: Boolean
- Definition Classes
- Interval
- final def isClosed(flags: Int): Boolean
- Attributes
- protected[this]
- Definition Classes
- Interval
- Annotations
- @inline()
- final def isClosedLower(flags: Int): Boolean
- Attributes
- protected[this]
- Definition Classes
- Interval
- Annotations
- @inline()
- final def isClosedUpper(flags: Int): Boolean
- Attributes
- protected[this]
- Definition Classes
- Interval
- Annotations
- @inline()
- def isEmpty: Boolean
- Definition Classes
- Interval
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def isOpen(flags: Int): Boolean
- Attributes
- protected[this]
- Definition Classes
- Interval
- Annotations
- @inline()
- final def isOpenLower(flags: Int): Boolean
- Attributes
- protected[this]
- Definition Classes
- Interval
- Annotations
- @inline()
- final def isOpenUpper(flags: Int): Boolean
- Attributes
- protected[this]
- Definition Classes
- Interval
- Annotations
- @inline()
- def isPoint: Boolean
- Definition Classes
- Interval
- def isProperSubsetOf(rhs: Interval[A])(implicit o: Order[A]): Boolean
- Definition Classes
- Interval
- def isProperSupersetOf(rhs: Interval[A])(implicit o: Order[A]): Boolean
- Definition Classes
- Interval
- def isSubsetOf(rhs: Interval[A])(implicit o: Order[A]): Boolean
- Definition Classes
- Interval
- def isSupersetOf(rhs: Interval[A])(implicit o: Order[A]): Boolean
- Definition Classes
- Interval
- def iterator(step: A)(implicit o: Order[A], ev: AdditiveMonoid[A], nt: NumberTag[A]): Iterator[A]
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
- def loop(step: A)(f: (A) => Unit)(implicit o: Order[A], ev: AdditiveMonoid[A], nt: NumberTag[A]): Unit
- Definition Classes
- Interval
- def lowerBound: Unbound[A]
- final def lowerFlag(flags: Int): Int
- Attributes
- protected[this]
- Definition Classes
- Interval
- Annotations
- @inline()
- final def lowerFlagToUpper(flags: Int): Int
- Attributes
- protected[this]
- Definition Classes
- Interval
- def lowerPairBelow(lower1: A, flags1: Int, lower2: A, flags2: Int)(implicit o: Order[A]): Boolean
- Attributes
- protected[this]
- Definition Classes
- Interval
- def mapAroundZero[B](f: (Interval[A]) => B)(implicit o: Order[A], ev: AdditiveMonoid[A]): (B, B)
- Definition Classes
- Interval
- def mapBounds[B](f: (A) => B)(implicit arg0: Order[B]): Interval[B]
- Definition Classes
- Interval
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def nonEmpty: Boolean
- Definition Classes
- Interval
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def nroot(k: Int)(implicit o: Order[A], r: Ring[A], n: NRoot[A]): Interval[A]
- Definition Classes
- Interval
- def overlap(rhs: Interval[A])(implicit o: Order[A]): Overlap[A]
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
- def pow(k: Int)(implicit o: Order[A], r: Ring[A]): Interval[A]
- Definition Classes
- Interval
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def reciprocal(implicit o: Order[A], ev: Field[A]): Interval[A]
- Definition Classes
- Interval
- final def reverseFlags(flags: Int): Int
- Attributes
- protected[this]
- Definition Classes
- Interval
- Annotations
- @inline()
- final def reverseLowerFlag(flags: Int): Int
- Attributes
- protected[this]
- Definition Classes
- Interval
- Annotations
- @inline()
- final def reverseUpperFlag(flags: Int): Int
- Attributes
- protected[this]
- Definition Classes
- Interval
- Annotations
- @inline()
- def split(t: A)(implicit o: Order[A]): (Interval[A], Interval[A])
- Definition Classes
- Interval
- def splitAtZero(implicit o: Order[A], ev: AdditiveMonoid[A]): (Interval[A], Interval[A])
- Definition Classes
- Interval
- def sqrt(implicit o: Order[A], r: Ring[A], n: NRoot[A]): Interval[A]
- Definition Classes
- Interval
- final def swapFlags(flags: Int): Int
- Attributes
- protected[this]
- Definition Classes
- Interval
- Annotations
- @inline()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- Interval → AnyRef → Any
- def top(epsilon: A)(implicit r: AdditiveGroup[A]): Option[A]
- Definition Classes
- Interval
- def translate(p: Polynomial[A])(implicit o: Order[A], ev: Field[A]): Interval[A]
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
- def unary_-(implicit ev: AdditiveGroup[A]): Interval[A]
- Definition Classes
- Interval
- def unary_~(implicit o: Order[A]): List[Interval[A]]
- Definition Classes
- Interval
- def union(rhs: Interval[A])(implicit o: Order[A]): Interval[A]
- Definition Classes
- Interval
- val upper: A
- def upperBound: ValueBound[A]
- final def upperFlag(flags: Int): Int
- Attributes
- protected[this]
- Definition Classes
- Interval
- Annotations
- @inline()
- final def upperFlagToLower(flags: Int): Int
- Attributes
- protected[this]
- Definition Classes
- Interval
- def upperPairAbove(upper1: A, flags1: Int, upper2: A, flags2: Int)(implicit o: Order[A]): Boolean
- Attributes
- protected[this]
- Definition Classes
- Interval
- def vmax(rhs: Interval[A])(implicit o: Order[A]): Interval[A]
- Definition Classes
- Interval
- def vmin(rhs: Interval[A])(implicit o: Order[A]): Interval[A]
- Definition Classes
- Interval
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- def |(rhs: Interval[A])(implicit o: Order[A]): Interval[A]
- Definition Classes
- Interval
- def ∈:(a: A)(implicit o: Order[A]): Boolean
- Definition Classes
- Interval
- def ∉:(a: A)(implicit o: Order[A]): Boolean
- Definition Classes
- Interval
- def ∋(rhs: A)(implicit o: Order[A]): Boolean
- Definition Classes
- Interval
- def ∌(rhs: A)(implicit o: Order[A]): Boolean
- Definition Classes
- Interval
- def ∩(rhs: Interval[A])(implicit o: Order[A]): Interval[A]
- Definition Classes
- Interval
- def ∪(rhs: Interval[A])(implicit o: Order[A]): Interval[A]
- Definition Classes
- Interval
- def ⊂(rhs: Interval[A])(implicit o: Order[A]): Boolean
- Definition Classes
- Interval
- def ⊃(rhs: Interval[A])(implicit o: Order[A]): Boolean
- Definition Classes
- Interval
- def ⊆(rhs: Interval[A])(implicit o: Order[A]): Boolean
- Definition Classes
- Interval
- def ⊇(rhs: Interval[A])(implicit o: Order[A]): Boolean
- Definition Classes
- Interval