Iterator of Coverage) tuples, e.g. a ContigCoverageIterator.
Maximum regions allowed to overlap each LociSet.
if true: build Contigs from ranges that have empty loci dropped, resulting in more ranges being stored; else: each Contig should only include one range, spanning from the lowest to highest loci covered by its parent LociSet on that contig. The latter is more performant but the former can yield more interesting statistics about the distribution of reads and loci across partitions.
(Changed in version 2.8.0) collect
has changed. The previous behavior can be reproduced with toSeq
.
(Since version 2.10.0) use fold instead
Given Positions and their corresponding Coverages, emit a sequence of LociSets such that no more than maxRegionsPerPartition regions overlap each LociSet.
The LociSets are built greedily, incorporating sequential loci until they reach one that would put them over the maxRegionsPerPartition limit.