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.Arrays;
25 import java.util.BitSet;
26 import java.util.Iterator;
27 import java.util.List;
28 import java.util.concurrent.locks.ReentrantReadWriteLock;
31 * This class manages the collection of hidden columns associated with an
32 * alignment. To iterate over the collection, or over visible columns/regions,
33 * use an iterator obtained from one of:
35 * - getBoundedIterator: iterates over the hidden regions, within some bounds,
36 * returning *absolute* positions
38 * - getBoundedStartIterator: iterates over the start positions of hidden
39 * regions, within some bounds, returning *visible* positions
41 * - getVisContigsIterator: iterates over visible regions in a range, returning
42 * *absolute* positions
44 * - getVisibleColsIterator: iterates over the visible *columns*
46 * For performance reasons, provide bounds where possible. Note that column
47 * numbering begins at 0 throughout this class.
52 /* Implementation notes:
54 * Methods which change the hiddenColumns collection should use a writeLock to
55 * prevent other threads accessing the hiddenColumns collection while changes
56 * are being made. They should also reset the hidden columns cursor, and either
57 * update the hidden columns count, or set it to 0 (so that it will later be
58 * updated when needed).
61 * Methods which only need read access to the hidden columns collection should
62 * use a readLock to prevent other threads changing the hidden columns
63 * collection while it is in use.
65 public class HiddenColumns
67 private static final int HASH_MULTIPLIER = 31;
69 private static final ReentrantReadWriteLock LOCK = new ReentrantReadWriteLock();
72 * Cursor which tracks the last used hidden columns region, and the number
73 * of hidden columns up to (but not including) that region.
75 private HiddenColumnsCursor cursor = new HiddenColumnsCursor();
78 * cache of the number of hidden columns
80 private int numColumns = 0;
83 * list of hidden column [start, end] ranges; the list is maintained in
84 * ascending start column order
86 private List<int[]> hiddenColumns = new ArrayList<>();
91 public HiddenColumns()
99 * the HiddenColumns object to copy from
101 public HiddenColumns(HiddenColumns copy)
103 this(copy, Integer.MIN_VALUE, Integer.MAX_VALUE, 0);
107 * Copy constructor within bounds and with offset. Copies hidden column
108 * regions fully contained between start and end, and offsets positions by
109 * subtracting offset.
112 * HiddenColumns instance to copy from
114 * lower bound to copy from
116 * upper bound to copy to
118 * offset to subtract from each region boundary position
121 public HiddenColumns(HiddenColumns copy, int start, int end, int offset)
125 LOCK.writeLock().lock();
129 Iterator<int[]> it = copy.getBoundedIterator(start, end);
132 int[] region = it.next();
133 // still need to check boundaries because iterator returns
134 // all overlapping regions and we need contained regions
135 if (region[0] >= start && region[1] <= end)
139 { region[0] - offset, region[1] - offset });
140 numColumns += region[1] - region[0] + 1;
143 cursor = new HiddenColumnsCursor(hiddenColumns);
147 LOCK.writeLock().unlock();
152 * Adds the specified column range to the hidden columns collection
155 * start of range to add (absolute position in alignment)
157 * end of range to add (absolute position in alignment)
159 public void hideColumns(int start, int end)
163 LOCK.writeLock().lock();
166 int prevHiddenCount = 0;
168 if (!hiddenColumns.isEmpty())
170 // set up cursor reset values
171 HiddenCursorPosition cursorPos = cursor.findRegionForColumn(start, false);
172 regionindex = cursorPos.getRegionIndex();
176 // get previous index and hidden count for updating the cursor later
177 previndex = regionindex - 1;
178 int[] prevRegion = hiddenColumns.get(previndex);
179 prevHiddenCount = cursorPos.getHiddenSoFar()
180 - (prevRegion[1] - prevRegion[0] + 1);
184 // new range follows everything else; check first to avoid looping over
185 // whole hiddenColumns collection
186 if (hiddenColumns.isEmpty()
187 || start > hiddenColumns.get(hiddenColumns.size() - 1)[1])
189 hiddenColumns.add(new int[] { start, end });
190 numColumns += end - start + 1;
195 * traverse existing hidden ranges and insert / amend / append as
198 boolean added = false;
201 added = insertRangeAtRegion(regionindex - 1, start, end);
203 if (!added && regionindex < hiddenColumns.size())
205 insertRangeAtRegion(regionindex, start, end);
209 // reset the cursor to just before our insertion point: this saves
210 // a lot of reprocessing in large alignments
211 cursor = new HiddenColumnsCursor(hiddenColumns, previndex,
215 LOCK.writeLock().unlock();
220 * Insert [start, range] at the region at index i in hiddenColumns, if
226 * start of range to insert
228 * end of range to insert
229 * @return true if range was successfully inserted
231 private boolean insertRangeAtRegion(int i, int start, int end)
233 boolean added = false;
235 int[] region = hiddenColumns.get(i);
236 if (end < region[0] - 1)
239 * insert discontiguous preceding range
241 hiddenColumns.add(i, new int[] { start, end });
242 numColumns += end - start + 1;
245 else if (end <= region[1])
248 * new range overlaps existing, or is contiguous preceding it - adjust
251 int oldstart = region[0];
252 region[0] = Math.min(region[0], start);
253 numColumns += oldstart - region[0]; // new columns are between old and
257 else if (start <= region[1] + 1)
260 * new range overlaps existing, or is contiguous following it - adjust
261 * start and end columns
263 insertRangeAtOverlap(i, start, end, region);
270 * Insert a range whose start position overlaps an existing region and/or is
271 * contiguous to the right of the region
276 * start of range to insert
278 * end of range to insert
280 * the overlapped/continued region
282 private void insertRangeAtOverlap(int i, int start, int end, int[] region)
284 int oldstart = region[0];
285 int oldend = region[1];
286 region[0] = Math.min(region[0], start);
287 region[1] = Math.max(region[1], end);
289 numColumns += oldstart - region[0];
292 * also update or remove any subsequent ranges
293 * that are overlapped
296 while (endi < hiddenColumns.size() - 1)
298 int[] nextRegion = hiddenColumns.get(endi + 1);
299 if (nextRegion[0] > end + 1)
302 * gap to next hidden range - no more to update
306 numColumns -= nextRegion[1] - nextRegion[0] + 1;
307 region[1] = Math.max(nextRegion[1], end);
310 numColumns += region[1] - oldend;
311 hiddenColumns.subList(i + 1, endi + 1).clear();
315 * hide a list of ranges
319 public void hideList(List<int[]> ranges)
323 LOCK.writeLock().lock();
324 for (int[] r : ranges)
326 hideColumns(r[0], r[1]);
328 cursor = new HiddenColumnsCursor(hiddenColumns);
332 LOCK.writeLock().unlock();
337 * Unhides, and adds to the selection list, all hidden columns
339 public void revealAllHiddenColumns(ColumnSelection sel)
343 LOCK.writeLock().lock();
345 for (int[] region : hiddenColumns)
347 for (int j = region[0]; j < region[1] + 1; j++)
352 hiddenColumns.clear();
353 cursor = new HiddenColumnsCursor(hiddenColumns);
358 LOCK.writeLock().unlock();
363 * Reveals, and marks as selected, the hidden column range with the given
367 * the start column to look for
369 * the column selection to add the hidden column range to
371 public void revealHiddenColumns(int start, ColumnSelection sel)
375 LOCK.writeLock().lock();
377 if (!hiddenColumns.isEmpty())
379 int regionIndex = cursor.findRegionForColumn(start, false)
382 if (regionIndex != -1 && regionIndex != hiddenColumns.size())
384 // regionIndex is the region which either contains start
385 // or lies to the right of start
386 int[] region = hiddenColumns.get(regionIndex);
387 if (start == region[0])
389 for (int j = region[0]; j < region[1] + 1; j++)
393 int colsToRemove = region[1] - region[0] + 1;
394 hiddenColumns.remove(regionIndex);
395 numColumns -= colsToRemove;
397 cursor.updateForDeletedRegion(hiddenColumns);
403 LOCK.writeLock().unlock();
408 * Output regions data as a string. String is in the format:
409 * reg0[0]<between>reg0[1]<delimiter>reg1[0]<between>reg1[1] ... regn[1]
412 * string to delimit regions
413 * @param betweenstring
414 * to put between start and end region values
415 * @return regions formatted according to delimiter and between strings
417 public String regionsToString(String delimiter, String between)
421 LOCK.readLock().lock();
422 StringBuilder regionBuilder = new StringBuilder();
424 boolean first = true;
425 for (int[] range : hiddenColumns)
429 regionBuilder.append(delimiter);
435 regionBuilder.append(range[0]).append(between).append(range[1]);
439 return regionBuilder.toString();
442 LOCK.readLock().unlock();
447 * Find the number of hidden columns
449 * @return number of hidden columns
457 * Get the number of distinct hidden regions
459 * @return number of regions
461 public int getNumberOfRegions()
465 LOCK.readLock().lock();
466 return hiddenColumns.size();
469 LOCK.readLock().unlock();
474 public boolean equals(Object obj)
478 LOCK.readLock().lock();
480 if (!(obj instanceof HiddenColumns))
484 HiddenColumns that = (HiddenColumns) obj;
487 * check hidden columns are either both null, or match
490 if (that.hiddenColumns.size() != this.hiddenColumns.size())
495 Iterator<int[]> it = this.iterator();
496 Iterator<int[]> thatit = that.iterator();
499 if (!(Arrays.equals(it.next(), thatit.next())))
508 LOCK.readLock().unlock();
513 * Return absolute column index for a visible column index
516 * int column index in alignment view (count from zero)
517 * @return alignment column index for column
519 public int visibleToAbsoluteColumn(int column)
523 LOCK.readLock().lock();
526 if (!hiddenColumns.isEmpty())
528 result += cursor.findRegionForColumn(column, true)
535 LOCK.readLock().unlock();
540 * Use this method to find out where a column will appear in the visible
541 * alignment when hidden columns exist. If the column is not visible, then the
542 * index of the next visible column on the left will be returned (or 0 if
543 * there is no visible column on the left)
545 * @param hiddenColumn
546 * the column index in the full alignment including hidden columns
547 * @return the position of the column in the visible alignment
549 public int absoluteToVisibleColumn(int hiddenColumn)
553 LOCK.readLock().lock();
554 int result = hiddenColumn;
556 if (!hiddenColumns.isEmpty())
558 HiddenCursorPosition cursorPos = cursor
559 .findRegionForColumn(hiddenColumn, false);
560 int index = cursorPos.getRegionIndex();
561 int hiddenBeforeCol = cursorPos.getHiddenSoFar();
563 // just subtract hidden cols count - this works fine if column is
565 result = hiddenColumn - hiddenBeforeCol;
567 // now check in case column is hidden - it will be in the returned
569 if (index < hiddenColumns.size())
571 int[] region = hiddenColumns.get(index);
572 if (hiddenColumn >= region[0] && hiddenColumn <= region[1])
574 // actually col is hidden, return region[0]-1
575 // unless region[0]==0 in which case return 0
582 result = region[0] - 1 - hiddenBeforeCol;
588 return result; // return the shifted position after removing hidden
592 LOCK.readLock().unlock();
597 * Find the visible column which is a given visible number of columns to the
598 * left (negative visibleDistance) or right (positive visibleDistance) of
599 * startColumn. If startColumn is not visible, we use the visible column at
600 * the left boundary of the hidden region containing startColumn.
602 * @param visibleDistance
603 * the number of visible columns to offset by (left offset = negative
604 * value; right offset = positive value)
606 * the position of the column to start from (absolute position)
607 * @return the position of the column which is <visibleDistance> away
608 * (absolute position)
610 public int offsetByVisibleColumns(int visibleDistance, int startColumn)
614 LOCK.readLock().lock();
615 int start = absoluteToVisibleColumn(startColumn);
616 return visibleToAbsoluteColumn(start + visibleDistance);
620 LOCK.readLock().unlock();
625 * This method returns the rightmost limit of a region of an alignment with
626 * hidden columns. In otherwords, the next hidden column.
629 * the absolute (visible) alignmentPosition to find the next hidden
631 * @return the index of the next hidden column, or alPos if there is no next
634 public int getNextHiddenBoundary(boolean left, int alPos)
638 LOCK.readLock().lock();
639 if (!hiddenColumns.isEmpty())
641 int index = cursor.findRegionForColumn(alPos, false)
644 if (left && index > 0)
646 int[] region = hiddenColumns.get(index - 1);
649 else if (!left && index < hiddenColumns.size())
651 int[] region = hiddenColumns.get(index);
652 if (alPos < region[0])
656 else if ((alPos <= region[1])
657 && (index + 1 < hiddenColumns.size()))
659 // alPos is within a hidden region, return the next one
661 region = hiddenColumns.get(index + 1);
669 LOCK.readLock().unlock();
674 * Answers if a column in the alignment is visible
677 * absolute position of column in the alignment
678 * @return true if column is visible
680 public boolean isVisible(int column)
684 LOCK.readLock().lock();
686 int regionindex = cursor.findRegionForColumn(column, false)
688 if (regionindex > -1 && regionindex < hiddenColumns.size())
690 int[] region = hiddenColumns.get(regionindex);
691 // already know that column <= region[1] as cursor returns containing
692 // region or region to right
693 if (column >= region[0])
702 LOCK.readLock().unlock();
708 * @return true if there are columns hidden
710 public boolean hasHiddenColumns()
714 LOCK.readLock().lock();
716 // we don't use getSize()>0 here because it has to iterate over
717 // the full hiddenColumns collection and so will be much slower
718 return (!hiddenColumns.isEmpty());
721 LOCK.readLock().unlock();
727 * @return true if there is more than one hidden column region
729 public boolean hasMultiHiddenColumnRegions()
733 LOCK.readLock().lock();
734 return !hiddenColumns.isEmpty() && hiddenColumns.size() > 1;
737 LOCK.readLock().unlock();
743 * Returns a hashCode built from hidden column ranges
746 public int hashCode()
750 LOCK.readLock().lock();
753 for (int[] hidden : hiddenColumns)
755 hashCode = HASH_MULTIPLIER * hashCode + hidden[0];
756 hashCode = HASH_MULTIPLIER * hashCode + hidden[1];
761 LOCK.readLock().unlock();
766 * Hide columns corresponding to the marked bits
769 * - columns mapped to bits starting from zero
771 public void hideColumns(BitSet inserts)
775 LOCK.writeLock().lock();
776 for (int firstSet = inserts
777 .nextSetBit(0), lastSet = 0; firstSet >= 0; firstSet = inserts
778 .nextSetBit(lastSet))
780 lastSet = inserts.nextClearBit(firstSet);
781 hideColumns(firstSet, lastSet - 1);
783 cursor = new HiddenColumnsCursor(hiddenColumns);
786 LOCK.writeLock().unlock();
791 * Hide columns corresponding to the marked bits, within the range
792 * [start,end]. Entries in tohide which are outside [start,end] are ignored.
795 * columns mapped to bits starting from zero
797 * start of range to hide columns within
799 * end of range to hide columns within
801 public void hideColumns(BitSet tohide, int start, int end)
803 clearHiddenColumnsInRange(start, end);
805 // make sure only bits between start and end are set
806 if (!tohide.isEmpty())
808 tohide.clear(0, start);
809 tohide.clear(Math.min(end + 1, tohide.length() + 1),
810 tohide.length() + 1);
817 * Make all columns in the range [start,end] visible
820 * start of range to show columns
822 * end of range to show columns
824 private void clearHiddenColumnsInRange(int start, int end)
828 LOCK.writeLock().lock();
830 if (!hiddenColumns.isEmpty())
832 HiddenCursorPosition pos = cursor.findRegionForColumn(start, false);
833 int index = pos.getRegionIndex();
835 if (index != -1 && index != hiddenColumns.size())
837 // regionIndex is the region which either contains start
838 // or lies to the right of start
839 int[] region = hiddenColumns.get(index);
840 if (region[0] < start && region[1] >= start)
842 // region contains start, truncate so that it ends just before start
843 numColumns -= region[1] - start + 1;
844 region[1] = start - 1;
849 while (endi < hiddenColumns.size())
851 region = hiddenColumns.get(endi);
855 if (region[0] <= end)
857 // region contains end, truncate so it starts just after end
858 numColumns -= end - region[0] + 1;
864 numColumns -= region[1] - region[0] + 1;
867 hiddenColumns.subList(index, endi).clear();
871 cursor = new HiddenColumnsCursor(hiddenColumns);
875 LOCK.writeLock().unlock();
882 * BitSet where hidden columns will be marked
884 protected void andNot(BitSet updates)
888 LOCK.writeLock().lock();
890 BitSet hiddenBitSet = new BitSet();
891 for (int[] range : hiddenColumns)
893 hiddenBitSet.set(range[0], range[1] + 1);
895 hiddenBitSet.andNot(updates);
896 hiddenColumns.clear();
897 hideColumns(hiddenBitSet);
900 LOCK.writeLock().unlock();
905 * Calculate the visible start and end index of an alignment.
908 * full alignment width
909 * @return integer array where: int[0] = startIndex, and int[1] = endIndex
911 public int[] getVisibleStartAndEndIndex(int width)
915 LOCK.readLock().lock();
917 int firstVisible = 0;
918 int lastVisible = width - 1;
920 if (!hiddenColumns.isEmpty())
922 // first visible col with index 0, convert to absolute index
923 firstVisible = visibleToAbsoluteColumn(0);
925 // last visible column is either immediately to left of
926 // last hidden region, or is just the last column in the alignment
927 int[] lastregion = hiddenColumns.get(hiddenColumns.size() - 1);
928 if (lastregion[1] == width - 1)
930 // last region is at very end of alignment
931 // last visible column immediately precedes it
932 lastVisible = lastregion[0] - 1;
935 return new int[] { firstVisible, lastVisible };
939 LOCK.readLock().unlock();
944 * Finds the hidden region (if any) which starts or ends at res
947 * visible residue position, unadjusted for hidden columns
948 * @return region as [start,end] or null if no matching region is found. If
949 * res is adjacent to two regions, returns the left region.
951 public int[] getRegionWithEdgeAtRes(int res)
955 LOCK.readLock().lock();
956 int adjres = visibleToAbsoluteColumn(res);
960 if (!hiddenColumns.isEmpty())
962 // look for a region ending just before adjres
963 int regionindex = cursor.findRegionForColumn(adjres - 1, false)
965 if (regionindex < hiddenColumns.size()
966 && hiddenColumns.get(regionindex)[1] == adjres - 1)
968 reveal = hiddenColumns.get(regionindex);
970 // check if the region ends just after adjres
971 else if (regionindex < hiddenColumns.size()
972 && hiddenColumns.get(regionindex)[0] == adjres + 1)
974 reveal = hiddenColumns.get(regionindex);
981 LOCK.readLock().unlock();
986 * Return an iterator over the hidden regions
988 public Iterator<int[]> iterator()
992 LOCK.readLock().lock();
993 return new HiddenColsIterator(hiddenColumns);
996 LOCK.readLock().unlock();
1001 * Return a bounded iterator over the hidden regions
1004 * position to start from (inclusive, absolute column position)
1006 * position to end at (inclusive, absolute column position)
1009 public Iterator<int[]> getBoundedIterator(int start, int end)
1013 LOCK.readLock().lock();
1014 return new HiddenColsIterator(start, end, hiddenColumns);
1017 LOCK.readLock().unlock();
1022 * Return a bounded iterator over the *visible* start positions of hidden
1026 * position to start from (inclusive, visible column position)
1028 * position to end at (inclusive, visible column position)
1030 public Iterator<Integer> getBoundedStartIterator(int start, int end)
1034 LOCK.readLock().lock();
1036 // get absolute position of column in alignment
1037 int absoluteStart = visibleToAbsoluteColumn(start);
1039 // Get cursor position and supply it to the iterator:
1040 // Since we want visible region start, we look for a cursor for the
1041 // (absoluteStart-1), then if absoluteStart is the start of a visible
1042 // region we'll get the cursor pointing to the region before, which is
1044 HiddenCursorPosition pos = cursor
1045 .findRegionForColumn(absoluteStart - 1, false);
1047 return new BoundedStartRegionIterator(pos, start, end,
1051 LOCK.readLock().unlock();
1056 * Return an iterator over visible *columns* (not regions) between the given
1057 * start and end boundaries
1060 * first column (inclusive)
1062 * last column (inclusive)
1064 public Iterator<Integer> getVisibleColsIterator(int start, int end)
1068 LOCK.readLock().lock();
1069 return new VisibleColsIterator(start, end, hiddenColumns);
1072 LOCK.readLock().unlock();
1077 * return an iterator over visible segments between the given start and end
1081 * first column, inclusive from 0
1083 * last column - not inclusive
1084 * @param useVisibleCoords
1085 * if true, start and end are visible column positions, not absolute
1088 public VisibleContigsIterator getVisContigsIterator(int start,
1090 boolean useVisibleCoords)
1092 int adjstart = start;
1094 if (useVisibleCoords)
1096 adjstart = visibleToAbsoluteColumn(start);
1097 adjend = visibleToAbsoluteColumn(end);
1102 LOCK.readLock().lock();
1103 return new VisibleContigsIterator(adjstart, adjend, hiddenColumns);
1106 LOCK.readLock().unlock();