Package org.apache.directory.mavibot.btree.serializer

Examples of org.apache.directory.mavibot.btree.serializer.LongSerializer

71
72
73
74
75
76
77
78
79
80
81
        openRecordManagerAndBtree();

        try
        {
            // Create a new BTree which allows duplicate values
            btree = recordManager1.addBTree( "test", new LongSerializer(), new StringSerializer(), true );
        }
        catch ( Exception e )
        {
            throw new RuntimeException( e );
        }
View Full Code Here
66
67
68
69
70
71
72
73
74
75
76
        openRecordManagerAndBtree();

        try
        {
            // Create a new BTree
            btree = recordManager1.addBTree( "test", new LongSerializer(), new StringSerializer(), false );
        }
        catch ( Exception e )
        {
            throw new RuntimeException( e );
        }
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
        openRecordManagerAndBtree();

        try
        {
            // Create a new BTree
            btree = recordManager1.addBTree( "test", new LongSerializer(), new StringSerializer(), false );
        }
        catch ( Exception e )
        {
            throw new RuntimeException( e );
        }
View Full Code Here
828
829
830
831
832
833
834
835
836
837
838
        int pageSize = 16;
        int numKeys = 1;
        String name = "duplicateTree";
        String[] testValues = new String[]{ "00", "01", "02", "03", "04", "05", "06", "07", "08", "09", "0A", "0B", "0C", "0D", "0E", "0F", "10" };

        BTree<Long, String> dupsTree = new BTree<Long, String>( name, null, new LongSerializer(),
            new StringSerializer(), pageSize,
            true );

        recordManager1.manage( dupsTree );
       
View Full Code Here
62
63
64
65
66
67
68
        // Now, try to reload the file back
        recordManager = new RecordManager( dataDir.getAbsolutePath(), 32 );

        // Create a new BTree
        btree = recordManager.addBTree( "test", new LongSerializer(), new StringSerializer(), false );
    }
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
        openRecordManagerAndBtree();

        try
        {
            // Create a new BTree which allows duplicate values
            btree = recordManager.addBTree( "test", new LongSerializer(), new StringSerializer(), true );
        }
        catch ( Exception e )
        {
            throw new RuntimeException( e );
        }
View Full Code Here
309
310
311
312
313
314
315
316
317
318
319
        copiedPageBTree = new BTree<RevisionName, long[]>( COPIED_PAGE_BTREE_NAME, new RevisionNameSerializer(),
            new LongArraySerializer() );

        // and initialize the Revision BTree
        revisionBTree = new BTree<RevisionName, Long>( REVISION_BTREE_NAME, new RevisionNameSerializer(),
            new LongSerializer() );

        // Inject these BTrees into the RecordManager
        try
        {
            manage( copiedPageBTree );
View Full Code Here
68
69
70
71
72
73
74
75
76
77
78
        openRecordManagerAndBtree();

        try
        {
            // Create a new BTree
            btree = recordManager1.addBTree( "test", new LongSerializer(), new StringSerializer(), false );
        }
        catch ( Exception e )
        {
            throw new RuntimeException( e );
        }
View Full Code Here
174
175
176
177
178
179
180
181
182
183
184
        int nbTrees = 1000;
        int nbElems = 1000;

        for ( int j = 0; j < nbTrees; j++ )
        {
            BTree<Long, String> btree = new BTree<Long, String>( "test", new LongSerializer(), new StringSerializer() );
            btree.setPageSize( 32 );

            for ( int i = 0; i < nbElems; i++ )
            {
                Long key = ( long ) random.nextInt( 1024 );
View Full Code Here
274
275
276
277
278
279
280
281
282
283
284
        int nbTrees = 1000;
        int nbElems = 1000;

        for ( int j = 0; j < nbTrees; j++ )
        {
            BTree<Long, String> btree = new BTree<Long, String>( "test", new LongSerializer(), new StringSerializer() );
            btree.setPageSize( 8 );

            for ( int i = 0; i < nbElems; i++ )
            {
                Long key = ( long ) random.nextInt( 1024 );
View Full Code Here
TOP

Related Classes of org.apache.directory.mavibot.btree.serializer.LongSerializer

  • org.apache.directory.mavibot.btree.BTreeFlushTest
  • org.apache.directory.mavibot.btree.comparator.LongComparator
  • org.apache.directory.mavibot.btree.InMemoryBTreeDuplicateKeyTest
  • org.apache.directory.mavibot.btree.InMemoryBTreeFlushTest
  • org.apache.directory.mavibot.btree.InMemoryBTreeTest
  • org.apache.directory.mavibot.btree.InMemoryBTreeTestOps
  • org.apache.directory.mavibot.btree.InMemoryLeafTest
  • org.apache.directory.mavibot.btree.LeafTest
  • org.apache.directory.mavibot.btree.managed.BTreeDuplicateKeyTest
  • org.apache.directory.mavibot.btree.managed.ManagedBTreeBrowseTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.