com.twitter.algebird

ExclusiveUpper

case class ExclusiveUpper[T](upper: T)(implicit ordering: Ordering[T]) extends Interval[T] with Upper[T] with Product with Serializable

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

Instance Constructors

  1. new ExclusiveUpper(upper: T)(implicit ordering: Ordering[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
    ExclusiveUpperInterval
  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]

    The smallest value that is contained here This is an Option, because of cases like ExclusiveUpper(Int.

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

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

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

    Definition Classes
    Any
  17. 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
    ExclusiveUpperInterval
  18. final def ne(arg0: AnyRef): Boolean

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

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

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

    Definition Classes
    ExclusiveUpperUpper
  22. def strictUpperBound(implicit s: Successible[T]): Option[T]

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

    Definition Classes
    AnyRef
  24. def toIterable(implicit p: Predecessible[T]): Iterable[T]

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

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

    Definition Classes
    Upper
  25. val upper: 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 Upper[T]

Inherited from Interval[T]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped