public Value get(Transaction tx, Key key) throws IOException { if (key == null) { throw new IllegalArgumentException("Key cannot be null"); } if( isBranch() ) { return getLeafNode(tx, this, key).get(tx, key); } else { int idx = Arrays.binarySearch(keys, key); if (idx < 0) { return null; } else { return values[idx]; } } }
public boolean contains(Transaction tx, Key key) throws IOException { if (key == null) { throw new IllegalArgumentException("Key cannot be null"); } if( isBranch() ) { return getLeafNode(tx, this, key).contains(tx, key); } else { int idx = Arrays.binarySearch(keys, key); if (idx < 0) { return false; } else { return true; } } }
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); } }
return getLeafNode(tx, this, key).put(tx, key, value); } else { int idx = Arrays.binarySearch(keys, key);
public Value get(Transaction tx, Key key) throws IOException { if (key == null) { throw new IllegalArgumentException("Key cannot be null"); } if( isBranch() ) { return getLeafNode(tx, this, key).get(tx, key); } else { int idx = Arrays.binarySearch(keys, key); if (idx < 0) { return null; } else { return values[idx]; } } }
public Value get(Transaction tx, Key key) throws IOException { if (key == null) { throw new IllegalArgumentException("Key cannot be null"); } if( isBranch() ) { return getLeafNode(tx, this, key).get(tx, key); } else { int idx = Arrays.binarySearch(keys, key); if (idx < 0) { return null; } else { return values[idx]; } } }
public boolean contains(Transaction tx, Key key) throws IOException { if (key == null) { throw new IllegalArgumentException("Key cannot be null"); } if( isBranch() ) { return getLeafNode(tx, this, key).contains(tx, key); } else { int idx = Arrays.binarySearch(keys, key); if (idx < 0) { return false; } else { return true; } } }
public boolean contains(Transaction tx, Key key) throws IOException { if (key == null) { throw new IllegalArgumentException("Key cannot be null"); } if( isBranch() ) { return getLeafNode(tx, this, key).contains(tx, key); } else { int idx = Arrays.binarySearch(keys, key); if (idx < 0) { return false; } else { return true; } } }
public Value get(Transaction tx, Key key) throws IOException { if (key == null) { throw new IllegalArgumentException("Key cannot be null"); } if( isBranch() ) { return getLeafNode(tx, this, key).get(tx, key); } else { int idx = Arrays.binarySearch(keys, key); if (idx < 0) { return null; } else { return values[idx]; } } }
public boolean contains(Transaction tx, Key key) throws IOException { if (key == null) { throw new IllegalArgumentException("Key cannot be null"); } if( isBranch() ) { return getLeafNode(tx, this, key).contains(tx, key); } else { int idx = Arrays.binarySearch(keys, key); if (idx < 0) { return false; } else { return true; } } }
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); } }
return getLeafNode(tx, this, key).put(tx, key, value); } else { int idx = Arrays.binarySearch(keys, key);
return getLeafNode(tx, this, key).put(tx, key, value); } else { int idx = Arrays.binarySearch(keys, key);
return getLeafNode(tx, this, key).put(tx, key, value); } else { int idx = Arrays.binarySearch(keys, key);