- Timestamp:
- 08/04/14 17:27:03 (10 years ago)
- Location:
- branches/autoquest-core-tasktrees-alignment/src/main/java/de/ugoe/cs/autoquest/tasktrees
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/autoquest-core-tasktrees-alignment/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/algorithms/NumberSequence.java
r1648 r1650 48 48 } 49 49 50 //Searching occur ences of50 //Searching occurrences of 51 51 public LinkedList<Integer> containsPattern(Match pattern) { 52 52 LinkedList<Integer> result = new LinkedList<Integer>(); … … 58 58 int ipat1 =0; 59 59 int ipat2 =0; 60 int optcount1 = 0; 61 int optcount2 = 0; 60 62 while(ipat1 < pat1.length && ipat2<pat2.length) { 61 63 if(pat1[ipat1]==-1) { 62 64 ipat1++; 65 optcount1++; 63 66 continue; 64 67 } 65 68 if(pat2[ipat2]==-1) { 66 69 ipat2++; 70 optcount2++; 67 71 continue; 68 72 } 69 if (sequence[i + ipat1 ] != pat1[ipat1]70 && sequence[i + ipat2 ] != pat2[ipat2]) {73 if (sequence[i + ipat1-optcount1] != pat1[ipat1] 74 && sequence[i + ipat2-optcount2] != pat2[ipat2]) { 71 75 i++; 76 //System.out.println(sequence[i+ipat1] + " != " + pat1[ipat1] + " || " + sequence[i+ipat2] + " != " + pat2[ipat2]); 72 77 continue notmatched; 73 78 } -
branches/autoquest-core-tasktrees-alignment/src/main/java/de/ugoe/cs/autoquest/tasktrees/temporalrelation/SequenceForTaskDetectionRuleAlignment.java
r1649 r1650 206 206 .hasNext();) { 207 207 int start = jt.next(); 208 System.out.println("Found match ");209 pattern.getFirstSequence().printSequence();210 pattern.getSecondSequence().printSequence();211 System.out.println("in sequence " + (j+1) + " at position " + start);208 //System.out.println("Found match "); 209 //pattern.getFirstSequence().printSequence(); 210 //pattern.getSecondSequence().printSequence(); 211 //System.out.println("in sequence " + (j+1) + " at position " + start); 212 212 pattern.addOccurence( 213 213 new MatchOccurence(start, j));
Note: See TracChangeset
for help on using the changeset viewer.