Object

fif

RddData

Related Doc: package fif

Permalink

object RddData extends Data[RDD] with Serializable

Linear Supertypes
Data[RDD], Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RddData
  2. Data
  3. Serializable
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

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. def aggregate[A, B](d: RDD[A])(zero: B)(seqOp: (B, A) ⇒ B, combOp: (B, B) ⇒ B)(implicit arg0: ClassTag[B]): B

    Permalink
    Definition Classes
    RddData → Data
  5. final def asInstanceOf[T0]: T0

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  8. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  9. def filter[A](d: RDD[A])(f: (A) ⇒ Boolean): RDD[A]

    Permalink
    Definition Classes
    RddData → Data
  10. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. def flatMap[A, B](d: RDD[A])(f: (A) ⇒ TraversableOnce[B])(implicit arg0: ClassTag[B]): RDD[B]

    Permalink
    Definition Classes
    RddData → Data
  12. def flatten[A, B](d: RDD[A])(implicit arg0: ClassTag[B], asRDD: (A) ⇒ TraversableOnce[B]): RDD[B]

    Permalink
    Definition Classes
    RddData → Data
  13. def foreach[A](d: RDD[A])(f: (A) ⇒ Any): Unit

    Permalink

    Apply a side-effecting function to each element.

    Apply a side-effecting function to each element.

    Definition Classes
    RddData → Data
  14. def foreachPartition[A](d: RDD[A])(f: (Iterable[A]) ⇒ Any): Unit

    Permalink
    Definition Classes
    RddData → Data
  15. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  16. def groupBy[A, B](d: RDD[A])(f: (A) ⇒ B)(implicit arg0: ClassTag[B]): RDD[(B, Iterable[A])]

    Permalink
    Definition Classes
    RddData → Data
  17. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  18. def headOption[A](d: RDD[A]): Option[A]

    Permalink
    Definition Classes
    RddData → Data
  19. def isEmpty[A](d: RDD[A]): Boolean

    Permalink
    Definition Classes
    RddData → Data
  20. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  21. def map[A, B](data: RDD[A])(f: (A) ⇒ B)(implicit arg0: ClassTag[B]): RDD[B]

    Permalink

    Transform a dataset by applying f to each element.

    Transform a dataset by applying f to each element.

    Definition Classes
    RddData → Data
  22. def mapParition[A, B](d: RDD[A])(f: (Iterable[A]) ⇒ Iterable[B])(implicit arg0: ClassTag[B]): RDD[B]

    Permalink
    Definition Classes
    RddData → Data
  23. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  26. def reduce[A](d: RDD[A])(op: (A, A) ⇒ A): A

    Permalink

    This has type A as opposed to B >: A due to the RDD limitations

    This has type A as opposed to B >: A due to the RDD limitations

    Definition Classes
    RddData → Data
  27. def size[A](d: RDD[A]): Long

    Permalink
    Definition Classes
    RddData → Data
  28. def sortBy[A, B](d: RDD[A])(f: (A) ⇒ B)(implicit arg0: ClassTag[B], ord: Ordering[B]): RDD[A]

    Permalink

    Sort the dataset using a function f that evaluates each element to an orderable type

    Sort the dataset using a function f that evaluates each element to an orderable type

    Definition Classes
    RddData → Data
  29. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  30. def take[A](d: RDD[A])(k: Int): Traversable[A]

    Permalink

    Construct a traversable for the first k elements of a dataset.

    Construct a traversable for the first k elements of a dataset. Will load into main mem.

    Definition Classes
    RddData → Data
  31. def toSeq[A](d: RDD[A]): Seq[A]

    Permalink

    Load all elements of the dataset into an array in main memory.

    Load all elements of the dataset into an array in main memory.

    Definition Classes
    RddData → Data
  32. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  33. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  36. def zip[A, B](d: RDD[A])(that: RDD[B])(implicit arg0: ClassTag[B]): RDD[(A, B)]

    Permalink
    Definition Classes
    RddData → Data
  37. def zipWithIndex[A](d: RDD[A]): RDD[(A, Long)]

    Permalink
    Definition Classes
    RddData → Data

Inherited from Data[RDD]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped