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

    @Override
    public ParentIdAndRdn fromBytes( byte[] buffer, int pos ) throws IOException
    {
        try
        {
            ParentIdAndRdn parentIdAndRdn = new ParentIdAndRdn();


            // Read the number of rdns, if any
            int nbRdns = Serialize.deserializeInt( buffer, pos );
            pos += 4;


            if ( nbRdns == 0 )
            {
                parentIdAndRdn.setRdns( new Rdn[0] );
            }
            else
            {
                Rdn[] rdns = new Rdn[nbRdns];


                for ( int i = 0; i < nbRdns; i++ )
                {
                    Rdn rdn = new Rdn( schemaManager );
                    pos = rdn.deserialize( buffer, pos );
                    rdns[i] = rdn;
                }


                parentIdAndRdn.setRdns( rdns );
            }


            // Read the parent ID
            byte[] uuidBytes = Serialize.deserializeBytes( buffer, pos );
            pos += 4 + uuidBytes.length;
            String uuid = Strings.utf8ToString( uuidBytes );


            parentIdAndRdn.setParentId( uuid );


            // Read the number of children and descendants
            int nbChildren = Serialize.deserializeInt( buffer, pos );
            pos += 4;


            int nbDescendants = Serialize.deserializeInt( buffer, pos );
            pos += 4;


            parentIdAndRdn.setNbChildren( nbChildren );
            parentIdAndRdn.setNbDescendants( nbDescendants );


            return parentIdAndRdn;
        }
        catch ( LdapInvalidAttributeValueException cnfe )
        {

View Full Code Here

            public Tuple next()
            {
                DnTuple dt = itr.next();
                Tuple t = new Tuple();


                ParentIdAndRdn rdn = new ParentIdAndRdn( dt.getParentId(), dt.getDn().getRdns() );
                rdn.setNbChildren( dt.getNbChildren() );
                rdn.setNbDescendants( dt.getNbDecendents() );
                
                t.setKey( rdn );
                t.setValue( dt.getId() );


                return t;
            }




            @Override
            public boolean hasNext()
            {
                return itr.hasNext();
            }
        };


        String forwardRdnTree = ApacheSchemaConstants.APACHE_RDN_AT_OID + MavibotRdnIndex.FORWARD_BTREE;


        build( parentIdAndRdnFwdItr, forwardRdnTree );


        Iterator<Tuple> parentIdAndRdnRevItr = new Iterator<Tuple>()
        {
            Iterator<DnTuple> itr = parentIdRdnSortedSet.iterator();




            @Override
            public void remove()
            {
            }




            @Override
            public Tuple next()
            {
                DnTuple dt = itr.next();
                Tuple t = new Tuple();


                ParentIdAndRdn rdn = new ParentIdAndRdn( dt.getParentId(), dt.getDn().getRdns() );
                rdn.setNbChildren( dt.getNbChildren() );
                rdn.setNbDescendants( dt.getNbDecendents() );
                
                t.setKey( dt.getId() );
                t.setValue( rdn );


                return t;

View Full Code Here


        ObjectInputStream in = new ObjectInputStream( new ByteArrayInputStream( buffer.array(), buffer.position(), len ) );


        try
        {
            ParentIdAndRdn parentIdAndRdn = new ParentIdAndRdn();


            // Read the number of rdns, if any
            byte nbRdns = in.readByte();


            if ( nbRdns == 0 )
            {
                parentIdAndRdn.setRdns( new Rdn[0] );
            }
            else
            {
                Rdn[] rdns = new Rdn[nbRdns];


                for ( int i = 0; i < nbRdns; i++ )
                {
                    Rdn rdn = new Rdn( schemaManager );
                    rdn.readExternal( in );
                    rdns[i] = rdn;
                }


                parentIdAndRdn.setRdns( rdns );
            }


            // Read the parent ID
            String uuid = in.readUTF();


            parentIdAndRdn.setParentId( uuid );


            // Read the nulber of children and descendants
            int nbChildren = in.readInt();
            int nbDescendants = in.readInt();


            parentIdAndRdn.setNbChildren( nbChildren );
            parentIdAndRdn.setNbDescendants( nbDescendants );


            buffer.position( buffer.position() + len );
            
            return parentIdAndRdn;
        }

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( schemaManager, "cn=key" ) );


        assertNull( idx.forwardLookup( key ) );


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


        // check with the different case in UP name, this ensures that the custom
        // key comparator is used
        key = new ParentIdAndRdn( Strings.getUUID( 0L ), new Rdn( schemaManager, "cn=KEY" ) );
        assertEquals( Strings.getUUID( 0L ), idx.forwardLookup( key ) );
        assertEquals( key, idx.reverseLookup( Strings.getUUID( 0L ) ) );
    }

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

    @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

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

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.