Asserts two RDDs are equal (un ordered).
Asserts two RDDs are equal (un ordered). If they are equal assertion succeeds, otherwise assertion fails.
Asserts two RDDs are equal (with the same order).
Asserts two RDDs are equal (with the same order). If they are equal assertion succeeds, otherwise assertion fails.
Compare two RDDs where we do not require the order to be equal.
Compare two RDDs where we do not require the order to be equal. If they are equal returns None, otherwise returns Some with the first mismatch.
None if the two RDDs are equal, or Some containing the first mismatch information. The mismatch information will be Tuple3 of: (key, number of times this key occur in expected RDD, number of times this key occur in result RDD)
Compare two RDDs with order (e.g.
Compare two RDDs with order (e.g. [1,2,3] != [3,2,1]) If the partitioners are not the same this requires multiple passes on the input. If they are equal returns None, otherwise returns Some with the first mismatch. If the lengths are not equal, one of the two components may be None.
Compare two RDDs.
Compare two RDDs. If they are equal returns None, otherwise returns Some with the first mismatch. Assumes we have the same partitioner.