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

    {
        // Start with the root
        Cursor<IndexEntry<ParentIdAndRdn, String>> cursor = rdnIdx.forwardCursor();


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


        while ( cursor.next() )
        {
            IndexEntry<ParentIdAndRdn, String> entry = cursor.get();

View Full Code Here

    {
        // Start with the root
        Cursor<IndexEntry<ParentIdAndRdn, String>> cursor = rdnIdx.forwardCursor();


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


        while ( cursor.next() && ( countChildren < nbSibbling ) )
        {

View Full Code Here

            // Suffix entry cannot have a parent since it is the root so it is
            // capped off using the zero value which no entry can have since
            // entry sequences start at 1.
            //
            Dn parentDn = null;
            ParentIdAndRdn key = null;


            if ( entryDn.equals( suffixDn ) )
            {
                parentId = Partition.ROOT_ID;
                key = new ParentIdAndRdn( parentId, suffixDn.getRdns() );
            }
            else
            {
                parentDn = entryDn.getParent();


                lockRead();


                try
                {
                    parentId = getEntryId( parentDn );
                }
                finally
                {
                    unlockRead();
                }


                key = new ParentIdAndRdn( parentId, entryDn.getRdn() );
            }


            // don't keep going if we cannot find the parent Id
            if ( parentId == null )
            {

View Full Code Here

        if ( parentId.equals( Partition.ROOT_ID ) )
        {
            return;
        }


        ParentIdAndRdn parent = rdnIdx.reverseLookup( parentId );


        while ( parent != null )
        {
            if ( isFirst )
            {
                if ( addRemove == ADD_CHILD )
                {
                    parent.setNbChildren( parent.getNbChildren() + 1 );
                }
                else
                {
                    parent.setNbChildren( parent.getNbChildren() - 1 );
                }


                isFirst = false;
            }


            if ( addRemove == ADD_CHILD )
            {
                parent.setNbDescendants( parent.getNbDescendants() + ( nbDescendant + 1 ) );
            }
            else
            {
                parent.setNbDescendants( parent.getNbDescendants() - ( nbDescendant + 1 ) );
            }


            // Inject the modified element into the index
            // we first need to drop it so that the key can be replaced
            rdnIdx.drop( parentId );
            rdnIdx.add( parent, parentId );


            parentId = parent.getParentId();
            parent = rdnIdx.reverseLookup( parentId );
        }
    }

View Full Code Here

            {
                objectClassIdx.drop( value.getString(), id );
            }


            // Update the parent's nbChildren and nbDescendants values
            ParentIdAndRdn parent = rdnIdx.reverseLookup( id );
            updateRdnIdx( parent.getParentId(), REMOVE_CHILD, 0 );


            // Update the rdn, oneLevel, subLevel, and entryCsn indexes
            entryCsnIdx.drop( entry.get( ENTRY_CSN_AT ).getString(), id );


            // Update the AdministrativeRole index, if needed

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

         * No need to calculate the new Dn.
         */
        String parentId = getParentId( oldId );


        // Get the old parentIdAndRdn to get the nb of children and descendant
        ParentIdAndRdn parentIdAndRdn = rdnIdx.reverseLookup( oldId );


        // Now we can drop it
        rdnIdx.drop( oldId );


        // Update the descendants
        parentIdAndRdn.setParentId( parentId );
        parentIdAndRdn.setRdns( newRdn );


        rdnIdx.add( parentIdAndRdn, oldId );


        if ( isSyncOnWrite.get() )
        {

View Full Code Here

        Rdn[] rdnArray = new Rdn[10];
        int pos = 0;


        do
        {
            ParentIdAndRdn cur = rdnIdx.reverseLookup( parentId );


            if ( cur == null )
            {
                return null;
            }


            Rdn[] rdns = cur.getRdns();


            for ( Rdn rdn : rdns )
            {
                if ( ( pos > 0 ) && ( pos % 10 == 0 ) )
                {
                    // extend the array
                    Rdn[] newRdnArray = new Rdn[pos + 10];
                    System.arraycopy( rdnArray, 0, newRdnArray, 0, pos );
                    rdnArray = newRdnArray;
                }


                rdnArray[pos++] = rdn;
            }


            parentId = cur.getParentId();
        }
        while ( !parentId.equals( rootId ) );


        Dn dn = new Dn( schemaManager, Arrays.copyOf( rdnArray, pos ) );

View Full Code Here

     */
    public final int getChildCount( String id ) throws LdapException
    {
        try
        {
            ParentIdAndRdn parentIdAndRdn = rdnIdx.reverseLookup( id );


            return parentIdAndRdn.getNbChildren();
        }
        catch ( Exception e )
        {
            throw new LdapOperationErrorException( e.getMessage(), e );
        }

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.