InclusiveLower

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def &&(that: Interval[T]): Interval[T]

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def apply(t: T): Boolean

final def asInstanceOf[T0]: T0

def canEqual(arg0: Any): Boolean

def clone(): AnyRef

def contains(t: T): Boolean

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): java.lang.Class[_]

def hashCode(): Int

def intersect(that: Interval[T]): Interval[T]

def intersects(u: Upper[T]): Boolean

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

final def isInstanceOf[T0]: Boolean

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.

val lower: T

def mapNonDecreasing[U](fn: (T) ⇒ U)(implicit arg0: Ordering[U]): Interval[U]

Map the Interval with a non-decreasing function.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

implicit val ordering: Ordering[T]

def productArity: Int

def productElement(arg0: Int): Any

def productIterator: Iterator[Any]

def productPrefix: String

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

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

def productElements: Iterator[Any]