X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;ds=sidebyside;f=src%2Fjalview%2Fdatamodel%2FSearchResults.java;h=bd1a3751759825d628f05e0f302b7a03a4b5f94c;hb=dfa04e77181fccfa6229ffef1591fc9c622d9b39;hp=240052464ef1842fa1686be892d3af4cbe89f8b7;hpb=2de8acfae59aced665e4c37ad0f7dcc2ed68818e;p=jalview.git

diff --git a/src/jalview/datamodel/SearchResults.java b/src/jalview/datamodel/SearchResults.java
index 2400524..bd1a375 100755
--- a/src/jalview/datamodel/SearchResults.java
+++ b/src/jalview/datamodel/SearchResults.java
@@ -1,20 +1,20 @@
 /*
- * Jalview - A Sequence Alignment Editor and Viewer (Development Version 2.4.1)
- * Copyright (C) 2009 AM Waterhouse, J Procter, G Barton, M Clamp, S Searle
+ * Jalview - A Sequence Alignment Editor and Viewer (Version 2.8.0b1)
+ * Copyright (C) 2014 The Jalview Authors
  * 
- * This program 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 2
- * of the License, or (at your option) any later version.
+ * This file is part of Jalview.
  * 
- * This program 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.
+ * 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 this program; if not, write to the Free Software
- * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA
+ * You should have received a copy of the GNU General Public License along with Jalview.  If not, see <http://www.gnu.org/licenses/>.
+ * The Jalview Authors are detailed in the 'AUTHORS' file.
  */
 package jalview.datamodel;
 
@@ -29,11 +29,11 @@ public class SearchResults
    * alignment
    * 
    * @param seq
-   *                Sequence
+   *          Sequence
    * @param start
-   *                int
+   *          int
    * @param end
-   *                int
+   *          int
    */
   public void addResult(SequenceI seq, int start, int end)
   {
@@ -57,29 +57,32 @@ public class SearchResults
 
     matches = tmp;
   }
+
   /**
    * Quickly check if the given sequence is referred to in the search results
-   * @param sequence (specific alignment sequence or a dataset sequence)
+   * 
+   * @param sequence
+   *          (specific alignment sequence or a dataset sequence)
    * @return true if the results involve sequence
    */
   public boolean involvesSequence(SequenceI sequence)
   {
-    if (matches==null || matches.length==0)
+    if (matches == null || matches.length == 0)
     {
       return false;
     }
     SequenceI ds = sequence.getDatasetSequence();
-    for (int m=0; m<matches.length; m++)
+    for (int m = 0; m < matches.length; m++)
     {
-      if (matches[m].sequence!=null &&
-              (matches[m].sequence==sequence 
-              || matches[m].sequence==ds))
+      if (matches[m].sequence != null
+              && (matches[m].sequence == sequence || matches[m].sequence == ds))
       {
         return true;
       }
     }
     return false;
   }
+
   /**
    * This Method returns the search matches which lie between the start and end
    * points of the sequence in question. It is optimised for returning objects
@@ -142,6 +145,12 @@ public class SearchResults
             result[resultLength + 1] = matchEnd;
           }
         }
+        else
+        {
+          // debug
+          // System.err.println("Outwith bounds!" + matchStart+">"+end +"  or "
+          // + matchEnd+"<"+start);
+        }
       }
     }
     return result;