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.BitSet;
25 import java.util.Iterator;
26 import java.util.List;
27 import java.util.concurrent.locks.ReentrantReadWriteLock;
29 public class HiddenColumns
31 private static final int HASH_MULTIPLIER = 31;
33 private static final ReentrantReadWriteLock LOCK = new ReentrantReadWriteLock();
35 private HiddenColumnsCursor cursor = new HiddenColumnsCursor();
38 * list of hidden column [start, end] ranges; the list is maintained in
39 * ascending start column order
41 private ArrayList<int[]> hiddenColumns;
46 public HiddenColumns()
55 public HiddenColumns(HiddenColumns copy)
59 LOCK.writeLock().lock();
62 if (copy.hiddenColumns != null)
64 hiddenColumns = new ArrayList<>();
65 Iterator<int[]> it = copy.iterator();
68 hiddenColumns.add(it.next());
70 cursor.resetCursor(hiddenColumns);
75 LOCK.writeLock().unlock();
80 * Copy constructor within bounds and with offset. Copies hidden column
81 * regions fully contained between start and end, and offsets positions by
85 * HiddenColumns instance to copy from
87 * lower bound to copy from
89 * upper bound to copy to
91 * offset to subtract from each region boundary position
94 public HiddenColumns(HiddenColumns copy, int start, int end, int offset)
98 LOCK.writeLock().lock();
101 hiddenColumns = new ArrayList<>();
102 Iterator<int[]> it = copy.getBoundedIterator(start, end);
105 int[] region = it.next();
106 // still need to check boundaries because iterator returns
107 // all overlapping regions and we need contained regions
108 if (region[0] >= start && region[1] <= end)
112 { region[0] - offset, region[1] - offset });
115 cursor.resetCursor(hiddenColumns);
119 LOCK.writeLock().unlock();
124 * Output regions data as a string. String is in the format:
125 * reg0[0]<between>reg0[1]<delimiter>reg1[0]<between>reg1[1] ... regn[1]
128 * string to delimit regions
129 * @param betweenstring
130 * to put between start and end region values
131 * @return regions formatted according to delimiter and between strings
133 public String regionsToString(String delimiter, String between)
137 LOCK.readLock().lock();
138 StringBuilder regionBuilder = new StringBuilder();
139 if (hiddenColumns != null)
141 Iterator<int[]> it = hiddenColumns.iterator();
144 int[] range = it.next();
145 regionBuilder.append(delimiter).append(range[0]).append(between)
149 regionBuilder.deleteCharAt(0);
153 return regionBuilder.toString();
156 LOCK.readLock().unlock();
161 * Find the number of hidden columns
163 * @return number of hidden columns
169 LOCK.readLock().lock();
171 if (hiddenColumns != null)
173 Iterator<int[]> it = hiddenColumns.iterator();
176 int[] range = it.next();
177 size += range[1] - range[0] + 1;
183 LOCK.readLock().unlock();
188 * Get the number of distinct hidden regions
190 * @return number of regions
192 public int getNumberOfRegions()
196 LOCK.readLock().lock();
198 if (hasHiddenColumns())
200 num = hiddenColumns.size();
205 LOCK.readLock().unlock();
210 public boolean equals(Object obj)
214 LOCK.readLock().lock();
216 if (!(obj instanceof HiddenColumns))
220 HiddenColumns that = (HiddenColumns) obj;
223 * check hidden columns are either both null, or match
225 if (this.hiddenColumns == null)
227 return (that.hiddenColumns == null);
229 if (that.hiddenColumns == null
230 || that.hiddenColumns.size() != this.hiddenColumns.size())
235 Iterator<int[]> it = hiddenColumns.iterator();
236 Iterator<int[]> thatit = that.iterator();
239 int[] thisRange = it.next();
240 int[] thatRange = thatit.next();
241 if (thisRange[0] != thatRange[0] || thisRange[1] != thatRange[1])
249 LOCK.readLock().unlock();
254 * Return absolute column index for a visible column index
257 * int column index in alignment view (count from zero)
258 * @return alignment column index for column
260 public int adjustForHiddenColumns(int column)
264 LOCK.readLock().lock();
267 if (hiddenColumns != null)
269 result += cursor.getHiddenOffset(column);
275 LOCK.readLock().unlock();
280 * Use this method to find out where a column will appear in the visible
281 * alignment when hidden columns exist. If the column is not visible, then the
282 * left-most visible column will always be returned.
284 * @param hiddenColumn
285 * the column index in the full alignment including hidden columns
286 * @return the position of the column in the visible alignment
288 public int findColumnPosition(int hiddenColumn)
292 LOCK.readLock().lock();
293 int result = hiddenColumn;
295 if (hiddenColumns != null)
297 Iterator<int[]> it = new RegionsIterator(0,
298 hiddenColumn, hiddenColumns, cursor);
302 if (hiddenColumn > region[1])
304 result -= region[1] + 1 - region[0];
308 if (region != null && hiddenColumn >= region[0]
309 && hiddenColumn <= region[1])
311 // Here the hidden column is within a region, so
312 // we want to return the position of region[0]-1, adjusted for any
313 // earlier hidden columns.
314 // Calculate the difference between the actual hidden col position
315 // and region[0]-1, and then subtract from result to convert result
316 // from the adjusted hiddenColumn value to the adjusted region[0]-1
319 // However, if the region begins at 0 we cannot return region[0]-1
327 return result - (hiddenColumn - region[0] + 1);
331 return result; // return the shifted position after removing hidden
335 LOCK.readLock().unlock();
340 * Find the visible column which is a given visible number of columns to the
341 * left of another visible column. i.e. for a startColumn x, the column which
342 * is distance 1 away will be column x-1.
344 * @param visibleDistance
345 * the number of visible columns to offset by
347 * the column to start from
348 * @return the position of the column in the visible alignment
350 public int subtractVisibleColumns(int visibleDistance, int startColumn)
354 LOCK.readLock().lock();
355 int distance = visibleDistance;
357 // in case startColumn is in a hidden region, move it to the left
358 int start = adjustForHiddenColumns(findColumnPosition(startColumn));
360 Iterator<int[]> it = new ReverseRegionsIterator(0, start,
363 while (it.hasNext() && (distance > 0))
365 int[] region = it.next();
367 if (start > region[1])
369 // subtract the gap to right of region from distance
370 if (start - region[1] <= distance)
372 distance -= start - region[1];
373 start = region[0] - 1;
377 start = start - distance;
383 return start - distance;
387 LOCK.readLock().unlock();
392 * This method returns the rightmost limit of a region of an alignment with
393 * hidden columns. In otherwords, the next hidden column.
396 * the absolute (visible) alignmentPosition to find the next hidden
399 public int getHiddenBoundaryRight(int alPos)
403 LOCK.readLock().lock();
404 if (hiddenColumns != null)
406 int index = cursor.findRegionForColumn(alPos);
407 if (index < hiddenColumns.size())
409 int[] region = hiddenColumns.get(index);
410 if (alPos < region[0])
414 else if ((alPos <= region[1])
415 && (index + 1 < hiddenColumns.size()))
417 // alPos is within a hidden region, return the next one
419 region = hiddenColumns.get(index + 1);
427 LOCK.readLock().unlock();
432 * This method returns the leftmost limit of a region of an alignment with
433 * hidden columns. In otherwords, the previous hidden column.
436 * the absolute (visible) alignmentPosition to find the previous
439 public int getHiddenBoundaryLeft(int alPos)
443 LOCK.readLock().lock();
445 if (hiddenColumns != null)
447 int index = cursor.findRegionForColumn(alPos);
451 int[] region = hiddenColumns.get(index - 1);
458 LOCK.readLock().unlock();
463 * Adds the specified column range to the hidden columns collection
466 * start of range to add (absolute position in alignment)
468 * end of range to add (absolute position in alignment)
470 public void hideColumns(int start, int end)
472 boolean wasAlreadyLocked = false;
475 // check if the write lock was already locked by this thread,
476 // as this method can be called internally in loops within HiddenColumns
477 if (!LOCK.isWriteLockedByCurrentThread())
479 LOCK.writeLock().lock();
483 wasAlreadyLocked = true;
486 if (hiddenColumns == null)
488 hiddenColumns = new ArrayList<>();
492 * new range follows everything else; check first to avoid looping over whole hiddenColumns collection
494 if (hiddenColumns.isEmpty()
495 || start > hiddenColumns.get(hiddenColumns.size() - 1)[1])
497 hiddenColumns.add(new int[] { start, end });
502 * traverse existing hidden ranges and insert / amend / append as
505 boolean added = false;
506 for (int i = 0; !added && i < hiddenColumns.size(); i++)
508 added = insertRangeAtRegion(i, start, end);
511 if (!wasAlreadyLocked)
513 cursor.resetCursor(hiddenColumns);
517 if (!wasAlreadyLocked)
519 LOCK.writeLock().unlock();
525 * Insert [start, range] at the region at index i in hiddenColumns, if
531 * start of range to insert
533 * end of range to insert
534 * @return true if range was successfully inserted
536 private boolean insertRangeAtRegion(int i, int start, int end)
538 boolean added = false;
540 int[] region = hiddenColumns.get(i);
541 if (end < region[0] - 1)
544 * insert discontiguous preceding range
546 hiddenColumns.add(i, new int[] { start, end });
549 else if (end <= region[1])
552 * new range overlaps existing, or is contiguous preceding it - adjust
555 region[0] = Math.min(region[0], start);
558 else if (start <= region[1] + 1)
561 * new range overlaps existing, or is contiguous following it - adjust
562 * start and end columns
564 region[0] = Math.min(region[0], start);
565 region[1] = Math.max(region[1], end);
568 * also update or remove any subsequent ranges
569 * that are overlapped
571 while (i < hiddenColumns.size() - 1)
573 int[] nextRegion = hiddenColumns.get(i + 1);
574 if (nextRegion[0] > end + 1)
577 * gap to next hidden range - no more to update
581 region[1] = Math.max(nextRegion[1], end);
582 hiddenColumns.subList(i + 1, i + 2).clear();
590 * Answers if a column in the alignment is visible
593 * absolute position of column in the alignment
594 * @return true if column is visible
596 public boolean isVisible(int column)
600 LOCK.readLock().lock();
602 Iterator<int[]> it = new RegionsIterator(column, column,
603 hiddenColumns, cursor);
606 int[] region = it.next();
607 if (column >= region[0] && column <= region[1])
616 LOCK.readLock().unlock();
621 * Get the visible sections of a set of sequences
624 * sequence position to start from
626 * sequence position to end at
628 * an array of sequences
629 * @return an array of strings encoding the visible parts of each sequence
631 public String[] getVisibleSequenceStrings(int start, int end,
636 LOCK.readLock().lock();
637 int iSize = seqs.length;
638 String[] selections = new String[iSize];
639 if (hiddenColumns != null && hiddenColumns.size() > 0)
641 for (int i = 0; i < iSize; i++)
643 StringBuffer visibleSeq = new StringBuffer();
645 Iterator<int[]> blocks = new VisibleContigsIterator(start,
646 end + 1, hiddenColumns);
648 while (blocks.hasNext())
650 int[] block = blocks.next();
651 if (blocks.hasNext())
654 .append(seqs[i].getSequence(block[0], block[1] + 1));
659 .append(seqs[i].getSequence(block[0], block[1]));
663 selections[i] = visibleSeq.toString();
668 for (int i = 0; i < iSize; i++)
670 selections[i] = seqs[i].getSequenceAsString(start, end);
677 LOCK.readLock().unlock();
682 * Locate the first position visible for this sequence. If seq isn't visible
683 * then return the position of the left side of the hidden boundary region.
686 * sequence to find position for
687 * @return visible start position
689 public int locateVisibleStartOfSequence(SequenceI seq)
693 LOCK.readLock().lock();
696 if (hiddenColumns == null || hiddenColumns.size() == 0)
698 return seq.findIndex(seq.getStart()) - 1;
701 // Simply walk along the sequence whilst watching for hidden column
703 Iterator<int[]> regions = hiddenColumns.iterator();
704 int hideStart = seq.getLength();
708 boolean foundStart = false;
710 // step through the non-gapped positions of the sequence
711 for (int i = seq.getStart(); i <= seq.getEnd() && (!foundStart); i++)
713 // get alignment position of this residue in the sequence
714 int p = seq.findIndex(i) - 1;
716 // update hidden region start/end
717 while (hideEnd < p && regions.hasNext())
719 int[] region = regions.next();
721 visNext += region[0] - visPrev;
722 hideStart = region[0];
727 hideStart = seq.getLength();
729 // update visible boundary for sequence
739 return findColumnPosition(start);
741 // otherwise, sequence was completely hidden
745 LOCK.readLock().unlock();
750 * delete any columns in alignmentAnnotation that are hidden (including
751 * sequence associated annotation).
753 * @param alignmentAnnotation
755 public void makeVisibleAnnotation(AlignmentAnnotation alignmentAnnotation)
757 makeVisibleAnnotation(0, alignmentAnnotation.annotations.length,
758 alignmentAnnotation);
762 * delete any columns in alignmentAnnotation that are hidden (including
763 * sequence associated annotation).
766 * remove any annotation to the right of this column
768 * remove any annotation to the left of this column
769 * @param alignmentAnnotation
770 * the annotation to operate on
772 public void makeVisibleAnnotation(int start, int end,
773 AlignmentAnnotation alignmentAnnotation)
777 LOCK.readLock().lock();
779 int startFrom = start;
782 if (alignmentAnnotation.annotations != null)
784 if (hiddenColumns != null && hiddenColumns.size() > 0)
786 removeHiddenAnnotation(startFrom, endAt, alignmentAnnotation);
790 alignmentAnnotation.restrict(startFrom, endAt);
795 LOCK.readLock().unlock();
799 private void removeHiddenAnnotation(int start, int end,
800 AlignmentAnnotation alignmentAnnotation)
802 // mangle the alignmentAnnotation annotation array
803 ArrayList<Annotation[]> annels = new ArrayList<>();
804 Annotation[] els = null;
808 Iterator<int[]> blocks = new VisibleContigsIterator(start, end + 1,
812 int annotationLength;
813 while (blocks.hasNext())
815 int[] block = blocks.next();
816 annotationLength = block[1] - block[0] + 1;
818 if (blocks.hasNext())
820 // copy just the visible segment of the annotation row
821 copylength = annotationLength;
825 if (annotationLength + block[0] <= alignmentAnnotation.annotations.length)
827 // copy just the visible segment of the annotation row
828 copylength = annotationLength;
832 // copy to the end of the annotation row
833 copylength = alignmentAnnotation.annotations.length - block[0];
837 els = new Annotation[annotationLength];
839 System.arraycopy(alignmentAnnotation.annotations, block[0], els, 0,
841 w += annotationLength;
846 alignmentAnnotation.annotations = new Annotation[w];
849 for (Annotation[] chnk : annels)
851 System.arraycopy(chnk, 0, alignmentAnnotation.annotations, w,
860 * @return true if there are columns hidden
862 public boolean hasHiddenColumns()
866 LOCK.readLock().lock();
867 return hiddenColumns != null && hiddenColumns.size() > 0;
870 LOCK.readLock().unlock();
876 * @return true if there are more than one set of columns hidden
878 public boolean hasManyHiddenColumns()
882 LOCK.readLock().lock();
883 return hiddenColumns != null && hiddenColumns.size() > 1;
886 LOCK.readLock().unlock();
891 * mark the columns corresponding to gap characters as hidden in the column
896 public void hideInsertionsFor(SequenceI sr)
900 LOCK.writeLock().lock();
901 List<int[]> inserts = sr.getInsertions();
902 for (int[] r : inserts)
904 hideColumns(r[0], r[1]);
906 cursor.resetCursor(hiddenColumns);
909 LOCK.writeLock().unlock();
914 * Unhides, and adds to the selection list, all hidden columns
916 public void revealAllHiddenColumns(ColumnSelection sel)
920 LOCK.writeLock().lock();
921 if (hiddenColumns != null)
923 Iterator<int[]> it = hiddenColumns.iterator();
926 int[] region = it.next();
927 for (int j = region[0]; j < region[1] + 1; j++)
932 hiddenColumns = null;
933 cursor.resetCursor(hiddenColumns);
937 LOCK.writeLock().unlock();
942 * Reveals, and marks as selected, the hidden column range with the given
947 public void revealHiddenColumns(int start, ColumnSelection sel)
951 LOCK.writeLock().lock();
952 Iterator<int[]> it = new RegionsIterator(start, start, hiddenColumns,
956 int[] region = it.next();
957 if (start == region[0])
959 for (int j = region[0]; j < region[1] + 1; j++)
966 else if (start < region[0])
968 break; // passed all possible matching regions
972 if (hiddenColumns.size() == 0)
974 hiddenColumns = null;
976 cursor.resetCursor(hiddenColumns);
979 LOCK.writeLock().unlock();
984 * Add gaps into the sequences aligned to profileseq under the given
989 * - alignment to have gaps inserted into it
991 * - alignment view where sequence corresponding to profileseq is
993 * @return new HiddenColumns for new alignment view, with insertions into
994 * profileseq marked as hidden.
996 public static HiddenColumns propagateInsertions(SequenceI profileseq,
997 AlignmentI al, AlignmentView input)
1001 char gc = al.getGapCharacter();
1002 Object[] alandhidden = input.getAlignmentAndHiddenColumns(gc);
1003 HiddenColumns nview = (HiddenColumns) alandhidden[1];
1004 SequenceI origseq = ((SequenceI[]) alandhidden[0])[profsqpos];
1005 nview.propagateInsertions(profileseq, al, origseq);
1012 * - sequence in al which corresponds to origseq
1014 * - alignment which is to have gaps inserted into it
1016 * - sequence corresponding to profileseq which defines gap map for
1019 private void propagateInsertions(SequenceI profileseq, AlignmentI al,
1024 LOCK.writeLock().lock();
1026 char gc = al.getGapCharacter();
1028 // take the set of hidden columns, and the set of gaps in origseq,
1029 // and remove all the hidden gaps from hiddenColumns
1031 // first get the gaps as a Bitset
1032 BitSet gaps = origseq.gapBitset();
1034 // now calculate hidden ^ not(gap)
1035 BitSet hidden = new BitSet();
1036 markHiddenRegions(hidden);
1037 hidden.andNot(gaps);
1038 hiddenColumns = null;
1039 this.hideMarkedBits(hidden);
1041 // for each sequence in the alignment, except the profile sequence,
1042 // insert gaps corresponding to each hidden region
1043 // but where each hidden column region is shifted backwards by the number
1045 // preceding visible gaps
1046 // update hidden columns at the same time
1047 Iterator<int[]> regions = hiddenColumns.iterator();
1048 ArrayList<int[]> newhidden = new ArrayList<>();
1050 int numGapsBefore = 0;
1051 int gapPosition = 0;
1052 while (regions.hasNext())
1054 // get region coordinates accounting for gaps
1055 // we can rely on gaps not being *in* hidden regions because we already
1057 int[] region = regions.next();
1058 while (gapPosition < region[0])
1061 if (gaps.get(gapPosition))
1067 int left = region[0] - numGapsBefore;
1068 int right = region[1] - numGapsBefore;
1069 newhidden.add(new int[] { left, right });
1071 // make a string with number of gaps = length of hidden region
1072 StringBuffer sb = new StringBuffer();
1073 for (int s = 0; s < right - left + 1; s++)
1077 padGaps(sb, left, profileseq, al);
1080 hiddenColumns = newhidden;
1081 cursor.resetCursor(hiddenColumns);
1084 LOCK.writeLock().unlock();
1089 * Pad gaps in all sequences in alignment except profileseq
1092 * gap string to insert
1094 * position to insert at
1096 * sequence not to pad
1098 * alignment to pad sequences in
1100 private void padGaps(StringBuffer sb, int pos, SequenceI profileseq,
1103 // loop over the sequences and pad with gaps where required
1104 for (int s = 0, ns = al.getHeight(); s < ns; s++)
1106 SequenceI sqobj = al.getSequenceAt(s);
1107 if (sqobj != profileseq)
1109 String sq = al.getSequenceAt(s).getSequenceAsString();
1110 if (sq.length() <= pos)
1113 int diff = pos - sq.length() - 1;
1118 while ((diff = pos - sq.length() - 1) > 0)
1120 if (diff >= sb.length())
1122 sq += sb.toString();
1126 char[] buf = new char[diff];
1127 sb.getChars(0, diff, buf, 0);
1128 sq += buf.toString();
1132 sq += sb.toString();
1136 al.getSequenceAt(s).setSequence(
1137 sq.substring(0, pos) + sb.toString() + sq.substring(pos));
1144 * Returns a hashCode built from hidden column ranges
1147 public int hashCode()
1151 LOCK.readLock().lock();
1153 Iterator<int[]> it = hiddenColumns.iterator();
1154 while (it.hasNext())
1156 int[] hidden = it.next();
1157 hashCode = HASH_MULTIPLIER * hashCode + hidden[0];
1158 hashCode = HASH_MULTIPLIER * hashCode + hidden[1];
1163 LOCK.readLock().unlock();
1168 * Hide columns corresponding to the marked bits
1171 * - columns map to bits starting from zero
1173 public void hideMarkedBits(BitSet inserts)
1177 LOCK.writeLock().lock();
1178 for (int firstSet = inserts
1179 .nextSetBit(0), lastSet = 0; firstSet >= 0; firstSet = inserts
1180 .nextSetBit(lastSet))
1182 lastSet = inserts.nextClearBit(firstSet);
1183 hideColumns(firstSet, lastSet - 1);
1185 cursor.resetCursor(hiddenColumns);
1188 LOCK.writeLock().unlock();
1195 * BitSet where hidden columns will be marked
1197 public void markHiddenRegions(BitSet inserts)
1201 LOCK.readLock().lock();
1202 if (hiddenColumns == null)
1206 Iterator<int[]> it = hiddenColumns.iterator();
1207 while (it.hasNext())
1209 int[] range = it.next();
1210 inserts.set(range[0], range[1] + 1);
1214 LOCK.readLock().unlock();
1219 * Calculate the visible start and end index of an alignment.
1222 * full alignment width
1223 * @return integer array where: int[0] = startIndex, and int[1] = endIndex
1225 public int[] getVisibleStartAndEndIndex(int width)
1229 LOCK.readLock().lock();
1230 int[] alignmentStartEnd = new int[] { 0, width - 1 };
1231 int startPos = alignmentStartEnd[0];
1232 int endPos = alignmentStartEnd[1];
1234 int[] lowestRange = new int[] { -1, -1 };
1235 int[] higestRange = new int[] { -1, -1 };
1237 if (hiddenColumns == null)
1239 return new int[] { startPos, endPos };
1242 Iterator<int[]> it = hiddenColumns.iterator();
1243 while (it.hasNext())
1245 int[] range = it.next();
1246 lowestRange = (range[0] <= startPos) ? range : lowestRange;
1247 higestRange = (range[1] >= endPos) ? range : higestRange;
1250 if (lowestRange[0] == -1 && lowestRange[1] == -1)
1252 startPos = alignmentStartEnd[0];
1256 startPos = lowestRange[1] + 1;
1259 if (higestRange[0] == -1 && higestRange[1] == -1)
1261 endPos = alignmentStartEnd[1];
1265 endPos = higestRange[0] - 1;
1267 return new int[] { startPos, endPos };
1270 LOCK.readLock().unlock();
1275 * Finds the hidden region (if any) which starts or ends at res
1278 * visible residue position, unadjusted for hidden columns
1279 * @return region as [start,end] or null if no matching region is found
1281 public int[] getRegionWithEdgeAtRes(int res)
1285 LOCK.readLock().lock();
1286 int adjres = adjustForHiddenColumns(res);
1288 int[] reveal = null;
1290 if (hiddenColumns != null)
1292 int regionindex = cursor.findRegionForColumn(adjres - 1);
1293 if (hiddenColumns.get(regionindex)[1] == adjres - 1)
1295 reveal = hiddenColumns.get(regionindex);
1299 regionindex = cursor.findRegionForColumn(adjres + 1);
1300 if (hiddenColumns.get(regionindex)[0] == adjres + 1)
1302 reveal = hiddenColumns.get(regionindex);
1310 LOCK.readLock().unlock();
1315 * Return an iterator over the hidden regions
1317 public Iterator<int[]> iterator()
1321 LOCK.readLock().lock();
1322 return new BoundedHiddenColsIterator(hiddenColumns);
1325 LOCK.readLock().unlock();
1330 * Return a bounded iterator over the hidden regions
1333 * position to start from (inclusive, absolute column position)
1335 * position to end at (inclusive, absolute column position)
1338 public Iterator<int[]> getBoundedIterator(int start, int end)
1342 LOCK.readLock().lock();
1343 return new BoundedHiddenColsIterator(start, end, hiddenColumns);
1346 LOCK.readLock().unlock();
1351 * Return a bounded iterator over the *visible* start positions of hidden
1355 * position to start from (inclusive, visible column position)
1357 * position to end at (inclusive, visible column position)
1359 public Iterator<Integer> getBoundedStartIterator(int start, int end)
1363 LOCK.readLock().lock();
1364 return new BoundedStartRegionIterator(start, end, hiddenColumns);
1367 LOCK.readLock().unlock();
1372 * Return an iterator over visible *columns* (not regions) between the given
1373 * start and end boundaries
1376 * first column (inclusive)
1378 * last column (inclusive)
1380 public Iterator<Integer> getVisibleColsIterator(int start, int end)
1384 LOCK.readLock().lock();
1385 return new VisibleColsIterator(start, end, hiddenColumns);
1388 LOCK.readLock().unlock();
1393 * return an iterator over visible segments between the given start and end
1397 * (first column inclusive from 0)
1399 * (last column - not inclusive)
1401 public Iterator<int[]> getVisContigsIterator(int start, int end)
1405 LOCK.readLock().lock();
1406 return new VisibleContigsIterator(start, end, hiddenColumns);
1409 LOCK.readLock().unlock();
1414 * return an iterator over visible segments between the given start and end
1418 * (first column - inclusive from 0)
1420 * (last column - inclusive)
1421 * @param useVisibleCoords
1422 * if true, start and end are visible column positions, not absolute
1425 public Iterator<int[]> getVisibleBlocksIterator(int start, int end,
1426 boolean useVisibleCoords)
1428 if (useVisibleCoords)
1431 // we should really just convert start and end here with
1432 // adjustForHiddenColumns
1433 // and then create a VisibleContigsIterator
1434 // but without a cursor this will be horribly slow in some situations
1435 // ... so until then...
1436 return new VisibleBlocksVisBoundsIterator(start, end, true);
1442 LOCK.readLock().lock();
1443 return new VisibleContigsIterator(start, end + 1, hiddenColumns);
1446 LOCK.readLock().unlock();
1452 * An iterator which iterates over visible regions in a range. The range is
1453 * specified in terms of visible column positions. Provides a special
1454 * "endsAtHidden" indicator to allow callers to determine if the final visible
1455 * column is adjacent to a hidden region.
1457 public class VisibleBlocksVisBoundsIterator implements Iterator<int[]>
1459 private List<int[]> vcontigs = new ArrayList<>();
1461 private int currentPosition = 0;
1463 private boolean endsAtHidden = false;
1466 * Constructor for iterator over visible regions in a range.
1469 * start position in terms of visible column position
1471 * end position in terms of visible column position
1473 * whether to use a local copy of hidden columns
1475 VisibleBlocksVisBoundsIterator(int start, int end, boolean usecopy)
1477 /* actually this implementation always uses a local copy but this may change in future */
1482 LOCK.readLock().lock();
1485 if (hiddenColumns != null && hiddenColumns.size() > 0)
1487 int blockStart = start;
1489 int hiddenSoFar = 0;
1492 // iterate until a region begins within (start,end]
1494 while ((i < hiddenColumns.size())
1495 && (hiddenColumns.get(i)[0] <= blockStart + hiddenSoFar))
1497 hiddenSoFar += hiddenColumns.get(i)[1] - hiddenColumns.get(i)[0]
1502 blockStart += hiddenSoFar; // convert start to absolute position
1503 blockEnd += hiddenSoFar; // convert end to absolute position
1505 // iterate from start to end, adding each visible region. Positions
1507 // absolute, and all hidden regions which overlap [start,end] are
1509 while (i < hiddenColumns.size()
1510 && (hiddenColumns.get(i)[0] <= blockEnd))
1512 int[] region = hiddenColumns.get(i);
1514 // end position of this visible region is either just before the
1515 // start of the next hidden region, or the absolute position of
1516 // 'end', whichever is lowest
1517 blockEnd = Math.min(blockEnd, region[0] - 1);
1519 vcontigs.add(new int[] { blockStart, blockEnd });
1521 visSoFar += blockEnd - blockStart + 1;
1523 // next visible region starts after this hidden region
1524 blockStart = region[1] + 1;
1526 hiddenSoFar += region[1] - region[0] + 1;
1528 // reset blockEnd to absolute position of 'end', assuming we've now
1529 // passed all hidden regions before end
1530 blockEnd = end + hiddenSoFar;
1534 if (visSoFar < end - start + 1)
1536 // the number of visible columns we've accounted for is less than
1537 // the number specified by end-start; work out the end position of
1538 // the last visible region
1539 blockEnd = blockStart + end - start - visSoFar;
1540 vcontigs.add(new int[] { blockStart, blockEnd });
1542 // if the last visible region ends at the next hidden region, set
1543 // endsAtHidden=true
1544 if (i < hiddenColumns.size()
1545 && hiddenColumns.get(i)[0] - 1 == blockEnd)
1547 endsAtHidden = true;
1553 // there are no hidden columns, return a single visible contig
1554 vcontigs.add(new int[] { start, end });
1555 endsAtHidden = false;
1561 LOCK.readLock().unlock();
1567 public boolean hasNext()
1569 return (currentPosition < vcontigs.size());
1575 int[] result = vcontigs.get(currentPosition);
1580 public boolean endsAtHidden()
1582 return endsAtHidden;