Examples of org.apache.ldap.server.partition.impl.btree.NoDupsEnumeration

Package org.apache.ldap.server.partition.impl.btree

Examples of org.apache.ldap.server.partition.impl.btree.NoDupsEnumeration

org.apache.ldap.server.partition.impl.btree.NoDupsEnumeration
A simple NamingEnumeration over a TupleBrowser on a table that does not allow duplicates.
WARNING: The Tuple returned by this listing is always the same instance object returned every time. It is reused to for the sake of efficency rather than creating a new tuple for each hasMore() call.
@author Apache Directory Project @version $Rev: 201594 $

        NamingEnumeration list = null;
        
        try 
        {
            JdbmTupleBrowser browser = new JdbmTupleBrowser( bt.browse() );
            list = new NoDupsEnumeration( browser, true );
        }
        catch ( IOException e ) 
        {
            NamingException ne = new NamingException();
            ne.setRootCause( e );

View Full Code Here

        {
            if ( isGreaterThan ) 
            {
                JdbmTupleBrowser browser =
                    new JdbmTupleBrowser( bt.browse( key ) );
                list = new NoDupsEnumeration( browser, isGreaterThan );
            } 
            else 
            {
                /* According to the jdbm docs a browser is positioned right
                 * before a key greater than or equal to key.  getNext() will
                 * return the next tuple with a key greater than or equal to
                 * key.  getPrevious() used in descending scans for less than
                 * for equal to comparisions will not.  We need to advance
                 * forward once and check if the returned Tuple key equals
                 * key.  If it does then we do nothing feeding in the browser
                 * to the NoDupsCursor.  If it does not we call getPrevious and
                 * pass it into the NoDupsCursor constructor.
                 */
                jdbm.helper.Tuple tuple = new jdbm.helper.Tuple();
                TupleBrowser browser = bt.browse( key ); 
                
                if ( browser.getNext( tuple ) ) 
                {
                    Object greaterKey = tuple.getKey();
                    
                    if ( 0 != comparator.compareKey( key, greaterKey ) ) 
                    {
                        // Make sure we don't return greaterKey in cursor
                        browser.getPrevious( tuple );
                    }
                }


                // If greaterKey != key above then it will not be returned.
                list = new NoDupsEnumeration( 
                    new JdbmTupleBrowser( browser ), isGreaterThan );
            }
        } 
        catch ( IOException e ) 
        {

View Full Code Here

        NamingEnumeration list = null;
        
        try 
        {
            JdbmTupleBrowser browser = new JdbmTupleBrowser( bt.browse() );
            list = new NoDupsEnumeration( browser, true );
        }
        catch ( IOException e ) 
        {
            NamingException ne = new NamingException();
            ne.setRootCause( e );

View Full Code Here

        {
            if ( isGreaterThan ) 
            {
                JdbmTupleBrowser browser =
                    new JdbmTupleBrowser( bt.browse( key ) );
                list = new NoDupsEnumeration( browser, isGreaterThan );
            } 
            else 
            {
                /* According to the jdbm docs a browser is positioned right
                 * before a key greater than or equal to key.  getNext() will
                 * return the next tuple with a key greater than or equal to
                 * key.  getPrevious() used in descending scans for less than
                 * for equal to comparisions will not.  We need to advance
                 * forward once and check if the returned Tuple key equals
                 * key.  If it does then we do nothing feeding in the browser
                 * to the NoDupsCursor.  If it does not we call getPrevious and
                 * pass it into the NoDupsCursor constructor.
                 */
                jdbm.helper.Tuple tuple = new jdbm.helper.Tuple();
                TupleBrowser browser = bt.browse( key ); 
                
                if ( browser.getNext( tuple ) ) 
                {
                    Object greaterKey = tuple.getKey();
                    
                    if ( 0 != comparator.compareKey( key, greaterKey ) ) 
                    {
                        // Make sure we don't return greaterKey in cursor
                        browser.getPrevious( tuple );
                    }
                }


                // If greaterKey != key above then it will not be returned.
                list = new NoDupsEnumeration( 
                    new JdbmTupleBrowser( browser ), isGreaterThan );
            }
        } 
        catch ( IOException e ) 
        {

View Full Code Here

        NamingEnumeration list = null;
        
        try 
        {
            JdbmTupleBrowser browser = new JdbmTupleBrowser( bt.browse() );
            list = new NoDupsEnumeration( browser, true );
        }
        catch ( IOException e ) 
        {
            NamingException ne = new NamingException();
            ne.setRootCause( e );

View Full Code Here

        {
            if ( isGreaterThan ) 
            {
                JdbmTupleBrowser browser =
                    new JdbmTupleBrowser( bt.browse( key ) );
                list = new NoDupsEnumeration( browser, isGreaterThan );
            } 
            else 
            {
                /* According to the jdbm docs a browser is positioned right
                 * before a key greater than or equal to key.  getNext() will
                 * return the next tuple with a key greater than or equal to
                 * key.  getPrevious() used in descending scans for less than
                 * for equal to comparisions will not.  We need to advance
                 * forward once and check if the returned Tuple key equals
                 * key.  If it does then we do nothing feeding in the browser
                 * to the NoDupsCursor.  If it does not we call getPrevious and
                 * pass it into the NoDupsCursor constructor.
                 */
                jdbm.helper.Tuple tuple = new jdbm.helper.Tuple();
                TupleBrowser browser = bt.browse( key ); 
                
                if ( browser.getNext( tuple ) ) 
                {
                    Object greaterKey = tuple.getKey();
                    
                    if ( 0 != comparator.compareKey( key, greaterKey ) ) 
                    {
                        // Make sure we don't return greaterKey in cursor
                        browser.getPrevious( tuple );
                    }
                }


                // If greaterKey != key above then it will not be returned.
                list = new NoDupsEnumeration( 
                    new JdbmTupleBrowser( browser ), isGreaterThan );
            }
        } 
        catch ( IOException e ) 
        {

View Full Code Here

TOP

Related Classes of org.apache.ldap.server.partition.impl.btree.NoDupsEnumeration

org.apache.ldap.server.partition.impl.btree.jdbm.JdbmTable

java.util.NoSuchElementException

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.