Class/Object

org.hammerlab.magic.rdd.scan

ScanRightRDD

Related Docs: object ScanRightRDD | package scan

Permalink

class ScanRightRDD[T] extends Serializable

RDD wrapper supporting methods that compute partial-sums (from right to left) across the RDD.

Linear Supertypes
Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ScanRightRDD
  2. Serializable
  3. Serializable
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ScanRightRDD(rdd: RDD[T])(implicit arg0: ClassTag[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. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  13. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  14. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  15. val rdd: RDD[T]

    Permalink

  16. def scanRight(identity: T, useRDDReversal: Boolean = false)(combine: (T, T) ⇒ T): RDD[T]

    Permalink

  17. def scanRight[U](identity: U, aggregate: (T, U) ⇒ U, combine: (U, U) ⇒ U)(implicit arg0: ClassTag[U]): RDD[U]

    Permalink

  18. def scanRight[U](identity: U, aggregate: (T, U) ⇒ U, combine: (U, U) ⇒ U, useRDDReversal: Boolean)(implicit arg0: ClassTag[U]): RDD[U]

    Permalink

    identity

    used to initialize per-partition "sums"

    aggregate

    aggregate an RDD element into a running "sum"

    combine

    combine two "sums"

    useRDDReversal

    when set, reverse the RDD, do a scanLeft (see ScanLeftRDD, and then reverse it back. Usually this will be more work than the default implementation, but the latter materializes whole partitions into memory as part of calling Iterator.scanRight, which may be prohibitively memory-expensive in some cases.

  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 Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped