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.
Return an array that contains all of the elements in this RDD.
Return an array that contains all of the elements in this RDD.
The asynchronous version of collect
, which returns a future for
retrieving an array containing all of the elements in this RDD.
The asynchronous version of collect
, which returns a future for
retrieving an array containing all of the elements in this RDD.
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.
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 algorithm used is based on streamlib's implementation of "HyperLogLog in Practice: Algorithmic Engineering of a State of The Art Cardinality Estimation Algorithm", available here.
Relative accuracy. Smaller values create counters that require more space. It must be greater than 0.000017.
The asynchronous version of count
, which returns a
future for counting the number of elements in this RDD.
The asynchronous version of count
, which returns a
future for counting the number of elements in this RDD.
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.
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.
The asynchronous version of the foreach
action, which
applies a function f to all the elements of this RDD.
The asynchronous version of the foreach
action, which
applies a function f to all the elements of this RDD.
Applies a function f to each partition of this RDD.
Applies a function f to each partition of this RDD.
The asynchronous version of the foreachPartition
action, which
applies a function f to each partition of this RDD.
The asynchronous version of the foreachPartition
action, which
applies a function f to each partition 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.
Compute a histogram using the provided buckets.
Compute a histogram using the provided buckets. The buckets are all open to the left except for the last which is closed e.g. for the array [1,10,20,50] the buckets are [1,10) [10,20) [20,50] e.g 1<=x<10 , 10<=x<20, 20<=x<50 And on the input of 1 and 50 we would have a histogram of 1,0,0
Note: if your histogram is evenly spaced (e.g. [0, 10, 20, 30]) this can be switched from an O(log n) insertion to O(1) per element. (where n = # buckets) if you set evenBuckets to true. buckets must be sorted and not contain any duplicates. buckets array must be at least two elements All NaN entries are treated the same. If you have a NaN bucket it must be the maximum value of the last position and all NaN entries will be counted in that bucket.
Compute a histogram of the data using bucketCount number of buckets evenly spaced between the minimum and maximum of the RDD.
Compute a histogram of the data using bucketCount number of buckets evenly spaced between the minimum and maximum of the RDD. For example if the min value is 0 and the max is 100 and there are two buckets the resulting buckets will be [0,50) [50,100]. bucketCount must be at least 1 If the RDD contains infinity, NaN throws an exception If the elements in RDD do not vary (max == min) always returns a single bucket.
A unique ID for this RDD (within its SparkContext).
A unique ID for this RDD (within its SparkContext).
Return the intersection of this RDD and another one.
Return the intersection of this RDD and another one. The output will not contain any duplicate elements, even if the input RDDs did.
Note that this method performs a shuffle internally.
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.
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.
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.
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.
Returns the maximum element from this RDD as defined by the specified Comparator[T].
Returns the maximum element from this RDD as defined by the specified Comparator[T].
the comparator that defines ordering
the maximum of the RDD
Compute the mean of this RDD's elements.
:: Experimental :: Approximate operation to return the mean within a timeout.
:: Experimental :: Approximate operation to return the mean within a timeout.
Return the approximate mean of the elements in this RDD.
Returns the minimum element from this RDD as defined by the specified Comparator[T].
Returns the minimum element from this RDD as defined by the specified Comparator[T].
the comparator that defines ordering
the minimum of the RDD
Set of partitions in this RDD.
Set of partitions in this RDD.
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.
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.
Compute the sample standard deviation of this RDD's elements (which corrects for bias in estimating the standard deviation by dividing by N-1 instead of N).
Compute the sample variance of this RDD's elements (which corrects for bias in estimating the standard variance by dividing by N-1 instead of N).
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
Return a org.apache.spark.util.StatCounter object that captures the mean, variance and count of the RDD's elements in one operation.
Compute the standard deviation of this RDD's elements.
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.
Add up the elements in this RDD.
:: Experimental :: Approximate operation to return the sum within a timeout.
:: Experimental :: Approximate operation to return the sum within a timeout.
:: Experimental :: Approximate operation to return the sum within a timeout.
:: Experimental :: Approximate operation to return the sum within a timeout.
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.
The asynchronous version of the take
action, which returns a
future for retrieving the first num
elements of this RDD.
The asynchronous version of the take
action, which returns a
future for retrieving the first num
elements of this RDD.
Returns the first k (smallest) elements from this RDD using the natural ordering for T while maintain the order.
Returns the first k (smallest) elements from this RDD using the natural ordering for T while maintain the order.
k, the number of top elements to return
an array of top elements
Returns the first k (smallest) elements from this RDD as defined by the specified Comparator[T] and maintains the order.
Returns the first k (smallest) elements from this RDD as defined by the specified Comparator[T] and maintains the order.
k, the number of elements to return
the comparator that defines the order
an array of top elements
A description of this RDD and its recursive dependencies for debugging.
A description of this RDD and its recursive dependencies for debugging.
Return an iterator that contains all of the elements in this RDD.
Return an iterator that contains all of the elements in this RDD.
The iterator will consume as much memory as the largest partition in this RDD.
Returns the top k (largest) elements from this RDD using the natural ordering for T.
Returns the top k (largest) elements from this RDD using the natural ordering for T.
k, the number of top elements to return
an array of top elements
Returns the top k (largest) elements from this RDD as defined by the specified Comparator[T].
Returns the top k (largest) elements from this RDD as defined by the specified Comparator[T].
k, 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.
Compute the variance of this RDD's elements.
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.
Zips this RDD with its element indices.
Zips this RDD with its element indices. The ordering is first based on the partition index and then the ordering of items within each partition. So the first item in the first partition gets index 0, and the last item in the last partition receives the largest index. This is similar to Scala's zipWithIndex but it uses Long instead of Int as the index type. This method needs to trigger a spark job when this RDD contains more than one partitions.
Zips this RDD with generated unique Long ids.
Zips this RDD with generated unique Long ids. Items in the kth partition will get ids k, n+k, 2*n+k, ..., where n is the number of partitions. So there may exist gaps, but this method won't trigger a spark job, which is different from org.apache.spark.rdd.RDD#zipWithIndex.
(Since version 1.1.0) Use partitions() instead.
Return an array that contains all of the elements in this RDD.
Return an array that contains all of the elements in this RDD.
As of Spark 1.0.0, toArray() is deprecated, use #collect()
instead