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; } } }
synchronized public boolean containsKey(Transaction tx, Key key) throws IOException { assertLoaded(); return getRoot(tx).contains(tx, key); }
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 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; } } }
synchronized public boolean containsKey(Transaction tx, Key key) throws IOException { assertLoaded(); return getRoot(tx).contains(tx, key); }
synchronized public boolean containsKey(Transaction tx, Key key) throws IOException { assertLoaded(); return getRoot(tx).contains(tx, key); }
synchronized public boolean containsKey(Transaction tx, Key key) throws IOException { assertLoaded(); return getRoot(tx).contains(tx, key); }