sealed trait Lower[T] extends Interval[T]
- Alphabetic
- By Inheritance
- Lower
- Interval
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
- abstract def contains(t: T)(implicit ord: Ordering[T]): Boolean
- Definition Classes
- Interval
- abstract def intersect(that: Interval[T])(implicit ord: Ordering[T]): Interval[T]
- Definition Classes
- Interval
- abstract def intersects(u: Upper[T])(implicit ord: Ordering[T]): Boolean
This may give a false positive (but should try not to).
This may give a false positive (but should try not to). Note the case of (0,1) for the integers. If they were doubles, this would intersect, but since there are no members of the set Int that are bigger than 0 and less than 1, they don't really intersect. So, ordering is not enough here. You need a stronger notion, which we don't have a typeclass for.
- abstract def least(implicit s: Successible[T]): Option[T]
The smallest value that is contained here This is an Option, because of cases like ExclusiveLower(Int.MaxValue) which are pathological and equivalent to Empty
- abstract 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
- Interval
- abstract def strictLowerBound(implicit p: Predecessible[T]): Option[T]
Concrete 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()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- 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 hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- 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()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toIterable(implicit s: Successible[T]): Iterable[T]
Iterates all the items in this Lower[T] from lowest to highest
- def toString(): String
- Definition Classes
- AnyRef → Any
- 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()