Class

com.twitter.algebird

IntegralPredecessible

Related Doc: package algebird

Permalink

class IntegralPredecessible[T] extends Predecessible[T]

Source
Predecessible.scala
Linear Supertypes
Predecessible[T], Serializable, AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IntegralPredecessible
  2. Predecessible
  3. Serializable
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new IntegralPredecessible()(implicit arg0: Integral[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. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  6. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  8. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  9. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  10. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  11. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  12. def iteratePrev(old: T): Iterable[T]

    Permalink
    Definition Classes
    Predecessible

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

    Permalink
    Definition Classes
    AnyRef

  14. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  15. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  16. def partialOrdering: PartialOrdering[T]

    Permalink

    The law is: prev(t) .map { n => partialOrdering.lteq(n, t) && (!partialOrdering.equiv(t, n)) } .getOrElse(true)

    The law is: prev(t) .map { n => partialOrdering.lteq(n, t) && (!partialOrdering.equiv(t, n)) } .getOrElse(true)

    Note Ordering extends PartialOrdering, so we are taking a weak constraint that some items can be ordered, and namely, the sequence of items returned by prev is strictly decreasing

    Definition Classes
    IntegralPredecessible → Predecessible

  17. def prev(old: T): Option[T]

    Permalink
    Definition Classes
    IntegralPredecessible → Predecessible

  18. def prev(old: Option[T]): Option[T]

    Permalink
    Definition Classes
    Predecessible

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

    Permalink
    Definition Classes
    AnyRef

  20. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  21. final def wait(): Unit

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

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

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

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

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

Inherited from Predecessible[T]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped