Package jdbm.btree

Examples of jdbm.btree.BTree$EmptyBrowser

890
891
892
893
894
895
896
897
898
899
900
        byte[] serialized = ( byte[] ) raw;

        if ( BTreeRedirectMarshaller.isRedirect( serialized ) )
        {
            BTree tree = getBTree( BTreeRedirectMarshaller.INSTANCE.deserialize( serialized ) );
            return new KeyTupleBTreeCursor<K, V>( tree, key, valueComparator );
        }

        ArrayTree<V> set = marshaller.deserialize( serialized );
View Full Code Here
924
925
926
927
928
929
930
931
932
933
934
        byte[] serialized = ( byte[] ) raw;

        if ( BTreeRedirectMarshaller.isRedirect( serialized ) )
        {
            BTree tree = getBTree( BTreeRedirectMarshaller.INSTANCE.deserialize( serialized ) );
            return new KeyBTreeCursor<V>( tree, valueComparator );
        }

        return new ArrayTreeCursor<V>( marshaller.deserialize( serialized ) );
    }
View Full Code Here
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
    {

        RecordManager  recman;

        BTree          btree;

        int            iterations;



        iterations = 100; // 23 works :-(((((



        // open database

        recman = RecordManagerFactory.createRecordManager( TestRecordFile.testFileName );



        // create a new B+Tree data structure

        btree = BTree.createInstance( recman, new StringComparator() );

        recman.setNamedObject( "testbtree", btree.getRecid() );



        // action:



        // insert data

        for( int count = 0; count < iterations; count++ ) {

            btree.insert( "num" + count, new Integer( count ), true );

        }



        // delete data

        for( int count = 0; count < iterations; count++ ) {

            btree.remove( "num" + count );

        }


View Full Code Here
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
    public void insert()
        throws IOException
    {

        BTree    btree;
        RecordManager  recman;
        long           start, finish;
        Properties     props;
       
        props = new Properties();
        recman = RecordManagerFactory.createRecordManager( "TestInsertPref-" + System.currentTimeMillis(),
                                                           props);
        btree = BTree.createInstance( recman, new LongComparator() );
       
        // Note:  One can use specialized serializers for better performance / database size
        // btree = BTree.createInstance( recman, new LongComparator(),
        //                               LongSerializer.INSTANCE, IntegerSerializer.INSTANCE );

        start = System.currentTimeMillis();
        for (int i = 0; i < _numberOfObjects; i++) {
            btree.insert( new Long( i ), new Integer( i ), false );
        }
        recman.commit();
        finish = System.currentTimeMillis();
       
        System.out.println( "It took " + (finish - start) + " ms to insert "
View Full Code Here
132
133
134
135
136
137
138
139
140
141
142
                ArrayTree<V> set = values.getArrayTree();
                dupsCursor = new ArrayTreeCursor<V>( set );
            }
            else
            {
                BTree tree = table.getBTree( values.getBTreeRedirect() );
                dupsCursor = new KeyBTreeCursor<V>( tree, table.getValueComparator() );
            }

            if ( value == null )
            {
View Full Code Here
207
208
209
210
211
212
213
214
215
216
217
                ArrayTree<V> set = values.getArrayTree();
                dupsCursor = new ArrayTreeCursor<V>( set );
            }
            else
            {
                BTree tree = table.getBTree( values.getBTreeRedirect() );
                dupsCursor = new KeyBTreeCursor<V>( tree, table.getValueComparator() );
            }

            if ( value == null )
            {
View Full Code Here
297
298
299
300
301
302
303
304
305
306
307
            {
                dupsCursor = new ArrayTreeCursor<V>( values.getArrayTree() );
            }
            else
            {
                BTree bt = table.getBTree( values.getBTreeRedirect() );
                dupsCursor = new KeyBTreeCursor<V>( bt, table.getValueComparator() );
            }

            /*
             * Since only tables with duplicate keys enabled use this
View Full Code Here
339
340
341
342
343
344
345
346
347
348
349
                ArrayTree<V> set = values.getArrayTree();
                dupsCursor = new ArrayTreeCursor<V>( set );
            }
            else
            {
                BTree tree = table.getBTree( values.getBTreeRedirect() );
                dupsCursor = new KeyBTreeCursor<V>( tree, table.getValueComparator() );
            }

            /*
             * Since only tables with duplicate keys enabled use this
View Full Code Here
402
403
404
405
406
407
408
409
410
411
412
                    ArrayTree<V> set = values.getArrayTree();
                    dupsCursor = new ArrayTreeCursor<V>( set );
                }
                else
                {
                    BTree tree = table.getBTree( values.getBTreeRedirect() );
                    dupsCursor = new KeyBTreeCursor<V>( tree, table.getValueComparator() );
                }

                /*
                 * Since only tables with duplicate keys enabled use this
View Full Code Here
462
463
464
465
466
467
468
469
470
471
472
                    ArrayTree<V> set = values.getArrayTree();
                    dupsCursor = new ArrayTreeCursor<V>( set );
                }
                else
                {
                    BTree tree = table.getBTree( values.getBTreeRedirect() );
                    dupsCursor = new KeyBTreeCursor<V>( tree, table.getValueComparator() );
                }

                /*
                 * Since only tables with duplicate keys enabled use this
View Full Code Here
TOP

Related Classes of jdbm.btree.BTree$EmptyBrowser

  • FamousPeople
  • jdbm.btree.StreamCorrupted
  • jdbm.btree.TestInsertPerf
  • jdbm.helper.Tuple
  • jdbm.helper.TupleBrowser
  • jdbm.htree.TestRollback
  • org.activemq.store.jdbm.JdbmPersistenceAdapter
  • org.apache.directory.server.core.partition.impl.btree.jdbm.DupsCursor
  • org.apache.directory.server.core.partition.impl.btree.jdbm.JdbmTable
  • org.apache.directory.server.core.partition.impl.btree.jdbm.KeyTupleBTreeCursorTest
    • 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.