public class TestTransientBTree extends AbstractBTreeTestCase
BTree
s (no backing store).TestCase2.MyProperties, TestCase2.RandomType
keyBuilder, log, r
_randomType
Constructor and Description |
---|
TestTransientBTree() |
TestTransientBTree(String name) |
Modifier and Type | Method and Description |
---|---|
void |
test_close()
Verifies that closing a transient
BTree is allowed and that
all data is discarded. |
void |
test_createTransient()
Test the ability to create a transient
BTree (one not backed by a
persistence store). |
void |
test_delete()
Test verifies that the nodes and leaves become weakly reachable once they
have been deleted.
|
void |
test_deletePersistent()
|
void |
test_eviction()
Test inserts a bunch of data into a transient
BTree and verifies
that eviction of dirty nodes and leaves does not result in errors arising
from an attempt to persist their state on the (non-existent) backing
store. |
void |
test_niceErrors()
Tests various methods that deal with persistence and makes sure that we
have reasonable error messages.
|
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 TestTransientBTree()
public TestTransientBTree(String name)
public void test_createTransient()
BTree
(one not backed by a
persistence store).public void test_close()
BTree
is allowed and that
all data is discarded.public void test_eviction()
BTree
and verifies
that eviction of dirty nodes and leaves does not result in errors arising
from an attempt to persist their state on the (non-existent) backing
store.public void test_delete()
The test builds up a modest amount of data in the BTree
using a
small branching factor to force a large #of nodes and leaves to be
created. A traversal is then performed of the nodes and leaves and all of
their references are placed into a weak value collection. It then removes
all entries in a key range, which should cause some leaves (and perhaps
some nodes) to become weakly reachable. Finally, it forces a large number
of object allocations in order to prompt a GC that will clear those weak
references. The weak reference collection is then scanned to verify that
its size has been decreased.
Note: This test is of necessity subject to the whims of the garbage collector. If it fails, try increasing some of the constants in the test and see if that will provoke a GC that will clear the references.
public void test_niceErrors()
public void test_deletePersistent()
Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.