1 | // Copyright 2012 Georg-August-Universität Göttingen, Germany |
---|
2 | // |
---|
3 | // Licensed under the Apache License, Version 2.0 (the "License"); |
---|
4 | // you may not use this file except in compliance with the License. |
---|
5 | // You may obtain a copy of the License at |
---|
6 | // |
---|
7 | // http://www.apache.org/licenses/LICENSE-2.0 |
---|
8 | // |
---|
9 | // Unless required by applicable law or agreed to in writing, software |
---|
10 | // distributed under the License is distributed on an "AS IS" BASIS, |
---|
11 | // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
---|
12 | // See the License for the specific language governing permissions and |
---|
13 | // limitations under the License. |
---|
14 | |
---|
15 | package de.ugoe.cs.autoquest.tasktrees.nodeequality; |
---|
16 | |
---|
17 | import static org.junit.Assert.*; |
---|
18 | |
---|
19 | import org.junit.Test; |
---|
20 | |
---|
21 | import de.ugoe.cs.autoquest.tasktrees.nodeequality.NodeEquality; |
---|
22 | import de.ugoe.cs.autoquest.tasktrees.nodeequality.NodeEqualityRuleManager; |
---|
23 | import de.ugoe.cs.autoquest.tasktrees.nodeequality.SequenceComparisonRule; |
---|
24 | import de.ugoe.cs.autoquest.tasktrees.treeifc.ISelection; |
---|
25 | import de.ugoe.cs.autoquest.tasktrees.treeifc.ISequence; |
---|
26 | import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskTreeBuilder; |
---|
27 | import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskTreeNode; |
---|
28 | import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskTreeNodeFactory; |
---|
29 | import de.ugoe.cs.autoquest.tasktrees.treeimpl.TaskTreeBuilder; |
---|
30 | import de.ugoe.cs.autoquest.tasktrees.treeimpl.TaskTreeNode; |
---|
31 | import de.ugoe.cs.autoquest.tasktrees.treeimpl.TaskTreeNodeFactory; |
---|
32 | |
---|
33 | /** |
---|
34 | * @author Patrick Harms |
---|
35 | */ |
---|
36 | public class SequenceComparisonRuleTest { |
---|
37 | |
---|
38 | /** |
---|
39 | * |
---|
40 | */ |
---|
41 | @Test |
---|
42 | public void test() { |
---|
43 | NodeEqualityRuleManager manager = new NodeEqualityRuleManager(); |
---|
44 | manager.init(); |
---|
45 | |
---|
46 | ITaskTreeNodeFactory treeNodeFactory = new TaskTreeNodeFactory(); |
---|
47 | ITaskTreeBuilder treeBuilder = new TaskTreeBuilder(); |
---|
48 | |
---|
49 | SequenceComparisonRule rule = new SequenceComparisonRule(manager); |
---|
50 | |
---|
51 | ITaskTreeNode task1 = new TaskTreeNode("task1"); |
---|
52 | ITaskTreeNode task2 = new TaskTreeNode("task2"); |
---|
53 | |
---|
54 | assertFalse(rule.isApplicable(task1, task2)); |
---|
55 | |
---|
56 | ISequence sequence1 = treeNodeFactory.createNewSequence(); |
---|
57 | assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(sequence1, sequence1)); |
---|
58 | |
---|
59 | ISequence sequence2 = treeNodeFactory.createNewSequence(); |
---|
60 | |
---|
61 | assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(sequence1, sequence2)); |
---|
62 | assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(sequence2, sequence1)); |
---|
63 | |
---|
64 | treeBuilder.addChild(sequence1, task1); |
---|
65 | |
---|
66 | assertEquals(NodeEquality.UNEQUAL, rule.compare(sequence1, sequence2)); |
---|
67 | assertEquals(NodeEquality.UNEQUAL, rule.compare(sequence2, sequence1)); |
---|
68 | |
---|
69 | treeBuilder.addChild(sequence2, task1); |
---|
70 | |
---|
71 | assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(sequence1, sequence2)); |
---|
72 | assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(sequence2, sequence1)); |
---|
73 | |
---|
74 | treeBuilder.addChild(sequence1, task2); |
---|
75 | |
---|
76 | assertEquals(NodeEquality.UNEQUAL, rule.compare(sequence1, sequence2)); |
---|
77 | assertEquals(NodeEquality.UNEQUAL, rule.compare(sequence2, sequence1)); |
---|
78 | |
---|
79 | treeBuilder.addChild(sequence2, task2); |
---|
80 | |
---|
81 | assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(sequence1, sequence2)); |
---|
82 | assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(sequence2, sequence1)); |
---|
83 | |
---|
84 | ISequence sequence3 = treeNodeFactory.createNewSequence(); |
---|
85 | treeBuilder.addChild(sequence3, task2); |
---|
86 | treeBuilder.addChild(sequence3, task1); |
---|
87 | |
---|
88 | assertEquals(NodeEquality.UNEQUAL, rule.compare(sequence1, sequence3)); |
---|
89 | assertEquals(NodeEquality.UNEQUAL, rule.compare(sequence3, sequence1)); |
---|
90 | assertEquals(NodeEquality.UNEQUAL, rule.compare(sequence2, sequence3)); |
---|
91 | assertEquals(NodeEquality.UNEQUAL, rule.compare(sequence3, sequence2)); |
---|
92 | |
---|
93 | ISelection selection = treeNodeFactory.createNewSelection(); |
---|
94 | assertFalse(rule.isApplicable(sequence1, selection)); |
---|
95 | assertFalse(rule.isApplicable(selection, sequence1)); |
---|
96 | assertFalse(rule.isApplicable(sequence2, selection)); |
---|
97 | assertFalse(rule.isApplicable(selection, sequence2)); |
---|
98 | assertFalse(rule.isApplicable(sequence3, selection)); |
---|
99 | assertFalse(rule.isApplicable(selection, sequence3)); |
---|
100 | } |
---|
101 | |
---|
102 | } |
---|