Return the union of this RDD and another one.
Return the union of this RDD and another one. Any identical elements will appear multiple
times (use .distinct() to eliminate them).
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.
Persist this RDD with the default storage level (MEMORY_ONLY).
Persist this RDD with the default storage level (MEMORY_ONLY).
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.
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.
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.
Clears the dependencies of this RDD.
Clears the dependencies of this RDD. This method must ensure that all references to the original parent RDDs is removed to enable the parent RDDs to be garbage collected. Subclasses of RDD may override this method for implementing their own cleaning logic. See org.apache.spark.rdd.UnionRDD for an example.
Return a new RDD that is reduced into numPartitions partitions.
Return a new RDD that is reduced into numPartitions partitions.
This results in a narrow dependency, e.g. if you go from 1000 partitions to 100 partitions, there will not be a shuffle, instead each of the 100 new partitions will claim 10 of the current partitions.
However, if you're doing a drastic coalesce, e.g. to numPartitions = 1, this may result in your computation taking place on fewer nodes than you like (e.g. one node in the case of numPartitions = 1). To avoid this, you can pass shuffle = true. This will add a shuffle step, but means the current upstream partitions will be executed in parallel (per whatever the current partitioning is).
Note: With shuffle = true, you can actually coalesce to a larger number of partitions. This is useful if you have a small number of partitions, say 100, potentially with a few partitions being abnormally large. Calling coalesce(1000, shuffle = true) will result in 1000 partitions with the data distributed using a hash partitioner.
Return an RDD that contains all matching values by applying f.
Return an RDD that contains all matching values by applying f.
Return an array that contains all of the elements in this RDD.
Return an array that contains all of the elements in this RDD.
Implemented by subclasses to compute a given partition.
Implemented by subclasses to compute a given partition.
The org.apache.spark.SparkContext that this RDD was created on.
The org.apache.spark.SparkContext that this RDD was created on.
Return the number of elements in the RDD.
Return the number of elements in the RDD.
(Experimental) Approximate version of count() that returns a potentially incomplete result within a timeout, even if not all tasks have finished.
(Experimental) Approximate version of count() that returns a potentially incomplete result within a timeout, even if not all tasks have finished.
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.
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.
(Experimental) Approximate version of countByValue().
(Experimental) Approximate version of countByValue().
Get the list of dependencies of this RDD, taking into account whether the RDD is checkpointed or not.
Get the list of dependencies of this RDD, taking into account whether the RDD is checkpointed or not.
Return a new RDD containing the distinct elements in this RDD.
Return a new RDD containing the distinct elements in this RDD.
Return a new RDD containing the distinct elements in this RDD.
Return a new RDD containing the distinct elements in this RDD.
Return a new RDD containing only the elements that satisfy a predicate.
Return a new RDD containing only the elements that satisfy a predicate.
Filters this RDD with p, where p takes an additional parameter of type A.
Filters this RDD with p, where p takes an additional parameter of type A. This additional parameter is produced by constructA, which is called in each partition with the index of that partition.
Return the first element in this RDD.
Return the first element in this RDD.
Returns the first parent RDD
Returns the first parent RDD
Return a new RDD by first applying a function to all elements of this RDD, and then flattening the results.
Return a new RDD by first applying a function to all elements of this RDD, and then flattening the results.
FlatMaps f over this RDD, where f takes an additional parameter of type A.
FlatMaps f over this RDD, where f takes an additional parameter of type A. This additional parameter is produced by constructA, which is called in each partition with the index of that partition.
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.
Applies a function f to all elements of this RDD.
Applies a function f to all elements of this RDD.
Applies a function f to each partition of this RDD.
Applies a function f to each partition of this RDD.
Applies f to each element of this RDD, where f takes an additional parameter of type A.
Applies f to each element of this RDD, where f takes an additional parameter of type A. This additional parameter is produced by constructA, which is called in each partition with the index of that partition.
User-defined generator of this RDD
User-defined generator of this RDD
Gets the name of the file to which this RDD was checkpointed
Gets the name of the file to which this RDD was checkpointed
Implemented by subclasses to return how this RDD depends on parent RDDs.
Implemented by subclasses to return how this RDD depends on parent RDDs. This method will only be called once, so it is safe to implement a time-consuming computation in it.
Implemented by subclasses to return the set of partitions in this RDD.
Implemented by subclasses to return the set of partitions in this RDD. This method will only be called once, so it is safe to implement a time-consuming computation in it.
Optionally overridden by subclasses to specify placement preferences.
Optionally overridden by subclasses to specify placement preferences.
Get the RDD's current storage level, or StorageLevel.
Get the RDD's current storage level, or StorageLevel.NONE if none is set.
Return an RDD created by coalescing all elements within each partition into an array.
Return an RDD created by coalescing all elements within each partition into an array.
Return an RDD of grouped items.
Return an RDD of grouped items.
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.
Return an RDD of grouped items.
Return an RDD of grouped items.
A unique ID for this RDD (within its SparkContext).
A unique ID for this RDD (within its SparkContext).
Return whether this RDD has been checkpointed or not
Return whether this RDD has been checkpointed or not
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.
Creates tuples of the elements in this RDD by applying f.
Creates tuples of the elements in this RDD by applying f.
Return a new RDD by applying a function to all elements of this RDD.
Return a new RDD by applying a function to all elements of this RDD.
Return a new RDD by applying a function to each partition of this RDD.
Return a new RDD by applying a function to each partition of this RDD.
Return a new RDD by applying a function to each partition of this RDD.
Return a new RDD by applying a function to each partition of this RDD. This is a variant of mapPartitions that also passes the TaskContext into the closure.
Return a new RDD by applying a function to each partition of this RDD, while tracking the index of the original partition.
Return a new RDD by applying a function to each partition of this RDD, while tracking the index of the original partition.
Maps f over this RDD, where f takes an additional parameter of type A.
Maps f over this RDD, where f takes an additional parameter of type A. This additional parameter is produced by constructA, which is called in each partition with the index of that partition.
A friendly name for this RDD
A friendly name for this RDD
Optionally overridden by subclasses to specify how they are partitioned.
Optionally overridden by subclasses to specify how they are partitioned.
Get the array of partitions of this RDD, taking into account whether the RDD is checkpointed or not.
Get the array of partitions of this RDD, taking into account whether the RDD is checkpointed or not.
Persist this RDD with the default storage level (MEMORY_ONLY).
Persist this RDD with the default storage level (MEMORY_ONLY).
Set this RDD's storage level to persist its values across operations after the first time it is computed.
Set this RDD's storage level to persist its values across operations after the first time it is computed. This can only be used to assign a new storage level if the RDD does not have a storage level set yet..
Return an RDD created by piping elements to a forked external process.
Return an RDD created by piping elements to a forked external process. The print behavior can be customized by providing two functions.
command to run in forked process.
environment variables to set.
Before piping elements, this function is called as an oppotunity to pipe context data. Print line function (like out.println) will be passed as printPipeContext's parameter.
Use this function to customize how to pipe elements. This function will be called with each RDD element as the 1st parameter, and the print line function (like out.println()) as the 2nd parameter. An example of pipe the RDD data of groupBy() in a streaming way, instead of constructing a huge String to concat all the elements: def printRDDElement(record:(String, Seq[String]), f:String=>Unit) = for (e <- record._2){f(e)}
the result RDD
Return an RDD created by piping elements to a forked external process.
Return an RDD created by piping elements to a forked external process.
Return an RDD created by piping elements to a forked external process.
Return an RDD created by piping elements to a forked external process.
Get the preferred locations of a partition (as hostnames), taking into account whether the RDD is checkpointed.
Get the preferred locations of a partition (as hostnames), taking into account whether the RDD is checkpointed.
Reduces the elements of this RDD using the specified commutative and associative binary operator.
Reduces the elements of this RDD using the specified commutative and associative binary operator.
Return a new RDD that has exactly numPartitions partitions.
Return a new RDD that has exactly numPartitions partitions.
Can increase or decrease the level of parallelism in this RDD. Internally, this uses a shuffle to redistribute data.
If you are decreasing the number of partitions in this RDD, consider using coalesce,
which can avoid performing a shuffle.
Return a sampled subset of this RDD.
Return a sampled subset of this RDD.
Save this RDD as a SequenceFile of serialized objects.
Save this RDD as a SequenceFile of serialized objects.
Save this RDD as a compressed text file, using string representations of elements.
Save this RDD as a compressed text file, using string representations of elements.
Save this RDD as a text file, using string representations of elements.
Save this RDD as a text file, using string representations of elements.
Reset generator
Reset generator
Assign a name to this RDD
Assign a name to this RDD
The SparkContext that created this RDD.
The SparkContext that created this RDD.
Return an RDD with the elements from this that are not in other.
Return an RDD with the elements from this that are not in other.
Return an RDD with the elements from this that are not in other.
Return an RDD with the elements from this that are not in other.
Return an RDD with the elements from this that are not in other.
Return an RDD with the elements from this that are not in other.
Uses this partitioner/partition size, because even if other is huge, the resulting
RDD will be <= us.
Take the first num elements of the RDD.
Take the first num elements of the RDD. It works by first scanning one partition, and use the results from that partition to estimate the number of additional partitions needed to satisfy the limit.
Returns the first K elements from this RDD as defined by the specified implicit Ordering[T] and maintains the ordering.
Returns the first K elements from this RDD as defined by the specified implicit Ordering[T] and maintains the ordering.
the number of top elements to return
the implicit ordering for T
an array of top elements
Return an array that contains all of the elements in this RDD.
Return an array that contains all of the elements in this RDD.
A description of this RDD and its recursive dependencies for debugging.
A description of this RDD and its recursive dependencies for debugging.
Returns the top K elements from this RDD as defined by the specified implicit Ordering[T].
Returns the top K elements from this RDD as defined by the specified implicit Ordering[T].
the number of top elements to return
the implicit ordering for T
an array of top elements
Return the union of this RDD and another one.
Return the union of this RDD and another one. Any identical elements will appear multiple
times (use .distinct() to eliminate them).
Mark the RDD as non-persistent, and remove all blocks for it from memory and disk.
Mark the RDD as non-persistent, and remove all blocks for it from memory and disk.
Whether to block until all blocks are deleted.
This RDD.
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).
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.
Return a new RDD by applying a function to each partition of this RDD, while tracking the index of the original partition.
Return a new RDD by applying a function to each partition of this RDD, while tracking the index of the original partition.
(Since version 0.7.0) use mapPartitionsWithIndex