Skip to content
Snippets Groups Projects
Commit 6471bfec authored by Stephen Haberman's avatar Stephen Haberman
Browse files

Reword 'evenly distributed' to 'distributed with a hash partitioner.

parent df5fd352
No related branches found
No related tags found
No related merge requests found
......@@ -282,8 +282,8 @@ abstract class RDD[T: ClassManifest](
* 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
* coalecse(1000, shuffle = true) will result in 1000 partitions with the
* data evenly distributed into each partition.
* coalesce(1000, shuffle = true) will result in 1000 partitions with the
* data distributed using a hash partitioner.
*/
def coalesce(numPartitions: Int, shuffle: Boolean = false): RDD[T] = {
if (shuffle) {
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment