InclusiveLower

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

    InclusiveLower → 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 intersect(that: Interval[T]): Interval[T]

    Definition Classes

    InclusiveLower → Interval

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

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

    This may give a false positive (but should try not to). Note the case of (0,1) for the integers. If they were doubles, this would intersect, but since there are no members of the set Int that are bigger than 0 and less than 1, they don't really intersect. So, ordering is not enough here. You need a stronger notion, which we don't have a typeclass for.

    Definition Classes

    InclusiveLower → Lower

16. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    The smallest value that is contained here This is an Option, because of cases like ExclusiveLower(Int.MaxValue) which are pathological and equivalent to Empty

    Definition Classes

    InclusiveLower → Lower

18. val lower: 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

    InclusiveLower → Interval

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. implicit val ordering: Ordering[T]

    Definition Classes

    InclusiveLower → Lower

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

    Definition Classes

    InclusiveLower → Lower

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

    Definition Classes

    AnyRef

26. def toIterable(implicit s: Successible[T]): Iterable[T]

    Iterates all the items in this Lower[T] from lowest to highest

    Iterates all the items in this Lower[T] from lowest to highest

    Definition Classes

    Lower

27. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )