case class InclusiveUpper[T](upper: T) extends Interval[T] with Upper[T] with Product with Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- InclusiveUpper
- Product
- Equals
- Upper
- Interval
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Instance Constructors
- new InclusiveUpper(upper: T)
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def &&(that: Interval[T])(implicit ord: Ordering[T]): Interval[T]
- Definition Classes
- Interval
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def apply(t: T)(implicit ord: Ordering[T]): Boolean
- Definition Classes
- Interval
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def contains(t: T)(implicit ordering: Ordering[T]): Boolean
- Definition Classes
- InclusiveUpper → 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])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def greatest(implicit p: Predecessible[T]): Option[T]
The smallest value that is contained here This is an Option, because of cases like ExclusiveUpper(Int.MinValue), which are pathological and equivalent to Empty
The smallest value that is contained here This is an Option, because of cases like ExclusiveUpper(Int.MinValue), which are pathological and equivalent to Empty
- Definition Classes
- InclusiveUpper → Upper
- def intersect(that: Interval[T])(implicit ordering: Ordering[T]): Interval[T]
- Definition Classes
- InclusiveUpper → Interval
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def mapNonDecreasing[U](fn: (T) => U): Interval[U]
Map the Interval with a non-decreasing function.
Map the Interval with a non-decreasing function. If you use a non-monotonic function (like x^2) then the result is meaningless. TODO: It might be good to have types for these properties in algebird.
- Definition Classes
- InclusiveUpper → Interval
- 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 productElementNames: Iterator[String]
- Definition Classes
- Product
- def strictUpperBound(implicit s: Successible[T]): Option[T]
- Definition Classes
- InclusiveUpper → Upper
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toIterable(implicit p: Predecessible[T]): Iterable[T]
Iterates all the items in this Upper[T] from highest to lowest
Iterates all the items in this Upper[T] from highest to lowest
- Definition Classes
- Upper
- val upper: T
- 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()