com.twitter.algebird

Intersection

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

Linear Supertypes
Serializable, Product, Equals, Interval[T], Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Intersection
  2. Serializable
  3. Product
  4. Equals
  5. Interval
  6. Serializable
  7. AnyRef
  8. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Intersection(lower: L[T], upper: U[T])

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. def &&(that: Interval[T]): Interval[T]

    Definition Classes
    Interval
  5. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  6. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  7. def apply(t: T): Boolean

    Definition Classes
    Interval
  8. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  9. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. def contains(t: T): Boolean

    Definition Classes
    IntersectionInterval
  11. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  12. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  13. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  14. def greatestToLeast(implicit p: Predecessible[T]): Iterable[T]

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

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

    Definition Classes
    IntersectionInterval
  16. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  17. def leastToGreatest(implicit s: Successible[T]): Iterable[T]

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

  18. val lower: L[T]

  19. def mapNonDecreasing[U](fn: (T) ⇒ U)(implicit arg0: Ordering[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
    IntersectionInterval
  20. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  21. final def notify(): Unit

    Definition Classes
    AnyRef
  22. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  23. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  24. 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).

  25. val upper: U[T]

  26. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Interval[T]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped