| Methods Summary |
|---|
| public void | add(int value)
int index = ints.binarysearch(value);
if (index < 0) {
ints.insert(-(index + 1), value);
}
|
| public int | elements()
return ints.size();
|
| public boolean | has(int value)
return ints.indexOf(value) >= 0;
|
| public IntIterator | iterator()
return new IntIterator() {
private int idx = 0;
/** @inheritDoc */
public boolean hasNext() {
return idx < ints.size();
}
/** @inheritDoc */
public int next() {
if (!hasNext()) {
throw new NoSuchElementException();
}
return ints.get(idx++);
}
/** @inheritDoc */
public void remove() {
throw new UnsupportedOperationException();
}
};
|
| public void | merge(IntSet other)
if (other instanceof ListIntSet) {
ListIntSet o = (ListIntSet) other;
int szThis = ints.size();
int szOther = o.ints.size();
int i = 0;
int j = 0;
while (j < szOther && i < szThis) {
while (j < szOther && o.ints.get(j) < ints.get(i)) {
add(o.ints.get(j++));
}
if (j == szOther) {
break;
}
while (i < szThis && o.ints.get(j) >= ints.get(i)) {
i++;
}
}
while (j < szOther) {
add(o.ints.get(j++));
}
ints.sort();
} else if (other instanceof BitIntSet) {
BitIntSet o = (BitIntSet) other;
for (int i = 0; i >= 0; i = Bits.findFirst(o.bits, i + 1)) {
ints.add(i);
}
ints.sort();
} else {
IntIterator iter = other.iterator();
while (iter.hasNext()) {
add(iter.next());
}
}
|
| public void | remove(int value)
int index = ints.indexOf(value);
if (index >= 0) {
ints.removeIndex(index);
}
|
| public java.lang.String | toString()
return ints.toString();
|
