Intersection

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 greatestToLeast(implicit p: Predecessible[T]): Iterable[T]

Goes from highest to lowest for all items that are contained in this Intersection

def hashCode(): Int

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

final def isInstanceOf[T0]: Boolean

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

Goes from lowest to highest for all items that are contained in this Intersection

val lower: L[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

def productArity: Int

def productElement(arg0: Int): Any

def productIterator: Iterator[Any]

def productPrefix: String

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

def toLeftClosedRightOpen(implicit s: Successible[T]): Option[Intersection[InclusiveLower, ExclusiveUpper, T]]

Some intervals can actually be synonyms for empty: (0,0) for instance, contains nothing.

def toString(): String

val upper: U[T]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def productElements: Iterator[Any]