Changeset 1186 for trunk/autoquest-core-usageprofiles/src
- Timestamp:
- 04/29/13 13:56:31 (12 years ago)
- Location:
- trunk/autoquest-core-usageprofiles/src/main/java/de/ugoe/cs/autoquest/usageprofiles
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/autoquest-core-usageprofiles/src/main/java/de/ugoe/cs/autoquest/usageprofiles/DefaultSymbolComparator.java
r1060 r1186 26 26 public class DefaultSymbolComparator<T> implements SymbolComparator<T> { 27 27 28 /** */ 29 private static final long serialVersionUID = 1L; 30 28 31 /* (non-Javadoc) 29 32 * @see de.ugoe.cs.autoquest.tasktrees.temporalrelation.SymbolComparator#equals(java.lang.Object, java.lang.Object) -
trunk/autoquest-core-usageprofiles/src/main/java/de/ugoe/cs/autoquest/usageprofiles/Trie.java
r1118 r1186 324 324 325 325 /** 326 * 326 * <p> 327 * used to recursively process the trie. The provided processor will be called for any path 328 * through the tree. The processor may abort the processing through returns values of its 329 * {@link TrieProcessor#process(List, int)} method. 330 * </p> 331 * 332 * @param processor the processor to process the tree 327 333 */ 328 334 public void process(TrieProcessor<T> processor) { … … 338 344 /** 339 345 * <p> 340 * TODO: comment 341 * </p> 342 * @param context 343 * 344 * @param child 345 * @param processor 346 * processes a specific path by calling the provided processor. Furthermore, the method 347 * calls itself recursively for further subpaths. 348 * </p> 349 * 350 * @param context the context of the currently processed trie node, i.e. the preceeding 351 * symbols 352 * @param child the processed trie node 353 * @param processor the processor used for processing the trie 354 * 355 * @return true, if processing shall continue, false else 346 356 */ 347 357 private boolean process(LinkedList<T> context, -
trunk/autoquest-core-usageprofiles/src/main/java/de/ugoe/cs/autoquest/usageprofiles/TrieProcessor.java
r1118 r1186 19 19 /** 20 20 * <p> 21 * TODO comment 21 * A trie processor can be used to recursively process a trie. It will be called for each path 22 * stored in the trie. The method called is the {@link #process(List, int)} method. It is provided 23 * with the symbol path and the number of its occurrences. The processor may decide for each 24 * call to the method using its return value, if the processing shall continue, if the path and all 25 * its subsequent symbols can be skipped, or if the whole processing shall be broken up. 22 26 * </p> 23 27 * … … 27 31 28 32 /** 29 * 33 * <p> 34 * potential results for a call to the {@link TrieProcessor#process(List, int)} method. The 35 * processor may decide for each call to the method using its return value, if the processing 36 * shall continue, if the path and all its subsequent symbols can be skipped, or if the whole 37 * processing shall be broken up. 38 * </p> 30 39 */ 31 40 public enum Result { … … 34 43 35 44 /** 45 * <p> 46 * called for each path of symbols stored in the trie which is processed. The method is 47 * provided with the symbol path and the number of its occurrences. The processor may decide 48 * for each call to the method using its return value, if the processing shall continue, if 49 * the path and all its subsequent symbols can be skipped, or if the whole processing shall 50 * be broken up. 51 * </p> 36 52 * 53 * @param sequence the symbol path to be processed 54 * @param count the number of occurrences of the provided symbol path in the trained 55 * sequence 56 * 57 * @return as described 37 58 */ 38 59 public Result process(List<T> sequence, int count);
Note: See TracChangeset
for help on using the changeset viewer.