1 | package de.ugoe.cs.quest.tasktrees.nodeequality; |
---|
2 | |
---|
3 | import static org.junit.Assert.*; |
---|
4 | |
---|
5 | import org.junit.Test; |
---|
6 | |
---|
7 | import de.ugoe.cs.quest.tasktrees.treeifc.ISelection; |
---|
8 | import de.ugoe.cs.quest.tasktrees.treeifc.ISequence; |
---|
9 | import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeBuilder; |
---|
10 | import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode; |
---|
11 | import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNodeFactory; |
---|
12 | import de.ugoe.cs.quest.tasktrees.treeimpl.TaskTreeBuilder; |
---|
13 | import de.ugoe.cs.quest.tasktrees.treeimpl.TaskTreeNodeFactory; |
---|
14 | import de.ugoe.cs.quest.tasktrees.treeimpl.TaskTreeNode; |
---|
15 | |
---|
16 | /** |
---|
17 | * @author Patrick Harms |
---|
18 | */ |
---|
19 | public class SequenceComparisonRuleTest { |
---|
20 | |
---|
21 | /** |
---|
22 | * |
---|
23 | */ |
---|
24 | @Test |
---|
25 | public void test() { |
---|
26 | NodeEqualityRuleManager manager = new NodeEqualityRuleManager(); |
---|
27 | manager.init(); |
---|
28 | |
---|
29 | ITaskTreeNodeFactory treeNodeFactory = new TaskTreeNodeFactory(); |
---|
30 | ITaskTreeBuilder treeBuilder = new TaskTreeBuilder(); |
---|
31 | |
---|
32 | SequenceComparisonRule rule = new SequenceComparisonRule(manager); |
---|
33 | |
---|
34 | ITaskTreeNode task1 = new TaskTreeNode("task1"); |
---|
35 | ITaskTreeNode task2 = new TaskTreeNode("task2"); |
---|
36 | |
---|
37 | assertNull(rule.compare(task1, task2)); |
---|
38 | |
---|
39 | ISequence sequence1 = treeNodeFactory.createNewSequence(); |
---|
40 | assertEquals(NodeEquality.IDENTICAL, rule.compare(sequence1, sequence1)); |
---|
41 | |
---|
42 | ISequence sequence2 = treeNodeFactory.createNewSequence(); |
---|
43 | |
---|
44 | assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(sequence1, sequence2)); |
---|
45 | assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(sequence2, sequence1)); |
---|
46 | |
---|
47 | treeBuilder.addChild(sequence1, task1); |
---|
48 | |
---|
49 | assertEquals(NodeEquality.UNEQUAL, rule.compare(sequence1, sequence2)); |
---|
50 | assertEquals(NodeEquality.UNEQUAL, rule.compare(sequence2, sequence1)); |
---|
51 | |
---|
52 | treeBuilder.addChild(sequence2, task1); |
---|
53 | |
---|
54 | assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(sequence1, sequence2)); |
---|
55 | assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(sequence2, sequence1)); |
---|
56 | |
---|
57 | treeBuilder.addChild(sequence1, task2); |
---|
58 | |
---|
59 | assertEquals(NodeEquality.UNEQUAL, rule.compare(sequence1, sequence2)); |
---|
60 | assertEquals(NodeEquality.UNEQUAL, rule.compare(sequence2, sequence1)); |
---|
61 | |
---|
62 | treeBuilder.addChild(sequence2, task2); |
---|
63 | |
---|
64 | assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(sequence1, sequence2)); |
---|
65 | assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(sequence2, sequence1)); |
---|
66 | |
---|
67 | ISequence sequence3 = treeNodeFactory.createNewSequence(); |
---|
68 | treeBuilder.addChild(sequence3, task2); |
---|
69 | treeBuilder.addChild(sequence3, task1); |
---|
70 | |
---|
71 | assertEquals(NodeEquality.UNEQUAL, rule.compare(sequence1, sequence3)); |
---|
72 | assertEquals(NodeEquality.UNEQUAL, rule.compare(sequence3, sequence1)); |
---|
73 | assertEquals(NodeEquality.UNEQUAL, rule.compare(sequence2, sequence3)); |
---|
74 | assertEquals(NodeEquality.UNEQUAL, rule.compare(sequence3, sequence2)); |
---|
75 | |
---|
76 | ISelection selection = treeNodeFactory.createNewSelection(); |
---|
77 | assertNull(rule.compare(sequence1, selection)); |
---|
78 | assertNull(rule.compare(selection, sequence1)); |
---|
79 | assertNull(rule.compare(sequence2, selection)); |
---|
80 | assertNull(rule.compare(selection, sequence2)); |
---|
81 | assertNull(rule.compare(sequence3, selection)); |
---|
82 | assertNull(rule.compare(selection, sequence3)); |
---|
83 | } |
---|
84 | |
---|
85 | } |
---|