зеркало из https://github.com/microsoft/spark.git
Comment
This commit is contained in:
Родитель
5718cef2a4
Коммит
fd0374b9de
|
@ -4,7 +4,7 @@ private class CoalescedRDDSplit(val index: Int, val parents: Array[Split]) exten
|
|||
|
||||
/**
|
||||
* Coalesce the partitions of a parent RDD (`prev`) into fewer partitions, so that each partition of
|
||||
* this RDD computes zero or more of the parent ones. Will produce exactly `maxPartitions` if the
|
||||
* this RDD computes one or more of the parent ones. Will produce exactly `maxPartitions` if the
|
||||
* parent had more than this many partitions, or fewer if the parent had fewer.
|
||||
*
|
||||
* This transformation is useful when an RDD with many partitions gets filtered into a smaller one,
|
||||
|
|
|
@ -79,7 +79,7 @@ class RDDSuite extends FunSuite with BeforeAndAfter {
|
|||
val coalesced1 = new CoalescedRDD(data, 2)
|
||||
assert(coalesced1.collect().toList === (1 to 10).toList)
|
||||
assert(coalesced1.glom().collect().map(_.toList).toList ===
|
||||
List(List(1, 2, 3, 4, 5), List(6, 7, 8, 9, 10)))
|
||||
List(List(1, 2, 3, 4, 5), List(6, 7, 8, 9, 10)))
|
||||
|
||||
// Check that the narrow dependency is also specified correctly
|
||||
assert(coalesced1.dependencies.head.getParents(0).toList === List(0, 1, 2, 3, 4))
|
||||
|
|
Загрузка…
Ссылка в новой задаче