2 * Jalview - A Sequence Alignment Editor and Viewer
\r
3 * Copyright (C) 2005 AM Waterhouse, J Procter, G Barton, M Clamp, S Searle
\r
5 * This program is free software; you can redistribute it and/or
\r
6 * modify it under the terms of the GNU General Public License
\r
7 * as published by the Free Software Foundation; either version 2
\r
8 * of the License, or (at your option) any later version.
\r
10 * This program is distributed in the hope that it will be useful,
\r
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
\r
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
\r
13 * GNU General Public License for more details.
\r
15 * You should have received a copy of the GNU General Public License
\r
16 * along with this program; if not, write to the Free Software
\r
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
\r
19 package jalview.gui;
\r
25 * NOTE: Columns are zero based.
\r
27 public class ColumnSelection
\r
29 Vector selected = new Vector();
\r
31 //Vector of int [] {startCol, endCol}
\r
32 Vector hiddenColumns;
\r
37 * @param col DOCUMENT ME!
\r
39 public void addElement(int col)
\r
41 if (!selected.contains(new Integer(col)))
\r
43 selected.addElement(new Integer(col));
\r
52 selected.removeAllElements();
\r
58 * @param col DOCUMENT ME!
\r
60 public void removeElement(int col)
\r
62 Integer colInt = new Integer(col);
\r
64 if (selected.contains(colInt))
\r
66 selected.removeElement(colInt);
\r
70 public void removeElements(int start, int end)
\r
73 for(int i=start; i<end; i++)
\r
75 colInt = new Integer(i);
\r
76 if (selected.contains(colInt))
\r
78 selected.removeElement(colInt);
\r
86 * @param col DOCUMENT ME!
\r
88 * @return DOCUMENT ME!
\r
90 public boolean contains(int col)
\r
92 return selected.contains(new Integer(col));
\r
98 * @param i DOCUMENT ME!
\r
100 * @return DOCUMENT ME!
\r
102 public int columnAt(int i)
\r
104 return ((Integer) selected.elementAt(i)).intValue();
\r
110 * @return DOCUMENT ME!
\r
114 return selected.size();
\r
120 * @return DOCUMENT ME!
\r
122 public int getMax()
\r
126 for (int i = 0; i < selected.size(); i++)
\r
128 if (columnAt(i) > max)
\r
140 * @return DOCUMENT ME!
\r
142 public int getMin()
\r
144 int min = 1000000000;
\r
146 for (int i = 0; i < selected.size(); i++)
\r
148 if (columnAt(i) < min)
\r
161 * @param start DOCUMENT ME!
\r
162 * @param change DOCUMENT ME!
\r
164 public void compensateForEdit(int start, int change)
\r
166 for (int i = 0; i < size(); i++)
\r
168 int temp = columnAt(i);
\r
172 selected.setElementAt(new Integer(temp - change), i);
\r
178 * This Method is used to return all the HiddenColumn regions
\r
179 * less than the given index.
\r
183 public Vector getHiddenColumns()
\r
185 return hiddenColumns;
\r
188 public int adjustForHiddenColumns(int column)
\r
190 int result = column;
\r
191 if (hiddenColumns != null)
\r
193 for (int i = 0; i < hiddenColumns.size(); i++)
\r
195 int[] region = (int[]) hiddenColumns.elementAt(i);
\r
196 if (result >= region[0])
\r
198 result += region[1] - region[0] + 1;
\r
206 * Use this method to find out where a visible column is in the alignment
\r
207 * when hidden columns exist
\r
208 * @param hiddenColumn int
\r
211 public int findColumnPosition(int hiddenColumn)
\r
213 int result = hiddenColumn;
\r
214 if (hiddenColumns != null)
\r
220 int[] region = (int[]) hiddenColumns.elementAt(index);
\r
221 if (hiddenColumn > region[1])
\r
223 result -= region[1]+1-region[0];
\r
227 while (index < hiddenColumns.size());
\r
236 * Use this method to determine where the next hiddenRegion starts
\r
238 public int findHiddenRegionPosition(int hiddenRegion)
\r
241 if (hiddenColumns != null)
\r
247 int[] region = (int[]) hiddenColumns.elementAt(index);
\r
248 if(hiddenRegion==0)
\r
253 gaps += region[1] +1 - region[0];
\r
254 result = region[1] +1;
\r
257 while(index < hiddenRegion+1);
\r
267 public void hideColumns(int res, AlignViewport av)
\r
269 if(hiddenColumns==null)
\r
270 hiddenColumns = new Vector();
\r
272 // First find out range of columns to hide
\r
273 int min = res, max = res+1;
\r
274 while( contains(min) )
\r
275 { removeElement(min); min --; }
\r
277 while( contains(max) )
\r
278 { removeElement(max); max ++; }
\r
282 boolean added = false;
\r
283 for(int i=0; i<hiddenColumns.size(); i++)
\r
285 int [] region = (int[])hiddenColumns.elementAt(i);
\r
286 if( max < region[0])
\r
288 hiddenColumns.insertElementAt(new int[]{min, max}, i);
\r
295 hiddenColumns.addElement(new int[]{min, max});
\r
298 av.setSelectionGroup(null);
\r
299 av.hasHiddenColumns = true;
\r
302 public void revealAllHiddenColumns(AlignViewport av)
\r
304 av.hasHiddenColumns = false;
\r
305 hiddenColumns = null;
\r
308 public void revealHiddenColumns(int res, AlignViewport av)
\r
310 for(int i=0; i<hiddenColumns.size(); i++)
\r
312 int [] region = (int[])hiddenColumns.elementAt(i);
\r
313 if( res == region[0])
\r
315 hiddenColumns.remove(region);
\r
321 if(hiddenColumns.size()<1)
\r
322 av.hasHiddenColumns = false;
\r