- Timestamp:
- 07/27/14 20:28:19 (10 years ago)
- Location:
- branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/algorithms
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/algorithms/Match.java
r1620 r1621 2 2 3 3 import java.util.ArrayList; 4 import java.util.Iterator; 4 5 import java.util.LinkedList; 5 6 6 7 public class Match { 7 8 private ArrayList<NumberSequence> matchseqs; 8 9 private LinkedList<MatchOccurence> occurences; 10 11 12 Match(){ 9 10 private LinkedList<MatchOccurence> occurences; 11 12 Match() { 13 13 matchseqs = new ArrayList<NumberSequence>(2); 14 14 occurences = new LinkedList<MatchOccurence>(); … … 16 16 matchseqs.add(null); 17 17 } 18 18 19 19 public NumberSequence getFirstSequence() { 20 20 return matchseqs.get(0); 21 21 } 22 22 23 23 public NumberSequence getSecondSequence() { 24 24 return matchseqs.get(1); 25 25 } 26 26 27 27 public void setFirstSequence(NumberSequence seq) { 28 28 matchseqs.set(0, seq); 29 29 } 30 30 31 31 public void setSecondSequence(NumberSequence seq) { 32 32 matchseqs.set(1, seq); 33 33 } 34 34 35 35 public void addOccurence(MatchOccurence occurence) { 36 36 occurences.add(occurence); 37 37 } 38 38 39 39 public int occurenceCount() { 40 40 return occurences.size(); 41 } 41 } 42 43 public boolean equals(Match m) { 44 if ((m.getFirstSequence().equals(this.getFirstSequence()) || m 45 .getFirstSequence().equals(this.getSecondSequence())) 46 && (m.getSecondSequence().equals(this.getFirstSequence()) || m 47 .getSecondSequence().equals(this.getSecondSequence()))) { 48 return true; 49 } 50 return false; 51 } 52 53 public LinkedList<MatchOccurence> getOccurences() { 54 return occurences; 55 } 56 57 public void setOccurences(LinkedList<MatchOccurence> occurences) { 58 this.occurences = occurences; 59 } 60 61 62 public void addOccurencesOf(Match m) { 63 LinkedList<MatchOccurence> occ = m.getOccurences(); 64 occurences.addAll(occ); 65 } 42 66 43 67 } -
branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/algorithms/NumberSequence.java
r1620 r1621 2 2 3 3 import java.util.ArrayList; 4 import java.util.LinkedList; 4 5 import java.util.Random; 5 6 … … 61 62 } 62 63 63 64 public int containsPattern(Match pattern) { 64 //Searching occurences of 65 public LinkedList<Integer> containsPattern(Match pattern) { 66 LinkedList<Integer> result = new LinkedList<Integer>(); 65 67 int i = 0; 66 int count = 0;67 68 int[] pat1 = pattern.getFirstSequence().getSequence(); 68 69 int[] pat2 = pattern.getSecondSequence().getSequence(); … … 88 89 ipat2++; 89 90 } 90 count++;91 result.add(i); 91 92 } 92 93 i++; 93 94 } 94 return count;95 return result; 95 96 } 96 97 … … 119 120 this.id = id; 120 121 } 122 123 public boolean equals(NumberSequence n) { 124 int[] seq = n.getSequence(); 125 if(n.size() !=this.size()) { 126 return false; 127 } 128 for (int i=0; i<n.size();i++) { 129 if(seq[i] != this.sequence[i]) { 130 return false; 131 } 132 } 133 return true; 134 } 135 136 121 137 }
Note: See TracChangeset
for help on using the changeset viewer.