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

    /**
     * {@inheritDoc}
     */
    public String getParentId( String childId ) throws Exception
    {
        ParentIdAndRdn key = rdnIdx.reverseLookup( childId );


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


        return key.getParentId();
    }

View Full Code Here

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


            suffixId = rdnIdx.forwardLookup( key );
        }


        return suffixId;

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 );


        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

    {
        String tmp = candidateId;


        while ( true )
        {
            ParentIdAndRdn parentIdAndRdn = db.getRdnIndex().reverseLookup( tmp );


            if ( parentIdAndRdn == null )
            {
                return false;
            }


            tmp = parentIdAndRdn.getParentId();


            if ( tmp.equals( Partition.ROOT_ID ) )
            {
                return false;
            }

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

    {
        // 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

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.