return btreeHas( getBTree( ( BTreeRedirect ) values ), value );
BTree tree = getBTree( ( BTreeRedirect ) returned ); this.count -= tree.size(); return removeAll( tree );
BTree tree = getBTree( ( BTreeRedirect ) values );
public void beforeKey( K key ) throws LdapException, CursorException { checkNotClosed(); try { browser = table.getBTree().browse( key ); clearValue(); } catch ( IOException e ) { throw new CursorException( e ); } }
/** * {@inheritDoc} */ public void afterLast() throws LdapException, CursorException { checkNotClosed(); try { browser = table.getBTree().browse( null ); clearValue(); } catch ( IOException e ) { throw new CursorException( e ); } }
/** * {@inheritDoc} */ @SuppressWarnings("unchecked") public void beforeKey( K key ) throws LdapException, CursorException { checkNotClosed(); try { browser = ( ( BTree<K, V> ) table.getBTree() ).browse( key ); forwardDirection = null; clearValue(); } catch ( IOException e ) { throw new CursorException( e ); } }
/** * {@inheritDoc} */ @SuppressWarnings("unchecked") public void beforeFirst() throws LdapException, CursorException { checkNotClosed(); try { browser = table.getBTree().browse(); forwardDirection = null; clearValue(); } catch ( IOException e ) { throw new CursorException( e ); } }
/** * {@inheritDoc} */ public void beforeFirst() throws LdapException, CursorException { checkNotClosed(); try { browser = table.getBTree().browse(); clearValue(); } catch ( IOException e ) { throw new CursorException( e ); } }
/** * {@inheritDoc} */ @SuppressWarnings("unchecked") public void afterLast() throws LdapException, CursorException { checkNotClosed(); try { browser = table.getBTree().browse( null ); forwardDirection = null; clearValue(); } catch ( IOException e ) { throw new CursorException( e ); } }
/** * {@inheritDoc} */ @SuppressWarnings("unchecked") public boolean has( PartitionTxn transaction, K key, V value ) throws LdapException { if ( key == null ) { return false; } try { if ( !allowsDuplicates ) { V stored = bt.find( key ); return null != stored && stored.equals( value ); } DupsContainer<V> values = getDupsContainer( ( byte[] ) bt.find( key ) ); if ( values.isArrayTree() ) { return values.getArrayTree().find( value ) != null; } return getBTree( values.getBTreeRedirect() ).find( value ) != null; } catch ( IOException ioe ) { throw new LdapOtherException( ioe.getMessage() ); } }
return new BTreeTupleEnumeration( getBTree( ( BTreeRedirect ) values ), key );
BTree<K, V> tree = getBTree( values.getBTreeRedirect() );
BTree<K, V> tree = getBTree( values.getBTreeRedirect() );
return getBTree( values.getBTreeRedirect() ).size();
browser = table.getBTree().browse( key );
BTree tree = getBTree( BTreeRedirectMarshaller.INSTANCE.deserialize( serialized ) ); return new KeyBTreeCursor<>( tree, valueComparator );
browser = ( ( BTree<K, V> ) table.getBTree() ).browse( key ); forwardDirection = null;
BTree tree = getBTree( BTreeRedirectMarshaller.INSTANCE.deserialize( serialized ) ); return new KeyTupleBTreeCursor<>( tree, key, valueComparator );
BTree tree = table.getBTree( values.getBTreeRedirect() ); dupsCursor = new KeyBTreeCursor<V>( tree, table.getValueComparator() );
BTree bt = table.getBTree( values.getBTreeRedirect() ); dupsCursor = new KeyBTreeCursor<V>( bt, table.getValueComparator() );