/** Create a B+Tree by BlockSize */ public static RangeIndex createBPTreeByBlockSize(FileSet fileset, int blockSize, int readCacheSize, int writeCacheSize, RecordFactory factory) { return createBPTree(fileset, -1, blockSize, readCacheSize, writeCacheSize, factory) ; }
public static Index makeIndex(Location location, String indexName, int blkSize, int dftKeyLength, int dftValueLength, int readCacheSize,int writeCacheSize) { return makeRangeIndex(location, indexName, blkSize, dftKeyLength, dftValueLength, readCacheSize, writeCacheSize) ; }
@Override public Index buildIndex(FileSet fileSet, RecordFactory recordfactory, IndexParams indexParams) { return other.buildRangeIndex(fileSet, recordfactory, indexParams) ; } } ;
@Test public void tree_ins_0_0() { // Empty tree int[] keys = {} ; rIndex = makeRangeIndex(2) ; testInsert(rIndex, keys) ; assertTrue(rIndex.isEmpty()) ; assertNull(rIndex.minKey()) ; assertNull(rIndex.maxKey()) ; }
void testClear(int N) { int[] keys = new int[N] ; // Slice is 1000. for ( int i = 0 ; i < keys.length ; i++ ) keys[i] = i ; rIndex = makeRangeIndex(3) ; add(rIndex, keys) ; if ( N > 0 ) assertFalse(rIndex.isEmpty()) ; rIndex.clear() ; assertTrue(rIndex.isEmpty()) ; } }
private Index test(int[] insKeys, int[] delKeys, int[] expected) { index = makeIndex(4,0) ; testInsert(index, insKeys) ; long x = index.size() ; if ( x >= 0 ) assertEquals(insKeys.length, x) ; if ( delKeys != null ) { testDelete(index, delKeys) ; } if ( expected != null ) testIndexContents(index, expected) ; return index ; }
public static Index testInsert(IndexMaker maker, int[] keys) { Index index = maker.makeIndex() ; testInsert(index, keys); return index ; }
public static void testInsert(Index index, int[] keys) { IndexTestLib.add(index, keys) ; testIndexContents(index, keys); }
/** Create a B+Tree by BlockSize */ public static RangeIndex createBPTreeByBlockSize(FileSet fileset, int blockSize, int readCacheSize, int writeCacheSize, RecordFactory factory) { return SetupIndex.createBPTreeByBlockSize(fileset, blockSize, readCacheSize, writeCacheSize, factory) ; }
@Override public long size() { return index.size(); } }
@Override public Index buildIndex(FileSet fileSet, RecordFactory recordFactory, IndexParams indexParams) { // Cheap. return other.buildRangeIndex(fileSet, recordFactory, indexParams) ; } }
public static Index makeIndex(Location location, String indexName, int blkSize, int dftKeyLength, int dftValueLength, int readCacheSize,int writeCacheSize) { return SetupIndex.makeIndex(location, indexName, blkSize, dftKeyLength, dftValueLength, readCacheSize, writeCacheSize) ; }
private Index test(int[] keys) { return test(keys, null, keys) ; } }
@Test public void tree_ins_0_0() { // Empty tree int[] keys = {} ; rIndex = makeRangeIndex(2) ; testInsert(rIndex, keys) ; assertTrue(rIndex.isEmpty()) ; assertNull(rIndex.minKey()) ; assertNull(rIndex.maxKey()) ; }
void testClear(int N) { int[] keys = new int[N] ; // Slice is 1000. for ( int i = 0 ; i < keys.length ; i++ ) keys[i] = i ; rIndex = makeRangeIndex(3) ; add(rIndex, keys) ; if ( N > 0 ) assertFalse(rIndex.isEmpty()) ; rIndex.clear() ; assertTrue(rIndex.isEmpty()) ; } }
public static Index testInsert(IndexMaker maker, int[] keys) { Index index = maker.makeIndex() ; testInsert(index, keys); return index ; }
/** Knowing all the parameters, create a B+Tree */ public static BPlusTree createBPTree(FileSet fileset, int order, int blockSize, int readCacheSize, int writeCacheSize, RecordFactory factory) { return SetupIndex.createBPTree(fileset, order, blockSize, readCacheSize, writeCacheSize, factory) ; } }
public static RangeIndex makeRangeIndex(Location location, String indexName, int blkSize, int dftKeyLength, int dftValueLength, int readCacheSize,int writeCacheSize) { return SetupIndex.makeRangeIndex(location, indexName, blkSize, dftKeyLength, dftValueLength, readCacheSize, writeCacheSize) ; }