source: trunk/quest-core-tasktrees-test/src/test/java/de/ugoe/cs/quest/tasktrees/nodeequality/SequenceComparisonRuleTest.java @ 655

Last change on this file since 655 was 655, checked in by pharms, 12 years ago
  • removed old copyright file header
File size: 2.8 KB
Line 
1package de.ugoe.cs.quest.tasktrees.nodeequality;
2
3import static org.junit.Assert.*;
4
5import org.junit.Test;
6
7import de.ugoe.cs.quest.tasktrees.treeifc.ISequence;
8import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeBuilder;
9import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
10import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNodeFactory;
11import de.ugoe.cs.quest.tasktrees.treeimpl.TaskTreeBuilder;
12import de.ugoe.cs.quest.tasktrees.treeimpl.TaskTreeNodeFactory;
13import de.ugoe.cs.quest.tasktrees.treeimpl.TaskTreeNode;
14
15/**
16 * <p>
17 * TODO comment
18 * </p>
19 *
20 * @version $Revision: $ $Date: 16.08.2012$
21 * @author 2012, last modified by $Author: pharms$
22 */
23public class SequenceComparisonRuleTest {
24
25    /**
26     * <p>
27     * TODO: comment
28     * </p>
29     *
30     */
31    @Test
32    public void test() {
33        NodeEqualityRuleManager manager = new NodeEqualityRuleManager();
34        manager.init();
35       
36        ITaskTreeNodeFactory treeNodeFactory = new TaskTreeNodeFactory();
37        ITaskTreeBuilder treeBuilder = new TaskTreeBuilder();
38       
39        SequenceComparisonRule rule = new SequenceComparisonRule(manager);
40       
41        ITaskTreeNode task1 = new TaskTreeNode("task1");
42        ITaskTreeNode task2 = new TaskTreeNode("task2");
43       
44        assertNull(rule.compare(task1, task2));
45       
46        ISequence sequence1 = treeNodeFactory.createNewSequence();
47        assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(sequence1, sequence1));
48
49        ISequence sequence2 = treeNodeFactory.createNewSequence();
50       
51        assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(sequence1, sequence2));
52        assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(sequence2, sequence1));
53       
54        treeBuilder.addChild(sequence1, task1);
55       
56        assertNull(rule.compare(sequence1, sequence2));
57        assertNull(rule.compare(sequence2, sequence1));
58       
59        treeBuilder.addChild(sequence2, task1);
60       
61        assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(sequence1, sequence2));
62        assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(sequence2, sequence1));
63       
64        treeBuilder.addChild(sequence1, task2);
65       
66        assertNull(rule.compare(sequence1, sequence2));
67        assertNull(rule.compare(sequence2, sequence1));
68       
69        treeBuilder.addChild(sequence2, task2);
70       
71        assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(sequence1, sequence2));
72        assertEquals(NodeEquality.LEXICALLY_EQUAL, rule.compare(sequence2, sequence1));
73       
74        ISequence sequence3 = treeNodeFactory.createNewSequence();
75        treeBuilder.addChild(sequence3, task2);
76        treeBuilder.addChild(sequence3, task1);
77       
78        assertNull(rule.compare(sequence1, sequence3));
79        assertNull(rule.compare(sequence3, sequence1));
80    }
81
82}
Note: See TracBrowser for help on using the repository browser.