Class

com.twitter.algebird

InclusiveLower

Related Doc: package algebird

Permalink

case class InclusiveLower[T](lower: T)(implicit ordering: Ordering[T]) extends Interval[T] with Lower[T] with Product with Serializable

Source
Interval.scala
Linear Supertypes
Serializable, Product, Equals, Lower[T], Interval[T], Serializable, AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. InclusiveLower
  2. Serializable
  3. Product
  4. Equals
  5. Lower
  6. Interval
  7. Serializable
  8. AnyRef
  9. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new InclusiveLower(lower: T)(implicit ordering: Ordering[T])

    Permalink

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

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

    Permalink
    Definition Classes
    Interval
  4. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  5. def apply(t: T): Boolean

    Permalink
    Definition Classes
    Interval
  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. def clone(): AnyRef

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

    Permalink
    Definition Classes
    InclusiveLowerInterval
  9. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  10. def finalize(): Unit

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

    Permalink
    Definition Classes
    AnyRef → Any
  12. def intersect(that: Interval[T]): Interval[T]

    Permalink
    Definition Classes
    InclusiveLowerInterval
  13. def intersects(u: Upper[T]): Boolean

    Permalink

    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
    InclusiveLowerLower
  14. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  15. def least(implicit s: Successible[T]): Option[T]

    Permalink

    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

    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
    InclusiveLowerLower
  16. val lower: T

    Permalink
  17. def mapNonDecreasing[U](fn: (T) ⇒ U)(implicit arg0: Ordering[U]): Interval[U]

    Permalink

    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
    InclusiveLowerInterval
  18. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  19. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  20. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  21. implicit val ordering: Ordering[T]

    Permalink
    Definition Classes
    InclusiveLowerLower
  22. def strictLowerBound(implicit p: Predecessible[T]): Option[T]

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

    Permalink
    Definition Classes
    AnyRef
  24. def toIterable(implicit s: Successible[T]): Iterable[T]

    Permalink

    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
  25. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Lower[T]

Inherited from Interval[T]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped