package de.ugoe.cs.autoquest.tasktrees.alignment.algorithms; import java.util.ArrayList; import java.util.LinkedList; public class Match { private ArrayList matchseqs; private LinkedList occurences; Match() { matchseqs = new ArrayList(2); occurences = new LinkedList(); matchseqs.add(null); matchseqs.add(null); } public NumberSequence getFirstSequence() { return matchseqs.get(0); } public NumberSequence getSecondSequence() { return matchseqs.get(1); } public void setFirstSequence(NumberSequence seq) { matchseqs.set(0, seq); } public void setSecondSequence(NumberSequence seq) { matchseqs.set(1, seq); } public void addOccurence(MatchOccurence occurence) { occurences.add(occurence); } public int occurenceCount() { return occurences.size(); } public boolean equals(Match m) { if ((m.getFirstSequence().equals(this.getFirstSequence()) || m .getFirstSequence().equals(this.getSecondSequence())) && (m.getSecondSequence().equals(this.getFirstSequence()) || m .getSecondSequence().equals(this.getSecondSequence()))) { return true; } return false; } public LinkedList getOccurences() { return occurences; } public void setOccurences(LinkedList occurences) { this.occurences = occurences; } public void addOccurencesOf(Match m) { LinkedList occ = m.getOccurences(); occurences.addAll(occ); } }