Lower

abstract def contains(t: T)(implicit ord: Ordering[T]): Boolean

abstract def intersect(that: Interval[T])(implicit ord: Ordering[T]): Interval[T]

abstract def intersects(u: Upper[T])(implicit ord: Ordering[T]): Boolean

This may give a false positive (but should try not to).

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.

abstract def strictLowerBound(implicit p: Predecessible[T]): Option[T]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def &&(that: Interval[T])(implicit ord: Ordering[T]): Interval[T]

final def ==(arg0: Any): Boolean

final def apply(t: T)(implicit ord: Ordering[T]): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toIterable(implicit s: Successible[T]): Iterable[T]

Iterates all the items in this Lower[T] from lowest to highest

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit