com.bigdata.btree

Class TestIndexSegmentBuilderWithSmallTree

java.lang.Object

junit.framework.Assert

junit.framework.TestCase

junit.framework.TestCase2

com.bigdata.btree.AbstractBTreeTestCase

com.bigdata.btree.AbstractIndexSegmentTestCase

com.bigdata.btree.TestIndexSegmentBuilderWithSmallTree

All Implemented Interfaces:

junit.framework.Test

public class TestIndexSegmentBuilderWithSmallTree
extends AbstractIndexSegmentTestCase

Test suite based on a small btree with known keys and values.

See Also:

src/architecture/btree.xls, which has the detailed examples.

Nested Class Summary

Nested classes/interfaces inherited from class junit.framework.TestCase2

TestCase2.MyProperties, TestCase2.RandomType

Field Summary

Fields inherited from class com.bigdata.btree.AbstractBTreeTestCase

keyBuilder, log, r

Fields inherited from class junit.framework.TestCase2

_randomType

Constructor Summary

Constructors

Constructor and Description
TestIndexSegmentBuilderWithSmallTree()
TestIndexSegmentBuilderWithSmallTree(String name)

Method Summary

Methods

Modifier and Type	Method and Description
protected IndexSegmentCheckpoint	doBuildAndDiscardCache(BTree btree, int m)
BTree	getProblem1() Create, populate, and return a btree with a branching factor of (3) and ten sequential keys [1:10].
BTree	getProblem2() Create, populate, and return a btree with a branching factor of (3) and nine sequential keys [1:9].
BTree	getProblem3() Create, populate, and return a btree with a branching factor of (3) and 20 sequential keys [1:20].
void	setUp()
void	tearDown()
void	test_buildOrder10() This case results in a single root leaf filled to capacity.
void	test_buildOrder3() Test ability to build an index segment from a BTree.
void	test_buildOrder9() This case results in a root node and two leaves.
void	test_problem2_buildOrder3() This case results in a single root leaf filled to capacity.
void	test_problem3_buildOrder3() Note: This problem requires us to short a node in the level above the leaves so that the last node in that level does not underflow.

Methods inherited from class com.bigdata.btree.AbstractIndexSegmentTestCase

dumpIndexSegment, testForwardScan, testMultiBlockIterator, testReverseScan

Methods inherited from class com.bigdata.btree.AbstractBTreeTestCase

assertChildKeys, assertEntryCounts, assertKeys, assertKeys, assertKeys, assertSameAbstractNodeData, assertSameBTree, assertSameEntryIterator, assertSameEntryIterator, assertSameIterator, assertSameIterator, assertSameLeaf, assertSameLeafData, assertSameNode, assertSameNodeData, assertSameNodeOrLeaf, assertSameRaba, assertValues, assertValues, doEntryIteratorTest, doInsertKeySequenceTest, doInsertLookupRemoveStressTest, doInsertRandomKeySequenceTest, doInsertRandomKeySequenceTest, doInsertRandomSparseKeySequenceTest, doKnownKeySequenceTest, doRandomIndexOfTest, doRandomKeyInsertTest, doRandomLookupTest, doRemoveStructureStressTest, doSplitTest, doSplitWithDecreasingKeySequence, doSplitWithIncreasingKeySequence, doSplitWithRandomDenseKeySequence, getBTree, getBTree, getKeysAndValues, getRandomKeys, getRandomKeyValues, i2k, nextLong, useRawRecords

Methods inherited from class junit.framework.TestCase2

assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEqualsWithinUlps, assertSameArray, assertSameArray, assertSameBigDecimal, assertSameBigDecimal, assertSameBigInteger, assertSameBigInteger, assertSameIterator, assertSameIterator, assertSameIteratorAnyOrder, assertSameIteratorAnyOrder, assertSameValue, assertSameValue, assertZeroUlps, assertZeroUlps, fail, getInnerCause, getNormalInt, getProjectBuildPath, getProperties, getRandomObject, getRandomObject, getRandomOrder, getRandomString, getTestInputStream, getTestResource, getTestResource, getUlps, getUlps, isDEBUG, isDEBUG, isINFO, isINFO, isInnerCause, logProperties

Methods inherited from class junit.framework.TestCase

assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertFalse, assertFalse, assertNotNull, assertNotNull, assertNotSame, assertNotSame, assertNull, assertNull, assertSame, assertSame, assertTrue, assertTrue, countTestCases, createResult, fail, fail, failNotEquals, failNotSame, failSame, format, getName, run, run, runBare, runTest, setName, toString

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

TestIndexSegmentBuilderWithSmallTree

public TestIndexSegmentBuilderWithSmallTree()

TestIndexSegmentBuilderWithSmallTree

public TestIndexSegmentBuilderWithSmallTree(String name)

Method Detail

setUp

public void setUp()
           throws Exception

Overrides:

setUp in class junit.framework.TestCase

Throws:

Exception

tearDown

public void tearDown()
              throws Exception

Overrides:

tearDown in class junit.framework.TestCase

Throws:

Exception

getProblem1

public BTree getProblem1()

Create, populate, and return a btree with a branching factor of (3) and ten sequential keys [1:10]. The values are SimpleEntry objects whose state is the same as the corresponding key.

Returns:

The btree.

See Also:

src/architecture/btree.xls, which details this input tree and a series of output trees with various branching factors.

test_buildOrder3

public void test_buildOrder3()
                      throws Exception

Test ability to build an index segment from a BTree.

Throws:

Exception

test_buildOrder9

public void test_buildOrder9()
                      throws Exception

This case results in a root node and two leaves. Each leaf is at its minimum capacity (5). This tests an edge case for the algorithm that distributes the keys among the leaves when there would otherwise be an underflow in the last leaf.

Throws:

IOException

Exception

test_buildOrder10

public void test_buildOrder10()
                       throws Exception

This case results in a single root leaf filled to capacity.

Throws:

IOException

Exception

getProblem2

public BTree getProblem2()

Create, populate, and return a btree with a branching factor of (3) and nine sequential keys [1:9]. The values are SimpleEntry objects whose state is the same as the corresponding key.

Returns:

The btree.

See Also:

src/architecture/btree.xls, which details this input tree and a series of output trees with various branching factors.

test_problem2_buildOrder3

public void test_problem2_buildOrder3()
                               throws Exception

This case results in a single root leaf filled to capacity.

Throws:

IOException

Exception

getProblem3

public BTree getProblem3()

Create, populate, and return a btree with a branching factor of (3) and 20 sequential keys [1:20]. The resulting tree has a height of (3). The values are SimpleEntry objects whose state is the same as the corresponding key.

Returns:

The btree.

See Also:

src/architecture/btree.xls, which details this input tree and a series of output trees with various branching factors.

test_problem3_buildOrder3

public void test_problem3_buildOrder3()
                               throws Exception

Note: This problem requires us to short a node in the level above the leaves so that the last node in that level does not underflow.

Throws:

IOException

Exception

doBuildAndDiscardCache

protected IndexSegmentCheckpoint doBuildAndDiscardCache(BTree btree,
                                            int m)
                                                 throws IOException,
                                                        Exception

Throws:

IOException

Exception