// Copyright 2012 Georg-August-Universität Göttingen, Germany // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // http://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. package de.ugoe.cs.autoquest.tasktrees.treeimpl; import java.util.Collection; import java.util.Collections; import java.util.HashSet; import java.util.LinkedList; import de.ugoe.cs.autoquest.tasktrees.treeifc.IEventTaskInstance; import de.ugoe.cs.autoquest.tasktrees.treeifc.IIterationInstance; import de.ugoe.cs.autoquest.tasktrees.treeifc.IOptionalInstance; import de.ugoe.cs.autoquest.tasktrees.treeifc.ISelectionInstance; import de.ugoe.cs.autoquest.tasktrees.treeifc.ISequenceInstance; import de.ugoe.cs.autoquest.tasktrees.treeifc.ITask; import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskInstance; import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskInstanceList; import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskVisitor; /** *

* this is the default implementation of the interface {@link ITask}. It * does not do anything fancy except implementing the interface. *

* * @author Patrick Harms */ abstract class Task implements ITask { /** *

* default serial version UID *

*/ private static final long serialVersionUID = 1L; /** *

* used as a counter to generate new ids for each newly created task. May overflow. *

*/ private static int temporalId = 0; /** *

* the id of the task (unique throughout the system as long as {@link #temporalId} does not * overflow. *

*/ private int id; /** *

* a human readable type of the task (used for visualization purposes) *

*/ private String type; /** *

* a human readable description of the task *

*/ private String description; /** *

* the instances of this task *

*/ private final Collection instances = new HashSet(); /** *

* the unmodifiable view on the instances of this task *

*/ private final Collection unmodifiableInstances; /** *

* the execution variants of this task *

*/ private Collection> executionVariants; /** *

* constructs a new task with a new id. The id is generated using the {@link #getNewId()} * method *

* * @param type the human readable type of the task * * @throws IllegalArgumentException in the case the provided type is null */ Task(String type) { this.id = getNewId(); this.type = type; if (type == null) { throw new IllegalArgumentException("type must not be null"); } unmodifiableInstances = Collections.unmodifiableCollection(instances); } /** *

* creates a new id for a task using {@link #temporalId} by incrementing it an returning its * current value. Resets the counter if {@link Integer.MAX_VALUE} is reached. *

* * @return a new unique id for a task as long as {@link #temporalId} does not overflow */ private static synchronized int getNewId() { if (temporalId == Integer.MAX_VALUE) { temporalId = 0; } return temporalId++; } /* (non-Javadoc) * @see de.ugoe.cs.autoquest.tasktrees.treeifc.ITask#geId() */ @Override public int getId() { return id; } /* (non-Javadoc) * @see de.ugoe.cs.autoquest.tasktrees.treeifc.ITask#getType() */ @Override public String getType() { return type; } /* (non-Javadoc) * @see de.ugoe.cs.autoquest.tasktrees.treeifc.ITask#getDescription() */ @Override public String getDescription() { return description; } /* (non-Javadoc) * @see de.ugoe.cs.autoquest.tasktrees.treeifc.ITask#getInstances() */ @Override public Collection getInstances() { return unmodifiableInstances; } /* (non-Javadoc) * @see de.ugoe.cs.autoquest.tasktrees.treeifc.ITask#getExecutionVariants() */ @Override public synchronized Collection> getExecutionVariants() { if (executionVariants == null) { executionVariants = new LinkedList>(); determineExecutionVariants(executionVariants); } return executionVariants; } /* (non-Javadoc) * @see de.ugoe.cs.autoquest.tasktrees.treeifc.ITask#equals(ITask) */ @Override public final boolean equals(ITask task) { // tasks are only equal if they are identical or if they have the same id // (may happen, if they are cloned) return (this == task) || (this.hashCode() == task.hashCode()); } /* (non-Javadoc) * @see de.ugoe.cs.autoquest.tasktrees.treeifc.ITask#hashCode() */ @Override public synchronized int hashCode() { return id; } /* (non-Javadoc) * @see java.lang.Object#toString() */ @Override public synchronized String toString() { StringBuffer result = new StringBuffer(); result.append(type); result.append(" #"); result.append(id); if (description != null) { result.append(" ("); result.append(description); result.append(')'); } return result.toString(); } /* (non-Javadoc) * @see de.ugoe.cs.autoquest.tasktrees.treeifc.ITask#clone() */ @Override public synchronized ITask clone() { Task clone = null; try { clone = (Task) super.clone(); } catch (CloneNotSupportedException e) { // this should never happen. Therefore simply dump the exception e.printStackTrace(); } return clone; } /** *

* internally used to set the human readable description of the task *

* * @param description the new human readable description of the task */ void setDescription(String description) { this.description = description; } /** *

* internally used to remove an instance from this task *

* * @param instance the instance to be removed from this task */ synchronized void removeInstance(ITaskInstance instance) { this.instances.remove(instance); this.executionVariants = null; } /** *

* internally used to add an instance to this task *

* * @param instance the instance belonging to this task */ synchronized void addInstance(ITaskInstance instance) { this.instances.add(instance); this.executionVariants = null; } /* (non-Javadoc) * @see de.ugoe.cs.autoquest.tasktrees.treeifc.ITask#accept(ITaskVisitor) */ @Override public void accept(ITaskVisitor visitor) { visitor.visit(this); } /** * */ private void determineExecutionVariants(Collection> executionVariants) { for (ITaskInstance instance : instances) { boolean added = false; for (Collection variant : executionVariants) { if (!variant.isEmpty() && (isSameExecution(variant.iterator().next(), instance))) { variant.add(instance); added = true; } } if (!added) { Collection variant = new HashSet(); variant.add(instance); executionVariants.add(variant); } } } /** * */ private boolean isSameExecution(ITaskInstance instance1, ITaskInstance instance2) { if (instance1 instanceof IIterationInstance) { if (!(instance2 instanceof IIterationInstance)) { return false; } ITaskInstanceList iteration1 = (ITaskInstanceList) instance1; ITaskInstanceList iteration2 = (ITaskInstanceList) instance2; return isSameExecutionList(iteration1, iteration2); } else if (instance1 instanceof ISequenceInstance) { if (!(instance2 instanceof ISequenceInstance)) { return false; } ITaskInstanceList selection1 = (ITaskInstanceList) instance1; ITaskInstanceList selection2 = (ITaskInstanceList) instance2; return isSameExecutionList(selection1, selection2); } else if (instance1 instanceof ISelectionInstance) { if (!(instance2 instanceof ISelectionInstance)) { return false; } else { return isSameExecution(((ISelectionInstance) instance1).getChild(), ((ISelectionInstance) instance2).getChild()); } } else if (instance1 instanceof IOptionalInstance) { if (!(instance2 instanceof IOptionalInstance)) { return false; } else { return isSameExecution(((IOptionalInstance) instance1).getChild(), ((IOptionalInstance) instance2).getChild()); } } else if (instance1 instanceof IEventTaskInstance) { if (!(instance2 instanceof IEventTaskInstance)) { return false; } else { return ((IEventTaskInstance) instance1).getTask().equals (((IEventTaskInstance) instance2).getTask()); } } else if (instance1 == null) { return instance2 == null; } else { throw new IllegalArgumentException("unknown type of task instance: " + instance1); } } /** * */ private boolean isSameExecutionList(ITaskInstanceList list1, ITaskInstanceList list2) { if (list1.size() == list2.size()) { for (int i = 0; i < list1.size(); i++) { if (!isSameExecution(list1.get(i), list2.get(i))) { return false; } } return true; } else { return false; } } }