Examples of jdbm.helper.TupleBrowser

jdbm.helper.TupleBrowser
Browser to traverse a collection of tuples. The browser allows for forward and reverse order traversal. @author Alex Boisvert @version $Id: TupleBrowser.java,v 1.2 2001/05/19 14:02:00 boisvert Exp $

             * key argument supplied.  We use this key to advance a browser to
             * that tuple and scan down to lesser Tuples until we hit one
             * that is less than the key argument supplied.  Usually this will
             * be the previous tuple if it exists.
             */
            TupleBrowser browser = bt.browse( tuple.getKey() );


            if ( browser.getPrevious( tuple ) )
            {
                return true;
            }
        }

View Full Code Here

    @SuppressWarnings("unchecked")
    private boolean btreeHas( BTree tree, V key, boolean isGreaterThan ) throws IOException
    {
        jdbm.helper.Tuple tuple = new jdbm.helper.Tuple();


        TupleBrowser browser = tree.browse( key );


        if ( isGreaterThan )
        {
            return browser.getNext( tuple );
        }
        else
        {
            if ( browser.getPrevious( tuple ) )
            {
                return true;
            }
            else
            {
                /*
                 * getPrevious() above fails which means the browser has is
                 * before the first Tuple of the btree.  A call to getNext()
                 * should work every time.
                 */
                browser.getNext( tuple );


                /*
                 * Since the browser is positioned now on the Tuple with the
                 * smallest key we just need to check if it equals this key
                 * which is the only chance for returning true.

View Full Code Here


    @SuppressWarnings("unchecked")
    private ArrayTree<V> convertToArrayTree( BTree bTree ) throws IOException
    {
        ArrayTree<V> avlTree = new ArrayTree<V>( valueComparator );
        TupleBrowser browser = bTree.browse();
        jdbm.helper.Tuple tuple = new jdbm.helper.Tuple();


        while ( browser.getNext( tuple ) )
        {
            avlTree.insert( ( V ) tuple.getKey() );
        }


        return avlTree;

View Full Code Here


    // we must synchronize on the BTree while browsing


    synchronized ( btree ) {


        TupleBrowser browser = btree.browse();


        Tuple tuple = new Tuple();


        while(browser.getNext(tuple)) {


          if(tuple.getValue().equals(value))


            return(true);

View Full Code Here


        BPage page = new BPage( tree, test, test );






        TupleBrowser browser;


        Tuple tuple = new Tuple();






        // test insertion


        page.insert( 1, test2, test2, false );


        page.insert( 1, test3, test3, false );


        page.insert( 1, test1, test1, false );






        // test binary search


        browser = page.find( 1, test2 );


        if ( browser.getNext( tuple ) == false ) {


            throw new IllegalStateException( "Browser didn't have 'test2'" );


        }

View Full Code Here

    {
        BPage rootPage = getRoot();
        if ( rootPage == null ) {
            return EmptyBrowser.INSTANCE;
        }
        TupleBrowser browser = rootPage.findFirst();
        return browser;
    }

View Full Code Here

    {
        BPage rootPage = getRoot();
        if ( rootPage == null ) {
            return EmptyBrowser.INSTANCE;
        }
        TupleBrowser browser = rootPage.find( _height, key );
        return browser;
    }

View Full Code Here

             * key argument supplied.  We use this key to advance a browser to
             * that tuple and scan down to lesser Tuples until we hit one
             * that is less than the key argument supplied.  Usually this will
             * be the previous tuple if it exists.
             */
            TupleBrowser browser = bt.browse( tuple.getKey() );


            if ( browser.getPrevious( tuple ) )
            {
                return true;
            }
        }

View Full Code Here

    @SuppressWarnings("unchecked")
    private boolean btreeHas( BTree tree, V key, boolean isGreaterThan ) throws IOException
    {
        jdbm.helper.Tuple tuple = new jdbm.helper.Tuple();


        TupleBrowser browser = tree.browse( key );


        if ( isGreaterThan )
        {
            return browser.getNext( tuple );
        }
        else
        {
            if ( browser.getPrevious( tuple ) )
            {
                return true;
            }
            else
            {
                /*
                 * getPrevious() above fails which means the browser has is
                 * before the first Tuple of the btree.  A call to getNext()
                 * should work every time.
                 */
                browser.getNext( tuple );


                /*
                 * Since the browser is positioned now on the Tuple with the
                 * smallest key we just need to check if it equals this key
                 * which is the only chance for returning true.

View Full Code Here


    @SuppressWarnings("unchecked")
    private ArrayTree<V> convertToArrayTree( BTree bTree ) throws IOException
    {
        ArrayTree<V> avlTree = new ArrayTree<V>( valueComparator );
        TupleBrowser browser = bTree.browse();
        jdbm.helper.Tuple tuple = new jdbm.helper.Tuple();


        while ( browser.getNext( tuple ) )
        {
            avlTree.insert( ( V ) tuple.getKey() );
        }


        return avlTree;

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of jdbm.helper.TupleBrowser

org.activemq.store.jdbm.JdbmMessageStore

org.activemq.store.jdbm.JdbmTopicMessageStore

org.activemq.store.jdbm.OrderTest

org.apache.directory.server.core.partition.impl.btree.jdbm.JdbmBrowserBugTest

org.apache.directory.server.core.partition.impl.btree.jdbm.JdbmTable

org.apache.directory.server.core.partition.impl.btree.jdbm.KeyBTreeCursorTest

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.