BTreeSearchIterator(Object[] btree, Comparator<? super K> comparator, BTree.Dir dir, int lowerBound, int upperBound) { super(comparator, btree); this.forwards = dir == BTree.Dir.ASC; this.lowerBound = lowerBound; this.upperBound = upperBound; rewind(); }
BTreeSearchIterator(Object[] btree, Comparator<? super K> comparator, BTree.Dir dir, int lowerBound, int upperBound) { super(comparator, btree); this.forwards = dir == BTree.Dir.ASC; this.lowerBound = lowerBound; this.upperBound = upperBound; rewind(); }
BTreeSearchIterator(Object[] btree, Comparator<? super K> comparator, BTree.Dir dir, int lowerBound, int upperBound) { super(comparator, btree); this.forwards = dir == BTree.Dir.ASC; this.lowerBound = lowerBound; this.upperBound = upperBound; rewind(); }
BTreeSearchIterator(Object[] btree, Comparator<? super K> comparator, BTree.Dir dir, int lowerBound, int upperBound) { super(comparator, btree); this.forwards = dir == BTree.Dir.ASC; this.lowerBound = lowerBound; this.upperBound = upperBound; rewind(); }