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

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


        entryDnCache.clear();

View Full Code Here

                return dn;
            }
            
            do
            {
                ParentIdAndRdn cur = null;
            
                if ( piarCache != null )
                {
                    Element piar = piarCache.get( parentId );
                    
                    if ( piar != null )
                    {
                        cur = (ParentIdAndRdn)piar.getValue();
                    }
                    else
                    {
                        cur = rdnIdx.reverseLookup( parentId );
                        
                        if ( cur == null )
                        {
                            return null;
                        }
                        
                        piarCache.put( new Element( parentId, cur) );
                    }
                }
                else
                {
                    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 = new Dn( schemaManager, Arrays.copyOf( rdnArray, pos ) );

View Full Code Here

     */
    public final long 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

            if ( Dn.isNullOrEmpty( dn ) )
            {
                return Partition.ROOT_ID;
            }


            ParentIdAndRdn suffixKey = new ParentIdAndRdn( Partition.ROOT_ID, suffixDn.getRdns() );


            // Check into the Rdn index, starting with the partition Suffix
            try
            {
                rwLock.readLock().lock();
                String currentId = rdnIdx.forwardLookup( suffixKey );


                for ( int i = dn.size() - suffixDn.size(); i > 0; i-- )
                {
                    Rdn rdn = dn.getRdn( i - 1 );
                    ParentIdAndRdn currentRdn = new ParentIdAndRdn( currentId, rdn );
                    currentId = rdnIdx.forwardLookup( currentRdn );


                    if ( currentId == null )
                    {
                        break;

View Full Code Here

    public String getParentId( String childId ) throws Exception
    {
        try
        {
            rwLock.readLock().lock();
            ParentIdAndRdn key = rdnIdx.reverseLookup( childId );


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


            return key.getParentId();
        }
        finally
        {
            rwLock.readLock().unlock();
        }

View Full Code Here

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

     * @throws Exception if db lookups fail
     * @see org.apache.directory.server.xdbm.search.Evaluator#evaluate(IndexEntry)
     */
    public boolean evaluate( IndexEntry<?, String> indexEntry ) throws LdapException
    {
        ParentIdAndRdn parent = db.getRdnIndex().reverseLookup( indexEntry.getId() );
        boolean isChild = parent.getParentId().equals( baseId );
        Entry entry = indexEntry.getEntry();


        // Fetch the entry
        if ( null == entry )
        {

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

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


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


        assertEquals( 0, idx.count() );


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


        for ( long i = 1; i < 5; i++ )
        {
            key = new ParentIdAndRdn( Strings.getUUID( i ), new Rdn( "cn=key" + i ) );


            idx.add( key, Strings.getUUID( i ) );
        }


        assertEquals( 5, idx.count() );

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.