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.IIteration; |
---|
8 | import de.ugoe.cs.quest.tasktrees.treeifc.ISelection; |
---|
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 NodeAndIterationComparisonRuleTest { |
---|
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 | NodeAndIterationComparisonRule rule = new NodeAndIterationComparisonRule(manager); |
---|
33 | |
---|
34 | ITaskTreeNode task1 = new TaskTreeNode("task1"); |
---|
35 | |
---|
36 | assertNull(rule.compare(task1, task1)); |
---|
37 | |
---|
38 | IIteration iteration1 = treeNodeFactory.createNewIteration(); |
---|
39 | assertNull(rule.compare(iteration1, iteration1)); |
---|
40 | assertNull(rule.compare(task1, iteration1)); |
---|
41 | assertNull(rule.compare(iteration1, task1)); |
---|
42 | |
---|
43 | treeBuilder.setChild(iteration1, task1); |
---|
44 | |
---|
45 | assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(iteration1, task1)); |
---|
46 | assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(task1, iteration1)); |
---|
47 | |
---|
48 | ISelection selection1 = treeNodeFactory.createNewSelection(); |
---|
49 | treeBuilder.addChild(selection1, task1); |
---|
50 | treeBuilder.setChild(iteration1, selection1); |
---|
51 | |
---|
52 | assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(iteration1, task1)); |
---|
53 | assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(task1, iteration1)); |
---|
54 | } |
---|
55 | |
---|
56 | } |
---|