5253545556575859606162
int total = 10; for ( int i = 0; i < total; i++ ) { testTree.put( Long.valueOf("" + i), Long.valueOf("" + i) ); } recman.commit(); Iterator fi = testTree.values(); Object item; int count = 0; while(fi.hasNext()) {
7374757677787980818283
// insert & check values for (int i=0; i<max; i++) { dir.put("key"+i, "value"+i); hash.put("key"+i, "value"+i); } recman.commit(); for (int i=0; i<max; i++) { String s = (String)dir.get("key"+i); assertEquals("value"+i, s); }
7980818283848586878889
for (int i=0; i<max; i++) { String s = (String)dir.get("key"+i); assertEquals("value"+i, s); } recman.commit(); // replace only even values for (int i=0; i<max; i+=2) { dir.put("key"+i, "value"+(i*2+1)); hash.put("key"+i, "value"+(i*2+1));
8687888990919293949596
// replace only even values for (int i=0; i<max; i+=2) { dir.put("key"+i, "value"+(i*2+1)); hash.put("key"+i, "value"+(i*2+1)); } recman.commit(); for (int i=0; i<max; i++) { if ((i%2) == 1) { // odd String s = (String)dir.get("key"+i);
5657585960616263646566
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 " + _numberOfObjects +" objects." );
99100101102103104105106107108109
// even String s = (String)dir.get("key"+i); assertEquals("value"+(i*2+1), s); } } recman.commit(); // remove odd numbers for (int i=1; i<max; i+=2) { dir.remove("key"+i); hash.remove("key"+i);
106107108109110111112113114115116
// remove odd numbers for (int i=1; i<max; i+=2) { dir.remove("key"+i); hash.remove("key"+i); } recman.commit(); for (int i=0; i<max; i++) { if ((i%2) == 1) { // odd String s = (String)dir.get("key"+i);
119120121122123124125126127128129
// even String s = (String)dir.get("key"+i); assertEquals("value"+(i*2+1), s); } } recman.commit(); recman.close(); recman = null; }
562563564565566567568569570571572
// put enough data into the tree so we definitely have multiple pages for (int count = 0; count < 1000; count++){ tree.insert(keys[count],new Integer(count),false); if (count % 100 == 0) recman.commit(); } recman.commit(); long currentRecmanSize = new File(recordManagerDBname).length(); assertTrue("file size too small "+ currentRecmanSize, currentRecmanSize > 0);
564565566567568569570571572573574
for (int count = 0; count < 1000; count++){ tree.insert(keys[count],new Integer(count),false); if (count % 100 == 0) recman.commit(); } recman.commit(); long currentRecmanSize = new File(recordManagerDBname).length(); assertTrue("file size too small "+ currentRecmanSize, currentRecmanSize > 0);