org.apache.spark.api.java

JavaRDDLike

trait JavaRDDLike[T, This <: JavaRDDLike[T, This]] extends Serializable

Linear Supertypes
Serializable, Serializable, AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. JavaRDDLike
  2. Serializable
  3. Serializable
  4. AnyRef
  5. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Abstract Value Members

  1. implicit abstract val classTag: ClassTag[T]

  2. abstract def rdd: RDD[T]

  3. abstract def wrapRDD(rdd: RDD[T]): This

Concrete 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. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. def aggregate[U](zeroValue: U)(seqOp: Function2[U, T, U], combOp: Function2[U, U, U]): U

    Aggregate the elements of each partition, and then the results for all the partitions, using given combine functions and a neutral "zero value".

    Aggregate the elements of each partition, and then the results for all the partitions, using given combine functions and a neutral "zero value". This function can return a different result type, U, than the type of this RDD, T. Thus, we need one operation for merging a T into an U and one operation for merging two U's, as in scala.TraversableOnce. Both of these functions are allowed to modify and return their first argument instead of creating a new U to avoid memory allocation.

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  8. def cartesian[U](other: JavaRDDLike[U, _]): JavaPairRDD[T, U]

    Return the Cartesian product of this RDD and another one, that is, the RDD of all pairs of elements (a, b) where a is in this and b is in other.

  9. def checkpoint(): Unit

    Mark this RDD for checkpointing.

    Mark this RDD for checkpointing. It will be saved to a file inside the checkpoint directory set with SparkContext.setCheckpointDir() and all references to its parent RDDs will be removed. This function must be called before any job has been executed on this RDD. It is strongly recommended that this RDD is persisted in memory, otherwise saving it on a file will require recomputation.

  10. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  11. def collect(): List[T]

    Return an array that contains all of the elements in this RDD.

  12. def collectPartitions(partitionIds: Array[Int]): Array[List[T]]

    Return an array that contains all of the elements in a specific partition of this RDD.

  13. def context: SparkContext

    The org.apache.spark.SparkContext that this RDD was created on.

  14. def count(): Long

    Return the number of elements in the RDD.

  15. def countApprox(timeout: Long): PartialResult[BoundedDouble]

    (Experimental) Approximate version of count() that returns a potentially incomplete result within a timeout, even if not all tasks have finished.

  16. def countApprox(timeout: Long, confidence: Double): PartialResult[BoundedDouble]

    (Experimental) Approximate version of count() that returns a potentially incomplete result within a timeout, even if not all tasks have finished.

  17. def countApproxDistinct(relativeSD: Double = 0.05): Long

    Return approximate number of distinct elements in the RDD.

    Return approximate number of distinct elements in the RDD.

    The accuracy of approximation can be controlled through the relative standard deviation (relativeSD) parameter, which also controls the amount of memory used. Lower values result in more accurate counts but increase the memory footprint and vise versa. The default value of relativeSD is 0.05.

  18. def countByValue(): Map[T, Long]

    Return the count of each unique value in this RDD as a map of (value, count) pairs.

    Return the count of each unique value in this RDD as a map of (value, count) pairs. The final combine step happens locally on the master, equivalent to running a single reduce task.

  19. def countByValueApprox(timeout: Long): PartialResult[Map[T, BoundedDouble]]

    (Experimental) Approximate version of countByValue().

  20. def countByValueApprox(timeout: Long, confidence: Double): PartialResult[Map[T, BoundedDouble]]

    (Experimental) Approximate version of countByValue().

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

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

    Definition Classes
    AnyRef → Any
  23. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  24. def first(): T

    Return the first element in this RDD.

  25. def flatMap[K2, V2](f: PairFlatMapFunction[T, K2, V2]): JavaPairRDD[K2, V2]

    Return a new RDD by first applying a function to all elements of this RDD, and then flattening the results.

  26. def flatMap(f: DoubleFlatMapFunction[T]): JavaDoubleRDD

    Return a new RDD by first applying a function to all elements of this RDD, and then flattening the results.

  27. def flatMap[U](f: FlatMapFunction[T, U]): JavaRDD[U]

    Return a new RDD by first applying a function to all elements of this RDD, and then flattening the results.

  28. def fold(zeroValue: T)(f: Function2[T, T, T]): T

    Aggregate the elements of each partition, and then the results for all the partitions, using a given associative function and a neutral "zero value".

    Aggregate the elements of each partition, and then the results for all the partitions, using a given associative function and a neutral "zero value". The function op(t1, t2) is allowed to modify t1 and return it as its result value to avoid object allocation; however, it should not modify t2.

  29. def foreach(f: VoidFunction[T]): Unit

    Applies a function f to all elements of this RDD.

  30. def getCheckpointFile(): Optional[String]

    Gets the name of the file to which this RDD was checkpointed

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

    Definition Classes
    AnyRef → Any
  32. def getStorageLevel: StorageLevel

    Get the RDD's current storage level, or StorageLevel.

    Get the RDD's current storage level, or StorageLevel.NONE if none is set.

  33. def glom(): JavaRDD[List[T]]

    Return an RDD created by coalescing all elements within each partition into an array.

  34. def groupBy[K](f: Function[T, K], numPartitions: Int): JavaPairRDD[K, List[T]]

    Return an RDD of grouped elements.

    Return an RDD of grouped elements. Each group consists of a key and a sequence of elements mapping to that key.

  35. def groupBy[K](f: Function[T, K]): JavaPairRDD[K, List[T]]

    Return an RDD of grouped elements.

    Return an RDD of grouped elements. Each group consists of a key and a sequence of elements mapping to that key.

  36. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  37. def id: Int

    A unique ID for this RDD (within its SparkContext).

  38. def isCheckpointed: Boolean

    Return whether this RDD has been checkpointed or not

  39. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  40. def iterator(split: Partition, taskContext: TaskContext): Iterator[T]

    Internal method to this RDD; will read from cache if applicable, or otherwise compute it.

    Internal method to this RDD; will read from cache if applicable, or otherwise compute it. This should not be called by users directly, but is available for implementors of custom subclasses of RDD.

  41. def keyBy[K](f: Function[T, K]): JavaPairRDD[K, T]

    Creates tuples of the elements in this RDD by applying f.

  42. def map[K2, V2](f: PairFunction[T, K2, V2]): JavaPairRDD[K2, V2]

    Return a new RDD by applying a function to all elements of this RDD.

  43. def map[R](f: DoubleFunction[T]): JavaDoubleRDD

    Return a new RDD by applying a function to all elements of this RDD.

  44. def map[R](f: Function[T, R]): JavaRDD[R]

    Return a new RDD by applying a function to all elements of this RDD.

  45. def mapPartitions[K2, V2](f: PairFlatMapFunction[Iterator[T], K2, V2]): JavaPairRDD[K2, V2]

    Return a new RDD by applying a function to each partition of this RDD.

  46. def mapPartitions(f: DoubleFlatMapFunction[Iterator[T]]): JavaDoubleRDD

    Return a new RDD by applying a function to each partition of this RDD.

  47. def mapPartitions[U](f: FlatMapFunction[Iterator[T], U]): JavaRDD[U]

    Return a new RDD by applying a function to each partition of this RDD.

  48. def mapPartitionsWithIndex[R](f: Function2[Int, Iterator[T], Iterator[R]], preservesPartitioning: Boolean = false)(implicit arg0: ClassTag[R]): JavaRDD[R]

    Return a new RDD by applying a function to each partition of this RDD, while tracking the index of the original partition.

  49. def name(): String

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

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

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

    Definition Classes
    AnyRef
  53. def pipe(command: List[String], env: Map[String, String]): JavaRDD[String]

    Return an RDD created by piping elements to a forked external process.

  54. def pipe(command: List[String]): JavaRDD[String]

    Return an RDD created by piping elements to a forked external process.

  55. def pipe(command: String): JavaRDD[String]

    Return an RDD created by piping elements to a forked external process.

  56. def reduce(f: Function2[T, T, T]): T

    Reduces the elements of this RDD using the specified commutative and associative binary operator.

  57. def saveAsObjectFile(path: String): Unit

    Save this RDD as a SequenceFile of serialized objects.

  58. def saveAsTextFile(path: String, codec: Class[_ <: CompressionCodec]): Unit

    Save this RDD as a compressed text file, using string representations of elements.

  59. def saveAsTextFile(path: String): Unit

    Save this RDD as a text file, using string representations of elements.

  60. def splits: List[Partition]

    Set of partitions in this RDD.

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

    Definition Classes
    AnyRef
  62. def take(num: Int): List[T]

    Take the first num elements of the RDD.

    Take the first num elements of the RDD. This currently scans the partitions *one by one*, so it will be slow if a lot of partitions are required. In that case, use collect() to get the whole RDD instead.

  63. def takeOrdered(num: Int): List[T]

    Returns the first K elements from this RDD using the natural ordering for T while maintain the order.

    Returns the first K elements from this RDD using the natural ordering for T while maintain the order.

    num

    the number of top elements to return

    returns

    an array of top elements

  64. def takeOrdered(num: Int, comp: Comparator[T]): List[T]

    Returns the first K elements from this RDD as defined by the specified Comparator[T] and maintains the order.

    Returns the first K elements from this RDD as defined by the specified Comparator[T] and maintains the order.

    num

    the number of top elements to return

    comp

    the comparator that defines the order

    returns

    an array of top elements

  65. def takeSample(withReplacement: Boolean, num: Int, seed: Int): List[T]

  66. def toArray(): List[T]

    Return an array that contains all of the elements in this RDD.

  67. def toDebugString(): String

    A description of this RDD and its recursive dependencies for debugging.

  68. def toString(): String

    Definition Classes
    AnyRef → Any
  69. def top(num: Int): List[T]

    Returns the top K elements from this RDD using the natural ordering for T.

    Returns the top K elements from this RDD using the natural ordering for T.

    num

    the number of top elements to return

    returns

    an array of top elements

  70. def top(num: Int, comp: Comparator[T]): List[T]

    Returns the top K elements from this RDD as defined by the specified Comparator[T].

    Returns the top K elements from this RDD as defined by the specified Comparator[T].

    num

    the number of top elements to return

    comp

    the comparator that defines the order

    returns

    an array of top elements

  71. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  74. def zip[U](other: JavaRDDLike[U, _]): JavaPairRDD[T, U]

    Zips this RDD with another one, returning key-value pairs with the first element in each RDD, second element in each RDD, etc.

    Zips this RDD with another one, returning key-value pairs with the first element in each RDD, second element in each RDD, etc. Assumes that the two RDDs have the *same number of partitions* and the *same number of elements in each partition* (e.g. one was made through a map on the other).

  75. def zipPartitions[U, V](other: JavaRDDLike[U, _], f: FlatMapFunction2[Iterator[T], Iterator[U], V]): JavaRDD[V]

    Zip this RDD's partitions with one (or more) RDD(s) and return a new RDD by applying a function to the zipped partitions.

    Zip this RDD's partitions with one (or more) RDD(s) and return a new RDD by applying a function to the zipped partitions. Assumes that all the RDDs have the *same number of partitions*, but does *not* require them to have the same number of elements in each partition.

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped