public class TestIndexSegmentPlan extends AbstractBTreeTestCase
TestCase2.MyProperties, TestCase2.RandomType
keyBuilder, log, r
_randomType
Constructor and Description |
---|
TestIndexSegmentPlan() |
TestIndexSegmentPlan(String name) |
Modifier and Type | Method and Description |
---|---|
void |
test_distributeChildren01()
An application of the routine to distribute children among nodes - the
logic is identical to distributing keys among leaves except that the
result must be interpreted as the #of children NOT the #of keys.
|
void |
test_distributeKeys_m10() |
void |
test_distributeKeys_m3()
A series of tests for
IndexSegmentBuilder#distributeKeys(int m, int m/2, int nleaves, int nentries) . |
void |
test_distributeKeys_m4() |
void |
test_distributeKeys_m5() |
void |
test_distributeKeys_m6() |
void |
test_distributeKeys_m7() |
void |
test_distributeKeys_m8() |
void |
test_distributeKeys_m9() |
void |
test_distributeKeys_rootUnderCapacity()
Test where the root leaf has fewer than (m+1)/2 entries.
|
void |
test_minimumHeight()
Test
IndexSegmentBuilder#getMinimumHeight(int, int) . |
void |
test_plan_m10_n10_everythingInTheRootLeaf()
Tests
IndexSegmentPlan for a tree with a branching factor of
(m=10) and (n=10) entries (everything fits into the root leaf) |
void |
test_plan_m3_n0_emptyRootLeaf()
Tests
IndexSegmentPlan for a tree with a branching factor of
(m=3) and (n=0) entries. |
void |
test_plan_m3_n10()
Tests
IndexSegmentPlan for a tree with a branching factor of
(m=3) and (n=10) entries. |
void |
test_plan_m3_n20()
Tests
IndexSegmentPlan for a tree with a branching factor of
(m=3) and (n=20) entries. |
void |
test_plan_m4_n10()
Tests
IndexSegmentPlan for a tree with a branching factor of
(m=4) and (n=10) entries. |
void |
test_plan_m5_n10()
Tests
IndexSegmentPlan for a tree with a branching factor of
(m=5) and (n=10) entries. |
void |
test_plan_m6_n10()
Tests
IndexSegmentPlan for a tree with a branching factor of
(m=6) and (n=10) entries. |
void |
test_plan_m7_n10()
Tests
IndexSegmentPlan for a tree with a branching factor of
(m=7) and (n=10) entries. |
void |
test_plan_m8_n10()
Tests
IndexSegmentPlan for a tree with a branching factor of
(m=8) and (n=10) entries. |
void |
test_plan_m9_n10()
Tests
IndexSegmentPlan for a tree with a branching factor of
(m=9) and (n=10) entries. |
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
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
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, setUp, tearDown, toString
public TestIndexSegmentPlan()
public TestIndexSegmentPlan(String name)
name
- public void test_minimumHeight()
IndexSegmentBuilder#getMinimumHeight(int, int)
. This
routine is responsible for determining the minimum height of a tree given
a branching factor and a #of index entries.public void test_distributeKeys_m3()
IndexSegmentBuilder#distributeKeys(int m, int m/2, int nleaves, int nentries)
.
This routine is responsible for deciding how many index entries will go
into each leaf of the generated IndexSegment
. In particular, it
compensates when there would be an underflow in the last leaf unless we
short some of the earlier leaves so that all leaves have at least their
minimum capacity.src/architecture/btree.xls, which has the examples from which these
tests are derived.
public void test_distributeKeys_m4()
public void test_distributeKeys_m5()
public void test_distributeKeys_m6()
public void test_distributeKeys_m7()
public void test_distributeKeys_m8()
public void test_distributeKeys_m9()
public void test_distributeKeys_m10()
public void test_distributeKeys_rootUnderCapacity()
public void test_distributeChildren01()
IndexSegmentBuilder#distributeKeys(int, int, int, int)
,
IndexSegmentBuilder#distributeChildren(int, int, int, int)
public void test_plan_m3_n10()
IndexSegmentPlan
for a tree with a branching factor of
(m=3) and (n=10) entries.public void test_plan_m4_n10()
IndexSegmentPlan
for a tree with a branching factor of
(m=4) and (n=10) entries.public void test_plan_m5_n10()
IndexSegmentPlan
for a tree with a branching factor of
(m=5) and (n=10) entries.public void test_plan_m6_n10()
IndexSegmentPlan
for a tree with a branching factor of
(m=6) and (n=10) entries.public void test_plan_m7_n10()
IndexSegmentPlan
for a tree with a branching factor of
(m=7) and (n=10) entries.public void test_plan_m8_n10()
IndexSegmentPlan
for a tree with a branching factor of
(m=8) and (n=10) entries.public void test_plan_m9_n10()
IndexSegmentPlan
for a tree with a branching factor of
(m=9) and (n=10) entries.public void test_plan_m10_n10_everythingInTheRootLeaf()
IndexSegmentPlan
for a tree with a branching factor of
(m=10) and (n=10) entries (everything fits into the root leaf)public void test_plan_m3_n0_emptyRootLeaf()
IndexSegmentPlan
for a tree with a branching factor of
(m=3) and (n=0) entries.public void test_plan_m3_n20()
IndexSegmentPlan
for a tree with a branching factor of
(m=3) and (n=20) entries.Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.