Any reason why you need exactly a certain number of partitions?
One way we can make that work is for RangePartitioner to return a bunch of
empty partitions if the number of distinct elements is small. That would
require changing Spark.
If you want a quick work around, you can also append some ran
Hi all:
I am developing an algorithm that needs to put together elements with
the same key as much as possible but with always using a fixed number of
partitions. To do that, this algorithm sorts by key the elements. The
problem is that the number of distinct keys influences in the number of
