public BTreeSet<V> subList(int fromIndex, int toIndex) { if (fromIndex < 0 || toIndex > size()) throw new IndexOutOfBoundsException(); return new BTreeRange<V>(tree, comparator, lowerBound + fromIndex, lowerBound + toIndex - 1); }
public BTreeSet<V> subList(int fromIndex, int toIndex) { if (fromIndex < 0 || toIndex > size()) throw new IndexOutOfBoundsException(); return new BTreeRange<V>(tree, comparator, lowerBound + fromIndex, lowerBound + toIndex - 1); }
public BTreeSet<V> subList(int fromIndex, int toIndex) { if (fromIndex < 0 || toIndex > size()) throw new IndexOutOfBoundsException(); return new BTreeRange<V>(tree, comparator, lowerBound + fromIndex, lowerBound + toIndex - 1); }
public int indexOf(Object item) { int i = super.indexOf(item); boolean negate = i < 0; if (negate) i = -1 - i; if (outOfBounds(i)) return i < lowerBound ? -1 : -1 - size(); i = i - lowerBound; if (negate) i = -1 -i; return i; }
public int indexOf(Object item) { int i = super.indexOf(item); boolean negate = i < 0; if (negate) i = -1 - i; if (outOfBounds(i)) return i < lowerBound ? -1 : -1 - size(); i = i - lowerBound; if (negate) i = -1 -i; return i; }
public int indexOf(Object item) { int i = super.indexOf(item); boolean negate = i < 0; if (negate) i = -1 - i; if (outOfBounds(i)) return i < lowerBound ? -1 : -1 - size(); i = i - lowerBound; if (negate) i = -1 -i; return i; }
public BTreeSet<V> subList(int fromIndex, int toIndex) { if (fromIndex < 0 || toIndex > size()) throw new IndexOutOfBoundsException(); return new BTreeRange<V>(tree, comparator, lowerBound + fromIndex, lowerBound + toIndex - 1); }
public int indexOf(Object item) { int i = super.indexOf(item); boolean negate = i < 0; if (negate) i = -1 - i; if (outOfBounds(i)) return i < lowerBound ? -1 : -1 - size(); i = i - lowerBound; if (negate) i = -1 -i; return i; }