Examples of jdbm.btree.BTree.find()

jdbm.btree.BTree.find()
Find the value associated with the given key. @param key Lookup key. @return Value associated with the key, or null if not found.


    private BTree getDupsContainer() throws Exception
    {
        BTree tree = table.getBTree();


        DupsContainer<String> values = table.getDupsContainer( ( byte[] ) tree.find( KEY ) );


        return table.getBTree( values.getBTreeRedirect() );
    }
}

View Full Code Here

            }


            // if the number of duplicates falls below the numDupLimit value
            BTree tree = getBTree( values.getBTreeRedirect() );


            if ( tree.find( value ) != null && tree.remove( value ) != null )
            {
                /*
                 * If we drop below the duplicate limit then we revert from using
                 * a Jdbm BTree to using an in memory AvlTree.
                 */

View Full Code Here

            }


            // if the number of duplicates falls below the numDupLimit value
            BTree tree = getBTree( values.getBTreeRedirect() );


            if ( tree.find( value ) != null && tree.remove( value ) != null )
            {
                /*
                 * If we drop below the duplicate limit then we revert from using
                 * a Jdbm BTree to using an in memory AvlTree.
                 */

View Full Code Here


    private BTree getDupsContainer() throws Exception
    {
        BTree tree = table.getBTree();
        
        DupsContainer<String> values = table.getDupsContainer( ( byte[] ) tree.find( KEY ) );
        
        return table.getBTree( values.getBTreeRedirect() );   
    }
}

View Full Code Here


    private BTree getDupsContainer() throws Exception
    {
        BTree tree = table.getBTree();


        DupsContainer<String> values = table.getDupsContainer( ( byte[] ) tree.find( KEY ) );


        return table.getBTree( values.getBTreeRedirect() );
    }
}

View Full Code Here

                    stamp = dateEncoder.parse(logDateTime);
                } catch (ParseException ex) {
                    System.err.println("Skipping log record:  " + ex.getMessage());
                    continue;
                }
                Date previous = (Date) stampDb.find(user);
                if (null == previous || stamp.after(previous))
                {
                    stampDb.insert(user, stamp, true); // Record this user's newest login so far
                }
            }

View Full Code Here

        recman.commit();


        tree.insert( "derek", "dick",true );
        recman.rollback();


        assertTrue( tree.find( "derek" ) == null );
        assertTrue( tree.find( "goodnight" ).equals( "gracie" ) );
        assertTrue( tree.find( "hello" ).equals( "world" ) );
    }

View Full Code Here


        tree.insert( "derek", "dick",true );
        recman.rollback();


        assertTrue( tree.find( "derek" ) == null );
        assertTrue( tree.find( "goodnight" ).equals( "gracie" ) );
        assertTrue( tree.find( "hello" ).equals( "world" ) );
    }

View Full Code Here

        tree.insert( "derek", "dick",true );
        recman.rollback();


        assertTrue( tree.find( "derek" ) == null );
        assertTrue( tree.find( "goodnight" ).equals( "gracie" ) );
        assertTrue( tree.find( "hello" ).equals( "world" ) );
    }
      
    
    
    /**

View Full Code Here

            }
    
            // if the number of duplicates falls below the numDupLimit value
            BTree tree = getBTree( values.getBTreeRedirect() );
            
            if ( tree.find( value ) != null && tree.remove( value ) != null )
            {
                /*
                 * If we drop below the duplicate limit then we revert from using
                 * a Jdbm BTree to using an in memory AvlTree.
                 */

View Full Code Here

0 1

TOP

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.