Intersection

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. final def &&(that: Interval[T])(implicit ord: Ordering[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. final def apply(t: T)(implicit ord: Ordering[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)(implicit ordering: Ordering[T]): Boolean

    Definition Classes

    Intersection → Interval

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

15. def greatestToLeast(implicit p: Predecessible[T]): Iterable[T]

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

16. def intersect(that: Interval[T])(implicit ordering: Ordering[T]): Interval[T]

    Definition Classes

    Intersection → Interval

17. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

18. def least(implicit s: Successible[T]): Option[T]

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

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

20. val lower: L[T]

21. 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

22. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

23. final def notify(): Unit

    Definition Classes

    AnyRef

24. final def notifyAll(): Unit

    Definition Classes

    AnyRef

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

    Definition Classes

    AnyRef

26. 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).

27. val upper: U[T]

28. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

30. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )