+ * TODO: comment + *
+ * + * @param appData + */ + private void harmonizeEventTaskInstancesModel(RuleApplicationData appData) { + System.out.print("harmonizing task model of event task instances"); + appData.getStopWatch().start("harmonizing event tasks"); + + SymbolMap- * deserialize this object and reinitialize the buffers - *
- */ - private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException { - in.defaultReadObject(); - init(); - } - } - - /** - * - */ - private static interface Comparer { - - /** - * - */ - boolean compare(ITask task1, ITask task2); - } - - /** - * - */ - private static class LexicalComparer implements Comparer { - - /** - * - */ - public boolean compare(ITask task1, ITask task2) { - return TaskEqualityRuleManager.getInstance().areLexicallyEqual(task1, task2); - } - } - - /** - * - */ - private static class SyntacticalComparer implements Comparer { - - /** - * - */ - public boolean compare(ITask task1, ITask task2) { - return TaskEqualityRuleManager.getInstance().areSyntacticallyEqual(task1, task2); - } - } - - /** - * - */ - private static class SemanticalComparer implements Comparer { - - /** - * - */ - public boolean compare(ITask task1, ITask task2) { - return TaskEqualityRuleManager.getInstance().areSemanticallyEqual(task1, task2); - } - } - - /** - * - */ - private static class DefaultComparer implements Comparer { - - /** - *- * the minimal task equality two identified sublists need to have to consider them as equal - *
- */ - private TaskEquality minimalNodeEquality; - - /** - * - */ - public DefaultComparer(TaskEquality minimalNodeEquality) { - this.minimalNodeEquality = minimalNodeEquality; - } - - /** - * - */ - public boolean compare(ITask task1, ITask task2) { - return TaskEqualityRuleManager.getInstance().areAtLeastEqual - (task1, task2, minimalNodeEquality); - } + public String toString() { + StringBuffer result = new StringBuffer(); + result.append(this.occurrenceCount); + result.append(" occurrences:\n"); + + for (List+ * deserialize this object and reinitialize the buffers + *
+ */ + private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException { + in.defaultReadObject(); + init(); + } + + + /** + * + */ + private static interface Comparer { + + /** + * + */ + boolean compare(ITask task1, ITask task2); + } + + /** + * + */ + private static class LexicalComparer implements Comparer { + + /** + * + */ + public boolean compare(ITask task1, ITask task2) { + return TaskEqualityRuleManager.getInstance().areLexicallyEqual(task1, task2); + } + } + + /** + * + */ + private static class SyntacticalComparer implements Comparer { + + /** + * + */ + public boolean compare(ITask task1, ITask task2) { + return TaskEqualityRuleManager.getInstance().areSyntacticallyEqual(task1, task2); + } + } + + /** + * + */ + private static class SemanticalComparer implements Comparer { + + /** + * + */ + public boolean compare(ITask task1, ITask task2) { + return TaskEqualityRuleManager.getInstance().areSemanticallyEqual(task1, task2); + } + } + + /** + * + */ + private static class DefaultComparer implements Comparer { + + /** + *+ * the minimal task equality two identified sublists need to have to consider them as equal + *
+ */ + private TaskEquality minimalNodeEquality; + + /** + * + */ + public DefaultComparer(TaskEquality minimalNodeEquality) { + this.minimalNodeEquality = minimalNodeEquality; + } + + /** + * + */ + public boolean compare(ITask task1, ITask task2) { + return TaskEqualityRuleManager.getInstance().areAtLeastEqual + (task1, task2, minimalNodeEquality); + } + } +} Index: trunk/autoquest-core-tasktrees/src/main/java/de/ugoe/cs/autoquest/tasktrees/temporalrelation/TaskInstanceTrie.java =================================================================== --- trunk/autoquest-core-tasktrees/src/main/java/de/ugoe/cs/autoquest/tasktrees/temporalrelation/TaskInstanceTrie.java (revision 1256) +++ trunk/autoquest-core-tasktrees/src/main/java/de/ugoe/cs/autoquest/tasktrees/temporalrelation/TaskInstanceTrie.java (revision 1256) @@ -0,0 +1,197 @@ +// 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.temporalrelation; + +import java.util.HashMap; +import java.util.LinkedList; +import java.util.List; +import java.util.Map; + +import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskInstance; +import de.ugoe.cs.autoquest.tasktrees.treeifc.IUserSession; +import de.ugoe.cs.autoquest.usageprofiles.SymbolMap; +import de.ugoe.cs.autoquest.usageprofiles.Trie; +import de.ugoe.cs.autoquest.usageprofiles.TrieProcessor; + +/** + *+ * TODO comment + *
+ * + * @author Patrick Harms + */ +public class TaskInstanceTrie extends Trie+ * the task comparator to be used for comparing tasks + *
+ */ + private TaskComparator comparator; + + /** + *+ * TODO: comment + *
+ * + * @param taskComparator2 + */ + public TaskInstanceTrie(TaskComparator taskComparator) { + super(taskComparator); + this.comparator = taskComparator; + } + + /** + * + */ + public void trainSessions(List+ * TODO: comment + *
+ * + * @return + */ + private int getCurrentSequenceMaxCount() { + MaxSequenceCountFinder processor = new MaxSequenceCountFinder(); + super.process(processor); + return processor.getMaxCount(); + } + + /** + * @author Patrick Harms + */ + private class MaxSequenceCountFinder implements TrieProcessor