|
31 | 31 | import org.biojava.nbio.core.sequence.location.template.Location; |
32 | 32 | import org.biojava.nbio.core.sequence.location.template.Point; |
33 | 33 | import org.biojava.nbio.core.sequence.template.*; |
| 34 | +import org.biojava.nbio.core.util.Equals; |
34 | 35 |
|
35 | 36 | import java.io.Serializable; |
36 | 37 | import java.util.ArrayList; |
@@ -60,7 +61,9 @@ public class SimpleAlignedSequence<S extends Sequence<C>, C extends Compound> im |
60 | 61 | // cached (lazily initialized) |
61 | 62 | private int numGaps = -1; |
62 | 63 | private int numGapPositions = -1; |
63 | | - private int[] alignmentFromSequence, sequenceFromAlignment; |
| 64 | + |
| 65 | + private int[] alignmentFromSequence; |
| 66 | + private int[] sequenceFromAlignment; |
64 | 67 |
|
65 | 68 | /** |
66 | 69 | * Creates an {@link AlignedSequence} for the given {@link Sequence} in a global alignment. |
@@ -132,25 +135,35 @@ public void clearCache() { |
132 | 135 | sequenceFromAlignment = null; |
133 | 136 | } |
134 | 137 |
|
135 | | - @Override |
136 | | - public int getAlignmentIndexAt(int sequenceIndex) { |
137 | | - if (alignmentFromSequence == null) { |
138 | | - alignmentFromSequence = new int[original.getLength()]; |
139 | | - int s = 1, a = 1; |
140 | | - for (int i = 0; i < numBefore; i++, s++) { |
141 | | - alignmentFromSequence[s - 1] = a; |
142 | | - } |
143 | | - for (; s <= alignmentFromSequence.length && a <= length; s++, a++) { |
144 | | - while (a <= length && isGap(a)) { |
145 | | - a++; |
146 | | - } |
147 | | - alignmentFromSequence[s - 1] = a; |
148 | | - } |
149 | | - a--; |
150 | | - for (int i = 0; i < numAfter; i++, s++) { |
151 | | - alignmentFromSequence[s - 1] = a; |
| 138 | + private void setAlignmentFromSequence() { |
| 139 | + alignmentFromSequence = new int[original.getLength()]; |
| 140 | + int s = 1, a = 1; |
| 141 | + for (int i = 0; i < numBefore; i++, s++) { |
| 142 | + alignmentFromSequence[s - 1] = a; |
| 143 | + } |
| 144 | + for (; s <= alignmentFromSequence.length && a <= length; s++, a++) { |
| 145 | + while (a <= length && isGap(a)) { |
| 146 | + a++; |
152 | 147 | } |
| 148 | + alignmentFromSequence[s - 1] = a; |
| 149 | + } |
| 150 | + a--; |
| 151 | + for (int i = 0; i < numAfter; i++, s++) { |
| 152 | + alignmentFromSequence[s - 1] = a; |
153 | 153 | } |
| 154 | + } |
| 155 | + |
| 156 | + @Override |
| 157 | + public int[] getAlignmentFromSequence() { |
| 158 | + if (alignmentFromSequence == null) |
| 159 | + setAlignmentFromSequence(); |
| 160 | + return alignmentFromSequence; |
| 161 | + } |
| 162 | + |
| 163 | + @Override |
| 164 | + public int getAlignmentIndexAt(int sequenceIndex) { |
| 165 | + if (alignmentFromSequence == null) |
| 166 | + setAlignmentFromSequence(); |
154 | 167 | return alignmentFromSequence[sequenceIndex - 1]; |
155 | 168 | } |
156 | 169 |
|
@@ -197,21 +210,31 @@ public int getOverlapCount() { |
197 | 210 | return 1; |
198 | 211 | } |
199 | 212 |
|
200 | | - @Override |
201 | | - public int getSequenceIndexAt(int alignmentIndex) { |
202 | | - if (sequenceFromAlignment == null) { |
203 | | - sequenceFromAlignment = new int[length]; |
204 | | - int a = 1, s = numBefore + 1; |
205 | | - for (int i = 0; i < getStart().getPosition(); i++, a++) { |
206 | | - sequenceFromAlignment[a - 1] = s; |
207 | | - } |
208 | | - for (; a <= length; a++) { |
209 | | - if (!isGap(a)) { |
210 | | - s++; |
211 | | - } |
212 | | - sequenceFromAlignment[a - 1] = s; |
| 213 | + private void setSequenceFromAlignment() { |
| 214 | + sequenceFromAlignment = new int[length]; |
| 215 | + int a = 1, s = numBefore + 1; |
| 216 | + for (int i = 0; i < getStart().getPosition(); i++, a++) { |
| 217 | + sequenceFromAlignment[a - 1] = s; |
| 218 | + } |
| 219 | + for (; a <= length; a++) { |
| 220 | + if (!isGap(a)) { |
| 221 | + s++; |
213 | 222 | } |
| 223 | + sequenceFromAlignment[a - 1] = s; |
214 | 224 | } |
| 225 | + } |
| 226 | + |
| 227 | + @Override |
| 228 | + public int[] getSequenceFromAlignment() { |
| 229 | + if (sequenceFromAlignment == null) |
| 230 | + setSequenceFromAlignment(); |
| 231 | + return sequenceFromAlignment; |
| 232 | + } |
| 233 | + |
| 234 | + @Override |
| 235 | + public int getSequenceIndexAt(int alignmentIndex) { |
| 236 | + if (sequenceFromAlignment == null) |
| 237 | + setSequenceFromAlignment(); |
215 | 238 | return sequenceFromAlignment[alignmentIndex - 1]; |
216 | 239 | } |
217 | 240 |
|
@@ -269,6 +292,30 @@ public List<C> getAsList() { |
269 | 292 | return compounds; |
270 | 293 | } |
271 | 294 |
|
| 295 | + @Override |
| 296 | + public boolean equals(Object o){ |
| 297 | + |
| 298 | + if(! Equals.classEqual(this, o)) { |
| 299 | + return false; |
| 300 | + } |
| 301 | + |
| 302 | + Sequence<C> other = (Sequence<C>)o; |
| 303 | + if ( original.getAsList().size() != other.getAsList().size()) |
| 304 | + return false; |
| 305 | + |
| 306 | + for ( int i = 0 ; i< original.getAsList().size() ; i++){ |
| 307 | + if ( ! original.getAsList().get(i).equalsIgnoreCase(other.getAsList().get(i))) |
| 308 | + return false; |
| 309 | + } |
| 310 | + return true; |
| 311 | + } |
| 312 | + |
| 313 | + @Override |
| 314 | + public int hashCode(){ |
| 315 | + String s = getSequenceAsString(); |
| 316 | + return s.hashCode(); |
| 317 | + } |
| 318 | + |
272 | 319 | @Override |
273 | 320 | public C getCompoundAt(int alignmentIndex) { |
274 | 321 | return alignmentIndex >= 1 && alignmentIndex <= length && isGap(alignmentIndex) ? |
|
0 commit comments