private boolean inDenseRange(int i) { return densePart.getOffset() <= i && densePart.length() > i; }
private boolean inDenseRange(int i) { return densePart.getOffset() <= i && densePart.length() > i; }
private boolean inDenseRange(int i) { return densePart.getOffset() <= i && densePart.length() > i; }
/** * @return true iff this set contains integer i */ @Override public boolean containsAny(IntSet set) { if (set == null) { throw new IllegalArgumentException("null set"); } if (!sparsePart.isEmpty() && sparsePart.containsAny(set)) { return true; } else if (densePart != null) { int lower = densePart.getOffset(); for (IntIterator is = set.intIterator(); is.hasNext();) { int i = is.next(); if (i < lower) continue; if (densePart.get(i)) { return true; } } } return false; }
/** * @return true iff this set contains integer i */ @Override public boolean containsAny(IntSet set) { if (set == null) { throw new IllegalArgumentException("null set"); } if (!sparsePart.isEmpty() && sparsePart.containsAny(set)) { return true; } else if (densePart != null) { int lower = densePart.getOffset(); for (IntIterator is = set.intIterator(); is.hasNext();) { int i = is.next(); if (i < lower) continue; if (densePart.get(i)) { return true; } } } return false; }
/** * @return true iff this set contains integer i */ @Override public boolean containsAny(IntSet set) { if (set == null) { throw new IllegalArgumentException("null set"); } if (!sparsePart.isEmpty() && sparsePart.containsAny(set)) { return true; } else if (densePart != null) { int lower = densePart.getOffset(); for (IntIterator is = set.intIterator(); is.hasNext();) { int i = is.next(); if (i < lower) continue; if (densePart.get(i)) { return true; } } } return false; }
if (thisBit < densePart.getOffset()) { newOffset = thisBit; int bits = 32; while (sparseBits.hasNext()) { int nextBit = sparseBits.next(); if (nextBit >= densePart.getOffset() || !sparseBits.hasNext()) { if (nextBit < densePart.getOffset() && !sparseBits.hasNext()) { count++; if (densePart.getOffset() - newOffset < (32 * count)) { moveCount += count; } else { for (sparseBits = sparsePart.intIterator(); sparseBits.hasNext();) { int bit = sparseBits.next(); if (newOffset != -1 && bit >= newOffset && bit < densePart.getOffset()) { bits[index++] = bit; int base = densePart.getOffset(); int currentSize = densePart.length() - base; float newSize = 1.1f * (bits[index - 1] - base);
if (thisBit < densePart.getOffset()) { newOffset = thisBit; int bits = 32; while (sparseBits.hasNext()) { int nextBit = sparseBits.next(); if (nextBit >= densePart.getOffset() || !sparseBits.hasNext()) { if (nextBit < densePart.getOffset() && !sparseBits.hasNext()) { count++; if (densePart.getOffset() - newOffset < (32 * count)) { moveCount += count; } else { for (sparseBits = sparsePart.intIterator(); sparseBits.hasNext();) { int bit = sparseBits.next(); if (newOffset != -1 && bit >= newOffset && bit < densePart.getOffset()) { bits[index++] = bit; int base = densePart.getOffset(); int currentSize = densePart.length() - base; float newSize = 1.1f * (bits[index - 1] - base);
if (thisBit < densePart.getOffset()) { newOffset = thisBit; int bits = 32; while (sparseBits.hasNext()) { int nextBit = sparseBits.next(); if (nextBit >= densePart.getOffset() || !sparseBits.hasNext()) { if (nextBit < densePart.getOffset() && !sparseBits.hasNext()) { count++; if (densePart.getOffset() - newOffset < (32 * count)) { moveCount += count; } else { for (sparseBits = sparsePart.intIterator(); sparseBits.hasNext();) { int bit = sparseBits.next(); if (newOffset != -1 && bit >= newOffset && bit < densePart.getOffset()) { bits[index++] = bit; int base = densePart.getOffset(); int currentSize = densePart.length() - base; float newSize = 1.1f * (bits[index - 1] - base);