AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
A234TreeTest.java
Go to the documentation of this file.
1package aud.test;
2
3import aud.A234Tree;
5
6import org.junit.*;
7import static org.junit.Assert.*;
8
9public class A234TreeTest {
10
11 @Test
12 public void testA234Tree() {
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 }
43
44 public static void main(String args[]) {
45 org.junit.runner.JUnitCore.main("aud.test.A234TreeTest");
46 }
47}
static void main(String args[])
Generate permutations.
utilities (not related to AuD lecture)
Definition: Colormap.java:1
AuD lecture: Data structures, algorithms, examples.
Definition: A234Tree.java:1