aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorStephen Haberman <stephen@exigencecorp.com>2013-09-09 11:44:15 -0500
committerStephen Haberman <stephen@exigencecorp.com>2013-09-09 11:44:15 -0500
commit6471bfec736b033a94a96575255f2d4453082709 (patch)
tree80e25fe1847c93c87303f44d07b7071f3549f060
parentdf5fd352735005ce0322d287ae27d72d12a7fc8e (diff)
downloadspark-6471bfec736b033a94a96575255f2d4453082709.tar.gz
spark-6471bfec736b033a94a96575255f2d4453082709.tar.bz2
spark-6471bfec736b033a94a96575255f2d4453082709.zip
Reword 'evenly distributed' to 'distributed with a hash partitioner.
-rw-r--r--core/src/main/scala/org/apache/spark/rdd/RDD.scala4
1 files changed, 2 insertions, 2 deletions
diff --git a/core/src/main/scala/org/apache/spark/rdd/RDD.scala b/core/src/main/scala/org/apache/spark/rdd/RDD.scala
index 41a90f139e..1082cbae3e 100644
--- a/core/src/main/scala/org/apache/spark/rdd/RDD.scala
+++ b/core/src/main/scala/org/apache/spark/rdd/RDD.scala
@@ -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) {