();
-
- while ((currentGUIElement != null) &&
- ((identicalParentGUIElement == null) ||
- (!currentGUIElement.equals(identicalParentGUIElement))))
- {
- tasksToBeAdded.add
- (mTaskTreeNodeFactory.createNewInteractionTask(currentGUIElement, new FocusLost()));
- currentGUIElement = currentGUIElement.getParent();
- }
-
- // now create focus received interactions for each GUI element, that is not common with
- // with the old one. Ensure, that if the current interaction is a focus reception, that
- // it is used instead of a generated one
- newGUIElement = interactionTask.getGUIElement();
-
- int index = tasksToBeAdded.size();
- while ((newGUIElement != null) &&
- ((identicalParentGUIElement == null) ||
- (!newGUIElement.equals(identicalParentGUIElement))))
- {
- tasksToBeAdded.add(index, mTaskTreeNodeFactory.createNewInteractionTask
- (newGUIElement, new FocusReceived()));
- newGUIElement = newGUIElement.getParent();
- }
-
- // this part ensures, that the original focus reception, if any, is preserved as is.
- boolean taskAlreadyHandled = false;
- if (interactionTask.getInteraction() instanceof FocusReceived)
- {
- if (tasksToBeAdded.size() > 0)
- {
- tasksToBeAdded.set(tasksToBeAdded.size() - 1, interactionTask);
- }
- //else
- //{
- // in this case, we already have focus on the element to which the focus shall be changed.
- // therefore, we discard the new focus change on the same element.
- //}
-
- taskAlreadyHandled = true;
- }
-
- // now that all tasks are determined, add them to the sequence
- for (InteractionTask task : tasksToBeAdded)
- {
- addTaskToSequence(task);
- }
-
- mCurrentGUIElement = interactionTask.getGUIElement();
-
- return taskAlreadyHandled;
- }*/
-
- //-----------------------------------------------------------------------------------------------
- /**
- *
- */
- //-----------------------------------------------------------------------------------------------
- private void addTaskToSequence(TaskTreeNode task, GUIElement currentKeyboardFocusGUIElement)
- {
- mTaskTreeBuilder.addChild(mRootSequence, task);
-
- if (--mInteractionsTillRuleApplication == 0)
- {
- mInteractionsTillRuleApplication = MAX_INTERACTIONS_TILL_RULE_APPLICATION;
-
- LOG.info("applying rules temporal relationship generation rules");
- ComponentManager.getTemporalRelationshipRuleManager().applyRules
- (mRootSequence, mTaskTreeBuilder, mTaskTreeNodeFactory, false);
- }
- }
}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/IterationComparisonRule.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/IterationComparisonRule.java (revision 556)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/IterationComparisonRule.java (revision 557)
@@ -1,3 +1,2 @@
-//-------------------------------------------------------------------------------------------------
// Module : $RCSfile: NodeIdentityRule.java,v $
// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 19.02.2012 $
@@ -5,129 +4,165 @@
// Creation : 2012 by patrick
// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
+
package de.ugoe.cs.quest.tasktrees.nodeequality;
-import de.ugoe.cs.quest.tasktrees.treeifc.Iteration;
-import de.ugoe.cs.quest.tasktrees.treeifc.Selection;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
+import de.ugoe.cs.quest.tasktrees.treeifc.IIteration;
+import de.ugoe.cs.quest.tasktrees.treeifc.ISelection;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
-//-------------------------------------------------------------------------------------------------
/**
- * TODO comment
+ *
+ * This class is capable of comparing Iterations. Iterations equal at distinct levels
+ * in distinct situations. The following table shows the results of the comparison for the
+ * specific situations (the parameters are commutative). In any other situation, the comparison
+ * returns NodeEquality.UNEQUAL:
+ *
+ *
+ *
+ *
+ * | iteration 1 |
+ * iteration 2 |
+ * comparison result |
+ *
+ *
+ * | any iteration |
+ * any iteration with a child that is lexically equal to the child of iteration 1 |
+ * NodeEquality.LEXICALLY_EQUAL |
+ *
+ *
+ * | any iteration |
+ * any iteration with a child that is syntactically equal to the child of iteration 1 |
+ * NodeEquality.SYNTACTICALLY_EQUAL |
+ *
+ *
+ * | any iteration |
+ * any iteration with a child that is semantically equal to the child of iteration 1 |
+ * NodeEquality.SEMANTICALLY_EQUAL |
+ *
+ *
+ * | an iteration with a selection of syntactically equal children |
+ * an iteration with a child that is syntactically equal to the children of the child
+ * selection of iteration 1 |
+ * NodeEquality.SYNTACTICALLY_EQUAL |
+ *
+ *
+ * | an iteration with a selection of semantically equal children |
+ * an iteration with a child that is semantically equal to the children of the child
+ * selection of iteration 1 |
+ * NodeEquality.SEMANTICALLY_EQUAL |
+ *
+ *
*
* @version $Revision: $ $Date: 19.02.2012$
* @author 2012, last modified by $Author: patrick$
*/
-//-------------------------------------------------------------------------------------------------
-public class IterationComparisonRule implements NodeComparisonRule
-{
- /** */
- private NodeEqualityRuleManager mRuleManager;
+public class IterationComparisonRule implements NodeComparisonRule {
+
+ /** the rule manager for internally comparing task tree nodes */
+ private NodeEqualityRuleManager mRuleManager;
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- */
- //-----------------------------------------------------------------------------------------------
- IterationComparisonRule(NodeEqualityRuleManager ruleManager)
- {
- super();
- mRuleManager = ruleManager;
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.nodeequality.NodeEqualityRule#apply(TaskTreeNode, TaskTreeNode)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public NodeEquality compare(TaskTreeNode node1, TaskTreeNode node2)
- {
- if ((!(node1 instanceof Iteration)) || (!(node2 instanceof Iteration)))
- {
- return null;
- }
-
- // if both iterations do not have children, they are equal although this doesn't make sense
- if ((node1.getChildren().size() == 0) && (node2.getChildren().size() == 0))
- {
- return new NodesIdentical();
- }
-
- TaskTreeNode child1 = node1.getChildren().get(0);
- TaskTreeNode child2 = node2.getChildren().get(0);
-
- // iterations may have 3 different structures.
- // 1. they have one child, which is the iterated one
- // 2. they have a sequence of children, which is iterated
- // 3. they have a selection of different iterated variants (usually the variants are
- // semantically equal)
- //
- // the permutations of the three variants in combination must be checked
-
- // check if both nodes are the same variants of iterations and if their children are equal.
- // This condition matches, if both iterations are the same variants of iteration. I.e. three
- // combinations of the permutation are handled herewith.
- NodeEquality nodeEquality = mRuleManager.applyRules(child1, child2);
-
- if (nodeEquality.getStructuralEquality() || nodeEquality.getSemanticalEquality())
- {
- return nodeEquality;
- }
-
- // compare one iteration with a single node as a child and another one with a selection of
- // semantically equal nodes
- if (selectionChildrenSemanticallyEqualNode(child1, child2))
- {
- return new NodesSemanticallyEqual();
+ /**
+ *
+ * simple constructor to provide the rule with the node equality rule manager to be able
+ * to perform comparisons of the children of provided task tree nodes
+ *
+ *
+ * @param ruleManager the rule manager for comparing task tree nodes
+ */
+ IterationComparisonRule(NodeEqualityRuleManager ruleManager) {
+ super();
+ mRuleManager = ruleManager;
}
- // all other combinations (i.e. sequence with single child and sequence with selection)
- // can not match
- return null;
- }
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.nodeequality.NodeEqualityRule#apply(TaskTreeNode, TaskTreeNode)
+ */
+ @Override
+ public NodeEquality compare(ITaskTreeNode node1, ITaskTreeNode node2) {
+ if ((!(node1 instanceof IIteration)) || (!(node2 instanceof IIteration))) {
+ return null;
+ }
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param taskTreeNode
- * @param taskTreeNode2
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- private boolean selectionChildrenSemanticallyEqualNode(TaskTreeNode taskTreeNode,
- TaskTreeNode taskTreeNode2)
- {
- Selection selection = null;
- TaskTreeNode node = null;
- if (taskTreeNode instanceof Selection)
+ // if both iterations do not have children, they are equal although this doesn't make sense
+ if ((node1.getChildren().size() == 0) && (node2.getChildren().size() == 0)) {
+ return NodeEquality.IDENTICAL;
+ }
+
+ ITaskTreeNode child1 = node1.getChildren().get(0);
+ ITaskTreeNode child2 = node2.getChildren().get(0);
+
+ // iterations may have 3 different structures.
+ // 1. they have one child, which is the iterated one
+ // 2. they have a sequence of children, which is iterated
+ // 3. they have a selection of different iterated variants (usually the variants are
+ // semantically equal)
+ //
+ // the permutations of the three variants in combination must be checked
+
+ // check if both nodes are the same variants of iterations and if their children are equal.
+ // This condition matches, if both iterations are the same variants of iteration. I.e. three
+ // combinations of the permutation are handled herewith.
+ NodeEquality nodeEquality = mRuleManager.applyRules(child1, child2);
+
+ if (nodeEquality.isAtLeast(NodeEquality.SEMANTICALLY_EQUAL)) {
+ return nodeEquality;
+ }
+
+ // compare one iteration with a single node as a child and another one with a selection of
+ // semantically equal nodes
+ return selectionChildrenSemanticallyEqualNode(child1, child2);
+
+ // all other combinations (i.e. sequence with single child and sequence with selection)
+ // can not match
+ }
+
+ /**
+ *
+ * compares two task tree nodes. One of them must be a selection of at least semantically
+ * equal children. The other one can be any task tree node. The method returns a node equality
+ * that is not NodeEquality.UNEQUAL if the other node is at least semantically
+ * equal to the children of the selection. It returns more concrete equalities, if the
+ * equality between the other node and the children of the selection is more concrete.
+ *
+ *
+ * @param taskTreeNode the first task tree node to compare
+ * @param taskTreeNode2 the second task tree node to compare
+ *
+ * @return as described
+ */
+ private NodeEquality selectionChildrenSemanticallyEqualNode(ITaskTreeNode taskTreeNode,
+ ITaskTreeNode taskTreeNode2)
{
- selection = (Selection) taskTreeNode;
- node = taskTreeNode2;
+ ISelection selection = null;
+ ITaskTreeNode node = null;
+ if (taskTreeNode instanceof ISelection) {
+ selection = (ISelection) taskTreeNode;
+ node = taskTreeNode2;
+ }
+ else if (taskTreeNode2 instanceof ISelection) {
+ selection = (ISelection) taskTreeNode2;
+ node = taskTreeNode;
+ }
+ else {
+ return NodeEquality.UNEQUAL;
+ }
+
+ NodeEquality lessConcreteEqualityForAllComparisons = NodeEquality.IDENTICAL;
+
+ for (ITaskTreeNode child : selection.getChildren()) {
+ NodeEquality nodeEquality = mRuleManager.applyRules(node, child);
+
+ if (!nodeEquality.isAtLeast(NodeEquality.SEMANTICALLY_EQUAL)) {
+ return NodeEquality.UNEQUAL;
+ }
+ else if (!lessConcreteEqualityForAllComparisons.isAtLeast(nodeEquality)) {
+ lessConcreteEqualityForAllComparisons = nodeEquality;
+ }
+ }
+
+ return lessConcreteEqualityForAllComparisons;
}
- else if (taskTreeNode2 instanceof Selection)
- {
- selection = (Selection) taskTreeNode2;
- node = taskTreeNode;
- }
- else
- {
- return false;
- }
-
- for (TaskTreeNode child : selection.getChildren())
- {
- NodeEquality nodeEquality = mRuleManager.applyRules(node, child);
-
- if (!nodeEquality.getStructuralEquality() && !nodeEquality.getSemanticalEquality())
- {
- return false;
- }
- }
-
- return true;
- }
}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/NodeComparisonRule.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/NodeComparisonRule.java (revision 556)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/NodeComparisonRule.java (revision 557)
@@ -1,3 +1,2 @@
-//-------------------------------------------------------------------------------------------------
// Module : $RCSfile: EqualityRule.java,v $
// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 19.02.2012 $
@@ -5,28 +4,33 @@
// Creation : 2012 by patrick
// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
+
package de.ugoe.cs.quest.tasktrees.nodeequality;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
-//-------------------------------------------------------------------------------------------------
/**
- * TODO comment
+ *
+ * A node comparison rule is used by the {@link NodeEqualityRuleManager} to compare task tree
+ * nodes with each other. It provides one method to be called for a comparison.
+ *
*
* @version $Revision: $ $Date: 19.02.2012$
* @author 2012, last modified by $Author: patrick$
*/
-//-------------------------------------------------------------------------------------------------
-public interface NodeComparisonRule
-{
+public interface NodeComparisonRule {
- //-----------------------------------------------------------------------------------------------
- /**
- * compares two nodes with each other. The result of the method is either a node equality or
- * null. If it is null, it means, that the rule is not able to correctly compare the two
- * given nodes
- */
- //-----------------------------------------------------------------------------------------------
- public NodeEquality compare(TaskTreeNode node1, TaskTreeNode node2);
-
+ /**
+ *
+ * compares two nodes with each other. The result of the method is either a node equality or
+ * null. If it is null, it means, that the rule is not able to correctly compare the two given
+ * nodes
+ *
+ *
+ * @param node1 the first task tree node to compare
+ * @param node2 the second task tree node to compare
+ *
+ * @return as described
+ */
+ public NodeEquality compare(ITaskTreeNode node1, ITaskTreeNode node2);
+
}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/NodeEquality.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/NodeEquality.java (revision 556)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/NodeEquality.java (revision 557)
@@ -1,3 +1,2 @@
-//-------------------------------------------------------------------------------------------------
// Module : $RCSfile: NodeEquality.java,v $
// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 19.02.2012 $
@@ -5,35 +4,95 @@
// Creation : 2012 by patrick
// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
+
package de.ugoe.cs.quest.tasktrees.nodeequality;
-//-------------------------------------------------------------------------------------------------
/**
- * TODO comment
+ *
+ * A node equality denotes, how equal two task tree nodes are. There are different equality levels
+ * which are similar to the usual design levels of GUI design. These levels are
+ *
+ * - conceptual design: defines the concepts to be edited using a GUI
+ * - semantical design: defines the possible functions for editing the concepts
+ * - syntactical design: defines, which steps are needed to execute the functions
+ * - lexical design: defines on the key stroke level, how the steps for executing a function
+ * can be performed
+ *
+ * It is not possible to compare two task nodes conceptually. But the other design levels can be
+ * identified and compared.
+ *
+ *
+ * Nodes can be identical. This is the case if in the java virtual machine, their comparison
+ * using the == operator or the equals method return true.
+ *
+ *
+ * Nodes are lexically equal, if they represent the same events on a key stroke level to be
+ * carried out to execute the task. Identical nodes are also syntactically equal.
+ *
+ *
+ * Nodes are syntactically equal, if they differ in their events on key stroke level, but the
+ * syntactical result is the same. For example, entering the text "hello" into a text field can
+ * be done by entering the letters in their correct order, but also by copying the text into the
+ * text field. The syntactical result is the same: The text hello was entered. But the tasks
+ * lexically differ because the events on key stroke level are different. On the other hand,
+ * lexically equal nodes are also syntactically equal.
+ *
+ *
+ * Task tree nodes are semantically equal, if they execute the same function for editing the
+ * concepts. An example are a click on a button and a short cut, both executing the same function.
+ * These task tree nodes are syntactically and, therefore, also lexically different, but
+ * semantically equal. Syntactically equal task tree nodes are always also semantically equal.
+ *
*
* @version $Revision: $ $Date: 19.02.2012$
* @author 2012, last modified by $Author: patrick$
*/
-//-------------------------------------------------------------------------------------------------
-public interface NodeEquality
-{
+public enum NodeEquality {
+ IDENTICAL,
+ LEXICALLY_EQUAL,
+ SYNTACTICALLY_EQUAL,
+ SEMANTICALLY_EQUAL,
+ UNEQUAL;
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- public boolean getStructuralEquality();
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- public boolean getSemanticalEquality();
-
+ /**
+ *
+ * Checks for the current node equality, if it is at least identical to the
+ * provided one or even more concrete. As an example, the node equality identical also
+ * indicates, that the nodes are e.g. lexically, syntactically and semantically equal.
+ * Therefore, the method called on IDENTICAL with SEMANTICALLY_EQUAL
+ * as parameter will return true. If this method is called on SYNTACTICALLY_EQUAL
+ * with the parameter IDENTICAL instead, it returns false;
+ *
+ *
+ * @param nodeEquality the node equality to compare with.
+ *
+ * @return as described
+ */
+ public boolean isAtLeast(NodeEquality nodeEquality)
+ {
+ switch (nodeEquality) {
+ case IDENTICAL:
+ return
+ (this == IDENTICAL);
+ case LEXICALLY_EQUAL:
+ return
+ (this == IDENTICAL) ||
+ (this == LEXICALLY_EQUAL);
+ case SYNTACTICALLY_EQUAL:
+ return
+ (this == IDENTICAL) ||
+ (this == LEXICALLY_EQUAL) ||
+ (this == SYNTACTICALLY_EQUAL);
+ case SEMANTICALLY_EQUAL:
+ return
+ (this == IDENTICAL) ||
+ (this == LEXICALLY_EQUAL) ||
+ (this == SYNTACTICALLY_EQUAL) ||
+ (this == SEMANTICALLY_EQUAL);
+ case UNEQUAL:
+ return
+ (this == UNEQUAL);
+ default :
+ return false;
+ }
+ }
}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/NodeEqualityRuleManager.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/NodeEqualityRuleManager.java (revision 556)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/NodeEqualityRuleManager.java (revision 557)
@@ -1,3 +1,2 @@
-//-------------------------------------------------------------------------------------------------
// Module : $RCSfile: NodeEqualityRuleManager.java,v $
// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 19.02.2012 $
@@ -5,73 +4,86 @@
// Creation : 2012 by patrick
// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
+
package de.ugoe.cs.quest.tasktrees.nodeequality;
import java.util.ArrayList;
import java.util.List;
-//import java.util.logging.Logger;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
-//-------------------------------------------------------------------------------------------------
/**
- * TODO comment
+ *
+ * The node equality rule manager is capable of comparing task tree nodes based on its internal list
+ * of comparison rules. The current list of rules contains the {@link NodeIdentityRule}, the
+ * {@link IterationComparisonRule}, the {@link SequenceComparisonRule}, and
+ * {@link SelectionComparisonRule}. These rules are asked for comparing the two provided task tree
+ * nodes in the mentioned order. If a rule returns a node equality other than null, this equality is
+ * returned. Otherwise the next rule is asked.
+ *
*
* @version $Revision: $ $Date: 19.02.2012$
* @author 2012, last modified by $Author: patrick$
*/
-//-------------------------------------------------------------------------------------------------
-public class NodeEqualityRuleManager
-{
+public class NodeEqualityRuleManager {
- /** */
- //private static Logger LOG = Logger.getLogger(NodeEqualityRuleManager.class.getName());
+ /** */
+ // private static Logger LOG = Logger.getLogger(NodeEqualityRuleManager.class.getName());
- /** */
- private List mRuleIndex = new ArrayList();
+ /** */
+ private List mRuleIndex = null;
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- */
- //-----------------------------------------------------------------------------------------------
- public void init()
- {
- mRuleIndex.add(new NodeIdentityRule());
- mRuleIndex.add(new IterationComparisonRule(this));
- mRuleIndex.add(new SequenceComparisonRule(this));
- mRuleIndex.add(new SelectionComparisonRule(this));
- }
+ /**
+ *
+ * initializes the node equality rule manager by filling the internal list of comparison rules.
+ * This method must be called before any other method is called on the rule manager.
+ *
+ */
+ public void init() {
+ mRuleIndex = new ArrayList();
+ mRuleIndex.add(new NodeIdentityRule());
+ mRuleIndex.add(new IterationComparisonRule(this));
+ mRuleIndex.add(new SequenceComparisonRule(this));
+ mRuleIndex.add(new SelectionComparisonRule(this));
+ }
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param node1
- * @param node2
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- public NodeEquality applyRules(TaskTreeNode node1, TaskTreeNode node2)
- {
- //LOG.info("checking for equality of " + node1 + " and " + node2);
- NodeEquality nodeEquality = null;
-
- for (NodeComparisonRule rule : mRuleIndex)
+ /**
+ *
+ * this method performs a comparison of the two provided task tree nodes. It iterates its
+ * internal comparison rules. If the first rule returns a node equality other than null,
+ * this equality is returned. Otherwise the next rule is tried. If no rule returns an equality
+ * NodeEquality.UNEQUAL is returned.
+ *
+ *
+ * @param node1 the first task tree node to be compared
+ * @param node2 the second task tree node to be compared
+ *
+ * @return as described
+ *
+ * @throws IllegalStateException in the case, the {@link #init()} method was not called on the
+ * manager before a call to this method.
+ */
+ public NodeEquality applyRules(ITaskTreeNode node1, ITaskTreeNode node2)
+ throws IllegalStateException
{
- nodeEquality = rule.compare(node1, node2);
-
- if (nodeEquality != null)
- {
- //LOG.warning("used rule " + rule + " for equality check");
- return nodeEquality;
- }
+ if (mRuleIndex == null) {
+ throw new IllegalStateException("not initialized");
+ }
+
+ // LOG.info("checking for equality of " + node1 + " and " + node2);
+ NodeEquality nodeEquality = null;
+
+ for (NodeComparisonRule rule : mRuleIndex) {
+ nodeEquality = rule.compare(node1, node2);
+
+ if (nodeEquality != null) {
+ // LOG.warning("used rule " + rule + " for equality check");
+ return nodeEquality;
+ }
+ }
+
+ // LOG.warning("no rule could be applied --> handling nodes as unequal");
+
+ return NodeEquality.UNEQUAL;
}
-
- //LOG.warning("no rule could be applied --> handling nodes as unequal");
-
- return new NodesUnequal();
- }
}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/NodeIdentityRule.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/NodeIdentityRule.java (revision 556)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/NodeIdentityRule.java (revision 557)
@@ -1,3 +1,2 @@
-//-------------------------------------------------------------------------------------------------
// Module : $RCSfile: NodeIdentityRule.java,v $
// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 19.02.2012 $
@@ -5,41 +4,35 @@
// Creation : 2012 by patrick
// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
+
package de.ugoe.cs.quest.tasktrees.nodeequality;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
-//-------------------------------------------------------------------------------------------------
/**
- * TODO comment
+ *
+ * This comparison rule returns NodeEquality.IDENTICAL if the comparison of the two
+ * task tree nodes using the == operator or the equals method return true.
+ * Else it returns null to denote, that it can not compare the nodes.
+ *
*
* @version $Revision: $ $Date: 19.02.2012$
* @author 2012, last modified by $Author: patrick$
*/
-//-------------------------------------------------------------------------------------------------
-public class NodeIdentityRule implements NodeComparisonRule
-{
+public class NodeIdentityRule implements NodeComparisonRule {
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.nodeequality.NodeEqualityRule#apply(TaskTreeNode, TaskTreeNode)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public NodeEquality compare(TaskTreeNode node1, TaskTreeNode node2)
- {
- if (node1 == node2)
- {
- return new NodesIdentical();
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.nodeequality.NodeEqualityRule#apply(TaskTreeNode, TaskTreeNode)
+ */
+ @Override
+ public NodeEquality compare(ITaskTreeNode node1, ITaskTreeNode node2) {
+ if ((node1 == node2) || ((node1 != null) && (node1.equals(node2)))) {
+ return NodeEquality.IDENTICAL;
+ }
+ else {
+ return null;
+ }
}
- else if ((node1 != null) && (node1.equals(node2)))
- {
- return new NodesEqual();
- }
- else
- {
- return null;
- }
- }
}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/NodesEqual.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/NodesEqual.java (revision 556)
+++ (revision )
@@ -1,43 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: NodesEqual.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 19.02.2012 $
-// Project : TaskTreeCreator
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.nodeequality;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 19.02.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public class NodesEqual implements NodeEquality
-{
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.nodeequality.NodeEquality#getStructuralEquality()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public boolean getStructuralEquality()
- {
- return true;
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.nodeequality.NodeEquality#getSemanticalEquality()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public boolean getSemanticalEquality()
- {
- return true;
- }
-
-}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/NodesIdentical.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/NodesIdentical.java (revision 556)
+++ (revision )
@@ -1,43 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: NodesIdentical.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 19.02.2012 $
-// Project : TaskTreeCreator
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.nodeequality;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 19.02.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public class NodesIdentical implements NodeEquality
-{
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.nodeequality.NodeEquality#getStructuralEquality()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public boolean getStructuralEquality()
- {
- return true;
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.nodeequality.NodeEquality#getSemanticalEquality()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public boolean getSemanticalEquality()
- {
- return true;
- }
-
-}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/NodesSemanticallyEqual.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/NodesSemanticallyEqual.java (revision 556)
+++ (revision )
@@ -1,43 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: NodesEqual.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 19.02.2012 $
-// Project : TaskTreeCreator
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.nodeequality;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 19.02.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public class NodesSemanticallyEqual implements NodeEquality
-{
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.nodeequality.NodeEquality#getStructuralEquality()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public boolean getStructuralEquality()
- {
- return false;
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.nodeequality.NodeEquality#getSemanticalEquality()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public boolean getSemanticalEquality()
- {
- return true;
- }
-
-}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/NodesUnequal.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/NodesUnequal.java (revision 556)
+++ (revision )
@@ -1,43 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: NodeUnequality.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 19.02.2012 $
-// Project : TaskTreeCreator
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.nodeequality;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 19.02.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public class NodesUnequal implements NodeEquality
-{
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.nodeequality.NodeEquality#getStructuralEquality()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public boolean getStructuralEquality()
- {
- return false;
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.nodeequality.NodeEquality#getSemanticalEquality()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public boolean getSemanticalEquality()
- {
- return false;
- }
-
-}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/SelectionComparisonRule.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/SelectionComparisonRule.java (revision 556)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/SelectionComparisonRule.java (revision 557)
@@ -1,3 +1,2 @@
-//-------------------------------------------------------------------------------------------------
// Module : $RCSfile: NodeIdentityRule.java,v $
// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 19.02.2012 $
@@ -5,92 +4,91 @@
// Creation : 2012 by patrick
// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
+
package de.ugoe.cs.quest.tasktrees.nodeequality;
-import de.ugoe.cs.quest.tasktrees.treeifc.Sequence;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
+import de.ugoe.cs.quest.tasktrees.treeifc.ISelection;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
-//-------------------------------------------------------------------------------------------------
/**
- * TODO comment
+ *
+ * this node comparison rule is capable of comparing selections. If both selections do not have
+ * children, they are treated as lexically equal. If they have the same number of children other
+ * than 0 and all these children are lexically equal, then the selections are lexically equal.
+ * They are syntactically equal, if each child of both selections is syntactically equal to any
+ * other child. The rule can not compare semantical equality if the nodes are not at least
+ * syntactically equal and returns null, if it can not decide this.
+ *
*
* @version $Revision: $ $Date: 19.02.2012$
* @author 2012, last modified by $Author: patrick$
*/
-//-------------------------------------------------------------------------------------------------
-public class SelectionComparisonRule implements NodeComparisonRule
-{
+public class SelectionComparisonRule implements NodeComparisonRule {
- /** */
- private NodeEqualityRuleManager mRuleManager;
+ /** the rule manager for internally comparing task tree nodes */
+ private NodeEqualityRuleManager mRuleManager;
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- */
- SelectionComparisonRule(NodeEqualityRuleManager ruleManager)
- {
- super();
- mRuleManager = ruleManager;
- }
+ /**
+ *
+ * simple constructor to provide the rule with the node equality rule manager to be able
+ * to perform comparisons of the children of provided task tree nodes
+ *
+ *
+ * @param ruleManager the rule manager for comparing task tree nodes
+ */
+ SelectionComparisonRule(NodeEqualityRuleManager ruleManager) {
+ super();
+ mRuleManager = ruleManager;
+ }
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.nodeequality.NodeEqualityRule#apply(TaskTreeNode, TaskTreeNode)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public NodeEquality compare(TaskTreeNode node1, TaskTreeNode node2)
- {
- if ((!(node1 instanceof Sequence)) || (!(node2 instanceof Sequence)))
- {
- return null;
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.nodeequality.NodeEqualityRule#apply(TaskTreeNode, TaskTreeNode)
+ */
+ @Override
+ public NodeEquality compare(ITaskTreeNode node1, ITaskTreeNode node2) {
+ if ((!(node1 instanceof ISelection)) || (!(node2 instanceof ISelection))) {
+ return null;
+ }
+
+ // if both sequences do not have children, they are equal although this doesn't make sense
+ if ((node1.getChildren().size() == 0) && (node2.getChildren().size() == 0)) {
+ return NodeEquality.LEXICALLY_EQUAL;
+ }
+
+ // Selections are syntactically equal, if they have children, which are all syntactically
+ // equal.
+ // They are lexically equals, if they have the same number and order of lexically equal
+ // children
+ boolean lexicallyEqual = node1.getChildren().size() == node2.getChildren().size();
+
+ for (int i = 0; i < node1.getChildren().size(); i++) {
+ ITaskTreeNode child1 = node1.getChildren().get(i);
+ boolean foundLexicallyEqualChild = false;
+
+ for (int j = 0; j < node2.getChildren().size(); j++) {
+ ITaskTreeNode child2 = node2.getChildren().get(j);
+
+ NodeEquality nodeEquality = mRuleManager.applyRules(child1, child2);
+
+ if (!nodeEquality.isAtLeast(NodeEquality.SYNTACTICALLY_EQUAL)) {
+ return null;
+ }
+ else if (nodeEquality.isAtLeast(NodeEquality.LEXICALLY_EQUAL)) {
+ foundLexicallyEqualChild = true;
+ }
+ }
+
+ // if we compare two children at the same position and if they are lexically equal
+ // then it can be further expected, that the selections are lexically equal
+ lexicallyEqual &= foundLexicallyEqualChild;
+ }
+
+ if (lexicallyEqual) {
+ return NodeEquality.LEXICALLY_EQUAL;
+ }
+ else {
+ return NodeEquality.SYNTACTICALLY_EQUAL;
+ }
}
-
- // if both sequences do not have children, they are equal although this doesn't make sense
- if ((node1.getChildren().size() == 0) && (node2.getChildren().size() == 0))
- {
- return new NodesEqual();
- }
-
- // Selections are semantically equal, if they have children, which are all semantically equal.
- // they are structurally equals, if they have the same number and order of structurally equal
- // children
- boolean structurallyEqual =
- node1.getChildren().size() == node2.getChildren().size();
-
- for (int i = 0; i < node1.getChildren().size(); i++)
- {
- TaskTreeNode child1 = node1.getChildren().get(i);
-
- for (int j = 0; j < node2.getChildren().size(); j++)
- {
- TaskTreeNode child2 = node2.getChildren().get(j);
-
- NodeEquality nodeEquality = mRuleManager.applyRules(child1, child2);
-
- if (!nodeEquality.getSemanticalEquality())
- {
- return null;
- }
- else if (structurallyEqual && (i == j))
- {
- // if we compare two children at the same position and if they are structurally equal
- // then it can be further expected, that the selections are structurally equal
- structurallyEqual &= nodeEquality.getStructuralEquality();
- }
- }
- }
-
- if (structurallyEqual)
- {
- return new NodesEqual();
- }
- else
- {
- return new NodesSemanticallyEqual();
- }
- }
-
}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/SequenceComparisonRule.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/SequenceComparisonRule.java (revision 556)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/nodeequality/SequenceComparisonRule.java (revision 557)
@@ -1,3 +1,2 @@
-//-------------------------------------------------------------------------------------------------
// Module : $RCSfile: NodeIdentityRule.java,v $
// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 19.02.2012 $
@@ -5,90 +4,73 @@
// Creation : 2012 by patrick
// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
+
package de.ugoe.cs.quest.tasktrees.nodeequality;
-import de.ugoe.cs.quest.tasktrees.treeifc.Sequence;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
+import de.ugoe.cs.quest.tasktrees.treeifc.ISequence;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
-//-------------------------------------------------------------------------------------------------
/**
- * TODO comment
+ *
+ * This rule is capable of comparing sequences. If both sequences do not have children, they are
+ * treated as lexically equal. Sequences are lexically equal, if they have the same number and
+ * order of lexically equal children. The rule can not decide, if two sequences are syntactically
+ * or semantically equal.
+ *
*
* @version $Revision: $ $Date: 19.02.2012$
* @author 2012, last modified by $Author: patrick$
*/
-//-------------------------------------------------------------------------------------------------
-public class SequenceComparisonRule implements NodeComparisonRule
-{
+public class SequenceComparisonRule implements NodeComparisonRule {
+ /** the rule manager for internally comparing task tree nodes */
+ private NodeEqualityRuleManager mRuleManager;
- /** */
- private NodeEqualityRuleManager mRuleManager;
+ /**
+ *
+ * simple constructor to provide the rule with the node equality rule manager to be able
+ * to perform comparisons of the children of provided task tree nodes
+ *
+ *
+ * @param ruleManager the rule manager for comparing task tree nodes
+ */
+ SequenceComparisonRule(NodeEqualityRuleManager ruleManager) {
+ super();
+ mRuleManager = ruleManager;
+ }
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- */
- //-----------------------------------------------------------------------------------------------
- SequenceComparisonRule(NodeEqualityRuleManager ruleManager)
- {
- super();
- mRuleManager = ruleManager;
- }
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.nodeequality.NodeEqualityRule#apply(TaskTreeNode, TaskTreeNode)
+ */
+ @Override
+ public NodeEquality compare(ITaskTreeNode node1, ITaskTreeNode node2) {
+ if ((!(node1 instanceof ISequence)) || (!(node2 instanceof ISequence))) {
+ return null;
+ }
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.nodeequality.NodeEqualityRule#apply(TaskTreeNode, TaskTreeNode)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public NodeEquality compare(TaskTreeNode node1, TaskTreeNode node2)
- {
- if ((!(node1 instanceof Sequence)) || (!(node2 instanceof Sequence)))
- {
- return null;
+ // if both sequences do not have children, they are equal although this doesn't make sense
+ if ((node1.getChildren().size() == 0) && (node2.getChildren().size() == 0)) {
+ return NodeEquality.LEXICALLY_EQUAL;
+ }
+
+ //
+ if (node1.getChildren().size() != node2.getChildren().size()) {
+ return null;
+ }
+
+ for (int i = 0; i < node1.getChildren().size(); i++) {
+ ITaskTreeNode child1 = node1.getChildren().get(i);
+ ITaskTreeNode child2 = node2.getChildren().get(i);
+
+ NodeEquality nodeEquality = mRuleManager.applyRules(child1, child2);
+
+ if (!nodeEquality.isAtLeast(NodeEquality.LEXICALLY_EQUAL)) {
+ return null;
+ }
+ }
+
+ return NodeEquality.LEXICALLY_EQUAL;
}
-
- // if both sequences do not have children, they are equal although this doesn't make sense
- if ((node1.getChildren().size() == 0) && (node2.getChildren().size() == 0))
- {
- return new NodesEqual();
- }
-
- // Sequences are equal, if they have the same number and order of children. If all the
- // children match structurally, then the sequences are structurally equal. Otherwise, if
- // at least one pair of children matches only semantically, then the sequences match only
- // semantically.
- if (node1.getChildren().size() != node2.getChildren().size())
- {
- return null;
- }
-
- boolean structurallyEqual = true;
- for (int i = 0; i < node1.getChildren().size(); i++)
- {
- TaskTreeNode child1 = node1.getChildren().get(i);
- TaskTreeNode child2 = node2.getChildren().get(i);
-
- NodeEquality nodeEquality = mRuleManager.applyRules(child1, child2);
-
- structurallyEqual &= nodeEquality.getStructuralEquality();
-
- if (!structurallyEqual && !nodeEquality.getSemanticalEquality())
- {
- return null;
- }
- }
-
- if (structurallyEqual)
- {
- return new NodesEqual();
- }
- else
- {
- return new NodesSemanticallyEqual();
- }
- }
}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/DefaultEventTargetSequenceDetectionRule.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/DefaultEventTargetSequenceDetectionRule.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/DefaultEventTargetSequenceDetectionRule.java (revision 557)
@@ -0,0 +1,119 @@
+// Module : $RCSfile: DefaultSequenceDetectionRule.java,v $
+// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 18.03.2012 $
+// Project : TaskTreeCreator
+// Creation : 2012 by patrick
+// Copyright : Patrick Harms, 2012
+
+package de.ugoe.cs.quest.tasktrees.temporalrelation;
+
+import de.ugoe.cs.quest.eventcore.IEventTarget;
+import de.ugoe.cs.quest.tasktrees.treeifc.IEventTask;
+import de.ugoe.cs.quest.tasktrees.treeifc.ISequence;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeBuilder;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNodeFactory;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: 18.03.2012$
+ * @author 2012, last modified by $Author: patrick$
+ */
+public class DefaultEventTargetSequenceDetectionRule implements TemporalRelationshipRule {
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.temporalrelation.TemporalRelationshipRule#apply(TaskTreeNode,
+ * TaskTreeBuilder, TaskTreeNodeFactory)
+ */
+ @Override
+ public RuleApplicationResult apply(ITaskTreeNode parent,
+ ITaskTreeBuilder builder,
+ ITaskTreeNodeFactory nodeFactory,
+ boolean finalize)
+ {
+ if (!(parent instanceof ISequence)) {
+ return null;
+ }
+
+ RuleApplicationResult result = new RuleApplicationResult();
+
+ IEventTarget currentEventTarget = null;
+ int startingIndex = -1;
+
+ int index = 0;
+ while (index < parent.getChildren().size()) {
+ ITaskTreeNode child = parent.getChildren().get(index);
+
+ IEventTarget eventTarget = determineEventTarget(child);
+
+ if ((eventTarget != null) && (!eventTarget.equals(currentEventTarget))) {
+ if (startingIndex < 0) {
+ startingIndex = index;
+ currentEventTarget = eventTarget;
+ }
+ else {
+ handleEventTargetSequence(parent, startingIndex, index - 1, builder,
+ nodeFactory, result);
+
+ return result;
+ }
+ }
+
+ index++;
+ }
+
+ if (startingIndex > -1) {
+ if (finalize && (startingIndex > 0)) {
+ handleEventTargetSequence(parent, startingIndex, parent.getChildren().size() - 1,
+ builder, nodeFactory, result);
+ }
+ else {
+ result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FEASIBLE);
+ }
+ }
+
+ return result;
+ }
+
+ /**
+ * TODO: comment
+ *
+ * @param child
+ * @return
+ */
+ private IEventTarget determineEventTarget(ITaskTreeNode node) {
+ if (node instanceof IEventTask) {
+ return ((IEventTask) node).getEventTarget();
+ }
+ else {
+ return null;
+ }
+ }
+
+ /**
+ * TODO: comment
+ *
+ */
+ private void handleEventTargetSequence(ITaskTreeNode parent,
+ int startIndex,
+ int endIndex,
+ ITaskTreeBuilder builder,
+ ITaskTreeNodeFactory nodeFactory,
+ RuleApplicationResult result)
+ {
+ ISequence sequence = nodeFactory.createNewSequence();
+
+ for (int i = startIndex; i <= endIndex; i++) {
+ builder.addChild(sequence, parent.getChildren().get(startIndex));
+ builder.removeChild((ISequence) parent, startIndex);
+ }
+
+ builder.addChild((ISequence) parent, startIndex, sequence);
+
+ result.addNewlyCreatedParentNode(sequence);
+ result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FINISHED);
+ }
+
+}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/DefaultGUIElementSequenceDetectionRule.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/DefaultGUIElementSequenceDetectionRule.java (revision 556)
+++ (revision )
@@ -1,137 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: DefaultSequenceDetectionRule.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 18.03.2012 $
-// Project : TaskTreeCreator
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.temporalrelation;
-
-import de.ugoe.cs.quest.eventcore.guimodel.GUIElement;
-import de.ugoe.cs.quest.tasktrees.treeifc.InteractionTask;
-import de.ugoe.cs.quest.tasktrees.treeifc.Sequence;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeBuilder;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNodeFactory;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 18.03.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public class DefaultGUIElementSequenceDetectionRule implements TemporalRelationshipRule
-{
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.temporalrelation.TemporalRelationshipRule#apply(TaskTreeNode, TaskTreeBuilder, TaskTreeNodeFactory)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public RuleApplicationResult apply(TaskTreeNode parent,
- TaskTreeBuilder builder,
- TaskTreeNodeFactory nodeFactory,
- boolean finalize)
- {
- if (!(parent instanceof Sequence))
- {
- return null;
- }
-
- RuleApplicationResult result = new RuleApplicationResult();
-
- GUIElement currentGUIElement = null;
- int startingIndex = -1;
-
- int index = 0;
- while (index < parent.getChildren().size())
- {
- TaskTreeNode child = parent.getChildren().get(index);
-
- GUIElement guiElement = determineGUIElement(child);
-
- if ((guiElement != null) && (!guiElement.equals(currentGUIElement)))
- {
- if (startingIndex < 0)
- {
- startingIndex = index;
- currentGUIElement = guiElement;
- }
- else
- {
- handleGuiElementSequence(parent, startingIndex, index - 1, builder, nodeFactory, result);
-
- return result;
- }
- }
-
- index++;
- }
-
- if (startingIndex > -1)
- {
- if (finalize && (startingIndex > 0))
- {
- handleGuiElementSequence
- (parent, startingIndex, parent.getChildren().size() - 1, builder, nodeFactory, result);
- }
- else
- {
- result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FEASIBLE);
- }
- }
-
- return result;
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param child
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- private GUIElement determineGUIElement(TaskTreeNode node)
- {
- if (node instanceof InteractionTask)
- {
- return ((InteractionTask) node).getGUIElement();
- }
- else
- {
- return null;
- }
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- */
- //-----------------------------------------------------------------------------------------------
- private void handleGuiElementSequence(TaskTreeNode parent,
- int startIndex,
- int endIndex,
- TaskTreeBuilder builder,
- TaskTreeNodeFactory nodeFactory,
- RuleApplicationResult result)
- {
- Sequence sequence = nodeFactory.createNewSequence();
-
- for (int i = startIndex; i <= endIndex; i++)
- {
- builder.addChild(sequence, parent.getChildren().get(startIndex));
- builder.removeChild((Sequence) parent, startIndex);
- }
-
- builder.addChild((Sequence) parent, startIndex, sequence);
-
- result.addNewlyCreatedParentNode(sequence);
- result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FINISHED);
- }
-
-}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/DefaultGuiEventSequenceDetectionRule.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/DefaultGuiEventSequenceDetectionRule.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/DefaultGuiEventSequenceDetectionRule.java (revision 557)
@@ -0,0 +1,125 @@
+// Module : $RCSfile: DefaultSequenceDetectionRule.java,v $
+// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 18.03.2012 $
+// Project : TaskTreeCreator
+// Creation : 2012 by patrick
+// Copyright : Patrick Harms, 2012
+
+
+package de.ugoe.cs.quest.tasktrees.temporalrelation;
+
+import de.ugoe.cs.quest.eventcore.gui.IInteraction;
+import de.ugoe.cs.quest.tasktrees.treeifc.IEventTask;
+import de.ugoe.cs.quest.tasktrees.treeifc.ISequence;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeBuilder;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNodeFactory;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: 18.03.2012$
+ * @author 2012, last modified by $Author: patrick$
+ */
+public class DefaultGuiEventSequenceDetectionRule implements TemporalRelationshipRule {
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.temporalrelation.TemporalRelationshipRule#apply(TaskTreeNode,
+ * TaskTreeBuilder, TaskTreeNodeFactory)
+ */
+ @Override
+ public RuleApplicationResult apply(ITaskTreeNode parent,
+ ITaskTreeBuilder builder,
+ ITaskTreeNodeFactory nodeFactory,
+ boolean finalize)
+ {
+ if (!(parent instanceof ISequence)) {
+ return null;
+ }
+
+ RuleApplicationResult result = new RuleApplicationResult();
+ int sequenceStartingIndex = -1;
+
+ int index = 0;
+ while (index < parent.getChildren().size()) {
+ ITaskTreeNode child = parent.getChildren().get(index);
+
+ if ((child instanceof IEventTask) &&
+ (((IEventTask) child).getEventType() instanceof IInteraction))
+ {
+ IInteraction eventType = (IInteraction) ((IEventTask) child).getEventType();
+
+ if (eventType.finishesLogicalSequence() && (sequenceStartingIndex > -1))
+ {
+ // There are several situations in which this implementation may cause infinite
+ // loops. This is because the rule manager will reapply rules until
+ // no rule is applied anymore. A sequence identified in a first iteration will
+ // be identified as a sequence also in a second iteration. As an example
+ // many sequences start with an interaction starting that sequence and end
+ // with an interaction ending that sequence. This will be reidentified as
+ // further subsequence. It must therefore be assured, that a sequence, that
+ // was once identified is not reidentified in a further application of the rule.
+ // For this, the implementation performs a kind of dry run. It creates a list of
+ // children that would belong to an identified sequence. Only if this list is
+ // not a reidentification then a new sequence is created and added to the
+ // parent. If it is a reidentification can be identified, if the list of
+ // children will contain all children of the parent, or if the list of children
+ // only consists of one sequence. Further, an identified sequence must at least
+ // have one child.
+ if (((sequenceStartingIndex != 0) ||
+ (index != (parent.getChildren().size() - 1))) &&
+ (((index - sequenceStartingIndex) > 0) ||
+ (((index - sequenceStartingIndex) == 0) &&
+ (!eventType.startsLogicalSequence()))))
+ {
+ boolean allNewChildrenAreSequences = true;
+
+ for (int j = sequenceStartingIndex;
+ ((allNewChildrenAreSequences) && (j < index)); j++)
+ {
+ allNewChildrenAreSequences &=
+ (parent.getChildren().get(j) instanceof ISequence);
+ }
+
+ if (!allNewChildrenAreSequences) {
+ ISequence sequence = nodeFactory.createNewSequence();
+
+ for (int j = sequenceStartingIndex; j < index; j++) {
+ builder.addChild
+ (sequence, parent.getChildren().get(sequenceStartingIndex));
+ builder.removeChild((ISequence) parent, sequenceStartingIndex);
+ }
+
+ if (!eventType.startsLogicalSequence()) {
+ builder.addChild
+ (sequence, parent.getChildren().get(sequenceStartingIndex));
+ builder.removeChild((ISequence) parent, sequenceStartingIndex);
+ }
+
+ builder.addChild((ISequence) parent, sequenceStartingIndex, sequence);
+
+ result.addNewlyCreatedParentNode(sequence);
+ result.setRuleApplicationStatus
+ (RuleApplicationStatus.RULE_APPLICATION_FINISHED);
+ return result;
+ }
+ }
+ }
+
+ if (eventType.startsLogicalSequence()) {
+ sequenceStartingIndex = index;
+ }
+ }
+
+ index++;
+ }
+
+ if (sequenceStartingIndex >= 0) {
+ result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FEASIBLE);
+ }
+
+ return result;
+ }
+
+}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/DefaultIterationDetectionRule.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/DefaultIterationDetectionRule.java (revision 556)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/DefaultIterationDetectionRule.java (revision 557)
@@ -1,3 +1,2 @@
-//-------------------------------------------------------------------------------------------------
// Module : $RCSfile: DefaultIterationDetectionRule.java,v $
// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 19.02.2012 $
@@ -5,5 +4,5 @@
// Creation : 2012 by patrick
// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
+
package de.ugoe.cs.quest.tasktrees.temporalrelation;
@@ -13,12 +12,11 @@
import de.ugoe.cs.quest.tasktrees.nodeequality.NodeEquality;
import de.ugoe.cs.quest.tasktrees.nodeequality.NodeEqualityRuleManager;
-import de.ugoe.cs.quest.tasktrees.treeifc.Iteration;
-import de.ugoe.cs.quest.tasktrees.treeifc.Selection;
-import de.ugoe.cs.quest.tasktrees.treeifc.Sequence;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeBuilder;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNodeFactory;
-
-//-------------------------------------------------------------------------------------------------
+import de.ugoe.cs.quest.tasktrees.treeifc.IIteration;
+import de.ugoe.cs.quest.tasktrees.treeifc.ISelection;
+import de.ugoe.cs.quest.tasktrees.treeifc.ISequence;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeBuilder;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNodeFactory;
+
/**
* TODO comment
@@ -27,263 +25,231 @@
* @author 2012, last modified by $Author: patrick$
*/
-//-------------------------------------------------------------------------------------------------
-public class DefaultIterationDetectionRule implements TemporalRelationshipRule
-{
- /** */
- private NodeEqualityRuleManager mNodeEqualityRuleManager;
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
+public class DefaultIterationDetectionRule implements TemporalRelationshipRule {
+
+ /** */
+ private NodeEqualityRuleManager nodeEqualityRuleManager;
+
+ /**
+ * TODO: comment
+ *
+ */
+ DefaultIterationDetectionRule(NodeEqualityRuleManager nodeEqualityRuleManager) {
+ super();
+ this.nodeEqualityRuleManager = nodeEqualityRuleManager;
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see TemporalRelationshipRule#apply(TaskTreeNode, TaskTreeBuilder, TaskTreeNodeFactory)
+ */
+ @Override
+ public RuleApplicationResult apply(ITaskTreeNode parent,
+ ITaskTreeBuilder treeBuilder,
+ ITaskTreeNodeFactory nodeFactory,
+ boolean finalize)
+ {
+ if (!(parent instanceof ISequence)) {
+ return null;
+ }
+
+ // parent must already have at least 2 children
+ if ((parent.getChildren() == null) || (parent.getChildren().size() < 2)) {
+ return null;
+ }
+
+ // iterations represent as a list of nodes that splits up in several equal sublists. If
+ // the remaining nodes also start an equal sublist, then the iteration may not be completed
+ // yet. So wait for further events to only identify completed iterations.
+
+ // to find longer iterations first, start with long sequences
+ for (int end = parent.getChildren().size() - 1; end > 0; end--) {
+ for (int start = 0; start < end; start++) {
+ List equalVariants =
+ getEqualSublistVariantsInBoundaries(parent, start, end);
+
+ if (equalVariants != null) {
+ if (!finalize) {
+ // check, if the iteration may go on. This may be the case, if the detected
+ // iteration finishes with the last child of the parent, or if the
+ // remaining children, which were not identified as part of the iteration,
+ // start a further occurrence of the iteration
+ if (end == (parent.getChildren().size() - 1)) {
+ RuleApplicationResult result = new RuleApplicationResult();
+ result.setRuleApplicationStatus
+ (RuleApplicationStatus.RULE_APPLICATION_FEASIBLE);
+ return result;
+ }
+
+ boolean allNodesEqual = true;
+ for (int i = 0; ((allNodesEqual) && (i < equalVariants.get(0).length)); i++)
+ {
+ if ((end + i + 1) >= parent.getChildren().size()) {
+ break;
+ }
+
+ NodeEquality nodeEquality = nodeEqualityRuleManager.applyRules
+ (equalVariants.get(0)[i], parent.getChildren().get(end + i + 1));
+
+ allNodesEqual &=
+ nodeEquality.isAtLeast(NodeEquality.SYNTACTICALLY_EQUAL);
+ }
+
+ if (allNodesEqual) {
+ RuleApplicationResult result = new RuleApplicationResult();
+ result.setRuleApplicationStatus
+ (RuleApplicationStatus.RULE_APPLICATION_FEASIBLE);
+ return result;
+ }
+ }
+
+ RuleApplicationResult result = new RuleApplicationResult();
+ IIteration newIteration = nodeFactory.createNewIteration();
+ result.addNewlyCreatedParentNode(newIteration);
+
+ if (equalVariants.size() == 1) {
+ // all children are the same. Create an iteration of this child
+ if (equalVariants.get(0).length == 1) {
+ // all children are the same. Create an iteration of this child
+ treeBuilder.setChild(newIteration, equalVariants.get(0)[0]);
+ }
+ else {
+ // there was an iteration of structurally equal sequences
+ ISequence sequence = nodeFactory.createNewSequence();
+ result.addNewlyCreatedParentNode(sequence);
+
+ for (ITaskTreeNode node : equalVariants.get(0)) {
+ treeBuilder.addChild(sequence, node);
+ }
+
+ treeBuilder.setChild(newIteration, sequence);
+ }
+ }
+ else {
+ // there are distinct variants of semantically equal subsequences or
+ // children -->
+ // create an iterated selection
+ ISelection selection = nodeFactory.createNewSelection();
+ result.addNewlyCreatedParentNode(selection);
+
+ for (ITaskTreeNode[] variant : equalVariants) {
+ if (variant.length == 1) {
+ treeBuilder.addChild(selection, variant[0]);
+ }
+ else {
+ ISequence sequence = nodeFactory.createNewSequence();
+ result.addNewlyCreatedParentNode(sequence);
+
+ for (ITaskTreeNode node : variant) {
+ treeBuilder.addChild(sequence, node);
+ }
+
+ treeBuilder.addChild(selection, sequence);
+ }
+ }
+
+ treeBuilder.setChild(newIteration, selection);
+ }
+
+ // remove iterated children
+ for (int j = end; j >= start; j--) {
+ treeBuilder.removeChild((ISequence) parent, j);
+ }
+
+ // add the new iteration instead
+ treeBuilder.addChild((ISequence) parent, start, newIteration);
+
+ result.setRuleApplicationStatus
+ (RuleApplicationStatus.RULE_APPLICATION_FINISHED);
+ return result;
+ }
+ }
+ }
+
+ return null;
+ }
+
+ /**
+ * TODO: comment
+ *
+ * @return
+ */
+ private List getEqualSublistVariantsInBoundaries(ITaskTreeNode parent,
+ int start,
+ int end)
+ {
+ List equalVariants = null;
+
+ int noOfChildrenInBoundaries = end - start + 1;
+
+ for (int subListLen = 1; subListLen <= (noOfChildrenInBoundaries / 2); subListLen++)
+ {
+ if ((noOfChildrenInBoundaries % subListLen) == 0) {
+ equalVariants =
+ getEqualSublistVariantsForSubListLength(parent, start, end, subListLen);
+
+ if (equalVariants != null) {
+ return equalVariants;
+ }
+ }
+ }
+
+ return null;
+ }
+
+ /**
*
*/
- //-----------------------------------------------------------------------------------------------
- DefaultIterationDetectionRule(NodeEqualityRuleManager nodeEqualityRuleManager)
- {
- super();
- mNodeEqualityRuleManager = nodeEqualityRuleManager;
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see TemporalRelationshipRule#apply(TaskTreeNode, TaskTreeBuilder, TaskTreeNodeFactory)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public RuleApplicationResult apply(TaskTreeNode parent,
- TaskTreeBuilder treeBuilder,
- TaskTreeNodeFactory nodeFactory,
- boolean finalize)
- {
- if (!(parent instanceof Sequence))
+ private List getEqualSublistVariantsForSubListLength(ITaskTreeNode parent,
+ int start,
+ int end,
+ int subListLen)
{
- return null;
- }
-
- // parent must already have at least 2 children
- if ((parent.getChildren() == null) || (parent.getChildren().size() < 2))
- {
- return null;
- }
-
- // iterations represent as a list of nodes that splits up in several equal sublists. If
- // the remaining nodes also start an equal sublist, then the iteration may not be completed
- // yet. So wait for further interactions to only identify completed iterations.
-
- // to find longer iterations first, start with long sequences
- for (int end = parent.getChildren().size() - 1; end > 0; end--)
- {
- for (int start = 0; start < end; start++)
- {
- List equalVariants =
- getEqualSublistVariantsInBoundaries(parent, start, end);
-
- if (equalVariants != null)
+ List equalVariants = new ArrayList();
+ ITaskTreeNode[] firstVariant = new ITaskTreeNode[subListLen];
+
+ for (int i = 0; i < subListLen; i++) {
+ firstVariant[i] = parent.getChildren().get(start + i);
+ }
+
+ equalVariants.add(firstVariant);
+
+ for (int parentIdx = (start + subListLen); parentIdx <= end; parentIdx += subListLen)
{
- if (!finalize)
- {
- // check, if the iteration may go on. This may be the case, if the detected iteration
- // finishes with the last child of the parent, or if the remaining children, which were
- // not identified as part of the iteration, start a further occurrence of the iteration
- if (end == (parent.getChildren().size() - 1))
- {
- RuleApplicationResult result = new RuleApplicationResult();
- result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FEASIBLE);
- return result;
- }
-
- boolean allNodesEqual = true;
- for (int i = 0; ((allNodesEqual) && (i < equalVariants.get(0).length)); i++)
- {
- if ((end + i + 1) >= parent.getChildren().size())
- {
- break;
- }
-
- NodeEquality nodeEquality = mNodeEqualityRuleManager.applyRules
- (equalVariants.get(0)[i], parent.getChildren().get(end + i + 1));
-
- allNodesEqual &=
- nodeEquality.getStructuralEquality() || nodeEquality.getSemanticalEquality();
- }
-
- if (allNodesEqual)
- {
- RuleApplicationResult result = new RuleApplicationResult();
- result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FEASIBLE);
- return result;
- }
- }
-
- RuleApplicationResult result = new RuleApplicationResult();
- Iteration newIteration = nodeFactory.createNewIteration();
- result.addNewlyCreatedParentNode(newIteration);
-
- if (equalVariants.size() == 1)
- {
- // all children are the same. Create an iteration of this child
- if (equalVariants.get(0).length == 1)
- {
- // all children are the same. Create an iteration of this child
- treeBuilder.setChild(newIteration, equalVariants.get(0)[0]);
- }
- else
- {
- // there was an iteration of structurally equal sequences
- Sequence sequence = nodeFactory.createNewSequence();
- result.addNewlyCreatedParentNode(sequence);
-
- for (TaskTreeNode node : equalVariants.get(0))
- {
- treeBuilder.addChild(sequence, node);
- }
-
- treeBuilder.setChild(newIteration, sequence);
- }
- }
- else
- {
- // there are distinct variants of semantically equal subsequences or children -->
- // create an iterated selection
- Selection selection = nodeFactory.createNewSelection();
- result.addNewlyCreatedParentNode(selection);
-
- for (TaskTreeNode[] variant : equalVariants)
- {
- if (variant.length == 1)
- {
- treeBuilder.addChild(selection, variant[0]);
- }
- else
- {
- Sequence sequence = nodeFactory.createNewSequence();
- result.addNewlyCreatedParentNode(sequence);
-
- for (TaskTreeNode node : variant)
- {
- treeBuilder.addChild(sequence, node);
- }
-
- treeBuilder.addChild(selection, sequence);
- }
- }
-
- treeBuilder.setChild(newIteration, selection);
- }
-
- // remove iterated children
- for (int j = end; j >= start; j--)
- {
- treeBuilder.removeChild((Sequence) parent, j);
- }
-
- // add the new iteration instead
- treeBuilder.addChild((Sequence) parent, start, newIteration);
-
- result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FINISHED);
- return result;
- }
- }
- }
-
- return null;
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- private List getEqualSublistVariantsInBoundaries(TaskTreeNode parent,
- int start,
- int end)
- {
- List equalVariants = null;
-
- int noOfChildrenInBoundaries = end - start + 1;
-
- for (int subListLength = 1; subListLength <= (noOfChildrenInBoundaries / 2); subListLength++)
- {
- if ((noOfChildrenInBoundaries % subListLength) == 0)
- {
- equalVariants = getEqualSublistVariantsForSubListLength(parent, start, end, subListLength);
-
- if (equalVariants != null)
- {
- return equalVariants;
- }
- }
- }
-
- return null;
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- *
- */
- //-----------------------------------------------------------------------------------------------
- private List getEqualSublistVariantsForSubListLength(TaskTreeNode parent,
- int start,
- int end,
- int subListLength)
- {
- List equalVariants = new ArrayList();
- TaskTreeNode[] firstVariant = new TaskTreeNode[subListLength];
-
- for (int i = 0; i < subListLength; i++)
- {
- firstVariant[i] = parent.getChildren().get(start + i);
- }
-
- equalVariants.add(firstVariant);
-
- for (int parentIdx = (start + subListLength); parentIdx <= end; parentIdx += subListLength)
- {
- TaskTreeNode[] otherVariant = new TaskTreeNode[subListLength];
-
- for (int i = 0; i < subListLength; i++)
- {
- NodeEquality nodeEquality = mNodeEqualityRuleManager.applyRules
- (firstVariant[i], parent.getChildren().get(parentIdx + i));
-
- if (!nodeEquality.getStructuralEquality())
- {
- if (nodeEquality.getSemanticalEquality())
- {
- otherVariant[i] = parent.getChildren().get(parentIdx + i);
- }
- else
- {
- return null;
- }
- }
- }
-
- // check, if there is a semantically equal other variant. If so, add it to the list of
- // variants
- boolean semanticallyUnequal = false;
- for (int i = 0; i < subListLength; i++)
- {
- if (otherVariant[i] == null)
- {
- otherVariant[i] = firstVariant[i];
- }
- else
- {
- semanticallyUnequal = true;
- }
- }
-
- if (semanticallyUnequal)
- {
- equalVariants.add(otherVariant);
- }
- }
-
- return equalVariants;
- }
+ ITaskTreeNode[] otherVariant = new ITaskTreeNode[subListLen];
+
+ for (int i = 0; i < subListLen; i++) {
+ NodeEquality nodeEquality = nodeEqualityRuleManager.applyRules
+ (firstVariant[i], parent.getChildren().get(parentIdx + i));
+
+ if (!nodeEquality.isAtLeast(NodeEquality.LEXICALLY_EQUAL)) {
+ if (nodeEquality.isAtLeast(NodeEquality.SEMANTICALLY_EQUAL)) {
+ otherVariant[i] = parent.getChildren().get(parentIdx + i);
+ }
+ else {
+ return null;
+ }
+ }
+ }
+
+ // check, if there is a semantically equal other variant. If so, add it to the list of
+ // variants
+ boolean semanticallyUnequal = false;
+ for (int i = 0; i < subListLen; i++) {
+ if (otherVariant[i] == null) {
+ otherVariant[i] = firstVariant[i];
+ }
+ else {
+ semanticallyUnequal = true;
+ }
+ }
+
+ if (semanticallyUnequal) {
+ equalVariants.add(otherVariant);
+ }
+ }
+
+ return equalVariants;
+ }
}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/DefaultMouseClickReductionRule.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/DefaultMouseClickReductionRule.java (revision 556)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/DefaultMouseClickReductionRule.java (revision 557)
@@ -1,3 +1,2 @@
-//-------------------------------------------------------------------------------------------------
// Module : $RCSfile: DefaultSequenceDetectionRule.java,v $
// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 18.03.2012 $
@@ -5,19 +4,18 @@
// Creation : 2012 by patrick
// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
+
package de.ugoe.cs.quest.tasktrees.temporalrelation;
-import de.ugoe.cs.quest.eventcore.guimodel.GUIElement;
-import de.ugoe.cs.quest.eventcore.userinteraction.MouseButtonDown;
-import de.ugoe.cs.quest.eventcore.userinteraction.MouseButtonInteraction;
-import de.ugoe.cs.quest.eventcore.userinteraction.MouseButtonUp;
-import de.ugoe.cs.quest.eventcore.userinteraction.MouseClick;
-import de.ugoe.cs.quest.tasktrees.treeifc.InteractionTask;
-import de.ugoe.cs.quest.tasktrees.treeifc.Sequence;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeBuilder;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNodeFactory;
+import de.ugoe.cs.quest.eventcore.IEventTarget;
+import de.ugoe.cs.quest.eventcore.gui.MouseButtonDown;
+import de.ugoe.cs.quest.eventcore.gui.MouseButtonInteraction;
+import de.ugoe.cs.quest.eventcore.gui.MouseButtonUp;
+import de.ugoe.cs.quest.eventcore.gui.MouseClick;
+import de.ugoe.cs.quest.tasktrees.treeifc.IEventTask;
+import de.ugoe.cs.quest.tasktrees.treeifc.ISequence;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeBuilder;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNodeFactory;
-//-------------------------------------------------------------------------------------------------
/**
* TODO comment
@@ -26,127 +24,113 @@
* @author 2012, last modified by $Author: patrick$
*/
-//-------------------------------------------------------------------------------------------------
-public class DefaultMouseClickReductionRule implements TemporalRelationshipRule
-{
+public class DefaultMouseClickReductionRule implements TemporalRelationshipRule {
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.temporalrelation.TemporalRelationshipRule#apply(TaskTreeNode, TaskTreeBuilder, TaskTreeNodeFactory)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public RuleApplicationResult apply(TaskTreeNode parent,
- TaskTreeBuilder builder,
- TaskTreeNodeFactory nodeFactory,
- boolean finalize)
- {
- if (!(parent instanceof Sequence))
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.temporalrelation.TemporalRelationshipRule#apply(TaskTreeNode,
+ * TaskTreeBuilder, TaskTreeNodeFactory)
+ */
+ @Override
+ public RuleApplicationResult apply(ITaskTreeNode parent,
+ ITaskTreeBuilder builder,
+ ITaskTreeNodeFactory nodeFactory,
+ boolean finalize)
{
- return null;
+ if (!(parent instanceof ISequence)) {
+ return null;
+ }
+
+ RuleApplicationResult result = new RuleApplicationResult();
+
+ int index = 0;
+ while (index < parent.getChildren().size() - 2) // -2 because we don't need to go to the end
+ {
+ if (mouseClickSequenceFound(parent.getChildren().get(index),
+ parent.getChildren().get(index + 1),
+ parent.getChildren().get(index + 2)))
+ {
+ builder.removeChild((ISequence) parent, index);
+ builder.removeChild((ISequence) parent, index);
+ result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FINISHED);
+ return result;
+ }
+ else if
+ ((parent.getChildren().get(index) instanceof ISequence) &&
+ (parent.getChildren().get(index).getChildren().size() == 2) &&
+ (mouseClickSequenceFound(parent.getChildren().get(index).getChildren().get(0),
+ parent.getChildren().get(index).getChildren().get(1),
+ parent.getChildren().get(index + 1))))
+ {
+ builder.removeChild((ISequence) parent, index);
+ result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FINISHED);
+ return result;
+ }
+
+ index++;
+ }
+
+ return result;
}
-
- RuleApplicationResult result = new RuleApplicationResult();
-
- int index = 0;
- while (index < parent.getChildren().size() - 2) // -2 because we don't need to go to the end
- {
- if (mouseClickSequenceFound(parent.getChildren().get(index),
- parent.getChildren().get(index + 1),
- parent.getChildren().get(index + 2)))
- {
- builder.removeChild((Sequence) parent, index);
- builder.removeChild((Sequence) parent, index);
- result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FINISHED);
- return result;
- }
- else if ((parent.getChildren().get(index) instanceof Sequence) &&
- (parent.getChildren().get(index).getChildren().size() == 2) &&
- (mouseClickSequenceFound(parent.getChildren().get(index).getChildren().get(0),
- parent.getChildren().get(index).getChildren().get(1),
- parent.getChildren().get(index + 1))))
- {
- builder.removeChild((Sequence) parent, index);
- result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FINISHED);
- return result;
- }
-
- index++;
- }
-
- return result;
- }
- //-----------------------------------------------------------------------------------------------
- /**
+ /**
*
*/
- //-----------------------------------------------------------------------------------------------
- private boolean mouseClickSequenceFound(TaskTreeNode mouseButtonDown,
- TaskTreeNode mouseButtonUp,
- TaskTreeNode mouseClick)
- {
- // check the first in a row of three for validity
- if (!(mouseButtonDown instanceof InteractionTask))
+ private boolean mouseClickSequenceFound(ITaskTreeNode mouseButtonDown,
+ ITaskTreeNode mouseButtonUp,
+ ITaskTreeNode mouseClick)
{
- return false;
+ // check the first in a row of three for validity
+ if (!(mouseButtonDown instanceof IEventTask)) {
+ return false;
+ }
+
+ IEventTarget eventTarget = ((IEventTask) mouseButtonDown).getEventTarget();
+
+ if (!(((IEventTask) mouseButtonDown).getEventType() instanceof MouseButtonDown)) {
+ return false;
+ }
+
+ MouseButtonInteraction.Button button =
+ ((MouseButtonDown) ((IEventTask) mouseButtonDown).getEventType()).getButton();
+
+ // check the second node for validity
+ if (!(mouseButtonUp instanceof IEventTask)) {
+ return false;
+ }
+
+ if (!eventTarget.equals(((IEventTask) mouseButtonUp).getEventTarget())) {
+ return false;
+ }
+
+ if (!(((IEventTask) mouseButtonUp).getEventType() instanceof MouseButtonUp)) {
+ return false;
+ }
+
+ if (!button.equals(((MouseButtonUp) ((IEventTask) mouseButtonUp).getEventType())
+ .getButton()))
+ {
+ return false;
+ }
+
+ // check the third node for validity
+ if (!(mouseClick instanceof IEventTask)) {
+ return false;
+ }
+
+ if (!eventTarget.equals(((IEventTask) mouseClick).getEventTarget())) {
+ return false;
+ }
+
+ if (!(((IEventTask) mouseClick).getEventType() instanceof MouseClick)) {
+ return false;
+ }
+
+ if (!button.equals(((MouseClick) ((IEventTask) mouseClick).getEventType()).getButton())) {
+ return false;
+ }
+
+ return true;
}
-
- GUIElement guiElement = ((InteractionTask) mouseButtonDown).getGUIElement();
-
- if (!(((InteractionTask) mouseButtonDown).getInteraction() instanceof MouseButtonDown))
- {
- return false;
- }
-
- MouseButtonInteraction.Button button =
- ((MouseButtonDown) ((InteractionTask) mouseButtonDown).getInteraction()).getButton();
-
-
- // check the second node for validity
- if (!(mouseButtonUp instanceof InteractionTask))
- {
- return false;
- }
-
- if (!guiElement.equals(((InteractionTask) mouseButtonUp).getGUIElement()))
- {
- return false;
- }
-
- if (!(((InteractionTask) mouseButtonUp).getInteraction() instanceof MouseButtonUp))
- {
- return false;
- }
-
- if (!button.equals
- (((MouseButtonUp) ((InteractionTask) mouseButtonUp).getInteraction()).getButton()))
- {
- return false;
- }
-
-
- // check the third node for validity
- if (!(mouseClick instanceof InteractionTask))
- {
- return false;
- }
-
- if (!guiElement.equals(((InteractionTask) mouseClick).getGUIElement()))
- {
- return false;
- }
-
- if (!(((InteractionTask) mouseClick).getInteraction() instanceof MouseClick))
- {
- return false;
- }
-
- if (!button.equals(((MouseClick) ((InteractionTask) mouseClick).getInteraction()).getButton()))
- {
- return false;
- }
-
- return true;
- }
}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/DefaultSequenceDetectionRule.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/DefaultSequenceDetectionRule.java (revision 556)
+++ (revision )
@@ -1,124 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: DefaultSequenceDetectionRule.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 18.03.2012 $
-// Project : TaskTreeCreator
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.temporalrelation;
-
-import de.ugoe.cs.quest.tasktrees.treeifc.InteractionTask;
-import de.ugoe.cs.quest.tasktrees.treeifc.Sequence;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeBuilder;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNodeFactory;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 18.03.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public class DefaultSequenceDetectionRule implements TemporalRelationshipRule
-{
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.temporalrelation.TemporalRelationshipRule#apply(TaskTreeNode, TaskTreeBuilder, TaskTreeNodeFactory)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public RuleApplicationResult apply(TaskTreeNode parent,
- TaskTreeBuilder builder,
- TaskTreeNodeFactory nodeFactory,
- boolean finalize)
- {
- if (!(parent instanceof Sequence))
- {
- return null;
- }
-
- RuleApplicationResult result = new RuleApplicationResult();
- int sequenceStartingIndex = -1;
-
- int index = 0;
- while (index < parent.getChildren().size())
- {
- TaskTreeNode child = parent.getChildren().get(index);
-
- if (child instanceof InteractionTask)
- {
- if (((InteractionTask) child).getInteraction().finishesLogicalSequence() &&
- (sequenceStartingIndex > -1))
- {
- // There are several situations in which this implementation may cause infinite
- // loops. This is because the rule manager will reapply rules until
- // no rule is applied anymore. A sequence identified in a first iteration will
- // be identified as a sequence also in a second iteration. As an example
- // many sequences start with an interaction starting that sequence and end
- // with an interaction ending that sequence. This will be reidentified as further
- // subsequence. It must therefore be assured, that a sequence, that was once
- // identified is not reidentified in a further application of the rule. For this,
- // the implementation performs a kind of dry run. It creates a list of children
- // that would belong to an identified sequence. Only if this list is not a
- // reidentification then a new sequence is created and added to the parent. If it
- // is a reidentification can be identified, if the list of children will contain
- // all children of the parent, or if the list of children only consists of one
- // sequence. Further, an identified sequence must at least have one child.
- if (((sequenceStartingIndex != 0) || (index != (parent.getChildren().size() - 1))) &&
- (((index - sequenceStartingIndex) > 0) ||
- (((index - sequenceStartingIndex) == 0) &&
- (!((InteractionTask) child).getInteraction().startsLogicalSequence()))))
- {
- boolean allNewChildrenAreSequences = true;
-
- for (int j = sequenceStartingIndex; ((allNewChildrenAreSequences) && (j < index)); j++)
- {
- allNewChildrenAreSequences &= (parent.getChildren().get(j) instanceof Sequence);
- }
-
- if (!allNewChildrenAreSequences)
- {
- Sequence sequence = nodeFactory.createNewSequence();
-
- for (int j = sequenceStartingIndex; j < index; j++)
- {
- builder.addChild(sequence, parent.getChildren().get(sequenceStartingIndex));
- builder.removeChild((Sequence) parent, sequenceStartingIndex);
- }
-
- if (!((InteractionTask) child).getInteraction().startsLogicalSequence())
- {
- builder.addChild(sequence, parent.getChildren().get(sequenceStartingIndex));
- builder.removeChild((Sequence) parent, sequenceStartingIndex);
- }
-
- builder.addChild((Sequence) parent, sequenceStartingIndex, sequence);
-
- result.addNewlyCreatedParentNode(sequence);
- result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FINISHED);
- return result;
- }
- }
- }
-
- if (((InteractionTask) child).getInteraction().startsLogicalSequence())
- {
- sequenceStartingIndex = index;
- }
- }
-
- index++;
- }
-
- if (sequenceStartingIndex >= 0)
- {
- result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FEASIBLE);
- }
-
- return result;
- }
-
-}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/DefaultTextInputReductionRule.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/DefaultTextInputReductionRule.java (revision 556)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/DefaultTextInputReductionRule.java (revision 557)
@@ -1,3 +1,2 @@
-//-------------------------------------------------------------------------------------------------
// Module : $RCSfile: DefaultSequenceDetectionRule.java,v $
// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 18.03.2012 $
@@ -5,5 +4,5 @@
// Creation : 2012 by patrick
// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
+
package de.ugoe.cs.quest.tasktrees.temporalrelation;
@@ -12,21 +11,20 @@
import java.util.Locale;
-import de.ugoe.cs.quest.eventcore.guimodel.GUIElement;
-import de.ugoe.cs.quest.eventcore.guimodel.TextArea;
-import de.ugoe.cs.quest.eventcore.guimodel.TextField;
-import de.ugoe.cs.quest.eventcore.userinteraction.KeyInteraction;
-import de.ugoe.cs.quest.eventcore.userinteraction.KeyPressed;
-import de.ugoe.cs.quest.eventcore.userinteraction.KeyReleased;
-import de.ugoe.cs.quest.tasktrees.treeifc.InteractionTask;
-import de.ugoe.cs.quest.tasktrees.treeifc.Sequence;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeBuilder;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNodeFactory;
-import de.ugoe.cs.quest.tasktrees.treeifc.TextInputInteractionTask;
+import de.ugoe.cs.quest.eventcore.IEventTarget;
+import de.ugoe.cs.quest.eventcore.gui.KeyInteraction;
+import de.ugoe.cs.quest.eventcore.gui.KeyPressed;
+import de.ugoe.cs.quest.eventcore.gui.KeyReleased;
+import de.ugoe.cs.quest.eventcore.guimodel.ITextArea;
+import de.ugoe.cs.quest.eventcore.guimodel.ITextField;
+import de.ugoe.cs.quest.tasktrees.treeifc.IEventTask;
+import de.ugoe.cs.quest.tasktrees.treeifc.ISequence;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeBuilder;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNodeFactory;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITextInputEventTask;
import de.ugoe.cs.tasktree.keyboardmaps.KeyboardMap;
import de.ugoe.cs.tasktree.keyboardmaps.KeyboardMapFactory;
import de.ugoe.cs.tasktree.keyboardmaps.VirtualKey;
-//-------------------------------------------------------------------------------------------------
/**
* TODO comment
@@ -35,239 +33,202 @@
* @author 2012, last modified by $Author: patrick$
*/
-//-------------------------------------------------------------------------------------------------
-public class DefaultTextInputReductionRule implements TemporalRelationshipRule
-{
- /** */
- private KeyboardMap mKeyboardMap = KeyboardMapFactory.createKeyboardMap(Locale.GERMAN);
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see TemporalRelationshipRule#apply(TaskTreeNode, TaskTreeBuilder, TaskTreeNodeFactory)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public RuleApplicationResult apply(TaskTreeNode parent,
- TaskTreeBuilder builder,
- TaskTreeNodeFactory nodeFactory,
- boolean finalize)
- {
- if ((!(parent instanceof Sequence)) ||
- (parent instanceof TextInputInteractionTask))
+public class DefaultTextInputReductionRule implements TemporalRelationshipRule {
+
+ /** */
+ private KeyboardMap keyboardMap = KeyboardMapFactory.createKeyboardMap(Locale.GERMAN);
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see TemporalRelationshipRule#apply(TaskTreeNode, TaskTreeBuilder, TaskTreeNodeFactory)
+ */
+ @Override
+ public RuleApplicationResult apply(ITaskTreeNode parent,
+ ITaskTreeBuilder builder,
+ ITaskTreeNodeFactory nodeFactory,
+ boolean finalize)
{
- return null;
- }
-
- RuleApplicationResult result = new RuleApplicationResult();
- int textEntryStartIndex = -1;
- GUIElement currentGUIElement = null;
-
- int index = 0;
- TaskTreeNode task = null;
- while (index < parent.getChildren().size())
+ if ((!(parent instanceof ISequence)) || (parent instanceof ITextInputEventTask)) {
+ return null;
+ }
+
+ RuleApplicationResult result = new RuleApplicationResult();
+ int textEntryStartIndex = -1;
+ IEventTarget currentEventTarget = null;
+
+ int index = 0;
+ ITaskTreeNode task = null;
+ while (index < parent.getChildren().size()) {
+ task = parent.getChildren().get(index);
+ if (isKeyInteraction(task) &&
+ isDataInputEventTarget(((IEventTask) task).getEventTarget()))
+ {
+ if (textEntryStartIndex < 0) {
+ textEntryStartIndex = index;
+ currentEventTarget = ((IEventTask) task).getEventTarget();
+ }
+ else if (!currentEventTarget.equals(((IEventTask) task).getEventTarget())) {
+ handleTextEntrySequence(parent, textEntryStartIndex, index - 1,
+ currentEventTarget, builder, nodeFactory, result);
+ return result;
+ }
+ }
+ else if (textEntryStartIndex >= 0) {
+ handleTextEntrySequence(parent, textEntryStartIndex, index - 1, currentEventTarget,
+ builder, nodeFactory, result);
+ return result;
+ }
+
+ index++;
+ }
+
+ if (textEntryStartIndex >= 0) {
+ if (finalize) {
+ handleTextEntrySequence(parent, textEntryStartIndex,
+ parent.getChildren().size() - 1, currentEventTarget,
+ builder, nodeFactory, result);
+ }
+ else {
+ result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FEASIBLE);
+ }
+ }
+
+ return result;
+ }
+
+ /**
+ * TODO: comment
+ *
+ * @param taskTreeNode
+ * @return
+ */
+ private boolean isKeyInteraction(ITaskTreeNode taskTreeNode) {
+ if ((taskTreeNode instanceof IEventTask)) {
+ return (((IEventTask) taskTreeNode).getEventType() instanceof KeyInteraction);
+ }
+ else {
+ return false;
+ }
+ }
+
+ /**
+ * TODO: comment
+ *
+ * @param textEntryStartIndex
+ * @param i
+ * @param result
+ * @return
+ */
+ private void handleTextEntrySequence(ITaskTreeNode parent,
+ int startIndex,
+ int endIndex,
+ IEventTarget eventTarget,
+ ITaskTreeBuilder builder,
+ ITaskTreeNodeFactory nodeFactory,
+ RuleApplicationResult result)
{
- task = parent.getChildren().get(index);
- if (isKeyInteraction(task) && isDataInputGUIElement(((InteractionTask) task).getGUIElement()))
- {
- if (textEntryStartIndex < 0)
- {
- textEntryStartIndex = index;
- currentGUIElement = ((InteractionTask) task).getGUIElement();
- }
- else if (!currentGUIElement.equals(((InteractionTask) task).getGUIElement()))
- {
- handleTextEntrySequence(parent, textEntryStartIndex, index - 1, currentGUIElement,
- builder, nodeFactory, result);
- return result;
- }
- }
- else if (textEntryStartIndex >= 0)
- {
- handleTextEntrySequence(parent, textEntryStartIndex, index - 1, currentGUIElement,
- builder, nodeFactory, result);
- return result;
- }
-
- index++;
- }
-
- if (textEntryStartIndex >= 0)
+ ITextInputEventTask textInput = nodeFactory.createNewTextInputEventTask(eventTarget);
+
+ for (int i = startIndex; i <= endIndex; i++) {
+ builder.addChild(textInput, parent.getChildren().get(startIndex));
+ builder.removeChild((ISequence) parent, startIndex);
+ }
+
+ builder.addChild((ISequence) parent, startIndex, textInput);
+
+ StringBuffer enteredText = new StringBuffer();
+ determineEnteredText(textInput, new ArrayList(), enteredText);
+ textInput.setEnteredText(enteredText.toString());
+
+ result.addNewlyCreatedParentNode(textInput);
+ result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FINISHED);
+ }
+
+ /**
+ * TODO: comment
+ *
+ * @param eventTarget
+ * @return
+ */
+ private boolean isDataInputEventTarget(IEventTarget eventTarget) {
+ return ((eventTarget instanceof ITextField) || (eventTarget instanceof ITextArea));
+ }
+
+ /**
+ * TODO: comment
+ *
+ * @param sequence
+ * @param enteredText
+ */
+ private void determineEnteredText(ITaskTreeNode node,
+ List pressedKeys,
+ StringBuffer enteredText)
{
- if (finalize)
- {
- handleTextEntrySequence(parent, textEntryStartIndex, parent.getChildren().size() - 1,
- currentGUIElement, builder, nodeFactory, result);
- }
- else
- {
- result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FEASIBLE);
- }
- }
-
- return result;
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param taskTreeNode
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- private boolean isKeyInteraction(TaskTreeNode taskTreeNode)
- {
- if ((taskTreeNode instanceof InteractionTask))
- {
- return (((InteractionTask) taskTreeNode).getInteraction() instanceof KeyInteraction);
- }
- else
- {
- return false;
- }
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param textEntryStartIndex
- * @param i
- * @param result
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- private void handleTextEntrySequence(TaskTreeNode parent,
- int startIndex,
- int endIndex,
- GUIElement guiElement,
- TaskTreeBuilder builder,
- TaskTreeNodeFactory nodeFactory,
- RuleApplicationResult result)
- {
- TextInputInteractionTask textInput = nodeFactory.createNewTextInputInteractionTask(guiElement);
-
- for (int i = startIndex; i <= endIndex; i++)
- {
- builder.addChild(textInput, parent.getChildren().get(startIndex));
- builder.removeChild((Sequence) parent, startIndex);
- }
-
- builder.addChild((Sequence) parent, startIndex, textInput);
-
- StringBuffer enteredText = new StringBuffer();
- determineEnteredText(textInput, new ArrayList(), enteredText);
- textInput.setEnteredText(enteredText.toString());
-
- result.addNewlyCreatedParentNode(textInput);
- result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FINISHED);
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param guiElement
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- private boolean isDataInputGUIElement(GUIElement guiElement)
- {
- return ((guiElement instanceof TextField) || (guiElement instanceof TextArea));
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param sequence
- * @param enteredText
- */
- //-----------------------------------------------------------------------------------------------
- private void determineEnteredText(TaskTreeNode node,
- List pressedKeys,
- StringBuffer enteredText)
- {
- if ((node instanceof Sequence) || (node instanceof TextInputInteractionTask))
- {
- for (TaskTreeNode child : node.getChildren())
- {
- if (child instanceof InteractionTask)
- {
- if (((InteractionTask) child).getInteraction() instanceof KeyPressed)
- {
- VirtualKey key = ((KeyPressed) ((InteractionTask) child).getInteraction()).getKey();
-
- pressedKeys.add(key);
-
- if (key == VirtualKey.BACK_SPACE)
- {
- if (enteredText.length() > 0)
- {
- enteredText.deleteCharAt(enteredText.length() - 1);
- }
- }
- else if (key == VirtualKey.ENTER)
- {
- // text fields only contain one line of code. Therefore the return is ignored.
- if (!(((InteractionTask) child).getGUIElement() instanceof TextField))
- {
- enteredText.append(getCharacter(key, pressedKeys));
- }
- }
- else
- {
- char theChar = getCharacter(key, pressedKeys);
- if (theChar != Character.UNASSIGNED)
- {
- enteredText.append(theChar);
- }
- }
- }
- else if (((InteractionTask) child).getInteraction() instanceof KeyReleased)
- {
- pressedKeys.remove(((KeyReleased) ((InteractionTask) child).getInteraction()).getKey());
- }
- }
- else
- {
- determineEnteredText(child, pressedKeys, enteredText);
- }
- }
- }
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param key
- * @param pressedKeys
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- private char getCharacter(VirtualKey key, List pressedKeys)
- {
- boolean numlock = false;
- boolean shift = false;
- boolean altgr = false;
-
- for (VirtualKey pressedKey : pressedKeys)
- {
- if (pressedKey.isShiftKey())
- {
- shift = !shift;
- }
- else if (pressedKey == VirtualKey.ALT_GRAPH)
- {
- altgr = !altgr;
- }
- else if (pressedKey == VirtualKey.NUM_LOCK)
- {
- numlock = !numlock;
- }
- }
-
- return mKeyboardMap.getCharacterFor(key, numlock, shift, altgr, false);
- }
+ if ((node instanceof ISequence) || (node instanceof ITextInputEventTask)) {
+ for (ITaskTreeNode child : node.getChildren()) {
+ if (child instanceof IEventTask) {
+ if (((IEventTask) child).getEventType() instanceof KeyPressed) {
+ VirtualKey key =
+ ((KeyPressed) ((IEventTask) child).getEventType()).getKey();
+
+ pressedKeys.add(key);
+
+ if (key == VirtualKey.BACK_SPACE) {
+ if (enteredText.length() > 0) {
+ enteredText.deleteCharAt(enteredText.length() - 1);
+ }
+ }
+ else if (key == VirtualKey.ENTER) {
+ // text fields only contain one line of code. Therefore the return is
+ // ignored.
+ if (!(((IEventTask) child).getEventTarget() instanceof ITextField)) {
+ enteredText.append(getCharacter(key, pressedKeys));
+ }
+ }
+ else {
+ char theChar = getCharacter(key, pressedKeys);
+ if (theChar != Character.UNASSIGNED) {
+ enteredText.append(theChar);
+ }
+ }
+ }
+ else if (((IEventTask) child).getEventType() instanceof KeyReleased) {
+ pressedKeys.remove
+ (((KeyReleased) ((IEventTask) child).getEventType()).getKey());
+ }
+ }
+ else {
+ determineEnteredText(child, pressedKeys, enteredText);
+ }
+ }
+ }
+ }
+
+ /**
+ * TODO: comment
+ *
+ * @param key
+ * @param pressedKeys
+ * @return
+ */
+ private char getCharacter(VirtualKey key, List pressedKeys) {
+ boolean numlock = false;
+ boolean shift = false;
+ boolean altgr = false;
+
+ for (VirtualKey pressedKey : pressedKeys) {
+ if (pressedKey.isShiftKey()) {
+ shift = !shift;
+ }
+ else if (pressedKey == VirtualKey.ALT_GRAPH) {
+ altgr = !altgr;
+ }
+ else if (pressedKey == VirtualKey.NUM_LOCK) {
+ numlock = !numlock;
+ }
+ }
+
+ return keyboardMap.getCharacterFor(key, numlock, shift, altgr, false);
+ }
}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/RuleApplicationResult.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/RuleApplicationResult.java (revision 556)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/RuleApplicationResult.java (revision 557)
@@ -1,3 +1,2 @@
-//-------------------------------------------------------------------------------------------------
// Module : $RCSfile: RuleApplicationResult.java,v $
// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 18.03.2012 $
@@ -5,5 +4,6 @@
// Creation : 2012 by patrick
// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
+
+
package de.ugoe.cs.quest.tasktrees.temporalrelation;
@@ -11,7 +11,6 @@
import java.util.List;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
-//-------------------------------------------------------------------------------------------------
/**
* TODO comment
@@ -20,73 +19,56 @@
* @author 2012, last modified by $Author: patrick$
*/
-//-------------------------------------------------------------------------------------------------
-public class RuleApplicationResult
-{
+public class RuleApplicationResult {
- /** */
- private RuleApplicationStatus mStatus = RuleApplicationStatus.RULE_NOT_APPLIED;
-
- /** */
- private List mNewParents = new ArrayList();
+ /** */
+ private RuleApplicationStatus status = RuleApplicationStatus.RULE_NOT_APPLIED;
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param b
- */
- //-----------------------------------------------------------------------------------------------
- public RuleApplicationResult()
- {
- // this is the default indicating nothing so far
- }
+ /** */
+ private List newParents = new ArrayList();
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param b
- */
- //-----------------------------------------------------------------------------------------------
- public void setRuleApplicationStatus(RuleApplicationStatus status)
- {
- mStatus = status;
- }
+ /**
+ * TODO: comment
+ *
+ * @param b
+ */
+ public RuleApplicationResult() {
+ // this is the default indicating nothing so far
+ }
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- public RuleApplicationStatus getRuleApplicationStatus()
- {
- return mStatus;
- }
+ /**
+ * TODO: comment
+ *
+ * @param b
+ */
+ public void setRuleApplicationStatus(RuleApplicationStatus status) {
+ this.status = status;
+ }
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param sequence
- */
- //-----------------------------------------------------------------------------------------------
- public void addNewlyCreatedParentNode(TaskTreeNode newParent)
- {
- mNewParents.add(newParent);
- }
+ /**
+ * TODO: comment
+ *
+ * @return
+ */
+ public RuleApplicationStatus getRuleApplicationStatus() {
+ return status;
+ }
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- public List getNewlyCreatedParentNodes()
- {
- return mNewParents;
- }
+ /**
+ * TODO: comment
+ *
+ * @param sequence
+ */
+ public void addNewlyCreatedParentNode(ITaskTreeNode newParent) {
+ newParents.add(newParent);
+ }
+
+ /**
+ * TODO: comment
+ *
+ * @return
+ */
+ public List getNewlyCreatedParentNodes() {
+ return newParents;
+ }
}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/RuleApplicationStatus.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/RuleApplicationStatus.java (revision 556)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/RuleApplicationStatus.java (revision 557)
@@ -1,3 +1,2 @@
-//-------------------------------------------------------------------------------------------------
// Module : $RCSfile: RuleApplicationStatus.java,v $
// Version : $Revision: 0.0 $ $Author: pharms $ $Date: 09.07.2012 $
@@ -5,8 +4,8 @@
// Creation : 2012 by pharms
// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
+
+
package de.ugoe.cs.quest.tasktrees.temporalrelation;
-//-------------------------------------------------------------------------------------------------
/**
* TODO comment
@@ -15,9 +14,7 @@
* @author 2012, last modified by $Author: pharms$
*/
-//-------------------------------------------------------------------------------------------------
-public enum RuleApplicationStatus
-{
- RULE_APPLICATION_FINISHED,
- RULE_APPLICATION_FEASIBLE,
- RULE_NOT_APPLIED;
+public enum RuleApplicationStatus {
+ RULE_APPLICATION_FINISHED,
+ RULE_APPLICATION_FEASIBLE,
+ RULE_NOT_APPLIED;
}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/TemporalRelationshipRule.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/TemporalRelationshipRule.java (revision 556)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/TemporalRelationshipRule.java (revision 557)
@@ -1,3 +1,2 @@
-//-------------------------------------------------------------------------------------------------
// Module : $RCSfile: TemporalRelationshipRule.java,v $
// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 12.02.2012 $
@@ -5,12 +4,11 @@
// Creation : 2012 by patrick
// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
+
package de.ugoe.cs.quest.tasktrees.temporalrelation;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeBuilder;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNodeFactory;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeBuilder;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNodeFactory;
-//-------------------------------------------------------------------------------------------------
/**
* TODO comment
@@ -19,18 +17,14 @@
* @author 2012, last modified by $Author: patrick$
*/
-//-------------------------------------------------------------------------------------------------
-public interface TemporalRelationshipRule
-{
+public interface TemporalRelationshipRule {
- //-----------------------------------------------------------------------------------------------
/**
* applies the rule to the given situation and returns a rule application result, if this was
* successful
*/
- //-----------------------------------------------------------------------------------------------
- public RuleApplicationResult apply(TaskTreeNode parent,
- TaskTreeBuilder builder,
- TaskTreeNodeFactory nodeFactory,
- boolean finalize);
+ public RuleApplicationResult apply(ITaskTreeNode parent,
+ ITaskTreeBuilder builder,
+ ITaskTreeNodeFactory nodeFactory,
+ boolean finalize);
}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/TemporalRelationshipRuleManager.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/TemporalRelationshipRuleManager.java (revision 556)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/TemporalRelationshipRuleManager.java (revision 557)
@@ -1,3 +1,2 @@
-//-------------------------------------------------------------------------------------------------
// Module : $RCSfile: TemporalRelationshipRuleManager.java,v $
// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 12.02.2012 $
@@ -5,5 +4,5 @@
// Creation : 2012 by patrick
// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
+
package de.ugoe.cs.quest.tasktrees.temporalrelation;
@@ -13,9 +12,8 @@
import de.ugoe.cs.quest.tasktrees.nodeequality.NodeEqualityRuleManager;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeBuilder;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNodeFactory;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeBuilder;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNodeFactory;
-//-------------------------------------------------------------------------------------------------
/**
* TODO comment
@@ -24,143 +22,123 @@
* @author 2012, last modified by $Author: patrick$
*/
-//-------------------------------------------------------------------------------------------------
-public class TemporalRelationshipRuleManager
-{
- /** */
- private static Logger LOG = Logger.getLogger(TemporalRelationshipRuleManager.class.getName());
+public class TemporalRelationshipRuleManager {
+
+ /** */
+ private static Logger LOG = Logger.getLogger(TemporalRelationshipRuleManager.class.getName());
- /** */
- private NodeEqualityRuleManager mNodeEqualityRuleManager;
+ /** */
+ private NodeEqualityRuleManager nodeEqualityRuleManager;
- /** */
- private List mRuleIndex = new ArrayList();
+ /** */
+ private List ruleIndex = new ArrayList();
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
+ /**
+ * TODO: comment
+ *
+ */
+ public TemporalRelationshipRuleManager(NodeEqualityRuleManager nodeEqualityRuleManager) {
+ super();
+ this.nodeEqualityRuleManager = nodeEqualityRuleManager;
+ }
+
+ /**
+ * TODO: comment
+ *
+ */
+ public void init() {
+ LOG.info("initializing");
+
+ ruleIndex.add(new DefaultMouseClickReductionRule());
+ ruleIndex.add(new DefaultTextInputReductionRule());
+ ruleIndex.add(new DefaultEventTargetSequenceDetectionRule());
+ ruleIndex.add(new TrackBarSelectionDetectionRule(nodeEqualityRuleManager));
+ ruleIndex.add(new DefaultGuiEventSequenceDetectionRule());
+ ruleIndex.add(new DefaultIterationDetectionRule(nodeEqualityRuleManager));
+ }
+
+ /**
+ * returns true, if there is a rule that matches the current situation and if, therefore, a new
+ * temporal relationship has been added to the tree.
+ *
+ * @param parent
+ * @param newChild
+ * @return
+ */
+ public void applyRules(ITaskTreeNode parent,
+ ITaskTreeBuilder builder,
+ ITaskTreeNodeFactory nodeFactory,
+ boolean finalize)
+ {
+ applyRules(parent, builder, nodeFactory, finalize, "");
+ }
+
+ /**
+ * returns true, if there is a rule that matches the current situation and if, therefore, a new
+ * temporal relationship has been added to the tree.
+ *
+ * @param parent
+ * @param newChild
+ * @return
+ */
+ private int applyRules(ITaskTreeNode parent,
+ ITaskTreeBuilder builder,
+ ITaskTreeNodeFactory nodeFactory,
+ boolean finalize,
+ String logIndent)
+ {
+ LOG.info(logIndent + "applying rules for " + parent);
+
+ int noOfRuleApplications = 0;
+
+ for (TemporalRelationshipRule rule : ruleIndex) {
+ RuleApplicationResult result;
+ do {
+ // LOG.info(logIndent + "trying to apply rule " + rule + " on " + parent);
+ result = rule.apply(parent, builder, nodeFactory, finalize);
+
+ if ((result != null) &&
+ (result.getRuleApplicationStatus() ==
+ RuleApplicationStatus.RULE_APPLICATION_FINISHED))
+ {
+ LOG.info(logIndent + "applied rule " + rule + " on " + parent);
+ noOfRuleApplications++;
+
+ for (ITaskTreeNode newParent : result.getNewlyCreatedParentNodes()) {
+ noOfRuleApplications +=
+ applyRules(newParent, builder, nodeFactory, true, logIndent + " ");
+ }
+ }
+ }
+ while ((result != null) &&
+ (result.getRuleApplicationStatus() ==
+ RuleApplicationStatus.RULE_APPLICATION_FINISHED));
+
+ if ((!finalize) &&
+ (result != null) &&
+ (result.getRuleApplicationStatus() ==
+ RuleApplicationStatus.RULE_APPLICATION_FEASIBLE))
+ {
+ // in this case, don't go on applying rules, which should not be applied yet
+ break;
+ }
+ }
+
+ if (noOfRuleApplications <= 0) {
+ LOG.warning(logIndent + "no rules applied --> no temporal relationship generated");
+ }
+
+ return noOfRuleApplications;
+ }
+
+ /**
*
*/
- //-----------------------------------------------------------------------------------------------
- public TemporalRelationshipRuleManager(NodeEqualityRuleManager nodeEqualityRuleManager)
- {
- super();
- mNodeEqualityRuleManager = nodeEqualityRuleManager;
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- */
- //-----------------------------------------------------------------------------------------------
- public void init()
- {
- LOG.info("initializing");
-
- mRuleIndex.add(new DefaultMouseClickReductionRule());
- mRuleIndex.add(new DefaultTextInputReductionRule());
- mRuleIndex.add(new DefaultGUIElementSequenceDetectionRule());
- mRuleIndex.add(new TrackBarSelectionDetectionRule(mNodeEqualityRuleManager));
- mRuleIndex.add(new DefaultSequenceDetectionRule());
- mRuleIndex.add(new DefaultIterationDetectionRule(mNodeEqualityRuleManager));
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * returns true, if there is a rule that matches the current situation and if, therefore, a
- * new temporal relationship has been added to the tree.
- *
- * @param parent
- * @param newChild
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- public void applyRules(TaskTreeNode parent,
- TaskTreeBuilder builder,
- TaskTreeNodeFactory nodeFactory,
- boolean finalize)
- {
- applyRules(parent, builder, nodeFactory, finalize, "");
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * returns true, if there is a rule that matches the current situation and if, therefore, a
- * new temporal relationship has been added to the tree.
- *
- * @param parent
- * @param newChild
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- private int applyRules(TaskTreeNode parent,
- TaskTreeBuilder builder,
- TaskTreeNodeFactory nodeFactory,
- boolean finalize,
- String logIndent)
- {
- LOG.info(logIndent + "applying rules for " + parent);
-
- int noOfRuleApplications = 0;
-
- for (TemporalRelationshipRule rule : mRuleIndex)
- {
- RuleApplicationResult result;
- do
- {
- //LOG.info(logIndent + "trying to apply rule " + rule + " on " + parent);
- result = rule.apply(parent, builder, nodeFactory, finalize);
-
- if ((result != null) &&
- (result.getRuleApplicationStatus() == RuleApplicationStatus.RULE_APPLICATION_FINISHED))
- {
- LOG.info(logIndent + "applied rule " + rule + " on " + parent);
- noOfRuleApplications++;
-
- for (TaskTreeNode newParent : result.getNewlyCreatedParentNodes())
- {
- noOfRuleApplications +=
- applyRules(newParent, builder, nodeFactory, true, logIndent + " ");
- }
- }
- }
- while ((result != null) &&
- (result.getRuleApplicationStatus() == RuleApplicationStatus.RULE_APPLICATION_FINISHED));
-
- if ((!finalize) && (result != null) &&
- (result.getRuleApplicationStatus() == RuleApplicationStatus.RULE_APPLICATION_FEASIBLE))
- {
- // in this case, don't go on applying rules, which should not be applied yet
- break;
- }
- }
-
- if (noOfRuleApplications <= 0)
- {
- LOG.warning(logIndent + "no rules applied --> no temporal relationship generated");
- }
-
- return noOfRuleApplications;
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- *
- */
- //-----------------------------------------------------------------------------------------------
- /*private void dumpTask(TaskTreeNode task, String indent)
- {
- System.err.print(indent);
- System.err.print(task);
- System.err.println(" ");
-
- if ((task.getChildren() != null) && (task.getChildren().size() > 0))
- {
- for (TaskTreeNode child : task.getChildren())
- {
- dumpTask(child, indent + " ");
- }
- }
- }*/
+ /*
+ * private void dumpTask(TaskTreeNode task, String indent) { System.err.print(indent);
+ * System.err.print(task); System.err.println(" ");
+ *
+ * if ((task.getChildren() != null) && (task.getChildren().size() > 0)) { for (TaskTreeNode
+ * child : task.getChildren()) { dumpTask(child, indent + " "); } } }
+ */
}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/TrackBarSelectionDetectionRule.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/TrackBarSelectionDetectionRule.java (revision 556)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/temporalrelation/TrackBarSelectionDetectionRule.java (revision 557)
@@ -1,3 +1,2 @@
-//-------------------------------------------------------------------------------------------------
// Module : $RCSfile: TrackBarSelectionDetectionRule.java,v $
// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 28.04.2012 $
@@ -5,20 +4,19 @@
// Creation : 2012 by patrick
// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
+
package de.ugoe.cs.quest.tasktrees.temporalrelation;
-import de.ugoe.cs.quest.eventcore.guimodel.TrackBar;
-import de.ugoe.cs.quest.eventcore.userinteraction.ValueSelection;
+import de.ugoe.cs.quest.eventcore.gui.ValueSelection;
+import de.ugoe.cs.quest.eventcore.guimodel.ITrackBar;
import de.ugoe.cs.quest.tasktrees.nodeequality.NodeEquality;
import de.ugoe.cs.quest.tasktrees.nodeequality.NodeEqualityRuleManager;
-import de.ugoe.cs.quest.tasktrees.treeifc.InteractionTask;
-import de.ugoe.cs.quest.tasktrees.treeifc.Iteration;
-import de.ugoe.cs.quest.tasktrees.treeifc.Selection;
-import de.ugoe.cs.quest.tasktrees.treeifc.Sequence;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeBuilder;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNodeFactory;
+import de.ugoe.cs.quest.tasktrees.treeifc.IEventTask;
+import de.ugoe.cs.quest.tasktrees.treeifc.IIteration;
+import de.ugoe.cs.quest.tasktrees.treeifc.ISelection;
+import de.ugoe.cs.quest.tasktrees.treeifc.ISequence;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeBuilder;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNodeFactory;
-//-------------------------------------------------------------------------------------------------
/**
* TODO comment
@@ -27,194 +25,171 @@
* @author 2012, last modified by $Author: patrick$
*/
-//-------------------------------------------------------------------------------------------------
-public class TrackBarSelectionDetectionRule implements TemporalRelationshipRule
-{
+public class TrackBarSelectionDetectionRule implements TemporalRelationshipRule {
- /** */
- private NodeEqualityRuleManager mNodeEqualityRuleManager;
+ /** */
+ private NodeEqualityRuleManager nodeEqualityRuleManager;
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
+ /**
+ * TODO: comment
+ *
+ */
+ TrackBarSelectionDetectionRule(NodeEqualityRuleManager nodeEqualityRuleManager) {
+ super();
+ this.nodeEqualityRuleManager = nodeEqualityRuleManager;
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see TemporalRelationshipRule#apply(TaskTreeNode, TaskTreeBuilder, TaskTreeNodeFactory)
+ */
+ @Override
+ public RuleApplicationResult apply(ITaskTreeNode parent,
+ ITaskTreeBuilder builder,
+ ITaskTreeNodeFactory nodeFactory,
+ boolean finalize)
+ {
+ if (!(parent instanceof ISequence)) {
+ return null;
+ }
+
+ RuleApplicationResult result = new RuleApplicationResult();
+
+ int valueSelectionStartIndex = -1;
+
+ int index = 0;
+ while (index < parent.getChildren().size()) {
+ ITaskTreeNode child = parent.getChildren().get(index);
+
+ if ((child instanceof IEventTask) &&
+ (((IEventTask) child).getEventTarget() instanceof ITrackBar) &&
+ (((IEventTask) child).getEventType() instanceof ValueSelection))
+ {
+ if (valueSelectionStartIndex < 0) {
+ // let the show begin
+ valueSelectionStartIndex = index;
+ }
+ }
+ else if (valueSelectionStartIndex >= 0) {
+ // current child is no more value selection. But the preceding tasks were.
+ // Therefore,
+ // create an iteration with the different selectable values as selection children
+ handleValueSelections(valueSelectionStartIndex, index - 1, parent, builder,
+ nodeFactory, result);
+
+ return result;
+ }
+
+ index++;
+ }
+
+ if (valueSelectionStartIndex >= 0) {
+ if (finalize) {
+ handleValueSelections(valueSelectionStartIndex, parent.getChildren().size() - 1,
+ parent, builder, nodeFactory, result);
+ }
+ else {
+ result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FEASIBLE);
+ }
+ }
+
+ return result;
+ }
+
+ /**
+ * TODO: comment
+ *
+ * @param valueSelectionStartIndex
+ * @param i
+ */
+ private void handleValueSelections(int startIndex,
+ int endIndex,
+ ITaskTreeNode parent,
+ ITaskTreeBuilder builder,
+ ITaskTreeNodeFactory nodeFactory,
+ RuleApplicationResult result)
+ {
+ IIteration iteration = nodeFactory.createNewIteration();
+ result.addNewlyCreatedParentNode(iteration);
+
+ ISelection selection = nodeFactory.createNewSelection();
+ result.addNewlyCreatedParentNode(selection);
+ builder.setChild(iteration, selection);
+
+ for (int i = endIndex - startIndex; i >= 0; i--) {
+ addChildIfNecessary(selection, parent.getChildren().get(startIndex), builder,
+ nodeFactory, result);
+ builder.removeChild((ISequence) parent, startIndex);
+ }
+
+ builder.addChild((ISequence) parent, startIndex, iteration);
+
+ result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FINISHED);
+ }
+
+ /**
*
*/
- //-----------------------------------------------------------------------------------------------
- TrackBarSelectionDetectionRule(NodeEqualityRuleManager nodeEqualityRuleManager)
- {
- super();
- mNodeEqualityRuleManager = nodeEqualityRuleManager;
- }
+ private void addChildIfNecessary(ISelection parentSelection,
+ ITaskTreeNode node,
+ ITaskTreeBuilder builder,
+ ITaskTreeNodeFactory nodeFactory,
+ RuleApplicationResult result)
+ {
+ for (int i = 0; i < parentSelection.getChildren().size(); i++) {
+ ITaskTreeNode child = parentSelection.getChildren().get(i);
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see TemporalRelationshipRule#apply(TaskTreeNode, TaskTreeBuilder, TaskTreeNodeFactory)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public RuleApplicationResult apply(TaskTreeNode parent,
- TaskTreeBuilder builder,
- TaskTreeNodeFactory nodeFactory,
- boolean finalize)
- {
- if (!(parent instanceof Sequence))
- {
- return null;
- }
-
- RuleApplicationResult result = new RuleApplicationResult();
-
- int valueSelectionStartIndex = -1;
-
- int index = 0;
- while (index < parent.getChildren().size())
- {
- TaskTreeNode child = parent.getChildren().get(index);
-
- if ((child instanceof InteractionTask) &&
- (((InteractionTask) child).getGUIElement() instanceof TrackBar) &&
- (((InteractionTask) child).getInteraction() instanceof ValueSelection))
- {
- if (valueSelectionStartIndex < 0)
- {
- // let the show begin
- valueSelectionStartIndex = index;
- }
- }
- else if (valueSelectionStartIndex >= 0)
- {
- // current child is no more value selection. But the preceding tasks were. Therefore,
- // create an iteration with the different selectable values as selection children
- handleValueSelections
- (valueSelectionStartIndex, index - 1, parent, builder, nodeFactory, result);
-
- return result;
- }
-
- index++;
- }
-
- if (valueSelectionStartIndex >= 0)
- {
- if (finalize)
- {
- handleValueSelections(valueSelectionStartIndex, parent.getChildren().size() - 1, parent,
- builder, nodeFactory, result);
- }
- else
- {
- result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FEASIBLE);
- }
- }
-
- return result;
- }
+ if (child instanceof IEventTask) {
+ // check, if the new node is a variant for the current event task
+ NodeEquality nodeEquality = nodeEqualityRuleManager.applyRules(child, node);
+ if (nodeEquality.isAtLeast(NodeEquality.SEMANTICALLY_EQUAL)) {
+ // the node is a variant. If it not structurally equal, a new sub-selection for
+ // the existing and the new node must be created. Otherwise, the new node does
+ // not need to be added
+ if (!nodeEquality.isAtLeast(NodeEquality.LEXICALLY_EQUAL)) {
+ ISelection selection = nodeFactory.createNewSelection();
+ result.addNewlyCreatedParentNode(selection);
+ builder.addChild(parentSelection, selection);
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param valueSelectionStartIndex
- * @param i
- */
- //-----------------------------------------------------------------------------------------------
- private void handleValueSelections(int startIndex,
- int endIndex,
- TaskTreeNode parent,
- TaskTreeBuilder builder,
- TaskTreeNodeFactory nodeFactory,
- RuleApplicationResult result)
- {
- Iteration iteration = nodeFactory.createNewIteration();
- result.addNewlyCreatedParentNode(iteration);
-
- Selection selection = nodeFactory.createNewSelection();
- result.addNewlyCreatedParentNode(selection);
- builder.setChild(iteration, selection);
-
- for (int i = endIndex - startIndex; i >= 0 ; i--)
- {
- addChildIfNecessary
- (selection, parent.getChildren().get(startIndex), builder, nodeFactory, result);
- builder.removeChild((Sequence) parent, startIndex);
- }
-
- builder.addChild((Sequence) parent, startIndex, iteration);
-
- result.setRuleApplicationStatus(RuleApplicationStatus.RULE_APPLICATION_FINISHED);
- }
+ builder.addChild(selection, child);
+ builder.addChild(selection, node);
+ builder.removeChild(parentSelection, child);
+ }
- //-----------------------------------------------------------------------------------------------
- /**
- *
- */
- //-----------------------------------------------------------------------------------------------
- private void addChildIfNecessary(Selection parentSelection,
- TaskTreeNode node,
- TaskTreeBuilder builder,
- TaskTreeNodeFactory nodeFactory,
- RuleApplicationResult result)
- {
- for (int i = 0; i < parentSelection.getChildren().size(); i++)
- {
- TaskTreeNode child = parentSelection.getChildren().get(i);
+ return;
+ }
+ }
+ else if (child instanceof ISelection) {
+ // check, if the new node is a variant for the semantically equal children of the
+ // current
+ // selection
+ boolean addNode = true;
+ for (int j = 0; j < child.getChildren().size(); j++) {
+ NodeEquality nodeEquality = nodeEqualityRuleManager.applyRules(child, node);
+ if (!nodeEquality.isAtLeast(NodeEquality.SEMANTICALLY_EQUAL)) {
+ // the new node is no semantical equivalent of the nodes in the current
+ // selection - break up
+ addNode = false;
+ break;
+ }
+ else if (nodeEquality.isAtLeast(NodeEquality.LEXICALLY_EQUAL)) {
+ addNode = false;
+ break;
+ }
+ }
- if (child instanceof InteractionTask)
- {
- // check, if the new node is a variant for the current interaction task
- NodeEquality nodeEquality = mNodeEqualityRuleManager.applyRules(child, node);
- if (nodeEquality.getSemanticalEquality())
- {
- // the node is a variant. If it not structurally equal, a new sub-selection for the
- // existing and the new node must be created. Otherwise, the new node does not need
- // to be added
- if (!nodeEquality.getStructuralEquality())
- {
- Selection selection = nodeFactory.createNewSelection();
- result.addNewlyCreatedParentNode(selection);
- builder.addChild(parentSelection, selection);
-
- builder.addChild(selection, child);
- builder.addChild(selection, node);
- builder.removeChild(parentSelection, child);
- }
-
- return;
- }
- }
- else if (child instanceof Selection)
- {
- // check, if the new node is a variant for the semantically equal children of the current
- // selection
- boolean addNode = true;
- for (int j = 0; j < child.getChildren().size(); j++)
- {
- NodeEquality nodeEquality = mNodeEqualityRuleManager.applyRules(child, node);
- if (!nodeEquality.getSemanticalEquality())
- {
- // the new node is no semantical equivalent of the nodes in the current selection -
- // break up
- addNode = false;
- break;
- }
- else if (nodeEquality.getStructuralEquality())
- {
- addNode = false;
- break;
- }
+ if (addNode) {
+ // the node is a semantical equivalent to all the nodes in the existing
+ // sub-selection
+ // but it is not structurally identical to either of them. Therefore add it.
+ builder.addChild((ISelection) child, node);
+ return;
+ }
+ }
}
- if (addNode)
- {
- // the node is a semantical equivalent to all the nodes in the existing sub-selection
- // but it is not structurally identical to either of them. Therefore add it.
- builder.addChild((Selection) child, node);
- return;
- }
- }
+ // if we did not return in the previous checks, then the node must be added
+ builder.addChild(parentSelection, node);
}
-
- // if we did not return in the previous checks, then the node must be added
- builder.addChild(parentSelection, node);
- }
}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/AbstractTask.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/AbstractTask.java (revision 556)
+++ (revision )
@@ -1,22 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: AbstractTask.java,v $
-// Version : $Revision: 0.0 $ $Author: Patrick $ $Date: 06.11.2011 12:53:24 $
-// Project : TaskTreePerformanceTest
-// Creation : 2011 by Patrick
-// Copyright : Patrick Harms, 2011
-//-------------------------------------------------------------------------------------------------
-
-package de.ugoe.cs.quest.tasktrees.treeifc;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: $
- * @author 2011, last modified by $Author: $
- */
-//-------------------------------------------------------------------------------------------------
-public interface AbstractTask extends TaskTreeNode
-{
-
-}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/IEventTask.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/IEventTask.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/IEventTask.java (revision 557)
@@ -0,0 +1,37 @@
+// Module : $RCSfile: InteractionTask.java,v $
+// Version : $Revision: 0.0 $ $Author: Patrick $ $Date: 08.11.2011 19:44:52 $
+// Project : TaskTreePerformanceTest
+// Creation : 2011 by Patrick
+// Copyright : Patrick Harms, 2011
+
+package de.ugoe.cs.quest.tasktrees.treeifc;
+
+import de.ugoe.cs.quest.eventcore.IEventTarget;
+import de.ugoe.cs.quest.eventcore.IEventType;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: $
+ * @author 2011, last modified by $Author: $
+ */
+public interface IEventTask extends ITaskTreeNode {
+
+ /**
+ * @return Returns the event type.
+ */
+ public IEventType getEventType();
+
+ /**
+ * @return Returns the event target.
+ */
+ public IEventTarget getEventTarget();
+
+ /**
+ * TODO: comment
+ *
+ * @return
+ */
+ public IEventTask clone();
+
+}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/IIteration.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/IIteration.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/IIteration.java (revision 557)
@@ -0,0 +1,24 @@
+// Module : $RCSfile: Iteration.java,v $
+// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 21.02.2012 $
+// Project : TaskTreeCreator
+// Creation : 2012 by patrick
+// Copyright : Patrick Harms, 2012
+
+package de.ugoe.cs.quest.tasktrees.treeifc;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: 21.02.2012$
+ * @author 2012, last modified by $Author: patrick$
+ */
+public interface IIteration extends ITemporalRelationship {
+
+ /**
+ * TODO: comment
+ *
+ * @return
+ */
+ public IIteration clone();
+
+}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ISelection.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ISelection.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ISelection.java (revision 557)
@@ -0,0 +1,24 @@
+// Module : $RCSfile: Selection.java,v $
+// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 21.02.2012 $
+// Project : TaskTreeCreator
+// Creation : 2012 by patrick
+// Copyright : Patrick Harms, 2012
+
+package de.ugoe.cs.quest.tasktrees.treeifc;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: 21.02.2012$
+ * @author 2012, last modified by $Author: patrick$
+ */
+public interface ISelection extends ITemporalRelationship {
+
+ /**
+ * TODO: comment
+ *
+ * @return
+ */
+ public ISelection clone();
+
+}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ISequence.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ISequence.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ISequence.java (revision 557)
@@ -0,0 +1,24 @@
+// Module : $RCSfile: Sequence.java,v $
+// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 21.02.2012 $
+// Project : TaskTreeCreator
+// Creation : 2012 by patrick
+// Copyright : Patrick Harms, 2012
+
+package de.ugoe.cs.quest.tasktrees.treeifc;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: 21.02.2012$
+ * @author 2012, last modified by $Author: patrick$
+ */
+public interface ISequence extends ITemporalRelationship {
+
+ /**
+ * TODO: comment
+ *
+ * @return
+ */
+ public ISequence clone();
+
+}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITaskTree.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITaskTree.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITaskTree.java (revision 557)
@@ -0,0 +1,37 @@
+// Module : $RCSfile: TaskTree.java,v $
+// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 21.02.2012 $
+// Project : TaskTreeCreator
+// Creation : 2012 by patrick
+// Copyright : Patrick Harms, 2012
+
+package de.ugoe.cs.quest.tasktrees.treeifc;
+
+import java.util.Map;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: 21.02.2012$
+ * @author 2012, last modified by $Author: patrick$
+ */
+public interface ITaskTree extends Cloneable {
+
+ /**
+ * TODO: comment
+ *
+ * @return
+ */
+ public ITaskTreeNode getRoot();
+
+ /**
+ * TODO: comment
+ *
+ * @return
+ */
+ public Map getTaskMap();
+
+ /**
+ *
+ */
+ public ITaskTree clone();
+}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITaskTreeBuilder.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITaskTreeBuilder.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITaskTreeBuilder.java (revision 557)
@@ -0,0 +1,83 @@
+// Module : $RCSfile: TaskTreeBuilder.java,v $
+// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 21.02.2012 $
+// Project : TaskTreeCreator
+// Creation : 2012 by patrick
+// Copyright : Patrick Harms, 2012
+
+
+package de.ugoe.cs.quest.tasktrees.treeifc;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: 21.02.2012$
+ * @author 2012, last modified by $Author: patrick$
+ */
+public interface ITaskTreeBuilder {
+
+ /**
+ * TODO: comment
+ *
+ * @param sequence
+ * @param task
+ */
+ void addChild(ISequence parent, ITaskTreeNode child);
+
+ /**
+ * TODO: comment
+ *
+ * @param parent
+ * @param index
+ * @param sequence
+ */
+ void addChild(ISequence parent, int index, ITaskTreeNode child);
+
+ /**
+ * TODO: comment
+ *
+ * @param sequence
+ * @param task
+ */
+ void addChild(ISelection parent, ITaskTreeNode child);
+
+ /**
+ * TODO: comment
+ *
+ * @param sequence
+ * @param task
+ */
+ void addChild(ITextInputEventTask parent, ITaskTreeNode child);
+
+ /**
+ * TODO: comment
+ *
+ * @param iteration
+ * @param newChild
+ */
+ void setChild(IIteration iteration, ITaskTreeNode newChild);
+
+ /**
+ * TODO: comment
+ *
+ * @param parent
+ * @param i
+ */
+ void removeChild(ISequence parent, int index);
+
+ /**
+ * TODO: comment
+ *
+ * @param parent
+ * @param i
+ */
+ void removeChild(ISelection parent, ITaskTreeNode child);
+
+ /**
+ * TODO: comment
+ *
+ * @param parent
+ * @param i
+ */
+ void setDescription(ITaskTreeNode node, String description);
+
+}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITaskTreeNode.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITaskTreeNode.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITaskTreeNode.java (revision 557)
@@ -0,0 +1,49 @@
+// Module : $RCSfile: Task.java,v $
+// Version : $Revision: 0.0 $ $Author: Patrick $ $Date: 08.11.2011 19:42:29 $
+// Project : TaskTreePerformanceTest
+// Creation : 2011 by Patrick
+// Copyright : Patrick Harms, 2011
+
+package de.ugoe.cs.quest.tasktrees.treeifc;
+
+import java.util.List;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: $
+ * @author 2011, last modified by $Author: $
+ */
+public interface ITaskTreeNode extends Cloneable {
+
+ /**
+ *
+ */
+ public String getName();
+
+ /**
+ *
+ */
+ public String getDescription();
+
+ /**
+ *
+ */
+ public List getChildren();
+
+ /**
+ *
+ */
+ public boolean equals(ITaskTreeNode taskTreeNode);
+
+ /**
+ *
+ */
+ public int hashCode();
+
+ /**
+ *
+ */
+ public ITaskTreeNode clone();
+
+}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITaskTreeNodeFactory.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITaskTreeNodeFactory.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITaskTreeNodeFactory.java (revision 557)
@@ -0,0 +1,66 @@
+// Module : $RCSfile: TaskTreeNodeFactory.java,v $
+// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 21.02.2012 $
+// Project : TaskTreeCreator
+// Creation : 2012 by patrick
+// Copyright : Patrick Harms, 2012
+
+package de.ugoe.cs.quest.tasktrees.treeifc;
+
+import de.ugoe.cs.quest.eventcore.IEventTarget;
+import de.ugoe.cs.quest.eventcore.IEventType;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: 21.02.2012$
+ * @author 2012, last modified by $Author: patrick$
+ */
+public interface ITaskTreeNodeFactory
+{
+
+ /**
+ * TODO: comment
+ *
+ * @param eventType
+ * @param eventTarget
+ * @return
+ */
+ IEventTask createNewEventTask(IEventType eventType, IEventTarget eventTarget);
+
+ /**
+ * TODO: comment
+ *
+ * @return
+ */
+ ISequence createNewSequence();
+
+ /**
+ * TODO: comment
+ *
+ * @return
+ */
+ ITextInputEventTask createNewTextInputEventTask(IEventTarget eventTarget);
+
+ /**
+ * TODO: comment
+ *
+ * @return
+ */
+ IIteration createNewIteration();
+
+ /**
+ * TODO: comment
+ *
+ * @return
+ */
+ ISelection createNewSelection();
+
+ /**
+ * TODO: comment
+ *
+ * @param rootSequence
+ * @return
+ */
+ ITaskTree createTaskTree(ITaskTreeNode root);
+
+}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITaskTreeNodeInfo.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITaskTreeNodeInfo.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITaskTreeNodeInfo.java (revision 557)
@@ -0,0 +1,32 @@
+// Module : $RCSfile: NodeInfo.java,v $
+// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 21.02.2012 $
+// Project : TaskTreeCreator
+// Creation : 2012 by patrick
+// Copyright : Patrick Harms, 2012
+
+package de.ugoe.cs.quest.tasktrees.treeifc;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: 21.02.2012$
+ * @author 2012, last modified by $Author: patrick$
+ */
+public interface ITaskTreeNodeInfo {
+
+ /**
+ *
+ */
+ public ITaskTreeNode getTask();
+
+ /**
+ *
+ */
+ public int getNoOfOccurencesInTree();
+
+ /**
+ *
+ */
+ public long getLastUpdate();
+
+}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITemporalRelationship.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITemporalRelationship.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITemporalRelationship.java (revision 557)
@@ -0,0 +1,22 @@
+// Module : $RCSfile: TemporalRelationship.java,v $
+// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 12.02.2012 $
+// Project : TaskTreeCreator
+// Creation : 2012 by patrick
+// Copyright : Patrick Harms, 2012
+
+package de.ugoe.cs.quest.tasktrees.treeifc;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: 12.02.2012$
+ * @author 2012, last modified by $Author: patrick$
+ */
+public interface ITemporalRelationship extends ITaskTreeNode {
+
+ /**
+ *
+ */
+ public ITemporalRelationship clone();
+
+}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITextInputEventTask.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITextInputEventTask.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/ITextInputEventTask.java (revision 557)
@@ -0,0 +1,37 @@
+// Module : $RCSfile: TextInputSequence.java,v $
+// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 10.06.2012 $
+// Project : TaskTreeIfc
+// Creation : 2012 by patrick
+// Copyright : Patrick Harms, 2012
+
+
+package de.ugoe.cs.quest.tasktrees.treeifc;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: 10.06.2012$
+ * @author 2012, last modified by $Author: patrick$
+ */
+public interface ITextInputEventTask extends IEventTask {
+
+ /**
+ *
+ */
+ public String getEnteredText();
+
+ /**
+ * TODO: comment
+ *
+ * @param string
+ */
+ public void setEnteredText(String text);
+
+ /**
+ * TODO: comment
+ *
+ * @return
+ */
+ public ITextInputEventTask clone();
+
+}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/InteractionTask.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/InteractionTask.java (revision 556)
+++ (revision )
@@ -1,38 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: InteractionTask.java,v $
-// Version : $Revision: 0.0 $ $Author: Patrick $ $Date: 08.11.2011 19:44:52 $
-// Project : TaskTreePerformanceTest
-// Creation : 2011 by Patrick
-// Copyright : Patrick Harms, 2011
-//-------------------------------------------------------------------------------------------------
-
-package de.ugoe.cs.quest.tasktrees.treeifc;
-
-import de.ugoe.cs.quest.eventcore.guimodel.GUIElement;
-import de.ugoe.cs.quest.eventcore.userinteraction.Interaction;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: $
- * @author 2011, last modified by $Author: $
- */
-//-------------------------------------------------------------------------------------------------
-public interface InteractionTask extends TaskTreeNode
-{
- //-----------------------------------------------------------------------------------------------
- /**
- * @return Returns the interaction.
- */
- //-----------------------------------------------------------------------------------------------
- public Interaction getInteraction();
-
- //-----------------------------------------------------------------------------------------------
- /**
- * @return Returns the GUIElement.
- */
- //-----------------------------------------------------------------------------------------------
- public GUIElement getGUIElement();
-
-}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/Iteration.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/Iteration.java (revision 556)
+++ (revision )
@@ -1,21 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: Iteration.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 21.02.2012 $
-// Project : TaskTreeCreator
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.treeifc;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 21.02.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public interface Iteration extends TemporalRelationship
-{
-
-}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/NodeInfo.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/NodeInfo.java (revision 556)
+++ (revision )
@@ -1,43 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: NodeInfo.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 21.02.2012 $
-// Project : TaskTreeCreator
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-
-package de.ugoe.cs.quest.tasktrees.treeifc;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 21.02.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public interface NodeInfo
-{
-
- //-----------------------------------------------------------------------------------------------
- /**
- *
- */
- //-----------------------------------------------------------------------------------------------
- public TaskTreeNode getTask();
-
- //-----------------------------------------------------------------------------------------------
- /**
- *
- */
- //-----------------------------------------------------------------------------------------------
- public int getNoOfOccurencesInTree();
-
- //-----------------------------------------------------------------------------------------------
- /**
- *
- */
- //-----------------------------------------------------------------------------------------------
- public long getLastUpdate();
-
-}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/Selection.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/Selection.java (revision 556)
+++ (revision )
@@ -1,21 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: Selection.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 21.02.2012 $
-// Project : TaskTreeCreator
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.treeifc;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 21.02.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public interface Selection extends TemporalRelationship
-{
-
-}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/Sequence.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/Sequence.java (revision 556)
+++ (revision )
@@ -1,30 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: Sequence.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 21.02.2012 $
-// Project : TaskTreeCreator
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.treeifc;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 21.02.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public interface Sequence extends TemporalRelationship
-{
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- public Sequence clone();
-
-}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/TaskTree.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/TaskTree.java (revision 556)
+++ (revision )
@@ -1,47 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: TaskTree.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 21.02.2012 $
-// Project : TaskTreeCreator
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.treeifc;
-
-import java.util.Map;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 21.02.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public interface TaskTree extends Cloneable
-{
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- public TaskTreeNode getRoot();
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- public Map getTaskMap();
-
- //-----------------------------------------------------------------------------------------------
- /**
- *
- */
- //-----------------------------------------------------------------------------------------------
- public TaskTree clone();
-}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/TaskTreeBuilder.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/TaskTreeBuilder.java (revision 556)
+++ (revision )
@@ -1,102 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: TaskTreeBuilder.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 21.02.2012 $
-// Project : TaskTreeCreator
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.treeifc;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 21.02.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public interface TaskTreeBuilder
-{
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param sequence
- * @param task
- */
- //-----------------------------------------------------------------------------------------------
- void addChild(Sequence parent, TaskTreeNode child);
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param parent
- * @param index
- * @param sequence
- */
- //-----------------------------------------------------------------------------------------------
- void addChild(Sequence parent, int index, TaskTreeNode child);
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param sequence
- * @param task
- */
- //-----------------------------------------------------------------------------------------------
- void addChild(Selection parent, TaskTreeNode child);
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param sequence
- * @param task
- */
- //-----------------------------------------------------------------------------------------------
- void addChild(TextInputInteractionTask parent, TaskTreeNode child);
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param iteration
- * @param newChild
- */
- //-----------------------------------------------------------------------------------------------
- void setChild(Iteration iteration, TaskTreeNode newChild);
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param parent
- * @param i
- */
- //-----------------------------------------------------------------------------------------------
- void removeChild(Sequence parent, int index);
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param parent
- * @param i
- */
- //-----------------------------------------------------------------------------------------------
- void removeChild(Selection parent, TaskTreeNode child);
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param parent
- * @param i
- */
- //-----------------------------------------------------------------------------------------------
- void setDescription(TaskTreeNode parent, String description);
-
-}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/TaskTreeNode.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/TaskTreeNode.java (revision 556)
+++ (revision )
@@ -1,75 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: Task.java,v $
-// Version : $Revision: 0.0 $ $Author: Patrick $ $Date: 08.11.2011 19:42:29 $
-// Project : TaskTreePerformanceTest
-// Creation : 2011 by Patrick
-// Copyright : Patrick Harms, 2011
-//-------------------------------------------------------------------------------------------------
-
-package de.ugoe.cs.quest.tasktrees.treeifc;
-
-import java.util.List;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: $
- * @author 2011, last modified by $Author: $
- */
-//-------------------------------------------------------------------------------------------------
-public interface TaskTreeNode extends Cloneable
-{
- //-----------------------------------------------------------------------------------------------
- /**
- *
- */
- //-----------------------------------------------------------------------------------------------
- public String getName();
-
- //-----------------------------------------------------------------------------------------------
- /**
- */
- //-----------------------------------------------------------------------------------------------
- //public void addChild(TaskTreeNode child);
-
- //-----------------------------------------------------------------------------------------------
- /**
- */
- //-----------------------------------------------------------------------------------------------
- //public void removeChild(int index);
-
- //-----------------------------------------------------------------------------------------------
- /**
- *
- */
- //-----------------------------------------------------------------------------------------------
- public String getDescription();
-
- //-----------------------------------------------------------------------------------------------
- /**
- */
- //-----------------------------------------------------------------------------------------------
- public List getChildren();
-
- //-----------------------------------------------------------------------------------------------
- /**
- *
- */
- //-----------------------------------------------------------------------------------------------
- public boolean equals(TaskTreeNode taskTreeNode);
-
- //-----------------------------------------------------------------------------------------------
- /**
- *
- */
- //-----------------------------------------------------------------------------------------------
- public int hashCode();
-
- //-----------------------------------------------------------------------------------------------
- /**
- *
- */
- //-----------------------------------------------------------------------------------------------
- public TaskTreeNode clone();
-}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/TaskTreeNodeFactory.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/TaskTreeNodeFactory.java (revision 556)
+++ (revision )
@@ -1,82 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: TaskTreeNodeFactory.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 21.02.2012 $
-// Project : TaskTreeCreator
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.treeifc;
-
-import de.ugoe.cs.quest.eventcore.guimodel.GUIElement;
-import de.ugoe.cs.quest.eventcore.userinteraction.Interaction;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 21.02.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public interface TaskTreeNodeFactory
-{
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param GUIElement
- * @param interaction
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- InteractionTask createNewInteractionTask(GUIElement guiElement,
- Interaction interaction);
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- Sequence createNewSequence();
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- TextInputInteractionTask createNewTextInputInteractionTask(GUIElement guiElement);
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- Iteration createNewIteration();
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- Selection createNewSelection();
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param rootSequence
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- TaskTree createTaskTree(TaskTreeNode root);
-
-}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/TemporalRelationship.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/TemporalRelationship.java (revision 556)
+++ (revision )
@@ -1,21 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: TemporalRelationship.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 12.02.2012 $
-// Project : TaskTreeCreator
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.treeifc;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 12.02.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-// -------------------------------------------------------------------------------------------------
-public interface TemporalRelationship extends TaskTreeNode
-{
-
-}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/TextInputInteractionTask.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeifc/TextInputInteractionTask.java (revision 556)
+++ (revision )
@@ -1,44 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: TextInputSequence.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 10.06.2012 $
-// Project : TaskTreeIfc
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.treeifc;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 10.06.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public interface TextInputInteractionTask extends InteractionTask
-{
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- public TextInputInteractionTask clone();
-
- //-----------------------------------------------------------------------------------------------
- /**
- *
- */
- //-----------------------------------------------------------------------------------------------
- public String getEnteredText();
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param string
- */
- //-----------------------------------------------------------------------------------------------
- public void setEnteredText(String text);
-}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/EventTask.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/EventTask.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/EventTask.java (revision 557)
@@ -0,0 +1,89 @@
+// Module : $RCSfile: InteractionTask.java,v $
+// Version : $Revision: 0.0 $ $Author: Patrick $ $Date: 06.11.2011 10:57:52 $
+// Project : TaskTreePerformanceTest
+// Creation : 2011 by Patrick
+// Copyright : Patrick Harms, 2011
+
+package de.ugoe.cs.quest.tasktrees.treeimpl;
+
+import de.ugoe.cs.quest.eventcore.IEventTarget;
+import de.ugoe.cs.quest.eventcore.IEventType;
+import de.ugoe.cs.quest.tasktrees.treeifc.IEventTask;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: $
+ * @author 2011, last modified by $Author: $
+ */
+public class EventTask extends TaskTreeNode implements IEventTask {
+
+ /** */
+ private IEventType eventType;
+
+ /** */
+ private IEventTarget eventTarget;
+
+ /**
+ * @param eventType
+ * @param eventTarget
+ */
+ EventTask(IEventType eventType, IEventTarget eventTarget) {
+ super(eventType.getName() + "(" + eventTarget + ")");
+ super.setDescription(eventType + " on " + eventTarget);
+ this.eventType = eventType;
+ this.eventTarget = eventTarget;
+ }
+
+ /**
+ * @return Returns the interaction.
+ */
+ public IEventType getEventType() {
+ return eventType;
+ }
+
+ /**
+ * @return Returns the GUIElement.
+ */
+ public IEventTarget getEventTarget() {
+ return eventTarget;
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.harms.ctte.Task#equals(de.harms.ctte.Task)
+ */
+ @Override
+ public boolean equals(ITaskTreeNode task) {
+ if (!(task instanceof IEventTask)) {
+ return false;
+ }
+
+ IEventType otherType = ((IEventTask) task).getEventType();
+ IEventTarget otherTarget = ((IEventTask) task).getEventTarget();
+
+ if (((eventType == otherType) ||
+ ((eventType != null) && (eventType.equals(otherType)))) &&
+ ((eventTarget == otherTarget) ||
+ ((eventTarget != null) && (eventTarget.equals(otherTarget)))))
+ {
+ return true;
+ }
+
+ return false;
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.harms.tasktrees.TreeNode#clone()
+ */
+ @Override
+ public EventTask clone() {
+ // Event type and target are unchangeable and do not need to be cloned
+ return (EventTask) super.clone();
+ }
+
+}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/InteractionTaskImpl.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/InteractionTaskImpl.java (revision 556)
+++ (revision )
@@ -1,106 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: InteractionTask.java,v $
-// Version : $Revision: 0.0 $ $Author: Patrick $ $Date: 06.11.2011 10:57:52 $
-// Project : TaskTreePerformanceTest
-// Creation : 2011 by Patrick
-// Copyright : Patrick Harms, 2011
-//-------------------------------------------------------------------------------------------------
-
-package de.ugoe.cs.quest.tasktrees.treeimpl;
-
-import de.ugoe.cs.quest.eventcore.guimodel.GUIElement;
-import de.ugoe.cs.quest.eventcore.userinteraction.Interaction;
-import de.ugoe.cs.quest.tasktrees.treeifc.InteractionTask;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: $
- * @author 2011, last modified by $Author: $
- */
-//-------------------------------------------------------------------------------------------------
-public class InteractionTaskImpl extends TaskTreeNodeImpl implements InteractionTask
-{
- /** */
- private GUIElement mGUIElement;
-
- /** */
- private Interaction mInteraction;
-
- //-----------------------------------------------------------------------------------------------
- /**
- * @param guiElement
- * @param interaction
- */
- //-----------------------------------------------------------------------------------------------
- InteractionTaskImpl(GUIElement guiElement, Interaction interaction)
- {
- super(interaction.getName() + "(" + guiElement + ")");
- super.setDescription(interaction + " on " + guiElement);
- mGUIElement = guiElement;
- mInteraction = interaction;
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * @return Returns the interaction.
- */
- //-----------------------------------------------------------------------------------------------
- public Interaction getInteraction()
- {
- return mInteraction;
- }
-
-
- //-----------------------------------------------------------------------------------------------
- /**
- * @return Returns the GUIElement.
- */
- //-----------------------------------------------------------------------------------------------
- public GUIElement getGUIElement()
- {
- return mGUIElement;
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.harms.ctte.Task#equals(de.harms.ctte.Task)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public boolean equals(TaskTreeNode task)
- {
- if (!(task instanceof InteractionTask))
- {
- return false;
- }
-
- GUIElement otherInteractionElem = ((InteractionTask) task).getGUIElement();
- Interaction otherInteraction = ((InteractionTask) task).getInteraction();
-
- if ((((mGUIElement == null) && (otherInteractionElem == null)) ||
- ((mGUIElement != null) && (mGUIElement.equals(otherInteractionElem)))) &&
- (((mInteraction == null) && (otherInteraction == null)) ||
- ((mInteraction != null) && (mInteraction.equals(otherInteraction)))))
- {
- return true;
- }
-
- return false;
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.harms.tasktrees.TreeNode#clone()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public InteractionTaskImpl clone()
- {
- // GUI element and interaction are unchangeable and do not need to be cloned
- return (InteractionTaskImpl) super.clone();
- }
-
-}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/Iteration.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/Iteration.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/Iteration.java (revision 557)
@@ -0,0 +1,63 @@
+// Module : $RCSfile: Iteration.java,v $
+// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 19.02.2012 $
+// Project : TaskTreeCreator
+// Creation : 2012 by patrick
+// Copyright : Patrick Harms, 2012
+
+
+package de.ugoe.cs.quest.tasktrees.treeimpl;
+
+import de.ugoe.cs.quest.tasktrees.treeifc.IIteration;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: 19.02.2012$
+ * @author 2012, last modified by $Author: patrick$
+ */
+public class Iteration extends TaskTreeNode implements IIteration {
+
+ /**
+ *
+ */
+ Iteration() {
+ super("Iteration");
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeifc.TaskTreeNode#addChild(TaskTreeNode)
+ */
+ @Override
+ public void addChild(ITaskTreeNode child) {
+ // adding more children is not allowed
+ throw new UnsupportedOperationException
+ ("iterations may not have a list of children. Use setChild() instead.");
+ }
+
+ /**
+ * TODO: comment
+ *
+ * @param selection
+ * @return
+ */
+ public void setChild(ITaskTreeNode child) {
+ if (super.getChildren().size() > 0) {
+ super.removeChild(0);
+ }
+ super.addChild(child);
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see java.lang.Object#clone()
+ */
+ @Override
+ public Iteration clone() {
+ return (Iteration) super.clone();
+ }
+
+}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/IterationImpl.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/IterationImpl.java (revision 556)
+++ (revision )
@@ -1,74 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: Iteration.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 19.02.2012 $
-// Project : TaskTreeCreator
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.treeimpl;
-
-import de.ugoe.cs.quest.tasktrees.treeifc.Iteration;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 19.02.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public class IterationImpl extends TaskTreeNodeImpl implements Iteration
-{
-
- //-----------------------------------------------------------------------------------------------
- /**
- *
- */
- //-----------------------------------------------------------------------------------------------
- IterationImpl()
- {
- super("Iteration");
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeifc.TaskTreeNode#addChild(TaskTreeNode)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public void addChild(TaskTreeNode child)
- {
- // adding more children is not allowed
- throw new UnsupportedOperationException();
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param selection
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- public void setChild(TaskTreeNode child)
- {
- if (super.getChildren().size() > 0)
- {
- super.removeChild(0);
- }
- super.addChild(child);
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see java.lang.Object#clone()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public IterationImpl clone()
- {
- return (IterationImpl) super.clone();
- }
-
-}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/NodeInfo.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/NodeInfo.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/NodeInfo.java (revision 557)
@@ -0,0 +1,96 @@
+// Module : $RCSfile: NodeInfo.java,v $
+// Version : $Revision: 0.0 $ $Author: Patrick $ $Date: 05.11.2011 19:24:14 $
+// Project : TestTreePerformanceTest
+// Creation : 2011 by Patrick
+// Copyright : Patrick Harms, 2011
+
+package de.ugoe.cs.quest.tasktrees.treeimpl;
+
+import java.util.ArrayList;
+import java.util.List;
+
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNodeInfo;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: $
+ * @author 2011, last modified by $Author: $
+ */
+public class NodeInfo implements ITaskTreeNodeInfo {
+
+ /** */
+ private ITaskTreeNode task;
+
+ /** */
+ private long lastUpdate;
+
+ /** */
+ private List parentNodes = new ArrayList();
+
+ /**
+ * @param node
+ */
+ NodeInfo(ITaskTreeNode task) {
+ this.task = task;
+ lastUpdate = System.currentTimeMillis();
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeifc.NodeInfo#getTask()
+ */
+ @Override
+ public ITaskTreeNode getTask() {
+ return task;
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeimpl.NodeInfo#getNoOfOccurencesInTree()
+ */
+ @Override
+ public int getNoOfOccurencesInTree() {
+ return parentNodes.size();
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeimpl.NodeInfo#getLastUpdate()
+ */
+ @Override
+ public long getLastUpdate() {
+ return lastUpdate;
+ }
+
+ /**
+ * TODO: comment
+ *
+ */
+ void addParent(ITaskTreeNode parent) {
+ parentNodes.add(parent);
+ }
+
+ /**
+ * TODO: comment
+ *
+ */
+ void removeParent(ITaskTreeNode parent) {
+ parentNodes.remove(parent);
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see java.lang.Object#toString()
+ */
+ @Override
+ public synchronized String toString() {
+ return "NodeInfo(" + task + ", " + parentNodes.size() + " parents)";
+ }
+
+}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/NodeInfoImpl.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/NodeInfoImpl.java (revision 556)
+++ (revision )
@@ -1,114 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: NodeInfo.java,v $
-// Version : $Revision: 0.0 $ $Author: Patrick $ $Date: 05.11.2011 19:24:14 $
-// Project : TestTreePerformanceTest
-// Creation : 2011 by Patrick
-// Copyright : Patrick Harms, 2011
-//-------------------------------------------------------------------------------------------------
-
-package de.ugoe.cs.quest.tasktrees.treeimpl;
-
-import java.util.ArrayList;
-import java.util.List;
-
-import de.ugoe.cs.quest.tasktrees.treeifc.NodeInfo;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
-
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: $
- * @author 2011, last modified by $Author: $
- */
-//-------------------------------------------------------------------------------------------------
-public class NodeInfoImpl implements NodeInfo
-{
- /** */
- private TaskTreeNode mTask;
-
- /** */
- private long mLastUpdate;
-
- /** */
- private List mParentNodes = new ArrayList();
-
- //-----------------------------------------------------------------------------------------------
- /**
- * @param node
- */
- //-----------------------------------------------------------------------------------------------
- NodeInfoImpl(TaskTreeNode task)
- {
- mTask = task;
- mLastUpdate = System.currentTimeMillis();
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeifc.NodeInfo#getTask()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public TaskTreeNode getTask()
- {
- return mTask;
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeimpl.NodeInfo#getNoOfOccurencesInTree()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public int getNoOfOccurencesInTree()
- {
- return mParentNodes.size();
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeimpl.NodeInfo#getLastUpdate()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public long getLastUpdate()
- {
- return mLastUpdate;
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- */
- //-----------------------------------------------------------------------------------------------
- void addParent(TaskTreeNode parent)
- {
- mParentNodes.add(parent);
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- */
- //-----------------------------------------------------------------------------------------------
- void removeParent(TaskTreeNode parent)
- {
- mParentNodes.remove(parent);
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see java.lang.Object#toString()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public synchronized String toString()
- {
- return "NodeInfo(" + mTask + ", " + mParentNodes.size() + " parents)";
- }
-
-}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/Selection.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/Selection.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/Selection.java (revision 557)
@@ -0,0 +1,38 @@
+// Module : $RCSfile: Selection.java,v $
+// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 19.02.2012 $
+// Project : TaskTreeCreator
+// Creation : 2012 by patrick
+// Copyright : Patrick Harms, 2012
+
+package de.ugoe.cs.quest.tasktrees.treeimpl;
+
+import de.ugoe.cs.quest.tasktrees.treeifc.ISelection;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: 19.02.2012$
+ * @author 2012, last modified by $Author: patrick$
+ */
+public class Selection extends TaskTreeNode implements ISelection {
+
+ /**
+ * TODO: comment
+ *
+ * @param name
+ */
+ Selection() {
+ super("Selection");
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see java.lang.Object#clone()
+ */
+ @Override
+ public Selection clone() {
+ return (Selection) super.clone();
+ }
+
+}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/SelectionImpl.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/SelectionImpl.java (revision 556)
+++ (revision )
@@ -1,46 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: Selection.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 19.02.2012 $
-// Project : TaskTreeCreator
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.treeimpl;
-
-import de.ugoe.cs.quest.tasktrees.treeifc.Selection;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 19.02.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public class SelectionImpl extends TaskTreeNodeImpl implements Selection
-{
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param name
- */
- //-----------------------------------------------------------------------------------------------
- SelectionImpl()
- {
- super("Selection");
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see java.lang.Object#clone()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public SelectionImpl clone()
- {
- return (SelectionImpl) super.clone();
- }
-
-}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/Sequence.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/Sequence.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/Sequence.java (revision 557)
@@ -0,0 +1,47 @@
+// Module : $RCSfile: Sequence.java,v $
+// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 19.02.2012 $
+// Project : TaskTreeCreator
+// Creation : 2012 by patrick
+// Copyright : Patrick Harms, 2012
+
+package de.ugoe.cs.quest.tasktrees.treeimpl;
+
+import de.ugoe.cs.quest.tasktrees.treeifc.ISequence;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: 19.02.2012$
+ * @author 2012, last modified by $Author: patrick$
+ */
+public class Sequence extends TaskTreeNode implements ISequence {
+
+ /**
+ * TODO: comment
+ *
+ * @param name
+ */
+ Sequence() {
+ super("Sequence");
+ }
+
+ /**
+ * TODO: comment
+ *
+ * @param name
+ */
+ Sequence(String name) {
+ super(name);
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeimpl.TaskTreeNodeImpl#clone()
+ */
+ @Override
+ public Sequence clone() {
+ return (Sequence) super.clone();
+ }
+
+}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/SequenceImpl.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/SequenceImpl.java (revision 556)
+++ (revision )
@@ -1,57 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: Sequence.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 19.02.2012 $
-// Project : TaskTreeCreator
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.treeimpl;
-
-import de.ugoe.cs.quest.tasktrees.treeifc.Sequence;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 19.02.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public class SequenceImpl extends TaskTreeNodeImpl implements Sequence
-{
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param name
- */
- //-----------------------------------------------------------------------------------------------
- SequenceImpl()
- {
- super("Sequence");
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param name
- */
- //-----------------------------------------------------------------------------------------------
- SequenceImpl(String name)
- {
- super(name);
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeimpl.TaskTreeNodeImpl#clone()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public SequenceImpl clone()
- {
- return (SequenceImpl) super.clone();
- }
-
-}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TaskTree.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TaskTree.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TaskTree.java (revision 557)
@@ -0,0 +1,113 @@
+// Module : $RCSfile: TaskTree.java,v $
+// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 21.02.2012 $
+// Project : TaskTreeCreator
+// Creation : 2012 by patrick
+// Copyright : Patrick Harms, 2012
+
+package de.ugoe.cs.quest.tasktrees.treeimpl;
+
+import java.util.HashMap;
+import java.util.Map;
+
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNodeInfo;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTree;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: 21.02.2012$
+ * @author 2012, last modified by $Author: patrick$
+ */
+public class TaskTree implements ITaskTree {
+
+ /** the map of nodes */
+ private Map taskMap;
+
+ /** the root node of the task tree */
+ private ITaskTreeNode rootNode;
+
+ /**
+ * TODO: comment
+ *
+ */
+ TaskTree(ITaskTreeNode rootNode) {
+ this.rootNode = rootNode;
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeifc.TaskTree#getRoot()
+ */
+ @Override
+ public ITaskTreeNode getRoot() {
+ return rootNode;
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeifc.TaskTree#getTaskMap()
+ */
+ @Override
+ public synchronized Map getTaskMap() {
+ if (taskMap == null) {
+ taskMap = new HashMap();
+ addNodeToMap(rootNode, null);
+ }
+ return taskMap;
+ }
+
+ /**
+ * TODO: comment
+ *
+ * @param rootNode
+ */
+ private void addNodeToMap(ITaskTreeNode node, ITaskTreeNode parent) {
+ NodeInfo nodeInfo = (NodeInfo) taskMap.get(node);
+
+ if (nodeInfo == null) {
+ nodeInfo = new NodeInfo(node);
+ taskMap.put(node, nodeInfo);
+ }
+
+ if (parent != null) {
+ // through first removing an existing parent it is assured, that a parent is recorded
+ // only once. This is needed, because parent may be reused in a tree as well, but we
+ // always iterate the whole tree
+ nodeInfo.removeParent(parent);
+ nodeInfo.addParent(parent);
+ }
+
+ for (ITaskTreeNode child : node.getChildren()) {
+ addNodeToMap(child, node);
+ }
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see java.lang.Object#clone()
+ */
+ @Override
+ public TaskTree clone() {
+ TaskTree clone = null;
+ try {
+ clone = (TaskTree) super.clone();
+
+ clone.rootNode = rootNode.clone();
+
+ // the clone will create the task map itself, when it is first retrieved
+ clone.taskMap = null;
+
+ }
+ catch (CloneNotSupportedException e) {
+ // this should never happen. Therefore simply dump the exception
+ e.printStackTrace();
+ }
+
+ return clone;
+ }
+
+}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TaskTreeBuilder.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TaskTreeBuilder.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TaskTreeBuilder.java (revision 557)
@@ -0,0 +1,175 @@
+// Module : $RCSfile: TaskTreeBuilderImpl.java,v $
+// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 21.02.2012 $
+// Project : TaskTreeCreator
+// Creation : 2012 by patrick
+// Copyright : Patrick Harms, 2012
+
+package de.ugoe.cs.quest.tasktrees.treeimpl;
+
+import de.ugoe.cs.quest.tasktrees.treeifc.IIteration;
+import de.ugoe.cs.quest.tasktrees.treeifc.ISelection;
+import de.ugoe.cs.quest.tasktrees.treeifc.ISequence;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeBuilder;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITextInputEventTask;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: 21.02.2012$
+ * @author 2012, last modified by $Author: patrick$
+ */
+public class TaskTreeBuilder implements ITaskTreeBuilder {
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeifc.TaskTreeBuilder#addChild(Sequence, TaskTreeNode)
+ */
+ @Override
+ public void addChild(ISequence parent, ITaskTreeNode child) {
+ if (!(parent instanceof Sequence)) {
+ throw new IllegalArgumentException
+ ("illegal type of task tree node provided: " + parent.getClass());
+ }
+
+ addChildInternal(parent, -1, child);
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeifc.TaskTreeBuilder#addChild(Sequence, int, TaskTreeNode)
+ */
+ @Override
+ public void addChild(ISequence parent, int index, ITaskTreeNode child) {
+ if (!(parent instanceof Sequence)) {
+ throw new IllegalArgumentException
+ ("illegal type of task tree node provided: " + parent.getClass());
+ }
+
+ addChildInternal(parent, index, child);
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeifc.TaskTreeBuilder#addChild(Selection, TaskTreeNode)
+ */
+ @Override
+ public void addChild(ISelection parent, ITaskTreeNode child) {
+ if (!(parent instanceof Selection)) {
+ throw new IllegalArgumentException
+ ("illegal type of task tree node provided: " + parent.getClass());
+ }
+
+ addChildInternal(parent, -1, child);
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeifc.TaskTreeBuilder#addChild(de.ugoe.cs.tasktree.treeifc.
+ * TextInputEventTask, de.ugoe.cs.tasktree.treeifc.TaskTreeNode)
+ */
+ @Override
+ public void addChild(ITextInputEventTask parent, ITaskTreeNode child) {
+ if (!(parent instanceof TextInputEventTask)) {
+ throw new IllegalArgumentException
+ ("illegal type of task tree node provided: " + parent.getClass());
+ }
+
+ addChildInternal(parent, -1, child);
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeifc.TaskTreeBuilder#setChild(Iteration, TaskTreeNode)
+ */
+ @Override
+ public void setChild(IIteration iteration, ITaskTreeNode newChild) {
+ if (!(iteration instanceof Iteration)) {
+ throw new IllegalArgumentException
+ ("illegal type of iteration provided: " + iteration.getClass());
+ }
+
+ if (!(newChild instanceof TaskTreeNode)) {
+ throw new IllegalArgumentException
+ ("illegal type of task tree node provided: " + newChild.getClass());
+ }
+
+ ((Iteration) iteration).setChild(newChild);
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeifc.TaskTreeBuilder#removeChild(Sequence, int)
+ */
+ @Override
+ public void removeChild(ISequence parent, int index) {
+ if (!(parent instanceof TaskTreeNode)) {
+ throw new IllegalArgumentException
+ ("illegal type of task tree node provided: " + parent.getClass());
+ }
+
+ ((TaskTreeNode) parent).removeChild(index);
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeifc.TaskTreeBuilder#removeChild(Selection, TaskTreeNode)
+ */
+ @Override
+ public void removeChild(ISelection parent, ITaskTreeNode child) {
+ if (!(parent instanceof TaskTreeNode)) {
+ throw new IllegalArgumentException
+ ("illegal type of task tree node provided: " + parent.getClass());
+ }
+
+ for (int i = 0; i < parent.getChildren().size(); i++) {
+ if ((parent.getChildren().get(i) == child) ||
+ ((parent.getChildren().get(i) != null) &&
+ (parent.getChildren().get(i).equals(child))))
+ {
+ ((TaskTreeNode) parent).removeChild(i);
+ break;
+ }
+ }
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeifc.TaskTreeBuilder#setDescription(TaskTreeNode, String)
+ */
+ @Override
+ public void setDescription(ITaskTreeNode parent, String description) {
+ if (!(parent instanceof TaskTreeNode)) {
+ throw new IllegalArgumentException
+ ("illegal type of task tree node provided: " + parent.getClass());
+ }
+
+ ((TaskTreeNode) parent).setDescription(description);
+ }
+
+ /**
+ *
+ */
+ private void addChildInternal(ITaskTreeNode parent, int index, ITaskTreeNode child) {
+ if (!(child instanceof TaskTreeNode)) {
+ throw new IllegalArgumentException
+ ("illegal type of task tree node provided: " + child.getClass());
+ }
+
+ if (index > -1) {
+ ((TaskTreeNode) parent).addChild(index, child);
+ }
+ else {
+ ((TaskTreeNode) parent).addChild(child);
+ }
+ }
+
+}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TaskTreeBuilderImpl.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TaskTreeBuilderImpl.java (revision 556)
+++ (revision )
@@ -1,221 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: TaskTreeBuilderImpl.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 21.02.2012 $
-// Project : TaskTreeCreator
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.treeimpl;
-
-import de.ugoe.cs.quest.tasktrees.treeifc.Iteration;
-import de.ugoe.cs.quest.tasktrees.treeifc.Selection;
-import de.ugoe.cs.quest.tasktrees.treeifc.Sequence;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeBuilder;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
-import de.ugoe.cs.quest.tasktrees.treeifc.TextInputInteractionTask;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 21.02.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public class TaskTreeBuilderImpl implements TaskTreeBuilder
-{
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeifc.TaskTreeBuilder#addChild(Sequence, TaskTreeNode)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public void addChild(Sequence parent, TaskTreeNode child)
- {
- if (!(parent instanceof SequenceImpl))
- {
- throw new IllegalArgumentException
- ("illegal type of task tree node provided: " + parent.getClass());
- }
-
- addChildInternal(parent, -1, child);
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeifc.TaskTreeBuilder#addChild(Sequence, int, TaskTreeNode)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public void addChild(Sequence parent, int index, TaskTreeNode child)
- {
- if (!(parent instanceof SequenceImpl))
- {
- throw new IllegalArgumentException
- ("illegal type of task tree node provided: " + parent.getClass());
- }
-
- addChildInternal(parent, index, child);
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeifc.TaskTreeBuilder#addChild(Selection, TaskTreeNode)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public void addChild(Selection parent, TaskTreeNode child)
- {
- if (!(parent instanceof SelectionImpl))
- {
- throw new IllegalArgumentException
- ("illegal type of task tree node provided: " + parent.getClass());
- }
-
- addChildInternal(parent, -1, child);
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeifc.TaskTreeBuilder#addChild(de.ugoe.cs.tasktree.treeifc.TextInputInteractionTask, de.ugoe.cs.tasktree.treeifc.TaskTreeNode)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public void addChild(TextInputInteractionTask parent, TaskTreeNode child)
- {
- if (!(parent instanceof TextInputInteractionTaskImpl))
- {
- throw new IllegalArgumentException
- ("illegal type of task tree node provided: " + parent.getClass());
- }
-
- addChildInternal(parent, -1, child);
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeifc.TaskTreeBuilder#setChild(Iteration, TaskTreeNode)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public void setChild(Iteration iteration, TaskTreeNode newChild)
- {
- if (!(iteration instanceof IterationImpl))
- {
- throw new IllegalArgumentException
- ("illegal type of iteration provided: " + iteration.getClass());
- }
-
- if (!(newChild instanceof TaskTreeNodeImpl))
- {
- throw new IllegalArgumentException
- ("illegal type of task tree node provided: " + newChild.getClass());
- }
-
- ((IterationImpl) iteration).setChild(determineNode(newChild));
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeifc.TaskTreeBuilder#removeChild(Sequence, int)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public void removeChild(Sequence parent, int index)
- {
- if (!(parent instanceof TaskTreeNodeImpl))
- {
- throw new IllegalArgumentException
- ("illegal type of task tree node provided: " + parent.getClass());
- }
-
- ((TaskTreeNodeImpl) parent).removeChild(index);
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeifc.TaskTreeBuilder#removeChild(Selection, TaskTreeNode)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public void removeChild(Selection parent, TaskTreeNode child)
- {
- if (!(parent instanceof TaskTreeNodeImpl))
- {
- throw new IllegalArgumentException
- ("illegal type of task tree node provided: " + parent.getClass());
- }
-
- for (int i = 0; i < parent.getChildren().size(); i++)
- {
- if ((parent.getChildren().get(i) == child) ||
- ((parent.getChildren().get(i) != null) && (parent.getChildren().get(i).equals(child))))
- {
- ((TaskTreeNodeImpl) parent).removeChild(i);
- break;
- }
- }
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeifc.TaskTreeBuilder#setDescription(TaskTreeNode, String)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public void setDescription(TaskTreeNode parent, String description)
- {
- if (!(parent instanceof TaskTreeNodeImpl))
- {
- throw new IllegalArgumentException
- ("illegal type of task tree node provided: " + parent.getClass());
- }
-
- ((TaskTreeNodeImpl) parent).setDescription(description);
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- *
- */
- //-----------------------------------------------------------------------------------------------
- private void addChildInternal(TaskTreeNode parent, int index, TaskTreeNode child)
- {
- if (!(child instanceof TaskTreeNodeImpl))
- {
- throw new IllegalArgumentException
- ("illegal type of task tree node provided: " + child.getClass());
- }
-
- if (index > -1)
- {
- ((TaskTreeNodeImpl) parent).addChild(index, determineNode(child));
- }
- else
- {
- ((TaskTreeNodeImpl) parent).addChild(determineNode(child));
- }
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param newChild
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- private TaskTreeNode determineNode(TaskTreeNode newNode)
- {
- return newNode;
- /*TaskTreeNode node = mTaskMap.get(newNode);
- if (node == null)
- {
- node = newNode;
- mTaskMap.put(node, node);
- }
-
- return node;*/
- }
-
-}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TaskTreeImpl.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TaskTreeImpl.java (revision 556)
+++ (revision )
@@ -1,131 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: TaskTree.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 21.02.2012 $
-// Project : TaskTreeCreator
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.treeimpl;
-
-import java.util.HashMap;
-import java.util.Map;
-
-import de.ugoe.cs.quest.tasktrees.treeifc.NodeInfo;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTree;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 21.02.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public class TaskTreeImpl implements TaskTree
-{
- /** the map of nodes */
- private Map mTaskMap;
-
- /** the root node of the task tree */
- private TaskTreeNode mRootNode;
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- */
- //-----------------------------------------------------------------------------------------------
- TaskTreeImpl(TaskTreeNode rootNode)
- {
- mRootNode = rootNode;
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeifc.TaskTree#getRoot()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public TaskTreeNode getRoot()
- {
- return mRootNode;
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeifc.TaskTree#getTaskMap()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public synchronized Map getTaskMap()
- {
- if (mTaskMap == null)
- {
- mTaskMap = new HashMap();
- addNodeToMap(mRootNode, null);
- }
- return mTaskMap;
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param rootNode
- */
- //-----------------------------------------------------------------------------------------------
- private void addNodeToMap(TaskTreeNode node, TaskTreeNode parent)
- {
- NodeInfoImpl nodeInfo = (NodeInfoImpl) mTaskMap.get(node);
-
- if (nodeInfo == null)
- {
- nodeInfo = new NodeInfoImpl(node);
- mTaskMap.put(node, nodeInfo);
- }
-
- if (parent != null)
- {
- // through first removing an existing parent it is assured, that a parent is recorded
- // only once. This is needed, because parent may be reused in a tree as well, but we always
- // iterate the whole tree
- nodeInfo.removeParent(parent);
- nodeInfo.addParent(parent);
- }
-
- for (TaskTreeNode child : node.getChildren())
- {
- addNodeToMap(child, node);
- }
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see java.lang.Object#clone()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public TaskTreeImpl clone()
- {
- TaskTreeImpl clone = null;
- try
- {
- clone = (TaskTreeImpl) super.clone();
-
- clone.mRootNode = mRootNode.clone();
-
- // the clone will create the task map itself, when it is first retrieved
- clone.mTaskMap = null;
-
- }
- catch (CloneNotSupportedException e)
- {
- // this should never happen. Therefore simply dump the exception
- e.printStackTrace();
- }
-
- return clone;
- }
-
-}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TaskTreeNode.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TaskTreeNode.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TaskTreeNode.java (revision 557)
@@ -0,0 +1,226 @@
+// Module : $RCSfile: TreeNode.java,v $
+// Version : $Revision: 0.0 $ $Author: Patrick $ $Date: 06.11.2011 11:00:46 $
+// Project : TaskTreePerformanceTest
+// Creation : 2011 by Patrick
+// Copyright : Patrick Harms, 2011
+
+package de.ugoe.cs.quest.tasktrees.treeimpl;
+
+import java.util.ArrayList;
+import java.util.List;
+
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: $
+ * @author 2011, last modified by $Author: $
+ */
+public class TaskTreeNode implements ITaskTreeNode {
+ /** */
+ private static int temporalId = 0;
+
+ /** */
+ private String name;
+
+ /** */
+ private String description;
+
+ /** */
+ private int id;
+
+ /** children */
+ private List children;
+
+ /**
+ *
+ */
+ public TaskTreeNode(String name) {
+ this.name = name;
+ id = getNewId();
+ }
+
+ /**
+ * TODO: comment
+ *
+ * @return
+ */
+ private static synchronized int getNewId() {
+ if (temporalId == Integer.MAX_VALUE) {
+ temporalId = 0;
+ }
+
+ return temporalId++;
+ }
+
+ /**
+ * @return Returns the name.
+ */
+ public String getName() {
+ return name;
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeifc.TaskTreeNode#getDescription()
+ */
+ @Override
+ public String getDescription() {
+ return description;
+ }
+
+ /**
+ *
+ */
+ public synchronized List getChildren() {
+ if ((children == null) || (children.size() == 0)) {
+ return new ArrayList();
+ }
+
+ return children.subList(0, children.size());
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode#equals(TaskTreeNode)
+ */
+ @Override
+ public boolean equals(ITaskTreeNode taskTreeNode) {
+ if (!this.getClass().isInstance(taskTreeNode)) {
+ return false;
+ }
+
+ if (taskTreeNode.hashCode() != hashCode()) {
+ return false;
+ }
+
+ TaskTreeNode other = (TaskTreeNode) taskTreeNode;
+
+ if (id != other.id) {
+ return false;
+ }
+
+ if (!name.equals(other.name)) {
+ return false;
+ }
+
+ synchronized (other) {
+ if (children == null) {
+ return (other.children == null);
+ }
+ else if (other.children == null) {
+ return (children == null);
+ }
+ else if (other.children.size() != children.size()) {
+ return false;
+ }
+
+ for (int i = 0; i < children.size(); i++) {
+ if (!children.get(i).equals(other.children.get(i))) {
+ return false;
+ }
+ }
+ }
+
+ return true;
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see java.lang.Object#hashCode()
+ */
+ @Override
+ public synchronized int hashCode() {
+ return getClass().getSimpleName().hashCode();
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see java.lang.Object#toString()
+ */
+ @Override
+ public synchronized String toString() {
+ if (children == null) {
+ return name + "(" + id + ")";
+ }
+ else {
+ return name + "(" + id + ", " + children.size() + " children)";
+ }
+ }
+
+ /**
+ * TODO: comment
+ *
+ * @param i
+ * @return
+ */
+ void setDescription(String description) {
+ this.description = description;
+ }
+
+ /**
+ *
+ */
+ synchronized void addChild(ITaskTreeNode child) {
+ if (children == null) {
+ children = new ArrayList();
+ }
+
+ children.add(child);
+ }
+
+ /**
+ *
+ */
+ synchronized void addChild(int index, ITaskTreeNode child) {
+ if (children == null) {
+ children = new ArrayList();
+ }
+
+ children.add(index, child);
+ }
+
+ /**
+ * TODO: comment
+ *
+ * @param i
+ * @return
+ */
+ synchronized ITaskTreeNode removeChild(int index) {
+ return children.remove(index);
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see java.lang.Object#clone()
+ */
+ @Override
+ public ITaskTreeNode clone() {
+ TaskTreeNode clone = null;
+ try {
+ clone = (TaskTreeNode) super.clone();
+
+ if (children != null) {
+ clone.children = new ArrayList();
+
+ for (ITaskTreeNode child : children) {
+ clone.children.add(child.clone());
+ }
+ }
+
+ }
+ catch (CloneNotSupportedException e) {
+ // this should never happen. Therefore simply dump the exception
+ e.printStackTrace();
+ }
+
+ return clone;
+ }
+
+}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TaskTreeNodeFactory.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TaskTreeNodeFactory.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TaskTreeNodeFactory.java (revision 557)
@@ -0,0 +1,91 @@
+// Module : $RCSfile: TaskTreeNodeFactoryImpl.java,v $
+// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 21.02.2012 $
+// Project : TaskTreeCreator
+// Creation : 2012 by patrick
+// Copyright : Patrick Harms, 2012
+
+
+package de.ugoe.cs.quest.tasktrees.treeimpl;
+
+import de.ugoe.cs.quest.eventcore.IEventTarget;
+import de.ugoe.cs.quest.eventcore.IEventType;
+import de.ugoe.cs.quest.tasktrees.treeifc.IEventTask;
+import de.ugoe.cs.quest.tasktrees.treeifc.IIteration;
+import de.ugoe.cs.quest.tasktrees.treeifc.ISelection;
+import de.ugoe.cs.quest.tasktrees.treeifc.ISequence;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTree;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNode;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITaskTreeNodeFactory;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITextInputEventTask;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: 21.02.2012$
+ * @author 2012, last modified by $Author: patrick$
+ */
+public class TaskTreeNodeFactory implements ITaskTreeNodeFactory {
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see TaskTreeNodeFactory#createNewEventTask(IEventType, IEventTarget)
+ */
+ @Override
+ public IEventTask createNewEventTask(IEventType eventType, IEventTarget eventTarget) {
+ return new EventTask(eventType, eventTarget);
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeifc.TaskTreeNodeFactory#createNewSequence()
+ */
+ @Override
+ public ISequence createNewSequence() {
+ return new Sequence();
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeifc.TaskTreeNodeFactory#createNewTextInputEventTask(eventTarget)
+ */
+ @Override
+ public ITextInputEventTask createNewTextInputEventTask(IEventTarget eventTarget) {
+ return new TextInputEventTask(eventTarget);
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeifc.TaskTreeNodeFactory#createNewIteration()
+ */
+ @Override
+ public IIteration createNewIteration() {
+ return new Iteration();
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeifc.TaskTreeNodeFactory#createNewSelection()
+ */
+ @Override
+ public ISelection createNewSelection() {
+ return new Selection();
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see
+ * de.ugoe.cs.tasktree.treeifc.TaskTreeNodeFactory#createTaskTree(de.ugoe.cs.tasktree.treeifc
+ * .TaskTreeNode)
+ */
+ @Override
+ public ITaskTree createTaskTree(ITaskTreeNode root) {
+ return new TaskTree(root);
+ }
+
+}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TaskTreeNodeFactoryImpl.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TaskTreeNodeFactoryImpl.java (revision 556)
+++ (revision )
@@ -1,99 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: TaskTreeNodeFactoryImpl.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 21.02.2012 $
-// Project : TaskTreeCreator
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.treeimpl;
-
-import de.ugoe.cs.quest.eventcore.guimodel.GUIElement;
-import de.ugoe.cs.quest.eventcore.userinteraction.Interaction;
-import de.ugoe.cs.quest.tasktrees.treeifc.InteractionTask;
-import de.ugoe.cs.quest.tasktrees.treeifc.Iteration;
-import de.ugoe.cs.quest.tasktrees.treeifc.Selection;
-import de.ugoe.cs.quest.tasktrees.treeifc.Sequence;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTree;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNodeFactory;
-import de.ugoe.cs.quest.tasktrees.treeifc.TextInputInteractionTask;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 21.02.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public class TaskTreeNodeFactoryImpl implements TaskTreeNodeFactory
-{
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see TaskTreeNodeFactory#createNewInteractionTask(GUIElement, Interaction)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public InteractionTask createNewInteractionTask(GUIElement guiElement,
- Interaction interaction)
- {
- return new InteractionTaskImpl(guiElement, interaction);
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeifc.TaskTreeNodeFactory#createNewSequence()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public Sequence createNewSequence()
- {
- return new SequenceImpl();
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeifc.TaskTreeNodeFactory#createNewTextInputInteractionTask()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public TextInputInteractionTask createNewTextInputInteractionTask(GUIElement guiElement)
- {
- return new TextInputInteractionTaskImpl(guiElement);
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeifc.TaskTreeNodeFactory#createNewIteration()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public Iteration createNewIteration()
- {
- return new IterationImpl();
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeifc.TaskTreeNodeFactory#createNewSelection()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public Selection createNewSelection()
- {
- return new SelectionImpl();
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeifc.TaskTreeNodeFactory#createTaskTree(de.ugoe.cs.tasktree.treeifc.TaskTreeNode)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public TaskTree createTaskTree(TaskTreeNode root)
- {
- return new TaskTreeImpl(root);
- }
-
-}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TaskTreeNodeImpl.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TaskTreeNodeImpl.java (revision 556)
+++ (revision )
@@ -1,277 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: TreeNode.java,v $
-// Version : $Revision: 0.0 $ $Author: Patrick $ $Date: 06.11.2011 11:00:46 $
-// Project : TaskTreePerformanceTest
-// Creation : 2011 by Patrick
-// Copyright : Patrick Harms, 2011
-//-------------------------------------------------------------------------------------------------
-
-package de.ugoe.cs.quest.tasktrees.treeimpl;
-
-import java.util.ArrayList;
-import java.util.List;
-
-import de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode;
-
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: $
- * @author 2011, last modified by $Author: $
- */
-//-------------------------------------------------------------------------------------------------
-public class TaskTreeNodeImpl implements TaskTreeNode
-{
- /** */
- private static int sTemporalId = 0;
-
- /** */
- private String mName;
-
- /** */
- private String mDescription;
-
- /** */
- private int mId;
-
- /** children */
- private List mChildren;
-
- //-----------------------------------------------------------------------------------------------
- /**
- */
- //-----------------------------------------------------------------------------------------------
- TaskTreeNodeImpl(String name)
- {
- mName = name;
- mId = getNewId();
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- private static synchronized int getNewId()
- {
- if (sTemporalId == Integer.MAX_VALUE)
- {
- sTemporalId = 0;
- }
-
- return sTemporalId++;
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * @return Returns the name.
- */
- //-----------------------------------------------------------------------------------------------
- public String getName()
- {
- return mName;
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeifc.TaskTreeNode#getDescription()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public String getDescription()
- {
- return mDescription;
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- */
- //-----------------------------------------------------------------------------------------------
- public synchronized List getChildren()
- {
- if ((mChildren == null) || (mChildren.size() == 0))
- {
- return new ArrayList();
- }
-
- return mChildren.subList(0, mChildren.size());
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.quest.tasktrees.treeifc.TaskTreeNode#equals(TaskTreeNode)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public boolean equals(TaskTreeNode taskTreeNode)
- {
- if (!this.getClass().isInstance(taskTreeNode))
- {
- return false;
- }
-
- if (taskTreeNode.hashCode() != hashCode())
- {
- return false;
- }
-
- TaskTreeNodeImpl other = (TaskTreeNodeImpl) taskTreeNode;
-
- if (mId != other.mId)
- {
- return false;
- }
-
- if (!mName.equals(other.mName))
- {
- return false;
- }
-
- synchronized (other)
- {
- if (mChildren == null)
- {
- return (other.mChildren == null);
- }
- else if (other.mChildren == null)
- {
- return (mChildren == null);
- }
- else if (other.mChildren.size() != mChildren.size())
- {
- return false;
- }
-
- for (int i = 0; i < mChildren.size(); i++)
- {
- if (!mChildren.get(i).equals(other.mChildren.get(i)))
- {
- return false;
- }
- }
- }
-
- return true;
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see java.lang.Object#hashCode()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public synchronized int hashCode()
- {
- return getClass().getSimpleName().hashCode();
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see java.lang.Object#toString()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public synchronized String toString()
- {
- if (mChildren == null)
- {
- return mName + "(" + mId + ")";
- }
- else
- {
- return mName + "(" + mId + ", " + mChildren.size() + " children)";
- }
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param i
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- void setDescription(String description)
- {
- mDescription = description;
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- */
- //-----------------------------------------------------------------------------------------------
- synchronized void addChild(TaskTreeNode child)
- {
- if (mChildren == null)
- {
- mChildren = new ArrayList();
- }
-
- mChildren.add(child);
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- */
- //-----------------------------------------------------------------------------------------------
- synchronized void addChild(int index, TaskTreeNode child)
- {
- if (mChildren == null)
- {
- mChildren = new ArrayList();
- }
-
- mChildren.add(index, child);
- }
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param i
- * @return
- */
- //-----------------------------------------------------------------------------------------------
- synchronized TaskTreeNode removeChild(int index)
- {
- return mChildren.remove(index);
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see java.lang.Object#clone()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public TaskTreeNode clone()
- {
- TaskTreeNodeImpl clone = null;
- try
- {
- clone = (TaskTreeNodeImpl) super.clone();
-
- if (mChildren != null)
- {
- clone.mChildren = new ArrayList();
-
- for (TaskTreeNode child : mChildren)
- {
- clone.mChildren.add(child.clone());
- }
- }
-
- }
- catch (CloneNotSupportedException e)
- {
- // this should never happen. Therefore simply dump the exception
- e.printStackTrace();
- }
-
- return clone;
- }
-
-}
Index: /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TextInputEventTask.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TextInputEventTask.java (revision 557)
+++ /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TextInputEventTask.java (revision 557)
@@ -0,0 +1,81 @@
+// Module : $RCSfile: TextInputSequenceImpl.java,v $
+// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 10.06.2012 $
+// Project : TaskTreeImpl
+// Creation : 2012 by patrick
+// Copyright : Patrick Harms, 2012
+
+package de.ugoe.cs.quest.tasktrees.treeimpl;
+
+import de.ugoe.cs.quest.eventcore.IEventTarget;
+import de.ugoe.cs.quest.eventcore.gui.TextInput;
+import de.ugoe.cs.quest.tasktrees.treeifc.ITextInputEventTask;
+
+/**
+ * TODO comment
+ *
+ * @version $Revision: $ $Date: 10.06.2012$
+ * @author 2012, last modified by $Author: patrick$
+ */
+public class TextInputEventTask extends EventTask implements ITextInputEventTask {
+
+ /** the text, that was finally entered in this sequence without all backspaces, etc. */
+ private String enteredText;
+
+ /**
+ * TODO: comment
+ *
+ * @param name
+ */
+ TextInputEventTask(IEventTarget eventTarget) {
+ super(new TextInput(), eventTarget);
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeimpl.TaskTreeNodeImpl#clone()
+ */
+ @Override
+ public TextInputEventTask clone() {
+ // entered text is unchangeable and does not need to be cloned
+ return (TextInputEventTask) super.clone();
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeifc.TextInputSequence#getEnteredText()
+ */
+ @Override
+ public String getEnteredText() {
+ return enteredText;
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see de.ugoe.cs.tasktree.treeifc.TextInputSequence#setEnteredText(java.lang.String)
+ */
+ @Override
+ public void setEnteredText(String text) {
+ enteredText = text;
+ }
+
+ /*
+ * (non-Javadoc)
+ *
+ * @see java.lang.Object#toString()
+ */
+ @Override
+ public synchronized String toString() {
+ if (super.getChildren() == null) {
+ return super.getName();
+ }
+ else {
+ return
+ "TextInputInteraction(\"" + enteredText + "\", " + super.getChildren().size() +
+ " children)";
+ }
+ }
+
+}
Index: unk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TextInputInteractionTaskImpl.java
===================================================================
--- /trunk/quest-core-tasktrees/src/main/java/de/ugoe/cs/quest/tasktrees/treeimpl/TextInputInteractionTaskImpl.java (revision 556)
+++ (revision )
@@ -1,94 +1,0 @@
-//-------------------------------------------------------------------------------------------------
-// Module : $RCSfile: TextInputSequenceImpl.java,v $
-// Version : $Revision: 0.0 $ $Author: patrick $ $Date: 10.06.2012 $
-// Project : TaskTreeImpl
-// Creation : 2012 by patrick
-// Copyright : Patrick Harms, 2012
-//-------------------------------------------------------------------------------------------------
-package de.ugoe.cs.quest.tasktrees.treeimpl;
-
-import de.ugoe.cs.quest.eventcore.guimodel.GUIElement;
-import de.ugoe.cs.quest.eventcore.userinteraction.TextInput;
-import de.ugoe.cs.quest.tasktrees.treeifc.TextInputInteractionTask;
-
-//-------------------------------------------------------------------------------------------------
-/**
- * TODO comment
- *
- * @version $Revision: $ $Date: 10.06.2012$
- * @author 2012, last modified by $Author: patrick$
- */
-//-------------------------------------------------------------------------------------------------
-public class TextInputInteractionTaskImpl extends InteractionTaskImpl
- implements TextInputInteractionTask
-{
-
- /** the text, that was finally entered in this sequence without all backspaces, etc. */
- private String mEnteredText;
-
- //-----------------------------------------------------------------------------------------------
- /**
- * TODO: comment
- *
- * @param name
- */
- //-----------------------------------------------------------------------------------------------
- TextInputInteractionTaskImpl(GUIElement guiElement)
- {
- super(guiElement, new TextInput());
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeimpl.TaskTreeNodeImpl#clone()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public TextInputInteractionTaskImpl clone()
- {
- // entered text is unchangeable and does not need to be cloned
- return (TextInputInteractionTaskImpl) super.clone();
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeifc.TextInputSequence#getEnteredText()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public String getEnteredText()
- {
- return mEnteredText;
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see de.ugoe.cs.tasktree.treeifc.TextInputSequence#setEnteredText(java.lang.String)
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public void setEnteredText(String text)
- {
- mEnteredText = text;
- }
-
- //-----------------------------------------------------------------------------------------------
- /* (non-Javadoc)
- * @see java.lang.Object#toString()
- */
- //-----------------------------------------------------------------------------------------------
- @Override
- public synchronized String toString()
- {
- if (super.getChildren() == null)
- {
- return super.getName();
- }
- else
- {
- return "TextInputInteraction(\"" + mEnteredText + "\", " + super.getChildren().size() +
- " children)";
- }
- }
-
-}