case class Intersection[L[t] <: Lower[t], U[t] <: Upper[t], T](lower: L[T], upper: U[T]) extends Interval[T] with Product with Serializable
- Alphabetic
- By Inheritance
- Intersection
- Product
- Equals
- Interval
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new Intersection(lower: L[T], upper: U[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
- Intersection → 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]
- def greatestToLeast(implicit p: Predecessible[T]): Iterable[T]
Goes from highest to lowest for all items that are contained in this Intersection
- def intersect(that: Interval[T])(implicit ordering: Ordering[T]): Interval[T]
- Definition Classes
- Intersection → Interval
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def least(implicit s: Successible[T]): Option[T]
- 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[T1](fn: (T) => T1): Interval[T1]
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
- Intersection → 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
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- 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.
Some intervals can actually be synonyms for empty: (0,0) for instance, contains nothing. This cannot be normalized to [a, b) form, thus we return an option Also, there are cases like [Int.MinValue, Int.MaxValue] that cannot are actually equivalent to Universe. The bottom line: if this returns None, it just means you can't express it this way, it does not mean it is empty or universe, etc... (there are other cases).
- val upper: U[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()