source: branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/algorithms/Match.java @ 1620

package de.ugoe.cs.autoquest.tasktrees.alignment.algorithms;

import java.util.ArrayList;
import java.util.LinkedList;

public class Match {
        private ArrayList<NumberSequence> matchseqs;
        
        private LinkedList<MatchOccurence> occurences; 
        
        
        Match(){
                matchseqs = new ArrayList<NumberSequence>(2);
                occurences = new LinkedList<MatchOccurence>();
                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();
        }       

}