public class HapIdMultiset
Guava like Multiset which will store a sorted set of hapids as the key and how many reads hit that exact subset of ids.
public HapIdMultiset()
Guava like Multiset which will store a sorted set of hapids as the key and how many reads hit that exact subset of ids.
@NotNull public java.util.Map<java.util.SortedSet,java.lang.Integer> getMultiset()
public void setMultiset(@NotNull java.util.Map<java.util.SortedSet,java.lang.Integer> p)
public void add(@NotNull java.util.Set<java.lang.Integer> hapIds)
Method to increment the count for a given hapId set
public int count(@NotNull java.util.Set<java.lang.Integer> hapIds)
Method to return the count for a given hapId set. We sort the hapId set again just to be safe.
public void clear()
Method to clear out the multiset and create a new empty one.
@NotNull public java.util.Map<java.util.SortedSet,java.lang.Integer> getMap()
Method to get out the backing Map. This can be more easily worked with once everything is added to the Multiset.