| drjava.smyle.tests.BTreeTestBase
All known Subclasses: drjava.smyle.tests.PersistentBTreeTest, drjava.smyle.tests.MemoryBTreeTest,
BTreeTestBase | abstract public class BTreeTestBase extends TestCase (Code) | | |
Method Summary | |
protected void | additionalChecks() | static void | assertNodeContents(BTree<A,B> tree, BTree<A,B>.Node node, Iterator<Map.Entry<A,B>> iterator) | void | assertTreeContents(TreeMap<String, String> map) | public static void | assertTreeContents(BTree<A, B> tree, TreeMap<A, B> map) | void | checkGet() | void | checkIterate() | void | checkIterateKeySet(String s, String value) | abstract protected BTree<String, String> | createTree() | static void | nodeToMap(BTree<A, B>.Node node, Map<A, B> map) | static void | printSubTree(StringBuffer buf, BTree<A, B>.Node node) | static void | printTree(BTree<A, B> tree) | void | put(String key, String value) | void | remove(String key) | public void | setUp() | public void | testClear() | public void | testDelegationBug() | public void | testEmptyTree() | public void | testIterateKeySet() | public void | testLinearInserts() | public void | testRandomInserts() | public void | testRandomInsertsM4() | public void | testReplaceValue() | public void | testReverseInserts() | public static Map<A, B> | treeToMap(BTree<A, B> tree) | public static Map<A, B> | treeToMap(BTree<A, B> tree, Comparator<A> comparator) |
nsmallN | final int nsmallN(Code) | | |
nodeToMap | static void nodeToMap(BTree<A, B>.Node node, Map<A, B> map)(Code) | | |
testRandomInsertsM4 | public void testRandomInsertsM4() throws Exception(Code) | | |
|
|