Changeset 1146 for trunk/autoquest-core-tasktrees-test/src/test/java/de/ugoe/cs/autoquest/tasktrees/taskequality/IterationComparisonRuleTest.java
- Timestamp:
- 04/04/13 16:06:07 (11 years ago)
- Location:
- trunk/autoquest-core-tasktrees-test/src/test/java/de/ugoe/cs/autoquest/tasktrees/taskequality
- Files:
-
- 2 copied
Legend:
- Unmodified
- Added
- Removed
-
trunk/autoquest-core-tasktrees-test/src/test/java/de/ugoe/cs/autoquest/tasktrees/taskequality/IterationComparisonRuleTest.java
r1125 r1146 13 13 // limitations under the License. 14 14 15 package de.ugoe.cs.autoquest.tasktrees. nodeequality;15 package de.ugoe.cs.autoquest.tasktrees.taskequality; 16 16 17 17 import static org.junit.Assert.*; … … 19 19 import org.junit.Test; 20 20 21 import de.ugoe.cs.autoquest.tasktrees.nodeequality.IterationComparisonRule; 22 import de.ugoe.cs.autoquest.tasktrees.nodeequality.NodeEquality; 23 import de.ugoe.cs.autoquest.tasktrees.nodeequality.NodeEqualityRuleManager; 21 import de.ugoe.cs.autoquest.eventcore.IEventTarget; 22 import de.ugoe.cs.autoquest.eventcore.IEventType; 23 import de.ugoe.cs.autoquest.eventcore.StringEventType; 24 import de.ugoe.cs.autoquest.tasktrees.taskequality.IterationComparisonRule; 25 import de.ugoe.cs.autoquest.tasktrees.taskequality.TaskEquality; 26 import de.ugoe.cs.autoquest.tasktrees.taskequality.TaskEqualityRuleManager; 24 27 import de.ugoe.cs.autoquest.tasktrees.treeifc.IIteration; 25 28 import de.ugoe.cs.autoquest.tasktrees.treeifc.ISelection; 26 import de.ugoe.cs.autoquest.tasktrees.treeifc.ITask TreeBuilder;27 import de.ugoe.cs.autoquest.tasktrees.treeifc.ITask TreeNode;28 import de.ugoe.cs.autoquest.tasktrees.treeifc.ITask TreeNodeFactory;29 import de.ugoe.cs.autoquest.tasktrees.treeimpl.Task TreeBuilder;30 import de.ugoe.cs.autoquest.tasktrees.treeimpl.Task TreeNode;31 import de.ugoe.cs.autoquest.t asktrees.treeimpl.TaskTreeNodeFactory;29 import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskBuilder; 30 import de.ugoe.cs.autoquest.tasktrees.treeifc.ITask; 31 import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskFactory; 32 import de.ugoe.cs.autoquest.tasktrees.treeimpl.TaskBuilder; 33 import de.ugoe.cs.autoquest.tasktrees.treeimpl.TaskFactory; 34 import de.ugoe.cs.autoquest.test.DummyGUIElement; 32 35 33 36 /** … … 41 44 @Test 42 45 public void test() { 43 NodeEqualityRuleManager manager = new NodeEqualityRuleManager();46 TaskEqualityRuleManager manager = new TaskEqualityRuleManager(); 44 47 manager.init(); 45 48 46 ITask TreeNodeFactory treeNodeFactory = new TaskTreeNodeFactory();47 ITask TreeBuilder treeBuilder = new TaskTreeBuilder();49 ITaskFactory taskFactory = new TaskFactory(); 50 ITaskBuilder treeBuilder = new TaskBuilder(); 48 51 49 52 IterationComparisonRule rule = new IterationComparisonRule(manager); 50 53 51 ITaskTreeNode task1 = new TaskTreeNode("task1"); 52 ITaskTreeNode task2 = new TaskTreeNode("task2"); 54 IEventType eventType1 = new StringEventType("eventType1"); 55 IEventTarget eventTarget1 = new DummyGUIElement("elem1"); 56 57 IEventType eventType2 = new StringEventType("eventType2"); 58 IEventTarget eventTarget2 = new DummyGUIElement("elem2"); 59 60 ITask task1 = taskFactory.createNewEventTask(eventType1, eventTarget1); 61 ITask task2 = taskFactory.createNewEventTask(eventType2, eventTarget2); 53 62 54 63 assertFalse(rule.isApplicable(task1, task2)); 55 64 56 IIteration iteration1 = t reeNodeFactory.createNewIteration();57 assertEquals( NodeEquality.LEXICALLY_EQUAL, rule.compare(iteration1, iteration1));65 IIteration iteration1 = taskFactory.createNewIteration(); 66 assertEquals(TaskEquality.LEXICALLY_EQUAL, rule.compare(iteration1, iteration1)); 58 67 59 IIteration iteration2 = t reeNodeFactory.createNewIteration();68 IIteration iteration2 = taskFactory.createNewIteration(); 60 69 61 assertEquals( NodeEquality.LEXICALLY_EQUAL, rule.compare(iteration1, iteration2));62 assertEquals( NodeEquality.LEXICALLY_EQUAL, rule.compare(iteration2, iteration1));70 assertEquals(TaskEquality.LEXICALLY_EQUAL, rule.compare(iteration1, iteration2)); 71 assertEquals(TaskEquality.LEXICALLY_EQUAL, rule.compare(iteration2, iteration1)); 63 72 64 treeBuilder.set Child(iteration1, task1);73 treeBuilder.setMarkedTask(iteration1, task1); 65 74 66 assertEquals( NodeEquality.UNEQUAL, rule.compare(iteration1, iteration2));67 assertEquals( NodeEquality.UNEQUAL, rule.compare(iteration2, iteration1));75 assertEquals(TaskEquality.UNEQUAL, rule.compare(iteration1, iteration2)); 76 assertEquals(TaskEquality.UNEQUAL, rule.compare(iteration2, iteration1)); 68 77 69 treeBuilder.set Child(iteration2, task1);78 treeBuilder.setMarkedTask(iteration2, task1); 70 79 71 assertEquals( NodeEquality.LEXICALLY_EQUAL, rule.compare(iteration1, iteration2));72 assertEquals( NodeEquality.LEXICALLY_EQUAL, rule.compare(iteration2, iteration1));80 assertEquals(TaskEquality.LEXICALLY_EQUAL, rule.compare(iteration1, iteration2)); 81 assertEquals(TaskEquality.LEXICALLY_EQUAL, rule.compare(iteration2, iteration1)); 73 82 74 treeBuilder.set Child(iteration1, task2);83 treeBuilder.setMarkedTask(iteration1, task2); 75 84 76 assertEquals( NodeEquality.UNEQUAL, rule.compare(iteration1, iteration2));77 assertEquals( NodeEquality.UNEQUAL, rule.compare(iteration2, iteration1));85 assertEquals(TaskEquality.UNEQUAL, rule.compare(iteration1, iteration2)); 86 assertEquals(TaskEquality.UNEQUAL, rule.compare(iteration2, iteration1)); 78 87 79 treeBuilder.set Child(iteration2, task2);88 treeBuilder.setMarkedTask(iteration2, task2); 80 89 81 assertEquals( NodeEquality.LEXICALLY_EQUAL, rule.compare(iteration1, iteration2));82 assertEquals( NodeEquality.LEXICALLY_EQUAL, rule.compare(iteration2, iteration1));90 assertEquals(TaskEquality.LEXICALLY_EQUAL, rule.compare(iteration1, iteration2)); 91 assertEquals(TaskEquality.LEXICALLY_EQUAL, rule.compare(iteration2, iteration1)); 83 92 84 ISelection selection1 = t reeNodeFactory.createNewSelection();93 ISelection selection1 = taskFactory.createNewSelection(); 85 94 treeBuilder.addChild(selection1, task2); 86 treeBuilder.set Child(iteration1, selection1);95 treeBuilder.setMarkedTask(iteration1, selection1); 87 96 88 assertEquals( NodeEquality.LEXICALLY_EQUAL, rule.compare(iteration1, iteration2));89 assertEquals( NodeEquality.LEXICALLY_EQUAL, rule.compare(iteration2, iteration1));97 assertEquals(TaskEquality.LEXICALLY_EQUAL, rule.compare(iteration1, iteration2)); 98 assertEquals(TaskEquality.LEXICALLY_EQUAL, rule.compare(iteration2, iteration1)); 90 99 91 ISelection selection2 = t reeNodeFactory.createNewSelection();100 ISelection selection2 = taskFactory.createNewSelection(); 92 101 treeBuilder.addChild(selection2, task2); 93 treeBuilder.set Child(iteration2, selection2);102 treeBuilder.setMarkedTask(iteration2, selection2); 94 103 95 assertEquals( NodeEquality.LEXICALLY_EQUAL, rule.compare(iteration1, iteration2));96 assertEquals( NodeEquality.LEXICALLY_EQUAL, rule.compare(iteration2, iteration1));104 assertEquals(TaskEquality.LEXICALLY_EQUAL, rule.compare(iteration1, iteration2)); 105 assertEquals(TaskEquality.LEXICALLY_EQUAL, rule.compare(iteration2, iteration1)); 97 106 98 107 assertFalse(rule.isApplicable(iteration1, selection1));
Note: See TracChangeset
for help on using the changeset viewer.