X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fjalview%2Fanalysis%2FFinder.java;h=d52e42a768a0e65db9a543e05031e5a5a164de6f;hb=1b4d71403c0e11b7afa731e9e4abda211fd4d50c;hp=f3ec514da1397bec8ce64b5105703893d9787fcb;hpb=4af6d48c5ca5f79ee207ca1bcc5d5a14188a0004;p=jalview.git diff --git a/src/jalview/analysis/Finder.java b/src/jalview/analysis/Finder.java index f3ec514..d52e42a 100644 --- a/src/jalview/analysis/Finder.java +++ b/src/jalview/analysis/Finder.java @@ -1,235 +1,632 @@ +/* + * Jalview - A Sequence Alignment Editor and Viewer ($$Version-Rel$$) + * Copyright (C) $$Year-Rel$$ The Jalview Authors + * + * This file is part of Jalview. + * + * Jalview is free software: you can redistribute it and/or + * modify it under the terms of the GNU General Public License + * as published by the Free Software Foundation, either version 3 + * of the License, or (at your option) any later version. + * + * Jalview is distributed in the hope that it will be useful, but + * WITHOUT ANY WARRANTY; without even the implied warranty + * of MERCHANTABILITY or FITNESS FOR A PARTICULAR + * PURPOSE. See the GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with Jalview. If not, see . + * The Jalview Authors are detailed in the 'AUTHORS' file. + */ package jalview.analysis; -import java.util.Vector; -import jalview.datamodel.*; +import jalview.api.AlignViewportI; +import jalview.api.FinderI; +import jalview.datamodel.AlignmentI; +import jalview.datamodel.SearchResultMatchI; +import jalview.datamodel.SearchResults; +import jalview.datamodel.SearchResultsI; +import jalview.datamodel.SequenceGroup; +import jalview.datamodel.SequenceI; +import jalview.util.Comparison; +import jalview.util.MapList; -public class Finder { - /** - * Implements the search algorithms for the Find dialog box. +import java.util.ArrayList; +import java.util.Arrays; +import java.util.Iterator; +import java.util.List; + +import com.stevesoft.pat.Regex; + +/** + * Implements the search algorithm for the Find dialog + */ +public class Finder implements FinderI +{ + /* + * matched residue locations + */ + private SearchResultsI searchResults; + + /* + * sequences matched by id or description + */ + private List idMatches; + + /* + * the viewport to search over + */ + private AlignViewportI viewport; + + /* + * sequence index in alignment to search from + */ + private int sequenceIndex; + + /* + * position offset in sequence to search from, base 0 + * (position after start of last match for a 'find next') + */ + private int residueIndex; + + /* + * the true sequence position of the start of the + * last sequence searched (when 'ignore hidden regions' does not apply) + */ + private int searchedSequenceStartPosition; + + /* + * when 'ignore hidden regions' applies, this holds the mapping from + * the visible sequence positions (1, 2, ...) to true sequence positions + */ + private MapList searchedSequenceMap; + + private String seqToSearch; + + /** + * Constructor for searching a viewport + * + * @param av + */ + public Finder(AlignViewportI av) + { + this.viewport = av; + this.sequenceIndex = 0; + this.residueIndex = -1; + } + + @Override + public void findAll(String theSearchString, boolean matchCase, + boolean searchDescription, boolean ignoreHidden) + { + /* + * search from the start */ - SearchResults searchResults; - AlignmentI alignment; - jalview.datamodel.SequenceGroup selection=null; - Vector idMatch=null; - boolean caseSensitive=false; - boolean findAll=false; - com.stevesoft.pat.Regex regex=null; - public Finder(AlignmentI alignment, SequenceGroup selection) { - this.alignment=alignment; - this.selection = selection; - } - public boolean find(String searchString) { - boolean hasResults=false; - if(!caseSensitive) - searchString = searchString.toUpperCase(); - regex = new com.stevesoft.pat.Regex(searchString); - searchResults = new SearchResults(); - idMatch = new Vector(); - Sequence seq; - int seqIndex=0,resIndex=0; - String item = null; - boolean found = false; - - ////// is the searchString a residue number? - try - { - int res = Integer.parseInt(searchString); - found = true; - if (selection == null || selection.getSize(false) < 1) - { - seq = (Sequence) alignment.getSequenceAt(0); - } - else - { - seq = (Sequence) (selection.getSequenceAt(0)); - } - - searchResults.addResult(seq, res, res); - hasResults=true; - } - catch (NumberFormatException ex) - { - } + sequenceIndex = 0; + residueIndex = -1; - /////////////////////////////////////////////// + doFind(theSearchString, matchCase, searchDescription, true, + ignoreHidden); - int end = alignment.getHeight(); + /* + * reset to start for next search + */ + sequenceIndex = 0; + residueIndex = -1; + } - - if (selection != null) - { - if ((selection.getSize(false) < 1) || - ((selection.getEndRes() - selection.getStartRes()) < 2)) - { - selection = null; - } - } + @Override + public void findNext(String theSearchString, boolean matchCase, + boolean searchDescription, boolean ignoreHidden) + { + doFind(theSearchString, matchCase, searchDescription, false, + ignoreHidden); + + if (searchResults.isEmpty() && idMatches.isEmpty()) + { + /* + * search failed - reset to start for next search + */ + sequenceIndex = 0; + residueIndex = -1; + } + } - while (!found && (seqIndex < end)) - { - seq = (Sequence) alignment.getSequenceAt(seqIndex); - - if ((selection != null) && !selection.getSequences(false).contains(seq)) - { - seqIndex++; - resIndex = 0; - - continue; - } - - item = seq.getSequenceAsString(); - // JBPNote - check if this toUpper which is present in the application implementation makes a difference - //if(!caseSensitive) - // item = item.toUpperCase(); - - if ((selection != null) && - (selection.getEndRes() < alignment.getWidth()-1)) - { - item = item.substring(0, selection.getEndRes() + 1); - } - - ///Shall we ignore gaps???? - JBPNote: Add Flag for forcing this or not - StringBuffer noGapsSB = new StringBuffer(); - int insertCount = 0; - Vector spaces = new Vector(); - - for (int j = 0; j < item.length(); j++) - { - if (!jalview.util.Comparison.isGap(item.charAt(j))) - { - noGapsSB.append(item.charAt(j)); - spaces.add(new Integer(insertCount)); - } - else - { - insertCount++; - } - } - - String noGaps = noGapsSB.toString(); - - for (int r = resIndex; r < noGaps.length(); r++) - { - - if (regex.searchFrom(noGaps, r)) - { - resIndex = regex.matchedFrom(); - - if ((selection != null) && - ((resIndex + - Integer.parseInt(spaces.get(resIndex).toString())) < selection.getStartRes())) - { - continue; - } - - - int sres = seq.findPosition(resIndex + - Integer.parseInt(spaces.elementAt(resIndex) - .toString())); - int eres = seq.findPosition(regex.matchedTo() - 1 + - Integer.parseInt(spaces.elementAt(regex.matchedTo() - - 1).toString())); - - searchResults.addResult(seq, sres, eres); - hasResults=true; - if (!findAll) - { - // thats enough, break and display the result - found = true; - resIndex++; - - break; - } - - r = resIndex; - } - else - { - break; - } - } - - if (!found) - { - seqIndex++; - resIndex = 0; - } - } + /** + * Performs a 'find next' or 'find all' + * + * @param theSearchString + * @param matchCase + * @param searchDescription + * @param findAll + * @param ignoreHidden + */ + protected void doFind(String theSearchString, boolean matchCase, + boolean searchDescription, boolean findAll, boolean ignoreHidden) + { + searchResults = new SearchResults(); + idMatches = new ArrayList<>(); - for (int id = 0; id < alignment.getHeight(); id++) - { - if (regex.search(alignment.getSequenceAt(id).getName())) - { - idMatch.add(alignment.getSequenceAt(id)); - hasResults=true; - } - } - return hasResults; + String searchString = matchCase ? theSearchString + : theSearchString.toUpperCase(); + Regex searchPattern = new Regex(searchString); + searchPattern.setIgnoreCase(!matchCase); + + SequenceGroup selection = viewport.getSelectionGroup(); + if (selection != null && selection.getSize() < 1) + { + selection = null; // ? ignore column-only selection } - /** - * @return the alignment - */ - public AlignmentI getAlignment() { - return alignment; + + AlignmentI alignment = viewport.getAlignment(); + int end = alignment.getHeight(); + + getSequence(ignoreHidden); + + boolean found = false; + while ((!found || findAll) && sequenceIndex < end) + { + found = findNextMatch(searchString, searchPattern, searchDescription, + ignoreHidden); } - /** - * @param alignment the alignment to set - */ - public void setAlignment(AlignmentI alignment) { - this.alignment = alignment; + } + + /** + * Calculates and saves the sequence string to search. The string is restricted + * to the current selection region if there is one, and is saved with all gaps + * removed. + *

+ * If there are hidden columns, and option {@ignoreHidden} is selected, then + * only visible positions of the sequence are included, and a mapping is also + * constructed from the returned string positions to the true sequence + * positions. + *

+ * Note we have to do this each time {@code findNext} or {@code findAll} is + * called, in case the alignment, selection group or hidden columns have + * changed. In particular, if the sequence at offset {@code sequenceIndex} in + * the alignment is (no longer) in the selection group, search is advanced to + * the next sequence that is. + *

+ * Sets sequence string to the empty string if there are no more sequences (in + * selection group if any) at or after {@code sequenceIndex}. + *

+ * Returns true if a sequence could be found, false if end of alignment was + * reached + * + * @param ignoreHidden + * @return + */ + private boolean getSequence(boolean ignoreHidden) + { + AlignmentI alignment = viewport.getAlignment(); + if (sequenceIndex >= alignment.getHeight()) + { + seqToSearch = ""; + return false; } - /** - * @return the caseSensitive - */ - public boolean isCaseSensitive() { - return caseSensitive; + SequenceI seq = alignment.getSequenceAt(sequenceIndex); + SequenceGroup selection = viewport.getSelectionGroup(); + if (selection != null && !selection.contains(seq)) + { + if (!nextSequence(ignoreHidden)) + { + return false; + } + seq = alignment.getSequenceAt(sequenceIndex); } - /** - * @param caseSensitive the caseSensitive to set - */ - public void setCaseSensitive(boolean caseSensitive) { - this.caseSensitive = caseSensitive; + + String seqString = null; + if (ignoreHidden) + { + seqString = getVisibleSequence(seq); + this.searchedSequenceStartPosition = 1; } - /** - * @return the findAll + else + { + int startCol = 0; + int endCol = seq.getLength() - 1; + this.searchedSequenceStartPosition = seq.getStart(); + if (selection != null) + { + startCol = selection.getStartRes(); + endCol = Math.min(endCol, selection.getEndRes()); + this.searchedSequenceStartPosition = seq.findPosition(startCol); + } + seqString = seq.getSequenceAsString(startCol, endCol + 1); + } + + /* + * remove gaps; note that even if this leaves an empty string, we 'search' + * the sequence anyway (for possible match on name or description) */ - public boolean isFindAll() { - return findAll; + String ungapped = AlignSeq.extractGaps(Comparison.GapChars, seqString); + this.seqToSearch = ungapped; + + return true; + } + + /** + * Returns a string consisting of only the visible residues of {@code seq} from + * alignment column {@ fromColumn}, restricted to the current selection region + * if there is one. + *

+ * As a side-effect, also computes the mapping from the true sequence positions + * to the positions (1, 2, ...) of the returned sequence. This is to allow + * search matches in the visible sequence to be converted to sequence positions. + * + * @param seq + * @return + */ + private String getVisibleSequence(SequenceI seq) + { + /* + * get start / end columns of sequence and convert to base 0 + * (so as to match the visible column ranges) + */ + int seqStartCol = seq.findIndex(seq.getStart()) - 1; + int seqEndCol = seq.findIndex(seq.getStart() + seq.getLength() - 1) - 1; + Iterator visibleColumns = viewport.getViewAsVisibleContigs(true); + StringBuilder visibleSeq = new StringBuilder(seqEndCol - seqStartCol); + List fromRanges = new ArrayList<>(); + + while (visibleColumns.hasNext()) + { + int[] range = visibleColumns.next(); + if (range[0] > seqEndCol) + { + // beyond the end of the sequence + break; + } + if (range[1] < seqStartCol) + { + // before the start of the sequence + continue; + } + String subseq = seq.getSequenceAsString(range[0], range[1] + 1); + String ungapped = AlignSeq.extractGaps(Comparison.GapChars, subseq); + visibleSeq.append(ungapped); + if (!ungapped.isEmpty()) + { + /* + * visible region includes at least one non-gap character, + * so add the range to the mapping being constructed + */ + int seqResFrom = seq.findPosition(range[0]); + int seqResTo = seqResFrom + ungapped.length() - 1; + fromRanges.add(new int[] { seqResFrom, seqResTo }); + } } - /** - * @param findAll the findAll to set + + /* + * construct the mapping + * from: visible sequence positions 1..length + * to: true residue positions of the alignment sequence */ - public void setFindAll(boolean findAll) { - this.findAll = findAll; + List toRange = Arrays + .asList(new int[] + { 1, visibleSeq.length() }); + searchedSequenceMap = new MapList(fromRanges, toRange, 1, 1); + + return visibleSeq.toString(); + } + + /** + * Advances the search to the next sequence in the alignment. Sequences not in + * the current selection group (if there is one) are skipped. The (sub-)sequence + * to be searched is extracted, gaps removed, and saved, or set to null if there + * are no more sequences to search. + *

+ * Returns true if a sequence could be found, false if end of alignment was + * reached + * + * @param ignoreHidden + */ + private boolean nextSequence(boolean ignoreHidden) + { + sequenceIndex++; + residueIndex = -1; + + return getSequence(ignoreHidden); + } + + /** + * Finds the next match in the given sequence, starting at offset + * {@code residueIndex}. Answers true if a match is found, else false. + *

+ * If a match is found, {@code residueIndex} is advanced to the position after + * the start of the matched region, ready for the next search. + *

+ * If no match is found, {@code sequenceIndex} is advanced ready to search the + * next sequence. + * + * @param seqToSearch + * @param searchString + * @param searchPattern + * @param matchDescription + * @param ignoreHidden + * @return + */ + protected boolean findNextMatch(String searchString, + Regex searchPattern, boolean matchDescription, + boolean ignoreHidden) + { + if (residueIndex < 0) + { + /* + * at start of sequence; try find by residue number, in sequence id, + * or (optionally) in sequence description + */ + if (doNonMotifSearches(searchString, searchPattern, + matchDescription)) + { + return true; + } } - /** - * @return the selection + + /* + * search for next match in sequence string */ - public jalview.datamodel.SequenceGroup getSelection() { - return selection; + int end = seqToSearch.length(); + while (residueIndex < end) + { + boolean matched = searchPattern.searchFrom(seqToSearch, residueIndex); + if (matched) + { + if (recordMatch(searchPattern, ignoreHidden)) + { + return true; + } + } + else + { + residueIndex = Integer.MAX_VALUE; + } } - /** - * @param selection the selection to set + + nextSequence(ignoreHidden); + return false; + } + + /** + * Adds the match held in the searchPattern Regex to the + * searchResults, unless it is a subregion of the last match + * recorded. residueIndex is advanced to the position after the + * start of the matched region, ready for the next search. Answers true if a + * match was added, else false. + *

+ * Matches that lie entirely within hidden regions of the alignment are not + * added. + * + * @param searchPattern + * @param ignoreHidden + * @return + */ + protected boolean recordMatch(Regex searchPattern, boolean ignoreHidden) + { + SequenceI seq = viewport.getAlignment().getSequenceAt(sequenceIndex); + + /* + * convert start/end of the match to sequence coordinates + */ + int offset = searchPattern.matchedFrom(); + int matchStartPosition = this.searchedSequenceStartPosition + offset; + int matchEndPosition = matchStartPosition + + searchPattern.charsMatched() - 1; + + /* + * update residueIndex to next position after the start of the match + * (findIndex returns a value base 1, columnIndex is held base 0) + */ + residueIndex = searchPattern.matchedFrom()+1; + + /* + * return false if the match is entirely in a hidden region */ - public void setSelection(jalview.datamodel.SequenceGroup selection) { - this.selection = selection; + if (allHidden(seq, matchStartPosition, matchEndPosition)) + { + return false; } - /** - * @return the idMatch + + /* + * check that this match is not a subset of the previous one (JAL-2302) */ - public Vector getIdMatch() { - return idMatch; + List matches = searchResults.getResults(); + SearchResultMatchI lastMatch = matches.isEmpty() ? null + : matches.get(matches.size() - 1); + + if (lastMatch == null || !lastMatch.contains(seq, matchStartPosition, + matchEndPosition)) + { + addMatch(seq, matchStartPosition, matchEndPosition, ignoreHidden); + return true; + } + + return false; + } + + /** + * Adds one match to the stored list. If hidden residues are being skipped, then + * the match may need to be split into contiguous positions of the sequence (so + * it does not include skipped residues). + * + * @param seq + * @param matchStartPosition + * @param matchEndPosition + * @param ignoreHidden + */ + private void addMatch(SequenceI seq, int matchStartPosition, + int matchEndPosition, boolean ignoreHidden) + { + if (!ignoreHidden) + { + /* + * simple case + */ + searchResults.addResult(seq, matchStartPosition, matchEndPosition); + return; } - /** - * @return the regex + + /* + * get start-end contiguous ranges in underlying sequence */ - public com.stevesoft.pat.Regex getRegex() { - return regex; + int[] truePositions = searchedSequenceMap + .locateInFrom(matchStartPosition, matchEndPosition); + searchResults.addResult(seq, truePositions); + } + + /** + * Returns true if all residues are hidden, else false + * + * @param seq + * @param fromPos + * @param toPos + * @return + */ + private boolean allHidden(SequenceI seq, int fromPos, int toPos) + { + if (!viewport.hasHiddenColumns()) + { + return false; } - /** - * @return the searchResults + for (int res = fromPos; res <= toPos; res++) + { + if (isVisible(seq, res)) + { + return false; + } + } + return true; + } + + /** + * Does searches other than for residue patterns. Currently this includes + *

+ * Answers true if a match is found, else false. + * + * @param searchString + * @param searchPattern + * @param includeDescription + * @return + */ + protected boolean doNonMotifSearches(String searchString, + Regex searchPattern, boolean includeDescription) + { + SequenceI seq = viewport.getAlignment().getSequenceAt(sequenceIndex); + + /* + * position sequence search to start of sequence */ - public SearchResults getSearchResults() { - return searchResults; + residueIndex = 0; + try + { + int res = Integer.parseInt(searchString); + return searchForResidueNumber(seq, res); + } catch (NumberFormatException ex) + { + // search pattern is not a number + } + + if (searchSequenceName(seq, searchPattern)) + { + return true; } + if (includeDescription && searchSequenceDescription(seq, searchPattern)) + { + return true; + } + return false; + } + + /** + * Searches for a match with the sequence description, and if found, adds the + * sequence to the list of match ids (but not as a duplicate). Answers true if + * a match was added, else false. + * + * @param seq + * @param searchPattern + * @return + */ + protected boolean searchSequenceDescription(SequenceI seq, Regex searchPattern) + { + String desc = seq.getDescription(); + if (desc != null && searchPattern.search(desc) && !idMatches.contains(seq)) + { + idMatches.add(seq); + return true; + } + return false; + } + + /** + * Searches for a match with the sequence name, and if found, adds the + * sequence to the list of match ids (but not as a duplicate). Answers true if + * a match was added, else false. + * + * @param seq + * @param searchPattern + * @return + */ + protected boolean searchSequenceName(SequenceI seq, Regex searchPattern) + { + if (searchPattern.search(seq.getName()) && !idMatches.contains(seq)) + { + idMatches.add(seq); + return true; + } + return false; + } + + /** + * If the residue position is valid for the sequence, and in a visible column, + * adds the position to the search results and returns true, else answers false. + * + * @param seq + * @param resNo + * @return + */ + protected boolean searchForResidueNumber(SequenceI seq, int resNo) + { + if (seq.getStart() <= resNo && seq.getEnd() >= resNo) + { + if (isVisible(seq, resNo)) + { + searchResults.addResult(seq, resNo, resNo); + return true; + } + } + return false; + } + + /** + * Returns true if the residue is in a visible column, else false + * + * @param seq + * @param res + * @return + */ + private boolean isVisible(SequenceI seq, int res) + { + if (!viewport.hasHiddenColumns()) + { + return true; + } + int col = seq.findIndex(res); // base 1 + return viewport.getAlignment().getHiddenColumns().isVisible(col - 1); // base 0 + } + + @Override + public List getIdMatches() + { + return idMatches; + } + + @Override + public SearchResultsI getSearchResults() + { + return searchResults; + } }