You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@spark.apache.org by pw...@apache.org on 2013/09/10 21:32:40 UTC
[35/50] git commit: Reword 'evenly distributed' to 'distributed with
a hash partitioner.
Reword 'evenly distributed' to 'distributed with a hash partitioner.
Project: http://git-wip-us.apache.org/repos/asf/incubator-spark/repo
Commit: http://git-wip-us.apache.org/repos/asf/incubator-spark/commit/6471bfec
Tree: http://git-wip-us.apache.org/repos/asf/incubator-spark/tree/6471bfec
Diff: http://git-wip-us.apache.org/repos/asf/incubator-spark/diff/6471bfec
Branch: refs/remotes/origin/branch-0.8
Commit: 6471bfec736b033a94a96575255f2d4453082709
Parents: df5fd35
Author: Stephen Haberman <st...@exigencecorp.com>
Authored: Mon Sep 9 11:44:15 2013 -0500
Committer: Stephen Haberman <st...@exigencecorp.com>
Committed: Mon Sep 9 11:44:15 2013 -0500
----------------------------------------------------------------------
core/src/main/scala/org/apache/spark/rdd/RDD.scala | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
----------------------------------------------------------------------
http://git-wip-us.apache.org/repos/asf/incubator-spark/blob/6471bfec/core/src/main/scala/org/apache/spark/rdd/RDD.scala
----------------------------------------------------------------------
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 41a90f1..1082cba 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) {