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

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

168
169
170
171
172
173
174
175
176
177
178
        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
268
269
270
271
272
273
274
275
276
277
278
        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
381
382
383
384
385
386
387
388
389
390
391
                69, 955, 344, 325, 896, 423, 855, 783, 225, 447,
                28, 23, 262, 679, 782, 517, 412, 878, 641, 940,
                368, 245, 1005, 226, 939, 320, 396, 437, 373, 61
        };

        BTree<Long, String> btree = new BTree<Long, String>( "test", new LongSerializer(), new StringSerializer() );
        btree.setPageSize( 8 );

        for ( long value : values )
        {
            String strValue = "V" + value;
View Full Code Here
438
439
440
441
442
443
444
445
446
447
448
        Set<Long> expected = new HashSet<Long>();
        List<Long> added = new ArrayList<Long>();

        Random random = new Random( System.nanoTime() );

        BTree<Long, String> btree = new BTree<Long, String>( "test", new LongSerializer(), new StringSerializer() );
        btree.setPageSize( 8 );

        // Insert some values
        for ( int i = 0; i < 8; i++ )
        {
View Full Code Here
494
495
496
497
498
499
500
501
502
503
504
     */
    @Test
    @Ignore
    public void testPageInsertDebug() throws Exception
    {
        BTree<Long, String> btree = new BTree<Long, String>( "test", new LongSerializer(), new StringSerializer() );
        btree.setPageSize( 4 );

        Long[] elems = new Long[]
            {
                235L, 135L, 247L, 181L, 12L, 112L, 117L, 253L,
View Full Code Here
600
601
602
603
604
605
606
607
608
609
610
     */
    @Test
    public void testBrowseForward() throws Exception
    {
        // Create a BTree with pages containing 8 elements
        BTree<Integer, String> btree = new BTree<Integer, String>( "test", new IntSerializer(), new StringSerializer() );
        btree.setPageSize( 8 );

        // Inject the values
        for ( int value : sortedValues )
        {
View Full Code Here
684
685
686
687
688
689
690
691
692
693
694
     */
    @Test
    public void testBrowseBackward() throws Exception
    {
        // Create a BTree with pages containing 8 elements
        BTree<Integer, String> btree = new BTree<Integer, String>( "test", new IntSerializer(), new StringSerializer() );
        btree.setPageSize( 8 );

        // Inject the values
        for ( int value : sortedValues )
        {
View Full Code Here
759
760
761
762
763
764
765
766
767
768
769
     */
    @Test
    public void testBrowseEmptyTree() throws Exception
    {
        // Create a BTree with pages containing 8 elements
        BTree<Integer, String> btree = new BTree<Integer, String>( "test", new IntSerializer(), new StringSerializer() );
        btree.setPageSize( 8 );

        TupleCursor<Integer, String> cursor = btree.browse();

        assertFalse( cursor.hasNext() );
View Full Code Here
779
780
781
782
783
784
785
786
787
788
789
     */
    @Test
    public void testBrowseForwardBackward() throws Exception
    {
        // Create a BTree with pages containing 4 elements
        BTree<Integer, String> btree = new BTree<Integer, String>( "test", new IntSerializer(), new StringSerializer() );
        btree.setPageSize( 4 );

        for ( int i = 0; i < 16; i++ )
        {
            String strValue = "V" + i;
View Full Code Here
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
     */
    @Test
    public void testBrowseNonExistingKey() throws Exception
    {
        // Create a BTree with pages containing 8 elements
        BTree<Integer, String> btree = new BTree<Integer, String>( "test", new IntSerializer(), new StringSerializer() );
        btree.setPageSize( 8 );
        for ( int i = 0; i < 11; i++ )
        {
            btree.insert( i, String.valueOf( i ) );
        }
View Full Code Here
TOP

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

  • org.apache.directory.mavibot.btree.BTreeConfigurationTest
  • org.apache.directory.mavibot.btree.BTreeDuplicateKeyTest
  • org.apache.directory.mavibot.btree.BTreeFlushTest
  • org.apache.directory.mavibot.btree.comparator.StringComparator
  • org.apache.directory.mavibot.btree.InMemoryBTreeConfigurationTest
  • 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
    • 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.