/** * @return true iff this set contains integer i */ @Override public boolean contains(int i) { if (densePart != null && inDenseRange(i)) { return densePart.contains(i); } else { return sparsePart.contains(i); } }
/** * @return true iff this set contains integer i */ @Override public boolean contains(int i) { if (densePart != null && inDenseRange(i)) { return densePart.contains(i); } else { return sparsePart.contains(i); } }
/** * @return true iff this set contains integer i */ @Override public boolean contains(int i) { if (densePart != null && inDenseRange(i)) { return densePart.contains(i); } else { return sparsePart.contains(i); } }
private final boolean assertDisjoint() { if (DEBUG) { if (densePart != null) { for (IntIterator sparseBits = sparsePart.intIterator(); sparseBits.hasNext();) { int bit = sparseBits.next(); if (densePart.contains(bit)) { return false; } if (inDenseRange(bit)) { return false; } } } } return true; }
private final boolean assertDisjoint() { if (DEBUG) { if (densePart != null) { for (IntIterator sparseBits = sparsePart.intIterator(); sparseBits.hasNext();) { int bit = sparseBits.next(); if (densePart.contains(bit)) { return false; } if (inDenseRange(bit)) { return false; } } } } return true; }
private final boolean assertDisjoint() { if (DEBUG) { if (densePart != null) { for (IntIterator sparseBits = sparsePart.intIterator(); sparseBits.hasNext();) { int bit = sparseBits.next(); if (densePart.contains(bit)) { return false; } if (inDenseRange(bit)) { return false; } } } } return true; }