Returns an RDD containing only the elements in the the inclusive range lower to upper.
Returns an RDD containing only the elements in the the inclusive range lower to upper.
If the RDD has been partitioned using a RangePartitioner, then this operation can be
performed efficiently by only scanning the partitions that might contain matching elements.
Otherwise, a standard filter is applied to all partitions.
Repartition the RDD according to the given partitioner and, within each resulting partition, sort records by their keys.
Repartition the RDD according to the given partitioner and, within each resulting partition, sort records by their keys.
This is more efficient than calling repartition and then sorting within each partition
because it can push the sorting down into the shuffle machinery.
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).
Extra functions available on RDDs of (key, value) pairs where the key is sortable through an implicit conversion. They will work with any key type
Kthat has an implicitOrdering[K]in scope. Ordering objects already exist for all of the standard primitive types. Users can also define their own orderings for custom types, or to override the default ordering. The implicit ordering that is in the closest scope will be used.