AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
aud.test.BTreeTest Class Reference

Public Member Functions

void testBTree ()
 

Static Public Member Functions

static void main (String args[])
 

Detailed Description

Definition at line 9 of file BTreeTest.java.

Member Function Documentation

◆ main()

static void aud.test.BTreeTest.main ( String  args[])
static

Definition at line 34 of file BTreeTest.java.

34 {
35 org.junit.runner.JUnitCore.main("aud.test.BTreeTest");
36 }

◆ testBTree()

void aud.test.BTreeTest.testBTree ( )

Definition at line 12 of file BTreeTest.java.

12 {
13 String[] keys={"a","b","c","d","e","f","g","h","i"};
14 int n=keys.length;
15
16 for (int m=1;m<3;++m) {
17 for (int[] p : new Permutations(n)) {
18
19 BTree<String> tree=new BTree<String>(m);
20
21 for (int i : p) {
22 String k=tree.find(keys[i]);
23 assertEquals(k,null);
24 tree.insert(keys[i]);
25 k=tree.find(keys[i]);
26 assertTrue(k!=null);
27 assertTrue(k.compareTo(keys[i])==0);
28 tree.checkConsistency();
29 }
30 }
31 }
32 }

The documentation for this class was generated from the following file: