@Override public int size() { return this.contents.size(); }
@Override public Object[] toArray() { Struct[] structs = new Struct[this.contents.size()]; int i = 0; for (Iterator iter = this.iterator(); iter.hasNext();) { structs[i++] = (Struct) iter.next(); } return structs; }
@Override public int size() { return this.contents.size(); }
public int tracking_lookupSize() { return endLookup.size(); } public int tracking_inputPosition() {
@Override public Object[] toArray() { Struct[] structs = new Struct[this.contents.size()]; int i = 0; for (Iterator iter = this.iterator(); iter.hasNext();) { structs[i++] = (Struct)iter.next(); } return structs; }
@Override public boolean addAll(Collection<? extends K> c) { // The resulting collection will be at least c.size() big if (f <= .5) ensureCapacity(c.size()); // The resulting collection will be sized for c.size() elements else tryCapacity(size() + c.size()); // The resulting collection will be tentatively sized for size() + c.size() // elements return super.addAll(c); } @Override
public boolean sanityCheck() { assert(endLookup.size() == processed.size()); for (KmerPathNode pn : processed) { // should not be able to reduce processed nodes any further assert(prevKmerToMergeWith(pn) == null); assert(adjacentBeforeKmerToMergeWith(pn) == null); assert(unprocessed.stream().filter(n -> pn.equals(n)).count() == 0); } for (KmerPathNode pn : unprocessed) { assert(processed.stream().filter(n -> pn.equals(n)).count() == 0); } return true; } public int tracking_processedSize() {