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).
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.
Return a new RDD that is reduced into numPartitions partitions.
Return a new RDD that is reduced into numPartitions partitions.
For each key k in this or other1 or other2, return a resulting RDD that contains a
tuple with the list of values for that key in this, other1 and other2.
For each key k in this or other, return a resulting RDD that contains a tuple with the
list of values for that key in this as well as other.
For each key k in this or other1 or other2, return a resulting RDD that contains a
tuple with the list of values for that key in this, other1 and other2.
For each key k in this or other, return a resulting RDD that contains a tuple with the
list of values for that key in this as well as other.
For each key k in this or other1 or other2, return a resulting RDD that contains a
tuple with the list of values for that key in this, other1 and other2.
For each key k in this or other, return a resulting RDD that contains a tuple with the
list of values for that key in this as well as other.
Return an array that contains all of the elements in this RDD.
Return an array that contains all of the elements in this RDD.
Return the key-value pairs in this RDD to the master as a Map.
Return an array that contains all of the elements in a specific partition of this RDD.
Return an array that contains all of the elements in a specific partition of this RDD.
Simplified version of combineByKey that hash-partitions the resulting RDD using the existing partitioner/parallelism level.
Simplified version of combineByKey that hash-partitions the output RDD.
Generic function to combine the elements for each key using a custom set of aggregation functions.
Generic function to combine the elements for each key using a custom set of aggregation functions. Turns a JavaPairRDD[(K, V)] into a result of type JavaPairRDD[(K, C)], for a "combined type" C * Note that V and C can be different -- for example, one might group an RDD of type (Int, Int) into an RDD of type (Int, List[Int]). Users provide three functions:
- createCombiner, which turns a V into a C (e.g., creates a one-element list)
- mergeValue, to merge a V into a C (e.g., adds it to the end of a list)
- mergeCombiners, to combine two C's into a single one.
In addition, users can control the partitioning of the output RDD, and whether to perform map-side aggregation (if a mapper can produce multiple items with the same key).
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.
(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 approximate number of distinct values for each key in this RDD.
Return approximate number of distinct values for each key in this 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. HashPartitions the output RDD into numPartitions.
Return approximate number of distinct values for each key this RDD.
Return approximate number of distinct values for each key this 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. Hash-partitions the output RDD using the existing partitioner/parallelism level.
Return approximate number of distinct values for each key in this RDD.
Return approximate number of distinct values for each key in this 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. Uses the provided Partitioner to partition the output RDD.
Count the number of elements for each key, and return the result to the master as a Map.
(Experimental) Approximate version of countByKey that can return a partial result if it does not finish within a timeout.
(Experimental) Approximate version of countByKey that can return a partial result if it does not finish within a timeout.
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().
(Experimental) Approximate version of countByValue().
(Experimental) Approximate version of countByValue().
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 the first element in this RDD.
Return the first element in this 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.
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.
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.
Pass each value in the key-value pair RDD through a flatMap function without changing the keys; this also retains the original RDD's partitioning.
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.
Merge the values for each key using an associative function and a neutral "zero value" which may be added to the result an arbitrary number of times, and must not change the result (e.
Merge the values for each key using an associative function and a neutral "zero value" which may be added to the result an arbitrary number of times, and must not change the result (e.g., Nil for list concatenation, 0 for addition, or 1 for multiplication.).
Merge the values for each key using an associative function and a neutral "zero value" which may be added to the result an arbitrary number of times, and must not change the result (e.
Merge the values for each key using an associative function and a neutral "zero value" which may be added to the result an arbitrary number of times, and must not change the result (e.g., Nil for list concatenation, 0 for addition, or 1 for multiplication.).
Merge the values for each key using an associative function and a neutral "zero value" which may be added to the result an arbitrary number of times, and must not change the result (e.
Merge the values for each key using an associative function and a neutral "zero value" which may be added to the result an arbitrary number of times, and must not change the result (e.g., Nil for list concatenation, 0 for addition, or 1 for multiplication.).
Applies a function f to all elements of this RDD.
Applies a function f to all elements 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
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 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 elements.
Return an RDD of grouped elements. Each group consists of a key and a sequence of elements mapping to that key.
Group the values for each key in the RDD into a single sequence.
Group the values for each key in the RDD into a single sequence. Hash-partitions the resulting RDD with the existing partitioner/parallelism level.
Group the values for each key in the RDD into a single sequence.
Group the values for each key in the RDD into a single sequence. Hash-partitions the
resulting RDD with into numPartitions partitions.
Group the values for each key in the RDD into a single sequence.
Group the values for each key in the RDD into a single sequence. Allows controlling the partitioning of the resulting key-value pair RDD by passing a Partitioner.
Alias for cogroup.
Alias for cogroup.
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.
Return an RDD containing all pairs of elements with matching keys in this and other.
Return an RDD containing all pairs of elements with matching keys in this and other. Each
pair of elements will be returned as a (k, (v1, v2)) tuple, where (k, v1) is in this and
(k, v2) is in other. Performs a hash join across the cluster.
Return an RDD containing all pairs of elements with matching keys in this and other.
Return an RDD containing all pairs of elements with matching keys in this and other. Each
pair of elements will be returned as a (k, (v1, v2)) tuple, where (k, v1) is in this and
(k, v2) is in other. Performs a hash join across the cluster.
Merge the values for each key using an associative reduce function.
Merge the values for each key using an associative reduce function. This will also perform the merging locally on each mapper before sending results to a reducer, similarly to a "combiner" in MapReduce.
Creates tuples of the elements in this RDD by applying f.
Creates tuples of the elements in this RDD by applying f.
Return an RDD with the keys of each tuple.
Perform a left outer join of this and other.
Perform a left outer join of this and other. For each element (k, v) in this, the
resulting RDD will either contain all pairs (k, (v, Some(w))) for w in other, or the
pair (k, (v, None)) if no elements in other have key k. Hash-partitions the output
into numPartitions partitions.
Perform a left outer join of this and other.
Perform a left outer join of this and other. For each element (k, v) in this, the
resulting RDD will either contain all pairs (k, (v, Some(w))) for w in other, or the
pair (k, (v, None)) if no elements in other have key k. Hash-partitions the output
using the existing partitioner/parallelism level.
Perform a left outer join of this and other.
Perform a left outer join of this and other. For each element (k, v) in this, the
resulting RDD will either contain all pairs (k, (v, Some(w))) for w in other, or the
pair (k, (v, None)) if no elements in other have key k. Uses the given Partitioner to
partition the output RDD.
Return the list of values in the RDD for key key.
Return the list of values in the RDD for key key. This operation is done efficiently if the
RDD has a known partitioner by only searching the partition that the key maps to.
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 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 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.
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, 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.
Pass each value in the key-value pair RDD through a map function without changing the keys; this also retains the original RDD's partitioning.
Return a copy of the RDD partitioned using the specified partitioner.
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. Can only be called once on each 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.
Return an RDD created by piping elements to a forked external process.
Return an RDD created by piping elements to a forked external process.
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.
Merge the values for each key using an associative reduce function.
Merge the values for each key using an associative reduce function. This will also perform the merging locally on each mapper before sending results to a reducer, similarly to a "combiner" in MapReduce. Output will be hash-partitioned with the existing partitioner/ parallelism level.
Merge the values for each key using an associative reduce function.
Merge the values for each key using an associative reduce function. This will also perform the merging locally on each mapper before sending results to a reducer, similarly to a "combiner" in MapReduce. Output will be hash-partitioned with numPartitions partitions.
Merge the values for each key using an associative reduce function.
Merge the values for each key using an associative reduce function. This will also perform the merging locally on each mapper before sending results to a reducer, similarly to a "combiner" in MapReduce.
Merge the values for each key using an associative reduce function, but return the results immediately to the master as a Map.
Merge the values for each key using an associative reduce function, but return the results immediately to the master as a Map. This will also perform the merging locally on each mapper before sending results to a reducer, similarly to a "combiner" in MapReduce.
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.
Perform a right outer join of this and other.
Perform a right outer join of this and other. For each element (k, w) in other, the
resulting RDD will either contain all pairs (k, (Some(v), w)) for v in this, or the
pair (k, (None, w)) if no elements in this have key k. Hash-partitions the resulting
RDD into the given number of partitions.
Perform a right outer join of this and other.
Perform a right outer join of this and other. For each element (k, w) in other, the
resulting RDD will either contain all pairs (k, (Some(v), w)) for v in this, or the
pair (k, (None, w)) if no elements in this have key k. Hash-partitions the resulting
RDD using the existing partitioner/parallelism level.
Perform a right outer join of this and other.
Perform a right outer join of this and other. For each element (k, w) in other, the
resulting RDD will either contain all pairs (k, (Some(v), w)) for v in this, or the
pair (k, (None, w)) if no elements in this have key k. Uses the given Partitioner to
partition the output RDD.
Return a sampled subset of this RDD.
Output the RDD to any Hadoop-supported storage system, using a Hadoop JobConf object for that storage system.
Output the RDD to any Hadoop-supported storage system, using a Hadoop JobConf object for that storage system. The JobConf should set an OutputFormat and any output paths required (e.g. a table name to write to) in the same way as it would be configured for a Hadoop MapReduce job.
Output the RDD to any Hadoop-supported file system, compressing with the supplied codec.
Output the RDD to any Hadoop-supported file system.
Output the RDD to any Hadoop-supported file system.
Output the RDD to any Hadoop-supported file system.
Output the RDD to any Hadoop-supported file system.
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.
Assign a name to this RDD
Sort the RDD by key, so that each partition contains a sorted range of the elements.
Sort the RDD by key, so that each partition contains a sorted range of the elements. Calling
collect or save on the resulting RDD will return or output an ordered list of records
(in the save case, they will be written to multiple part-X files in the filesystem, in
order of the keys).
Sort the RDD by key, so that each partition contains a sorted range of the elements.
Sort the RDD by key, so that each partition contains a sorted range of the elements. Calling
collect or save on the resulting RDD will return or output an ordered list of records
(in the save case, they will be written to multiple part-X files in the filesystem, in
order of the keys).
Sort the RDD by key, so that each partition contains a sorted range of the elements.
Sort the RDD by key, so that each partition contains a sorted range of the elements. Calling
collect or save on the resulting RDD will return or output an ordered list of records
(in the save case, they will be written to multiple part-X files in the filesystem, in
order of the keys).
Sort the RDD by key, so that each partition contains a sorted range of the elements.
Sort the RDD by key, so that each partition contains a sorted range of the elements. Calling
collect or save on the resulting RDD will return or output an ordered list of records
(in the save case, they will be written to multiple part-X files in the filesystem, in
order of the keys).
Sort the RDD by key, so that each partition contains a sorted range of the elements in ascending order.
Sort the RDD by key, so that each partition contains a sorted range of the elements in
ascending order. Calling collect or save on the resulting RDD will return or output an
ordered list of records (in the save case, they will be written to multiple part-X files
in the filesystem, in order of the keys).
Set of partitions in this RDD.
Set of partitions in 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.
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. 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.
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.
the number of top elements to return
an array of top elements
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.
the number of top elements to return
the comparator that defines the order
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 using the natural ordering for T.
Returns the top K elements from this RDD using the natural ordering for T.
the number of top elements to return
an array of top elements
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].
the number of top elements to return
the comparator that defines the order
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.
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. This method blocks until all blocks are deleted.
Return an RDD with the values of each tuple.
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.