[1620] | 1 | package de.ugoe.cs.autoquest.tasktrees.alignment.algorithms; |
---|
| 2 | |
---|
| 3 | import java.util.ArrayList; |
---|
| 4 | import java.util.LinkedList; |
---|
| 5 | |
---|
[1630] | 6 | |
---|
| 7 | |
---|
[1620] | 8 | public class Match { |
---|
| 9 | private ArrayList<NumberSequence> matchseqs; |
---|
[1621] | 10 | |
---|
| 11 | private LinkedList<MatchOccurence> occurences; |
---|
| 12 | |
---|
| 13 | Match() { |
---|
[1620] | 14 | matchseqs = new ArrayList<NumberSequence>(2); |
---|
| 15 | occurences = new LinkedList<MatchOccurence>(); |
---|
| 16 | matchseqs.add(null); |
---|
| 17 | matchseqs.add(null); |
---|
| 18 | } |
---|
[1621] | 19 | |
---|
[1620] | 20 | public NumberSequence getFirstSequence() { |
---|
| 21 | return matchseqs.get(0); |
---|
| 22 | } |
---|
[1621] | 23 | |
---|
[1620] | 24 | public NumberSequence getSecondSequence() { |
---|
| 25 | return matchseqs.get(1); |
---|
| 26 | } |
---|
[1621] | 27 | |
---|
[1620] | 28 | public void setFirstSequence(NumberSequence seq) { |
---|
| 29 | matchseqs.set(0, seq); |
---|
| 30 | } |
---|
[1621] | 31 | |
---|
[1620] | 32 | public void setSecondSequence(NumberSequence seq) { |
---|
| 33 | matchseqs.set(1, seq); |
---|
| 34 | } |
---|
[1621] | 35 | |
---|
[1620] | 36 | public void addOccurence(MatchOccurence occurence) { |
---|
| 37 | occurences.add(occurence); |
---|
| 38 | } |
---|
[1621] | 39 | |
---|
[1620] | 40 | public int occurenceCount() { |
---|
| 41 | return occurences.size(); |
---|
[1621] | 42 | } |
---|
[1657] | 43 | |
---|
| 44 | public int size() { |
---|
| 45 | //Both sequences should be equally long |
---|
| 46 | return matchseqs.get(0).size(); |
---|
| 47 | } |
---|
[1620] | 48 | |
---|
[1621] | 49 | public boolean equals(Match m) { |
---|
| 50 | if ((m.getFirstSequence().equals(this.getFirstSequence()) || m |
---|
| 51 | .getFirstSequence().equals(this.getSecondSequence())) |
---|
| 52 | && (m.getSecondSequence().equals(this.getFirstSequence()) || m |
---|
| 53 | .getSecondSequence().equals(this.getSecondSequence()))) { |
---|
| 54 | return true; |
---|
| 55 | } |
---|
| 56 | return false; |
---|
| 57 | } |
---|
| 58 | |
---|
| 59 | public LinkedList<MatchOccurence> getOccurences() { |
---|
| 60 | return occurences; |
---|
| 61 | } |
---|
| 62 | |
---|
| 63 | public void setOccurences(LinkedList<MatchOccurence> occurences) { |
---|
| 64 | this.occurences = occurences; |
---|
| 65 | } |
---|
| 66 | |
---|
[1655] | 67 | |
---|
[1621] | 68 | public void addOccurencesOf(Match m) { |
---|
[1655] | 69 | occurences.addAll(m.getOccurences()); |
---|
[1621] | 70 | } |
---|
[1630] | 71 | |
---|
[1655] | 72 | |
---|
[1630] | 73 | |
---|
[1621] | 74 | |
---|
[1620] | 75 | } |
---|