Examples of org.apache.directory.server.xdbm.ParentIdAndRdn

Package org.apache.directory.server.xdbm

Examples of org.apache.directory.server.xdbm.ParentIdAndRdn

org.apache.directory.server.xdbm.ParentIdAndRdn
A wrapper for the tuple of parentId and Rdn, used for the Rdn index. If the refered entry is a ContextEntry, we may have more than one Rdn stored @author Apache Directory Project

     */
    protected String getSuffixId() throws Exception
    {
        if ( suffixId == null )
        {
            ParentIdAndRdn key = new ParentIdAndRdn( Partition.ROOT_ID, suffixDn.getRdns() );


            try
            {
                rwLock.readLock().lock();
                suffixId = rdnIdx.forwardLookup( key );

View Full Code Here

        // We use the RdnIndex to get all the entries from a starting point
        // and below up to the number of children
        Cursor<IndexEntry<ParentIdAndRdn, String>> rdnCursor = db.getRdnIndex().forwardCursor();


        IndexEntry<ParentIdAndRdn, String> startingPos = new IndexEntry<ParentIdAndRdn, String>();
        startingPos.setKey( new ParentIdAndRdn( node.getBaseId(), ( Rdn[] ) null ) );
        rdnCursor.before( startingPos );


        Cursor<IndexEntry<String, String>> scopeCursor = new ChildrenCursor( db, node.getBaseId(), rdnCursor );
        Set<String> candidateSet = searchResult.getCandidateSet();

View Full Code Here

        int nbResults = 0;


        // We use the RdnIndex to get all the entries from a starting point
        // and below up to the number of descendant
        String baseId = node.getBaseId();
        ParentIdAndRdn parentIdAndRdn = db.getRdnIndex().reverseLookup( baseId );
        IndexEntry<ParentIdAndRdn, String> startingPos = new IndexEntry<ParentIdAndRdn, String>();


        startingPos.setKey( parentIdAndRdn );
        startingPos.setId( baseId );


        Cursor<IndexEntry<ParentIdAndRdn, String>> rdnCursor = new SingletonIndexCursor<ParentIdAndRdn>(
            startingPos );
        String parentId = parentIdAndRdn.getParentId();


        Cursor<IndexEntry<String, String>> scopeCursor = new DescendantCursor( db, baseId, parentId, rdnCursor );
        Set<String> candidateSet = searchResult.getCandidateSet();


        // Fetch all the UUIDs if we have an index

View Full Code Here

    public void testCount() throws Exception
    {
        initIndex();
        assertEquals( 0, idx.count() );


        ParentIdAndRdn key = new ParentIdAndRdn( Strings.getUUID( 0L ), new Rdn( "cn=key" ) );


        idx.add( key, Strings.getUUID( 0L ) );
        assertEquals( 1, idx.count() );


        // setting a different parentId should make this key a different key
        key = new ParentIdAndRdn( Strings.getUUID( 1L ), new Rdn( "cn=key" ) );


        idx.add( key, Strings.getUUID( 1L ) );
        assertEquals( 2, idx.count() );


        //count shouldn't get affected cause of inserting the same key
        idx.add( key, Strings.getUUID( 2L ) );
        assertEquals( 2, idx.count() );


        key = new ParentIdAndRdn( Strings.getUUID( 2L ), new Rdn( "cn=key" ) );
        idx.add( key, Strings.getUUID( 3L ) );
        assertEquals( 3, idx.count() );
    }

View Full Code Here

    @Test
    public void testCountOneArg() throws Exception
    {
        initIndex();


        ParentIdAndRdn key = new ParentIdAndRdn( Strings.getUUID( 0L ), new Rdn( "cn=key" ) );


        assertEquals( 0, idx.count( key ) );


        idx.add( key, Strings.getUUID( 0L ) );
        assertEquals( 1, idx.count( key ) );

View Full Code Here

    @Test
    public void testLookups() throws Exception
    {
        initIndex();


        ParentIdAndRdn key = new ParentIdAndRdn( Strings.getUUID( 0L ), new Rdn( "cn=key" ) );


        assertNull( idx.forwardLookup( key ) );


        idx.add( key, Strings.getUUID( 0L ) );
        assertEquals( Strings.getUUID( 0L ), idx.forwardLookup( key ) );

View Full Code Here

    @Test
    public void testAddDropById() throws Exception
    {
        initIndex();


        ParentIdAndRdn key = new ParentIdAndRdn( Strings.getUUID( 0L ), new Rdn( "cn=key" ) );


        assertNull( idx.forwardLookup( key ) );


        // test add/drop without adding any duplicates
        idx.add( key, Strings.getUUID( 0L ) );

View Full Code Here

            // The idea is to use a ChildrenCursor each time we have an entry with chidren, 
            // and process recursively.
            if ( hasNext )
            {
                IndexEntry cursorEntry = currentCursor.get();
                ParentIdAndRdn parentIdAndRdn = ( ( ParentIdAndRdn ) ( cursorEntry.getKey() ) );


                // Check that we aren't out of the cursor's limit
                if ( !parentIdAndRdn.getParentId().equals( currentParentId ) )
                {
                    // Ok, we went too far. Unstack the cursor and return
                    finished = cursorStack.size() == 0;


                    if ( !finished )
                    {
                        currentCursor.close();
                        currentCursor = ( Cursor<IndexEntry<ParentIdAndRdn, String>> ) cursorStack.pop();
                        currentParentId = ( String ) parentIdStack.pop();
                    }


                    // And continue...
                }
                else
                {
                    // We have a candidate, it will be returned.
                    if ( topLevel )
                    {
                        prefetched = new IndexEntry();
                        prefetched.setId( cursorEntry.getId() );
                        prefetched.setKey( baseId );
                    }
                    else
                    {
                        prefetched = cursorEntry;
                    }


                    // Check if the current entry has children or not.
                    if ( parentIdAndRdn.getNbDescendants() > 0 )
                    {
                        String newParentId = ( String ) cursorEntry.getId();


                        // Yes, then create a new cursor and go down one level
                        Cursor<IndexEntry<ParentIdAndRdn, String>> cursor = db.getRdnIndex().forwardCursor();


                        IndexEntry<ParentIdAndRdn, String> startingPos = new IndexEntry<ParentIdAndRdn, String>();
                        startingPos.setKey( new ParentIdAndRdn( newParentId, ( Rdn[] ) null ) );
                        cursor.before( startingPos );


                        cursorStack.push( currentCursor );
                        parentIdStack.push( currentParentId );

View Full Code Here

         */
        dropMovedAliasIndices( oldDn );


        // Update the Rdn index
        // First drop the old entry
        ParentIdAndRdn movedEntry = rdnIdx.reverseLookup( entryId );


        updateRdnIdx( oldParentId, REMOVE_CHILD, movedEntry.getNbDescendants() );


        rdnIdx.drop( entryId );


        // Now, add the new entry at the right position
        movedEntry.setParentId( newParentId );
        rdnIdx.add( movedEntry, entryId );


        updateRdnIdx( newParentId, ADD_CHILD, movedEntry.getNbDescendants() );


        /*
         * Read Alias Index Tuples
         *
         * If this is a name change due to a move operation then the one and

View Full Code Here


        /*
         * Update the Rdn index
         */
        // First drop the old entry
        ParentIdAndRdn movedEntry = rdnIdx.reverseLookup( entryId );


        updateRdnIdx( oldParentId, REMOVE_CHILD, movedEntry.getNbDescendants() );


        rdnIdx.drop( entryId );


        // Now, add the new entry at the right position
        movedEntry.setParentId( newParentId );
        movedEntry.setRdns( new Rdn[]
            { newRdn } );
        rdnIdx.add( movedEntry, entryId );


        updateRdnIdx( newParentId, ADD_CHILD, movedEntry.getNbDescendants() );


        dumpRdnIdx();


        /*
         * Read Alias Index Tuples

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of org.apache.directory.server.xdbm.ParentIdAndRdn

org.apache.directory.api.ldap.model.name.Rdn

org.apache.directory.mavibot.btree.MavibotPartitionBuilder

org.apache.directory.server.core.partition.impl.btree.AbstractBTreePartition

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

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

org.apache.directory.server.core.partition.impl.btree.mavibot.MavibotParentIdAndRdnSerializer

org.apache.directory.server.core.partition.impl.btree.mavibot.MavibotRdnIndexTest

org.apache.directory.server.core.partition.ldif.LdifPartition

org.apache.directory.server.core.partition.ldif.SingleFileLdifPartition

org.apache.directory.server.xdbm.impl.avl.AvlRdnIndexTest

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.