[927] | 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 | |
---|
[1146] | 15 | package de.ugoe.cs.autoquest.tasktrees.taskequality; |
---|
[817] | 16 | |
---|
| 17 | import static org.junit.Assert.*; |
---|
| 18 | |
---|
| 19 | import org.junit.Test; |
---|
| 20 | |
---|
[1146] | 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.TaskAndSelectionComparisonRule; |
---|
| 25 | import de.ugoe.cs.autoquest.tasktrees.taskequality.TaskEquality; |
---|
[922] | 26 | import de.ugoe.cs.autoquest.tasktrees.treeifc.ISelection; |
---|
[1146] | 27 | import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskBuilder; |
---|
| 28 | import de.ugoe.cs.autoquest.tasktrees.treeifc.ITask; |
---|
| 29 | import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskFactory; |
---|
| 30 | import de.ugoe.cs.autoquest.tasktrees.treeimpl.TaskBuilder; |
---|
| 31 | import de.ugoe.cs.autoquest.tasktrees.treeimpl.TaskFactory; |
---|
| 32 | import de.ugoe.cs.autoquest.test.DummyGUIElement; |
---|
[817] | 33 | |
---|
| 34 | /** |
---|
| 35 | * @author Patrick Harms |
---|
| 36 | */ |
---|
[1146] | 37 | public class TaskAndSelectionComparisonRuleTest { |
---|
[817] | 38 | |
---|
| 39 | /** |
---|
| 40 | * |
---|
| 41 | */ |
---|
| 42 | @Test |
---|
| 43 | public void test() { |
---|
[1146] | 44 | ITaskFactory taskFactory = new TaskFactory(); |
---|
| 45 | ITaskBuilder treeBuilder = new TaskBuilder(); |
---|
[817] | 46 | |
---|
[1190] | 47 | TaskAndSelectionComparisonRule rule = new TaskAndSelectionComparisonRule(); |
---|
[817] | 48 | |
---|
[1146] | 49 | IEventType eventType1 = new StringEventType("eventType1"); |
---|
| 50 | IEventTarget eventTarget1 = new DummyGUIElement("elem1"); |
---|
| 51 | ITask task1 = taskFactory.createNewEventTask(eventType1, eventTarget1); |
---|
[817] | 52 | |
---|
| 53 | assertNull(rule.compare(task1, task1)); |
---|
| 54 | |
---|
[1146] | 55 | ISelection selection1 = taskFactory.createNewSelection(); |
---|
[817] | 56 | assertNull(rule.compare(selection1, selection1)); |
---|
| 57 | assertNull(rule.compare(task1, selection1)); |
---|
| 58 | assertNull(rule.compare(selection1, task1)); |
---|
| 59 | |
---|
| 60 | treeBuilder.addChild(selection1, task1); |
---|
| 61 | |
---|
[1146] | 62 | assertEquals(TaskEquality.LEXICALLY_EQUAL, rule.compare(selection1, task1)); |
---|
| 63 | assertEquals(TaskEquality.LEXICALLY_EQUAL, rule.compare(task1, selection1)); |
---|
[817] | 64 | |
---|
[1146] | 65 | selection1 = taskFactory.createNewSelection(); |
---|
| 66 | ISelection selection2 = taskFactory.createNewSelection(); |
---|
[817] | 67 | treeBuilder.addChild(selection2, task1); |
---|
| 68 | treeBuilder.addChild(selection1, selection2); |
---|
| 69 | |
---|
[1146] | 70 | assertEquals(TaskEquality.LEXICALLY_EQUAL, rule.compare(selection1, task1)); |
---|
| 71 | assertEquals(TaskEquality.LEXICALLY_EQUAL, rule.compare(task1, selection1)); |
---|
[817] | 72 | } |
---|
| 73 | |
---|
| 74 | } |
---|