git://source.jalview.org
/
jalview.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Disable memory checker for now
[jalview.git]
/
src
/
jalview
/
datamodel
/
ColumnSelection.java
diff --git
a/src/jalview/datamodel/ColumnSelection.java
b/src/jalview/datamodel/ColumnSelection.java
index
6ef1799
..
4904495
100644
(file)
--- a/
src/jalview/datamodel/ColumnSelection.java
+++ b/
src/jalview/datamodel/ColumnSelection.java
@@
-578,9
+578,9
@@
public class ColumnSelection
}
\r
\r
/**
\r
}
\r
\r
/**
\r
- * THis method returns the rightmost limit of a
\r
+ * This method returns the leftmost limit of a
\r
* region of an alignment with hidden columns.
\r
* region of an alignment with hidden columns.
\r
- * In otherwords, the next hidden column.
\r
+ * In otherwords, the previous hidden column.
\r
* @param index int
\r
*/
\r
public int getHiddenBoundaryLeft(int alPos)
\r
* @param index int
\r
*/
\r
public int getHiddenBoundaryLeft(int alPos)
\r
@@
-727,14
+727,16
@@
public class ColumnSelection
\r
public boolean isVisible(int column)
\r
{
\r
\r
public boolean isVisible(int column)
\r
{
\r
- for (int i = 0; i < hiddenColumns.size(); i++)
\r
- {
\r
- int[] region = (int[]) hiddenColumns.elementAt(i);
\r
- if (column >= region[0] && column <= region[1])
\r
+ if (hiddenColumns != null)
\r
+ for (int i = 0; i < hiddenColumns.size(); i++)
\r
{
\r
{
\r
- return false;
\r
+ int[] region = (int[]) hiddenColumns.elementAt(i);
\r
+ if (column >= region[0] && column <= region[1])
\r
+ {
\r
+ return false;
\r
+ }
\r
}
\r
}
\r
- }
\r
+
\r
return true;
\r
}
\r
\r
return true;
\r
}
\r
\r