X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fjalview%2Fgui%2FColumnSelection.java;h=55c055c46d5546a5613ca18c7e5352ba8fbe0974;hb=6fc9aca27f606f6e3a0121597896e1a5dae35c36;hp=fc11698962d69332627a7c5e601b382d4ba93016;hpb=588042b69abf8e60bcc950b24c283933c7dd422f;p=jalview.git diff --git a/src/jalview/gui/ColumnSelection.java b/src/jalview/gui/ColumnSelection.java index fc11698..55c055c 100755 --- a/src/jalview/gui/ColumnSelection.java +++ b/src/jalview/gui/ColumnSelection.java @@ -25,93 +25,363 @@ import java.util.*; */ public class ColumnSelection { - Vector selected = new Vector(); + Vector selected = new Vector(); - public void addElement(int col) - { - selected.addElement(new Integer(col)); - } + //Vector of int [] {startCol, endCol} + Vector hiddenColumns; - public void clear() - { - selected.removeAllElements(); - } + /** + * DOCUMENT ME! + * + * @param col DOCUMENT ME! + */ + public void addElement(int col) + { + if (!selected.contains(new Integer(col))) + { + selected.addElement(new Integer(col)); + } + } + + /** + * DOCUMENT ME! + */ + public void clear() + { + selected.removeAllElements(); + } + + /** + * DOCUMENT ME! + * + * @param col DOCUMENT ME! + */ + public void removeElement(int col) + { + Integer colInt = new Integer(col); + + if (selected.contains(colInt)) + { + selected.removeElement(colInt); + } + } + + public void removeElements(int start, int end) + { + Integer colInt; + for(int i=start; i max) + { + max = columnAt(i); + } + } + + return max; } - else + + /** + * DOCUMENT ME! + * + * @return DOCUMENT ME! + */ + public int getMin() { - System.err.println( - "WARNING: Tried to remove Integer NOT in ColumnSelection"); + int min = 1000000000; + + for (int i = 0; i < selected.size(); i++) + { + if (columnAt(i) < min) + { + min = columnAt(i); + } + } + + return min; } - } - public boolean contains(int col) - { - return selected.contains(new Integer(col)); - } - public int columnAt(int i) - { - return ( (Integer) selected.elementAt(i)).intValue(); - } + /** + * DOCUMENT ME! + * + * @param start DOCUMENT ME! + * @param change DOCUMENT ME! + */ + public void compensateForEdit(int start, int change) + { + for (int i = 0; i < size(); i++) + { + int temp = columnAt(i); - public int size() - { - return selected.size(); - } + if (temp >= start) + { + selected.setElementAt(new Integer(temp - change), i); + } + } + } - public int getMax() - { - int max = -1; + /** + * This Method is used to return all the HiddenColumn regions + * less than the given index. + * @param end int + * @return Vector + */ + public Vector getHiddenColumns() + { + return hiddenColumns; + } - for (int i = 0; i < selected.size(); i++) + public int adjustForHiddenColumns(int column) { - if (columnAt(i) > max) + int result = column; + if (hiddenColumns != null) { - max = columnAt(i); + for (int i = 0; i < hiddenColumns.size(); i++) + { + int[] region = (int[]) hiddenColumns.elementAt(i); + if (result >= region[0]) + { + result += region[1] - region[0] + 1; + } + } } + return result; } - return max; - } + /** + * Use this method to find out where a visible column is in the alignment + * when hidden columns exist + * @param hiddenColumn int + * @return int + */ + public int findColumnPosition(int hiddenColumn) + { + int result = hiddenColumn; + if (hiddenColumns != null) + { + int index = 0; + int gaps = 0; + do + { + int[] region = (int[]) hiddenColumns.elementAt(index); + if (hiddenColumn > region[1]) + { + result -= region[1]+1-region[0]; + } + index++; + } + while (index < hiddenColumns.size()); - public int getMin() - { - int min = 1000000000; + result -= gaps; + } - for (int i = 0; i < selected.size(); i++) + return result; + } + + /** + * Use this method to determine where the next hiddenRegion starts + */ + public int findHiddenRegionPosition(int hiddenRegion) { - if (columnAt(i) < min) + int result = 0; + if (hiddenColumns != null) { - min = columnAt(i); + int index = 0; + int gaps = 0; + do + { + int[] region = (int[]) hiddenColumns.elementAt(index); + if(hiddenRegion==0) + { + return region[0]; + } + + gaps += region[1] +1 - region[0]; + result = region[1] +1; + index++; + } + while(index < hiddenRegion+1); + + result -= gaps; } + + return result; } - return min; - } + /** + * THis method returns the rightmost limit of a + * region of an alignment with hidden columns. + * In otherwords, the next hidden column. + * @param index int + */ + public int getHiddenBoundaryRight(int alPos) + { + if (hiddenColumns != null) + { + int index = 0; + do + { + int[] region = (int[]) hiddenColumns.elementAt(index); + if(alPos < region[0]) + return region[0]; + + index++; + } + while(index < hiddenColumns.size()); + } - public Vector asVector() - { - return selected; - } + return alPos; - public void compensateForEdit(int start, int change) - { - for (int i = 0; i < size(); i++) + } + /** + * THis method returns the rightmost limit of a + * region of an alignment with hidden columns. + * In otherwords, the next hidden column. + * @param index int + */ + public int getHiddenBoundaryLeft(int alPos) { - int temp = columnAt(i); + if (hiddenColumns != null) + { + int index = hiddenColumns.size()-1; + do + { + int[] region = (int[]) hiddenColumns.elementAt(index); + if(alPos > region[1]) + return region[1]; + + index--; + } + while(index >-1); + } + + return alPos; - if (temp >= start) + } + + + public void hideColumns(int res, AlignViewport av) + { + if(hiddenColumns==null) + hiddenColumns = new Vector(); + + // First find out range of columns to hide + int min = res, max = res+1; + while( contains(min) ) + { removeElement(min); min --; } + + while( contains(max) ) + { removeElement(max); max ++; } + + min++; max--; + + boolean added = false; + for(int i=0; i= region[0] && column <= region[1]) + { + return false; + } + } + return true; + } + }