Changeset 1125 for trunk/autoquest-core-tasktrees/src/main/java/de/ugoe/cs/autoquest/tasktrees/nodeequality/NodeComparisonRule.java
- Timestamp:
- 03/18/13 11:46:47 (11 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/autoquest-core-tasktrees/src/main/java/de/ugoe/cs/autoquest/tasktrees/nodeequality/NodeComparisonRule.java
r1113 r1125 30 30 /** 31 31 * <p> 32 * checks if the rule is applicable for comparing the two provided nodes 33 * </p> 34 * 35 * @param node1 the first task tree node to compare 36 * @param node2 the second task tree node to compare 37 * 38 * @return true, if the rule is applicable, false else 39 */ 40 public boolean isApplicable(ITaskTreeNode node1, ITaskTreeNode node2); 41 42 /** 43 * <p> 44 * checks, if the provided nodes are lexically equal 45 * </p> 46 * 47 * @param node1 the first task tree node to compare 48 * @param node2 the second task tree node to compare 49 * 50 * @return true, if the nodes are equal, false else 51 */ 52 public boolean areLexicallyEqual(ITaskTreeNode node1, ITaskTreeNode node2); 53 54 /** 55 * <p> 56 * checks, if the provided nodes are syntactically equal 57 * </p> 58 * 59 * @param node1 the first task tree node to compare 60 * @param node2 the second task tree node to compare 61 * 62 * @return true, if the nodes are equal, false else 63 */ 64 public boolean areSyntacticallyEqual(ITaskTreeNode node1, ITaskTreeNode node2); 65 66 /** 67 * <p> 68 * checks, if the provided nodes are semantically equal 69 * </p> 70 * 71 * @param node1 the first task tree node to compare 72 * @param node2 the second task tree node to compare 73 * 74 * @return true, if the nodes are equal, false else 75 */ 76 public boolean areSemanticallyEqual(ITaskTreeNode node1, ITaskTreeNode node2); 77 78 /** 79 * <p> 32 80 * compares two nodes with each other. The result of the method is either a node equality or 33 81 * null. If it is null, it means, that the rule is not able to correctly compare the two given
Note: See TracChangeset
for help on using the changeset viewer.