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

Public Member Functions

void testA234Tree ()
 

Static Public Member Functions

static void main (String args[])
 

Detailed Description

Definition at line 9 of file A234TreeTest.java.

Member Function Documentation

◆ main()

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

Definition at line 44 of file A234TreeTest.java.

44 {
45 org.junit.runner.JUnitCore.main("aud.test.A234TreeTest");
46 }

◆ testA234Tree()

void aud.test.A234TreeTest.testA234Tree ( )

Definition at line 12 of file A234TreeTest.java.

12 {
13 String[] keys={"a","b","c","d","e","f","g","h","i"};
14 int n=keys.length;
15
16 for (int[] p : new Permutations(n)) {
17
18 A234Tree<String> tree=new A234Tree<String>(false);
19
20 for (int i : p) {
21 String k=tree.find(keys[i]);
22 assertEquals(k,null);
23 tree.insert(keys[i]);
24 k=tree.find(keys[i]);
25 assertTrue(k!=null);
26 assertTrue(k.compareTo(keys[i])==0);
27 tree.checkConsistency();
28 }
29
30 tree=new A234Tree<String>(true);
31
32 for (int i : p) {
33 String k=tree.find(keys[i]);
34 assertEquals(k,null);
35 tree.insert(keys[i]);
36 k=tree.find(keys[i]);
37 assertTrue(k!=null);
38 assertTrue(k.compareTo(keys[i])==0);
39 tree.checkConsistency();
40 }
41 }
42 }

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