2 * Jalview - A Sequence Alignment Editor and Viewer ($$Version-Rel$$)
3 * Copyright (C) $$Year-Rel$$ The Jalview Authors
5 * This file is part of Jalview.
7 * Jalview is free software: you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation, either version 3
10 * of the License, or (at your option) any later version.
12 * Jalview is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty
14 * of MERCHANTABILITY or FITNESS FOR A PARTICULAR
15 * PURPOSE. See the GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with Jalview. If not, see <http://www.gnu.org/licenses/>.
19 * The Jalview Authors are detailed in the 'AUTHORS' file.
21 package jalview.datamodel;
23 import java.util.ArrayList;
24 import java.util.Arrays;
25 import java.util.List;
28 * Holds a list of search result matches, where each match is a contiguous
29 * stretch of a single sequence.
34 public class SearchResults
37 private List<Match> matches = new ArrayList<Match>();
40 * One match consists of a sequence reference, start and end positions.
41 * Discontiguous ranges in a sequence require two or more Match objects.
48 * Start position of match in sequence (base 1)
53 * End position (inclusive) (base 1)
63 * start position of matched range (base 1)
65 * end of matched range (inclusive, base 1)
67 public Match(SequenceI seq, int start, int end)
74 public SequenceI getSequence()
90 * Returns the string of characters in the matched region.
93 public String toString()
95 char[] chars = sequence.getSequence();
96 // convert start/end to base 0 (with bounds check)
97 final int from = Math.max(start - 1, 0);
98 final int to = Math.min(end, chars.length + 1);
99 // return String.valueOf(Arrays.copyOfRange(chars, from, to));
100 return String.valueOf(from)
101 + String.valueOf(Arrays.copyOfRange(chars, from, to));
104 public void setSequence(SequenceI seq)
110 * Hashcode is the hashcode of the matched sequence plus a hash of start and
111 * end positions. Match objects that pass the test for equals are guaranteed
112 * to have the same hashcode.
115 public int hashCode()
117 int hash = sequence == null ? 0 : sequence.hashCode();
124 * Two Match objects are equal if they are for the same sequence, start and
128 public boolean equals(Object obj)
130 if (obj == null || !(obj instanceof Match))
134 Match m = (Match) obj;
135 return (this.sequence == m.sequence && this.start == m.start && this.end == m.end);
140 * This method replaces the old search results which merely held an alignment
141 * index of search matches. This broke when sequences were moved around the
151 public void addResult(SequenceI seq, int start, int end)
153 matches.add(new Match(seq, start, end));
157 * Quickly check if the given sequence is referred to in the search results
160 * (specific alignment sequence or a dataset sequence)
161 * @return true if the results involve sequence
163 public boolean involvesSequence(SequenceI sequence)
165 SequenceI ds = sequence.getDatasetSequence();
166 for (Match m : matches)
168 if (m.sequence != null
169 && (m.sequence == sequence || m.sequence == ds))
178 * This Method returns the search matches which lie between the start and end
179 * points of the sequence in question. It is optimised for returning objects
180 * for drawing on SequenceCanvas
182 public int[] getResults(SequenceI sequence, int start, int end)
184 if (matches.isEmpty())
191 int resultLength, matchStart = 0, matchEnd = 0;
193 for (Match m : matches)
196 if (m.sequence == sequence)
199 // locate aligned position
200 matchStart = sequence.findIndex(m.start) - 1;
201 matchEnd = sequence.findIndex(m.end) - 1;
203 else if (m.sequence == sequence.getDatasetSequence())
206 // locate region in local context
207 matchStart = sequence.findIndex(m.start) - 1;
208 matchEnd = sequence.findIndex(m.end) - 1;
212 if (matchStart <= end && matchEnd >= start)
214 if (matchStart < start)
227 { matchStart, matchEnd };
231 resultLength = result.length;
232 tmp = new int[resultLength + 2];
233 System.arraycopy(result, 0, tmp, 0, resultLength);
235 result[resultLength] = matchStart;
236 result[resultLength + 1] = matchEnd;
242 // System.err.println("Outwith bounds!" + matchStart+">"+end +" or "
243 // + matchEnd+"<"+start);
252 return matches.size();
255 public SequenceI getResultSequence(int index)
257 return matches.get(index).sequence;
261 * Returns the start position of the i'th match in the search results.
266 public int getResultStart(int i)
268 return matches.get(i).start;
272 * Returns the end position of the i'th match in the search results.
277 public int getResultEnd(int i)
279 return matches.get(i).end;
283 * Returns true if no search result matches are held.
287 public boolean isEmpty()
289 return matches.isEmpty();
293 * Returns the list of matches.
297 public List<Match> getResults()
303 * Return the results as a string of characters. Meant for use when the
304 * context ensures that all matches are to regions of the same sequence
305 * (otherwise the result is meaningless).
310 public String toString()
312 StringBuilder result = new StringBuilder(256);
313 for (Match m : matches)
315 result.append(m.toString());
317 return result.toString();
321 * Hashcode is has derived from the list of matches. This ensures that when
322 * two SearchResults objects satisfy the test for equals(), then they have the
326 public int hashCode()
328 return matches.hashCode();
332 * Two SearchResults are considered equal if they contain the same matches in
336 public boolean equals(Object obj)
338 if (obj == null || !(obj instanceof SearchResults))
342 SearchResults sr = (SearchResults) obj;
343 return ((ArrayList<Match>) this.matches).equals(sr.matches);