1 |
|
|
2 |
|
|
3 |
|
|
4 |
|
|
5 |
|
|
6 |
|
|
7 |
|
|
8 |
|
|
9 |
|
|
10 |
|
|
11 |
|
|
12 |
|
|
13 |
|
|
14 |
|
|
15 |
|
|
16 |
|
|
17 |
|
|
18 |
|
|
19 |
|
|
20 |
|
|
21 |
|
package jalview.datamodel; |
22 |
|
|
23 |
|
import java.util.ArrayList; |
24 |
|
import java.util.BitSet; |
25 |
|
import java.util.List; |
26 |
|
|
27 |
|
|
28 |
|
|
29 |
|
|
30 |
|
|
31 |
|
@author |
32 |
|
|
33 |
|
|
|
|
| 87.5% |
Uncovered Elements: 13 (104) |
Complexity: 32 |
Complexity Density: 0.49 |
|
34 |
|
public class SearchResults implements SearchResultsI |
35 |
|
{ |
36 |
|
|
37 |
|
private List<SearchResultMatchI> matches = new ArrayList<>(); |
38 |
|
|
39 |
|
|
40 |
|
|
41 |
|
|
42 |
|
|
|
|
| 89.7% |
Uncovered Elements: 4 (39) |
Complexity: 13 |
Complexity Density: 0.57 |
|
43 |
|
public class Match implements SearchResultMatchI |
44 |
|
{ |
45 |
|
final SequenceI sequence; |
46 |
|
|
47 |
|
|
48 |
|
|
49 |
|
|
50 |
|
final int start; |
51 |
|
|
52 |
|
|
53 |
|
|
54 |
|
|
55 |
|
final int end; |
56 |
|
|
57 |
|
|
58 |
|
|
59 |
|
|
60 |
|
|
61 |
|
|
62 |
|
|
63 |
|
@param |
64 |
|
|
65 |
|
@param |
66 |
|
|
67 |
|
@param |
68 |
|
|
69 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (8) |
Complexity: 2 |
Complexity Density: 0.33 |
|
70 |
214 |
public Match(SequenceI seq, int start, int end)... |
71 |
|
{ |
72 |
214 |
sequence = seq; |
73 |
|
|
74 |
|
|
75 |
|
|
76 |
|
|
77 |
|
|
78 |
|
|
79 |
214 |
if (start <= end) |
80 |
|
{ |
81 |
213 |
this.start = start; |
82 |
213 |
this.end = end; |
83 |
|
} |
84 |
|
else |
85 |
|
{ |
86 |
|
|
87 |
|
|
88 |
|
|
89 |
1 |
this.start = end; |
90 |
1 |
this.end = start; |
91 |
|
} |
92 |
|
} |
93 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
94 |
265 |
@Override... |
95 |
|
public SequenceI getSequence() |
96 |
|
{ |
97 |
265 |
return sequence; |
98 |
|
} |
99 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
100 |
233 |
@Override... |
101 |
|
public int getStart() |
102 |
|
{ |
103 |
233 |
return start; |
104 |
|
} |
105 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
106 |
195 |
@Override... |
107 |
|
public int getEnd() |
108 |
|
{ |
109 |
195 |
return end; |
110 |
|
} |
111 |
|
|
112 |
|
|
113 |
|
|
114 |
|
|
|
|
| 85.7% |
Uncovered Elements: 1 (7) |
Complexity: 2 |
Complexity Density: 0.4 |
|
115 |
7 |
@Override... |
116 |
|
public String toString() |
117 |
|
{ |
118 |
7 |
StringBuilder sb = new StringBuilder(); |
119 |
7 |
if (sequence != null) |
120 |
|
{ |
121 |
7 |
sb.append(sequence.getName()).append("/"); |
122 |
|
} |
123 |
7 |
sb.append(start).append("-").append(end); |
124 |
7 |
return sb.toString(); |
125 |
|
} |
126 |
|
|
127 |
|
|
128 |
|
|
129 |
|
|
130 |
|
|
131 |
|
|
|
|
| 83.3% |
Uncovered Elements: 1 (6) |
Complexity: 2 |
Complexity Density: 0.5 |
|
132 |
8 |
@Override... |
133 |
|
public int hashCode() |
134 |
|
{ |
135 |
8 |
int hash = sequence == null ? 0 : sequence.hashCode(); |
136 |
8 |
hash += 31 * start; |
137 |
8 |
hash += 67 * end; |
138 |
8 |
return hash; |
139 |
|
} |
140 |
|
|
141 |
|
|
142 |
|
|
143 |
|
|
144 |
|
|
|
|
| 66.7% |
Uncovered Elements: 2 (6) |
Complexity: 3 |
Complexity Density: 0.75 |
|
145 |
81 |
@Override... |
146 |
|
public boolean equals(Object obj) |
147 |
|
{ |
148 |
81 |
if (obj == null || !(obj instanceof SearchResultMatchI)) |
149 |
|
{ |
150 |
0 |
return false; |
151 |
|
} |
152 |
81 |
SearchResultMatchI m = (SearchResultMatchI) obj; |
153 |
81 |
return (sequence == m.getSequence() && start == m.getStart() |
154 |
|
&& end == m.getEnd()); |
155 |
|
} |
156 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
157 |
36 |
@Override... |
158 |
|
public boolean contains(SequenceI seq, int from, int to) |
159 |
|
{ |
160 |
36 |
return (sequence == seq && start <= from && end >= to); |
161 |
|
} |
162 |
|
} |
163 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (6) |
Complexity: 2 |
Complexity Density: 0.5 |
|
164 |
210 |
@Override... |
165 |
|
public SearchResultMatchI addResult(SequenceI seq, int start, int end) |
166 |
|
{ |
167 |
210 |
Match m = new Match(seq, start, end); |
168 |
210 |
if (!matches.contains(m)) |
169 |
|
{ |
170 |
209 |
matches.add(m); |
171 |
|
} |
172 |
210 |
return m; |
173 |
|
} |
174 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (10) |
Complexity: 6 |
Complexity Density: 0.75 |
|
175 |
65 |
@Override... |
176 |
|
public boolean involvesSequence(SequenceI sequence) |
177 |
|
{ |
178 |
65 |
final int start = sequence.getStart(); |
179 |
65 |
final int end = sequence.getEnd(); |
180 |
|
|
181 |
65 |
SequenceI ds = sequence.getDatasetSequence(); |
182 |
65 |
for (SearchResultMatchI m : matches) |
183 |
|
{ |
184 |
68 |
SequenceI matched = m.getSequence(); |
185 |
68 |
if (matched != null && (matched == sequence || matched == ds) |
186 |
|
&& (m.getEnd() >= start) && (m.getStart() <= end)) |
187 |
|
{ |
188 |
14 |
return true; |
189 |
|
} |
190 |
|
} |
191 |
51 |
return false; |
192 |
|
} |
193 |
|
|
|
|
| 77.8% |
Uncovered Elements: 10 (45) |
Complexity: 11 |
Complexity Density: 0.38 |
|
194 |
48 |
@Override... |
195 |
|
public int[] getResults(SequenceI sequence, int start, int end) |
196 |
|
{ |
197 |
48 |
if (matches.isEmpty()) |
198 |
|
{ |
199 |
0 |
return null; |
200 |
|
} |
201 |
|
|
202 |
48 |
int[] result = null; |
203 |
48 |
int[] tmp = null; |
204 |
48 |
int resultLength, matchStart = 0, matchEnd = 0; |
205 |
48 |
boolean mfound; |
206 |
48 |
Match m; |
207 |
48 |
for (SearchResultMatchI _m : matches) |
208 |
|
{ |
209 |
64 |
m = (Match) _m; |
210 |
|
|
211 |
64 |
mfound = false; |
212 |
64 |
if (m.sequence == sequence |
213 |
|
|| m.sequence == sequence.getDatasetSequence()) |
214 |
|
{ |
215 |
23 |
mfound = true; |
216 |
23 |
matchStart = sequence.findIndex(m.start) - 1; |
217 |
23 |
matchEnd = m.start == m.end ? matchStart : sequence |
218 |
|
.findIndex(m.end) - 1; |
219 |
|
} |
220 |
|
|
221 |
64 |
if (mfound) |
222 |
|
{ |
223 |
23 |
if (matchStart <= end && matchEnd >= start) |
224 |
|
{ |
225 |
23 |
if (matchStart < start) |
226 |
|
{ |
227 |
1 |
matchStart = start; |
228 |
|
} |
229 |
|
|
230 |
23 |
if (matchEnd > end) |
231 |
|
{ |
232 |
1 |
matchEnd = end; |
233 |
|
} |
234 |
|
|
235 |
23 |
if (result == null) |
236 |
|
{ |
237 |
23 |
result = new int[] { matchStart, matchEnd }; |
238 |
|
} |
239 |
|
else |
240 |
|
{ |
241 |
0 |
resultLength = result.length; |
242 |
0 |
tmp = new int[resultLength + 2]; |
243 |
0 |
System.arraycopy(result, 0, tmp, 0, resultLength); |
244 |
0 |
result = tmp; |
245 |
0 |
result[resultLength] = matchStart; |
246 |
0 |
result[resultLength + 1] = matchEnd; |
247 |
|
} |
248 |
|
} |
249 |
|
else |
250 |
|
{ |
251 |
|
|
252 |
|
|
253 |
|
|
254 |
|
} |
255 |
|
} |
256 |
|
} |
257 |
48 |
return result; |
258 |
|
} |
259 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (18) |
Complexity: 3 |
Complexity Density: 0.21 |
|
260 |
8 |
@Override... |
261 |
|
public int markColumns(SequenceCollectionI sqcol, BitSet bs) |
262 |
|
{ |
263 |
8 |
int count = 0; |
264 |
8 |
BitSet mask = new BitSet(); |
265 |
8 |
int startRes = sqcol.getStartRes(); |
266 |
8 |
int endRes = sqcol.getEndRes(); |
267 |
|
|
268 |
8 |
for (SequenceI s : sqcol.getSequences()) |
269 |
|
{ |
270 |
27 |
int[] cols = getResults(s, startRes, endRes); |
271 |
27 |
if (cols != null) |
272 |
|
{ |
273 |
24 |
for (int pair = 0; pair < cols.length; pair += 2) |
274 |
|
{ |
275 |
12 |
mask.set(cols[pair], cols[pair + 1] + 1); |
276 |
|
} |
277 |
|
} |
278 |
|
} |
279 |
|
|
280 |
8 |
BitSet original = (BitSet) bs.clone(); |
281 |
8 |
original.and(mask); |
282 |
8 |
count = mask.cardinality() - original.cardinality(); |
283 |
|
|
284 |
8 |
bs.or(mask); |
285 |
8 |
return count; |
286 |
|
} |
287 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
288 |
29 |
@Override... |
289 |
|
public int getSize() |
290 |
|
{ |
291 |
29 |
return matches.size(); |
292 |
|
} |
293 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
294 |
443 |
@Override... |
295 |
|
public boolean isEmpty() |
296 |
|
{ |
297 |
443 |
return matches.isEmpty(); |
298 |
|
} |
299 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
300 |
254 |
@Override... |
301 |
|
public List<SearchResultMatchI> getResults() |
302 |
|
{ |
303 |
254 |
return matches; |
304 |
|
} |
305 |
|
|
306 |
|
|
307 |
|
|
308 |
|
|
309 |
|
@return |
310 |
|
|
|
|
| 66.7% |
Uncovered Elements: 1 (3) |
Complexity: 2 |
Complexity Density: 2 |
|
311 |
3 |
@Override... |
312 |
|
public String toString() |
313 |
|
{ |
314 |
3 |
return matches == null ? "" : matches.toString(); |
315 |
|
} |
316 |
|
|
317 |
|
|
318 |
|
|
319 |
|
|
320 |
|
|
321 |
|
|
322 |
|
@see |
323 |
|
@see |
324 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
325 |
6 |
@Override... |
326 |
|
public int hashCode() |
327 |
|
{ |
328 |
6 |
return matches.hashCode(); |
329 |
|
} |
330 |
|
|
331 |
|
|
332 |
|
|
333 |
|
|
334 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (6) |
Complexity: 3 |
Complexity Density: 0.75 |
|
335 |
35 |
@Override... |
336 |
|
public boolean equals(Object obj) |
337 |
|
{ |
338 |
35 |
if (obj == null || !(obj instanceof SearchResultsI)) |
339 |
|
{ |
340 |
6 |
return false; |
341 |
|
} |
342 |
29 |
SearchResultsI sr = (SearchResultsI) obj; |
343 |
29 |
return matches.equals(sr.getResults()); |
344 |
|
} |
345 |
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
346 |
0 |
@Override... |
347 |
|
public void addSearchResults(SearchResultsI toAdd) |
348 |
|
{ |
349 |
0 |
matches.addAll(toAdd.getResults()); |
350 |
|
} |
351 |
|
} |