synchronized public Iterator<Map.Entry<Key,Value>> iterator(final Transaction tx) throws IOException { return getRoot(tx).iterator(tx); }
synchronized public Iterator<Map.Entry<Key,Value>> iterator(final Transaction tx, Key initialKey, Key maxKey) throws IOException { return getRoot(tx).iterator(tx, initialKey, maxKey); }
synchronized public Iterator<Map.Entry<Key,Value>> iterator(final Transaction tx, Key initialKey) throws IOException { return getRoot(tx).iterator(tx, initialKey, null); }
public Iterator<Map.Entry<Key,Value>> iterator(final Transaction tx, Key startKey, Key endKey) throws IOException { if (startKey == null) { return iterator(tx); } if( isBranch() ) { return getLeafNode(tx, this, startKey).iterator(tx, startKey, endKey); } else { int idx = Arrays.binarySearch(keys, startKey); if (idx < 0) { idx = -(idx + 1); } return new BTreeIterator(tx, this, idx, endKey); } }
synchronized public Iterator<Map.Entry<Key,Value>> iterator(final Transaction tx, Key initialKey, Key maxKey) throws IOException { return getRoot(tx).iterator(tx, initialKey, maxKey); }
synchronized public Iterator<Map.Entry<Key,Value>> iterator(final Transaction tx, Key initialKey) throws IOException { return getRoot(tx).iterator(tx, initialKey, null); }
synchronized public Iterator<Map.Entry<Key,Value>> iterator(final Transaction tx, Key initialKey, Key maxKey) throws IOException { return getRoot(tx).iterator(tx, initialKey, maxKey); }
synchronized public Iterator<Map.Entry<Key,Value>> iterator(final Transaction tx, Key initialKey) throws IOException { return getRoot(tx).iterator(tx, initialKey, null); }
synchronized public Iterator<Map.Entry<Key,Value>> iterator(final Transaction tx) throws IOException { return getRoot(tx).iterator(tx); }
synchronized public Iterator<Map.Entry<Key,Value>> iterator(final Transaction tx, Key initialKey) throws IOException { return getRoot(tx).iterator(tx, initialKey, null); }
synchronized public Iterator<Map.Entry<Key,Value>> iterator(final Transaction tx) throws IOException { return getRoot(tx).iterator(tx); }
synchronized public Iterator<Map.Entry<Key,Value>> iterator(final Transaction tx) throws IOException { return getRoot(tx).iterator(tx); }
synchronized public Iterator<Map.Entry<Key,Value>> iterator(final Transaction tx, Key initialKey, Key maxKey) throws IOException { return getRoot(tx).iterator(tx, initialKey, maxKey); }
public Iterator<Map.Entry<Key,Value>> iterator(final Transaction tx, Key startKey, Key endKey) throws IOException { if (startKey == null) { return iterator(tx); } if( isBranch() ) { return getLeafNode(tx, this, startKey).iterator(tx, startKey, endKey); } else { int idx = Arrays.binarySearch(keys, startKey); if (idx < 0) { idx = -(idx + 1); } return new BTreeIterator(tx, this, idx, endKey); } }
public Iterator<Map.Entry<Key,Value>> iterator(final Transaction tx, Key startKey, Key endKey) throws IOException { if (startKey == null) { return iterator(tx); } if( isBranch() ) { return getLeafNode(tx, this, startKey).iterator(tx, startKey, endKey); } else { int idx = Arrays.binarySearch(keys, startKey); if (idx < 0) { idx = -(idx + 1); } return new BTreeIterator(tx, this, idx, endKey); } }
public Iterator<Map.Entry<Key,Value>> iterator(final Transaction tx, Key startKey, Key endKey) throws IOException { if (startKey == null) { return iterator(tx); } if( isBranch() ) { return getLeafNode(tx, this, startKey).iterator(tx, startKey, endKey); } else { int idx = Arrays.binarySearch(keys, startKey); if (idx < 0) { idx = -(idx + 1); } return new BTreeIterator(tx, this, idx, endKey); } }