2 * Jalview - A Sequence Alignment Editor and Viewer ($$Version-Rel$$)
3 * Copyright (C) $$Year-Rel$$ The Jalview Authors
5 * This file is part of Jalview.
7 * Jalview is free software: you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation, either version 3
10 * of the License, or (at your option) any later version.
12 * Jalview is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty
14 * of MERCHANTABILITY or FITNESS FOR A PARTICULAR
15 * PURPOSE. See the GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with Jalview. If not, see <http://www.gnu.org/licenses/>.
19 * The Jalview Authors are detailed in the 'AUTHORS' file.
21 package jalview.datamodel;
23 import java.util.ArrayList;
24 import java.util.List;
26 public class HiddenColumnsCursor
28 // absolute position of first hidden column
29 private int firstColumn;
31 private List<int[]> hiddenColumns = new ArrayList<>();
33 private HiddenCursorPosition cursorPos = new HiddenCursorPosition(0, 0);
35 protected HiddenColumnsCursor()
40 protected HiddenColumnsCursor(List<int[]> hiddenCols)
42 resetCursor(hiddenCols, 0, 0);
45 protected HiddenColumnsCursor(List<int[]> hiddenCols, int index,
48 resetCursor(hiddenCols, index, hiddencount);
52 * Reset the cursor with a new hidden columns collection, where we know in
53 * advance the index and hidden columns count of a particular location.
56 * new hidden columns collection
58 * cursor index to reset to
60 * hidden columns count to reset to
62 private void resetCursor(List<int[]> hiddenCols, int index,
65 hiddenColumns = hiddenCols;
66 if (!hiddenCols.isEmpty())
68 firstColumn = hiddenColumns.get(0)[0];
69 cursorPos = new HiddenCursorPosition(index,
75 * Delete the region the cursor is currently at. Avoids having to reset the
76 * cursor just because we deleted a region.
78 * Calls to updateForDeletedRegion should be made from within a writeLock in
79 * the HiddenColumns class - since changes to the hiddenColumns collection
80 * require a writeLock the lock should already exist.
83 * replacement list of hidden column regions
85 * number of columns which were deleted
87 protected void updateForDeletedRegion(List<int[]> hiddenCols, int remove)
89 hiddenColumns = hiddenCols;
90 if (!hiddenCols.isEmpty())
92 if (cursorPos.getRegionIndex() >= hiddenCols.size())
94 cursorPos = new HiddenCursorPosition(hiddenCols.size(),
95 cursorPos.getHiddenSoFar() - remove);
101 * Get the cursor pointing to the hidden region that column is within (if
102 * column is hidden) or which is to the right of column (if column is
103 * visible). If no hidden columns are to the right, returns a cursor pointing
104 * to an imaginary hidden region beyond the end of the hidden columns
105 * collection (this ensures the count of previous hidden columns is correct).
106 * If hidden columns is empty returns null.
109 * index of column in visible or absolute coordinates
111 * true if column is in visible coordinates, false if absolute
112 * @return cursor pointing to hidden region containing the column (if hidden)
113 * or to the right of the column (if visible)
115 protected HiddenCursorPosition findRegionForColumn(int column,
118 if (hiddenColumns.isEmpty())
123 // used to add in hiddenColumns offset when working with visible columns
124 int offset = (useVisible ? 1 : 0);
126 HiddenCursorPosition pos = cursorPos;
127 int index = pos.getRegionIndex();
128 int hiddenCount = pos.getHiddenSoFar();
130 if (column < firstColumn)
132 pos = new HiddenCursorPosition(0, 0);
135 // column is after current region
136 else if ((index < hiddenColumns.size())
137 && (hiddenColumns.get(index)[0] <= column
138 + offset * hiddenCount))
140 // iterate from where we are now, if we're lucky we'll be close by
141 // (but still better than iterating from 0)
142 // stop when we find the region *before* column
143 // i.e. the next region starts after column or if not, ends after column
144 pos = searchForward(pos, column, useVisible);
147 // column is before current region
150 pos = searchBackward(pos, column, useVisible);
157 * Search forwards through the hidden columns collection to find the hidden
158 * region immediately before a column
165 * whether using visible or absolute coordinates
166 * @return position of region before column
168 private HiddenCursorPosition searchForward(HiddenCursorPosition pos,
169 int column, boolean useVisible)
171 HiddenCursorPosition p = pos;
174 while ((p.getRegionIndex() < hiddenColumns.size())
175 && hiddenColumns.get(p.getRegionIndex())[0] <= column
176 + p.getHiddenSoFar())
183 while ((p.getRegionIndex() < hiddenColumns.size())
184 && hiddenColumns.get(p.getRegionIndex())[1] < column)
193 * Move to the next (rightwards) hidden region after a given cursor position
196 * current position of cursor
197 * @return new position of cursor at next region
199 private HiddenCursorPosition stepForward(HiddenCursorPosition p)
201 int[] region = hiddenColumns.get(p.getRegionIndex());
203 // increment the index, and add this region's hidden columns to the hidden
205 return new HiddenCursorPosition(p.getRegionIndex() + 1,
206 p.getHiddenSoFar() + region[1] - region[0] + 1);
210 * Search backwards through the hidden columns collection to find the hidden
211 * region immediately before (left of) a given column
218 * whether using visible or absolute coordinates
219 * @return position of region immediately to left of column
221 private HiddenCursorPosition searchBackward(HiddenCursorPosition p,
222 int column, boolean useVisible)
224 int i = p.getRegionIndex();
225 int h = p.getHiddenSoFar();
227 // used to add in hiddenColumns offset when working with visible columns
228 int offset = (useVisible ? 1 : 0);
230 while ((i > 0) && (hiddenColumns.get(i - 1)[1] >= column + offset * h))
233 int[] region = hiddenColumns.get(i);
234 h -= region[1] - region[0] + 1;
236 return new HiddenCursorPosition(i, h);