Changeset 1733 for branches/autoquest-core-tasktrees-alignment/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/algorithms/Match.java

Timestamp:

09/05/14 19:33:12 (10 years ago)

Author:

rkrimmel

Message:

Used Eclipse code cleanup

File:

• branches/autoquest-core-tasktrees-alignment/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/algorithms/Match.java (modified) (5 diffs)

branches/autoquest-core-tasktrees-alignment/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/algorithms/Match.java

@@ -5 +5 @@
 import java.util.LinkedList;
 
-
-
-public class Match implements Serializable{
+public class Match implements Serializable {
         /**
          * 
@@ -13 +11 @@
         private static final long serialVersionUID = -3206992723755714741L;
 
-        private ArrayList<NumberSequence> matchseqs;
+        private final ArrayList<NumberSequence> matchseqs;
 
         private LinkedList<MatchOccurence> occurences;
@@ -24 +22 @@
         }
 
-        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 int size() {
-                //Both sequences should be equally long
-                return matchseqs.get(0).size();
+        public void addOccurencesOf(Match m) {
+                occurences.addAll(m.getOccurences());
         }
 
@@ -63 +40 @@
         }
 
+        public NumberSequence getFirstSequence() {
+                return matchseqs.get(0);
+        }
+
         public LinkedList<MatchOccurence> getOccurences() {
                 return occurences;
+        }
+
+        public NumberSequence getSecondSequence() {
+                return matchseqs.get(1);
+        }
+
+        public int occurenceCount() {
+                return occurences.size();
+        }
+
+        public void setFirstSequence(NumberSequence seq) {
+                matchseqs.set(0, seq);
         }
 
@@ -71 +64 @@
         }
 
-        
-        public void addOccurencesOf(Match m) {
-                occurences.addAll(m.getOccurences());
+        public void setSecondSequence(NumberSequence seq) {
+                matchseqs.set(1, seq);
         }
-        
-        
-   
+
+        public int size() {
+                // Both sequences should be equally long
+                return matchseqs.get(0).size();
+        }
 
 }