X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fjalview%2Fdatamodel%2FHiddenColumns.java;h=c40c1050040e841732de481b8922e4fcc25ebaa1;hb=65c6bb5c1deac2163c9e2a75287de5e59c8728a9;hp=2edb3f1d8905aa6a30854b146329200fcc5d72b8;hpb=d4c27a996e22436dd4c4d8f64f6341d5315ff621;p=jalview.git

diff --git a/src/jalview/datamodel/HiddenColumns.java b/src/jalview/datamodel/HiddenColumns.java
index 2edb3f1..c40c105 100644
--- a/src/jalview/datamodel/HiddenColumns.java
+++ b/src/jalview/datamodel/HiddenColumns.java
@@ -1,861 +1,704 @@
+/*
+ * Jalview - A Sequence Alignment Editor and Viewer ($$Version-Rel$$)
+ * Copyright (C) $$Year-Rel$$ The Jalview Authors
+ * 
+ * This file is part of Jalview.
+ * 
+ * Jalview is free software: you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License 
+ * as published by the Free Software Foundation, either version 3
+ * of the License, or (at your option) any later version.
+ *  
+ * Jalview is distributed in the hope that it will be useful, but 
+ * WITHOUT ANY WARRANTY; without even the implied warranty 
+ * of MERCHANTABILITY or FITNESS FOR A PARTICULAR 
+ * PURPOSE.  See the GNU General Public License for more details.
+ * 
+ * You should have received a copy of the GNU General Public License
+ * along with Jalview.  If not, see <http://www.gnu.org/licenses/>.
+ * The Jalview Authors are detailed in the 'AUTHORS' file.
+ */
 package jalview.datamodel;
 
-import jalview.util.Comparison;
-import jalview.util.ShiftList;
-
 import java.util.ArrayList;
-import java.util.Collections;
+import java.util.Arrays;
+import java.util.BitSet;
+import java.util.Iterator;
 import java.util.List;
-import java.util.Vector;
-
+import java.util.concurrent.locks.ReentrantReadWriteLock;
+
+/**
+ * This class manages the collection of hidden columns associated with an
+ * alignment. To iterate over the collection, or over visible columns/regions,
+ * use an iterator obtained from one of:
+ * 
+ * - getBoundedIterator: iterates over the hidden regions, within some bounds,
+ * returning *absolute* positions
+ * 
+ * - getBoundedStartIterator: iterates over the start positions of hidden
+ * regions, within some bounds, returning *visible* positions
+ * 
+ * - getVisContigsIterator: iterates over visible regions in a range, returning
+ * *absolute* positions
+ * 
+ * - getVisibleColsIterator: iterates over the visible *columns*
+ * 
+ * For performance reasons, provide bounds where possible. Note that column
+ * numbering begins at 0 throughout this class.
+ * 
+ * @author kmourao
+ */
+
+/* Implementation notes:
+ * 
+ * Methods which change the hiddenColumns collection should use a writeLock to
+ * prevent other threads accessing the hiddenColumns collection while changes
+ * are being made. They should also reset the hidden columns cursor, and either
+ * update the hidden columns count, or set it to 0 (so that it will later be
+ * updated when needed).
+ * 
+ * 
+ * Methods which only need read access to the hidden columns collection should
+ * use a readLock to prevent other threads changing the hidden columns
+ * collection while it is in use.
+ */
 public class HiddenColumns
 {
+  private static final int HASH_MULTIPLIER = 31;
+
+  private static final ReentrantReadWriteLock LOCK = new ReentrantReadWriteLock();
+
+  /*
+   * Cursor which tracks the last used hidden columns region, and the number 
+   * of hidden columns up to (but not including) that region.
+   */
+  private HiddenColumnsCursor cursor = new HiddenColumnsCursor();
+
+  /*
+   * cache of the number of hidden columns: must be kept up to date by methods 
+   * which add or remove hidden columns
+   */
+  private int numColumns = 0;
+
   /*
    * list of hidden column [start, end] ranges; the list is maintained in
    * ascending start column order
    */
-  private Vector<int[]> hiddenColumns;
+  private List<int[]> hiddenColumns = new ArrayList<>();
 
   /**
-   * This Method is used to return all the HiddenColumn regions
-   * 
-   * @return empty list or List of hidden column intervals
+   * Constructor
    */
-  public List<int[]> getHiddenRegions()
+  public HiddenColumns()
   {
-    return hiddenColumns == null ? Collections.<int[]> emptyList()
-            : hiddenColumns;
   }
 
   /**
-   * Find the number of hidden columns
+   * Copy constructor
    * 
-   * @return number of hidden columns
+   * @param copy
+   *          the HiddenColumns object to copy from
    */
-  public int getSize()
+  public HiddenColumns(HiddenColumns copy)
   {
-    int size = 0;
-    if (hasHidden())
-    {
-      for (int[] range : hiddenColumns)
-      {
-        size += range[1] - range[0] + 1;
-      }
-    }
-    return size;
+    this(copy, Integer.MIN_VALUE, Integer.MAX_VALUE, 0);
   }
 
   /**
-   * Answers if there are any hidden columns
+   * Copy constructor within bounds and with offset. Copies hidden column
+   * regions fully contained between start and end, and offsets positions by
+   * subtracting offset.
    * 
-   * @return true if there are hidden columns
-   */
-  public boolean hasHidden()
-  {
-    return (hiddenColumns != null) && (!hiddenColumns.isEmpty());
-  }
-
-  @Override
-  public boolean equals(Object obj)
-  {
-    if (!(obj instanceof HiddenColumns))
-    {
-      return false;
-    }
-    HiddenColumns that = (HiddenColumns) obj;
-
-    /*
-     * check hidden columns are either both null, or match
-     */
-    if (this.hiddenColumns == null)
-    {
-      return (that.hiddenColumns == null);
-    }
-    if (that.hiddenColumns == null
-            || that.hiddenColumns.size() != this.hiddenColumns.size())
-    {
-      return false;
-    }
-    int i = 0;
-    for (int[] thisRange : hiddenColumns)
-    {
-      int[] thatRange = that.hiddenColumns.get(i++);
-      if (thisRange[0] != thatRange[0] || thisRange[1] != thatRange[1])
-      {
-        return false;
-      }
-    }
-    return true;
-  }
-
-  /**
-   * Return absolute column index for a visible column index
+   * @param copy
+   *          HiddenColumns instance to copy from
+   * @param start
+   *          lower bound to copy from
+   * @param end
+   *          upper bound to copy to
+   * @param offset
+   *          offset to subtract from each region boundary position
    * 
-   * @param column
-   *          int column index in alignment view (count from zero)
-   * @return alignment column index for column
    */
-  public int adjustForHiddenColumns(int column)
+  public HiddenColumns(HiddenColumns copy, int start, int end, int offset)
   {
-    int result = column;
-    if (hiddenColumns != null)
+    try
     {
-      for (int i = 0; i < hiddenColumns.size(); i++)
+      LOCK.writeLock().lock();
+      if (copy != null)
       {
-        int[] region = hiddenColumns.elementAt(i);
-        if (result >= region[0])
+        numColumns = 0;
+        Iterator<int[]> it = copy.getBoundedIterator(start, end);
+        while (it.hasNext())
         {
-          result += region[1] - region[0] + 1;
+          int[] region = it.next();
+          // still need to check boundaries because iterator returns
+          // all overlapping regions and we need contained regions
+          if (region[0] >= start && region[1] <= end)
+          {
+            hiddenColumns.add(
+                    new int[]
+            { region[0] - offset, region[1] - offset });
+            numColumns += region[1] - region[0] + 1;
+          }
         }
+        cursor = new HiddenColumnsCursor(hiddenColumns);
       }
+    } finally
+    {
+      LOCK.writeLock().unlock();
     }
-    return result;
   }
 
   /**
-   * Use this method to find out where a column will appear in the visible
-   * alignment when hidden columns exist. If the column is not visible, then the
-   * left-most visible column will always be returned.
+   * Adds the specified column range to the hidden columns collection
    * 
-   * @param hiddenColumn
-   *          the column index in the full alignment including hidden columns
-   * @return the position of the column in the visible alignment
+   * @param start
+   *          start of range to add (absolute position in alignment)
+   * @param end
+   *          end of range to add (absolute position in alignment)
    */
-  public int findColumnPosition(int hiddenColumn)
+  public void hideColumns(int start, int end)
   {
-    int result = hiddenColumn;
-    if (hiddenColumns != null)
+    try
     {
-      int index = 0;
-      int[] region;
-      do
+      LOCK.writeLock().lock();
+
+      int previndex = 0;
+      int prevHiddenCount = 0;
+      int regionindex = 0;
+      if (!hiddenColumns.isEmpty())
       {
-        region = hiddenColumns.elementAt(index++);
-        if (hiddenColumn > region[1])
+        // set up cursor reset values
+        HiddenCursorPosition cursorPos = cursor.findRegionForColumn(start, false);
+        regionindex = cursorPos.getRegionIndex();
+
+        if (regionindex > 0)
         {
-          result -= region[1] + 1 - region[0];
+          // get previous index and hidden count for updating the cursor later
+          previndex = regionindex - 1;
+          int[] prevRegion = hiddenColumns.get(previndex);
+          prevHiddenCount = cursorPos.getHiddenSoFar()
+                  - (prevRegion[1] - prevRegion[0] + 1);
         }
-      } while ((hiddenColumn > region[1]) && (index < hiddenColumns.size()));
+      }
 
-      if (hiddenColumn >= region[0] && hiddenColumn <= region[1])
+      // new range follows everything else; check first to avoid looping over
+      // whole hiddenColumns collection
+      if (hiddenColumns.isEmpty()
+              || start > hiddenColumns.get(hiddenColumns.size() - 1)[1])
+      {
+        hiddenColumns.add(new int[] { start, end });
+        numColumns += end - start + 1;
+      }
+      else
       {
-        // Here the hidden column is within a region, so
-        // we want to return the position of region[0]-1, adjusted for any
-        // earlier hidden columns.
-        // Calculate the difference between the actual hidden col position
-        // and region[0]-1, and then subtract from result to convert result from
-        // the adjusted hiddenColumn value to the adjusted region[0]-1 value
-
-        // However, if the region begins at 0 we cannot return region[0]-1
-        // just return 0
-        if (region[0] == 0)
+        /*
+         * traverse existing hidden ranges and insert / amend / append as
+         * appropriate
+         */
+        boolean added = false;
+        if (regionindex > 0)
         {
-          return 0;
+          added = insertRangeAtRegion(regionindex - 1, start, end);
         }
-        else
+        if (!added && regionindex < hiddenColumns.size())
         {
-          return result - (hiddenColumn - region[0] + 1);
+          insertRangeAtRegion(regionindex, start, end);
         }
       }
+
+      // reset the cursor to just before our insertion point: this saves
+      // a lot of reprocessing in large alignments
+      cursor = new HiddenColumnsCursor(hiddenColumns, previndex,
+              prevHiddenCount);
+    } finally
+    {
+      LOCK.writeLock().unlock();
     }
-    return result; // return the shifted position after removing hidden columns.
   }
 
   /**
-   * Find the visible column which is a given visible number of columns to the
-   * left of another visible column. i.e. for a startColumn x, the column which
-   * is distance 1 away will be column x-1.
+   * Insert [start, range] at the region at index i in hiddenColumns, if
+   * feasible
    * 
-   * @param visibleDistance
-   *          the number of visible columns to offset by
-   * @param startColumn
-   *          the column to start from
-   * @return the position of the column in the visible alignment
+   * @param i
+   *          index to insert at
+   * @param start
+   *          start of range to insert
+   * @param end
+   *          end of range to insert
+   * @return true if range was successfully inserted
    */
-  public int subtractVisibleColumns(int visibleDistance, int startColumn)
+  private boolean insertRangeAtRegion(int i, int start, int end)
   {
-    int distance = visibleDistance;
-
-    // in case startColumn is in a hidden region, move it to the left
-    int start = adjustForHiddenColumns(findColumnPosition(startColumn));
+    boolean added = false;
 
-    // get index of hidden region to left of start
-    int index = getHiddenIndexLeft(start);
-    if (index == -1)
+    int[] region = hiddenColumns.get(i);
+    if (end < region[0] - 1)
     {
-      // no hidden regions to left of startColumn
-      return start - distance;
+      /*
+       * insert discontiguous preceding range
+       */
+      hiddenColumns.add(i, new int[] { start, end });
+      numColumns += end - start + 1;
+      added = true;
     }
-
-    // walk backwards through the alignment subtracting the counts of visible
-    // columns from distance
-    int[] region;
-    int gap = 0;
-    int nextstart = start;
-
-    while ((index > -1) && (distance - gap > 0))
+    else if (end <= region[1])
     {
-      // subtract the gap to right of region from distance
-      distance -= gap;
-      start = nextstart;
-
-      // calculate the next gap
-      region = hiddenColumns.get(index);
-      gap = start - region[1];
-
-      // set start to just to left of current region
-      nextstart = region[0] - 1;
-      index--;
+      /*
+       * new range overlaps existing, or is contiguous preceding it - adjust
+       * start column
+       */
+      int oldstart = region[0];
+      region[0] = Math.min(region[0], start);
+      numColumns += oldstart - region[0]; // new columns are between old and
+                                              // adjusted starts
+      added = true;
     }
-
-    if (distance - gap > 0)
+    else if (start <= region[1] + 1)
     {
-      // fell out of loop because there are no more hidden regions
-      distance -= gap;
-      return nextstart - distance;
+      /*
+       * new range overlaps existing, or is contiguous following it - adjust
+       * start and end columns
+       */
+      insertRangeAtOverlap(i, start, end, region);
+      added = true;
     }
-    return start - distance;
-
+    return added;
   }
 
   /**
-   * Use this method to determine where the next hiddenRegion starts
+   * Insert a range whose start position overlaps an existing region and/or is
+   * contiguous to the right of the region
    * 
-   * @param hiddenRegion
-   *          index of hidden region (counts from 0)
-   * @return column number in visible view
+   * @param i
+   *          index to insert at
+   * @param start
+   *          start of range to insert
+   * @param end
+   *          end of range to insert
+   * @param region
+   *          the overlapped/continued region
    */
-  public int findHiddenRegionPosition(int hiddenRegion)
+  private void insertRangeAtOverlap(int i, int start, int end, int[] region)
   {
-    int result = 0;
-    if (hiddenColumns != null)
-    {
-      int index = 0;
-      int gaps = 0;
-      do
-      {
-        int[] region = hiddenColumns.elementAt(index);
-        if (hiddenRegion == 0)
-        {
-          return region[0];
-        }
-
-        gaps += region[1] + 1 - region[0];
-        result = region[1] + 1;
-        index++;
-      } while (index <= hiddenRegion);
-
-      result -= gaps;
-    }
+    int oldstart = region[0];
+    int oldend = region[1];
+    region[0] = Math.min(region[0], start);
+    region[1] = Math.max(region[1], end);
 
-    return result;
-  }
+    numColumns += oldstart - region[0];
 
-  /**
-   * 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)
+    /*
+     * also update or remove any subsequent ranges 
+     * that are overlapped
+     */
+    int endi = i;
+    while (endi < hiddenColumns.size() - 1)
     {
-      int index = 0;
-      do
+      int[] nextRegion = hiddenColumns.get(endi + 1);
+      if (nextRegion[0] > end + 1)
       {
-        int[] region = hiddenColumns.elementAt(index);
-        if (alPos < region[0])
-        {
-          return region[0];
-        }
-
-        index++;
-      } while (index < hiddenColumns.size());
+        /*
+         * gap to next hidden range - no more to update
+         */
+        break;
+      }
+      numColumns -= nextRegion[1] - nextRegion[0] + 1;
+      region[1] = Math.max(nextRegion[1], end);
+      endi++;
     }
-
-    return alPos;
-
+    numColumns += region[1] - oldend;
+    hiddenColumns.subList(i + 1, endi + 1).clear();
   }
 
   /**
-   * This method returns the leftmost limit of a region of an alignment with
-   * hidden columns. In otherwords, the previous hidden column.
+   * hide a list of ranges
    * 
-   * @param index
-   *          int
+   * @param ranges
    */
-  public int getHiddenBoundaryLeft(int alPos)
+  public void hideList(List<int[]> ranges)
   {
-    if (hiddenColumns != null)
+    try
     {
-      int index = hiddenColumns.size() - 1;
-      do
+      LOCK.writeLock().lock();
+      for (int[] r : ranges)
       {
-        int[] region = hiddenColumns.elementAt(index);
-        if (alPos > region[1])
-        {
-          return region[1];
-        }
+        hideColumns(r[0], r[1]);
+      }
+      cursor = new HiddenColumnsCursor(hiddenColumns);
 
-        index--;
-      } while (index > -1);
+    } finally
+    {
+      LOCK.writeLock().unlock();
     }
-
-    return alPos;
-
   }
 
   /**
-   * This method returns the index of the hidden region to the left of a column
-   * position. If the column is in a hidden region it returns the index of the
-   * region to the left. If there is no hidden region to the left it returns -1.
-   * 
-   * @param pos
-   *          int
+   * Unhides, and adds to the selection list, all hidden columns
    */
-  private int getHiddenIndexLeft(int pos)
+  public void revealAllHiddenColumns(ColumnSelection sel)
   {
-    if (hiddenColumns != null)
+    try
     {
-      int index = hiddenColumns.size() - 1;
-      do
+      LOCK.writeLock().lock();
+
+      for (int[] region : hiddenColumns)
       {
-        int[] region = hiddenColumns.elementAt(index);
-        if (pos > region[1])
+        for (int j = region[0]; j < region[1] + 1; j++)
         {
-          return index;
+          sel.addElement(j);
         }
+      }
+      hiddenColumns.clear();
+      cursor = new HiddenColumnsCursor(hiddenColumns);
+      numColumns = 0;
 
-        index--;
-      } while (index > -1);
+    } finally
+    {
+      LOCK.writeLock().unlock();
     }
-
-    return -1;
-
   }
 
   /**
-   * Adds the specified column range to the hidden columns
+   * Reveals, and marks as selected, the hidden column range with the given
+   * start column
    * 
    * @param start
-   * @param end
+   *          the start column to look for
+   * @param sel
+   *          the column selection to add the hidden column range to
    */
-  public void hideColumns(int start, int end)
+  public void revealHiddenColumns(int start, ColumnSelection sel)
   {
-    if (hiddenColumns == null)
+    try
     {
-      hiddenColumns = new Vector<int[]>();
-    }
+      LOCK.writeLock().lock();
 
-    /*
-     * traverse existing hidden ranges and insert / amend / append as
-     * appropriate
-     */
-    for (int i = 0; i < hiddenColumns.size(); i++)
-    {
-      int[] region = hiddenColumns.elementAt(i);
-
-      if (end < region[0] - 1)
-      {
-        /*
-         * insert discontiguous preceding range
-         */
-        hiddenColumns.insertElementAt(new int[] { start, end }, i);
-        return;
-      }
-
-      if (end <= region[1])
+      if (!hiddenColumns.isEmpty())
       {
-        /*
-         * new range overlaps existing, or is contiguous preceding it - adjust
-         * start column
-         */
-        region[0] = Math.min(region[0], start);
-        return;
-      }
-
-      if (start <= region[1] + 1)
-      {
-        /*
-         * new range overlaps existing, or is contiguous following it - adjust
-         * start and end columns
-         */
-        region[0] = Math.min(region[0], start);
-        region[1] = Math.max(region[1], end);
+        int regionIndex = cursor.findRegionForColumn(start, false)
+                .getRegionIndex();
 
-        /*
-         * also update or remove any subsequent ranges 
-         * that are overlapped
-         */
-        while (i < hiddenColumns.size() - 1)
+        if (regionIndex != -1 && regionIndex != hiddenColumns.size())
         {
-          int[] nextRegion = hiddenColumns.get(i + 1);
-          if (nextRegion[0] > end + 1)
+          // regionIndex is the region which either contains start
+          // or lies to the right of start
+          int[] region = hiddenColumns.get(regionIndex);
+          if (start == region[0])
           {
-            /*
-             * gap to next hidden range - no more to update
-             */
-            break;
+            for (int j = region[0]; j < region[1] + 1; j++)
+            {
+              sel.addElement(j);
+            }
+            int colsToRemove = region[1] - region[0] + 1;
+            hiddenColumns.remove(regionIndex);
+            numColumns -= colsToRemove;
           }
-          region[1] = Math.max(nextRegion[1], end);
-          hiddenColumns.remove(i + 1);
         }
-        return;
       }
+    } finally
+    {
+      LOCK.writeLock().unlock();
     }
-
-    /*
-     * remaining case is that the new range follows everything else
-     */
-    hiddenColumns.addElement(new int[] { start, end });
   }
 
-  public boolean isVisible(int column)
+  /**
+   * Output regions data as a string. String is in the format:
+   * reg0[0]<between>reg0[1]<delimiter>reg1[0]<between>reg1[1] ... regn[1]
+   * 
+   * @param delimiter
+   *          string to delimit regions
+   * @param betweenstring
+   *          to put between start and end region values
+   * @return regions formatted according to delimiter and between strings
+   */
+  public String regionsToString(String delimiter, String between)
   {
-    if (hiddenColumns != null)
+    try
     {
-      for (int[] region : hiddenColumns)
+      LOCK.readLock().lock();
+      StringBuilder regionBuilder = new StringBuilder();
+
+      boolean first = true;
+      for (int[] range : hiddenColumns)
       {
-        if (column >= region[0] && column <= region[1])
+        if (!first)
         {
-          return false;
+          regionBuilder.append(delimiter);
         }
+        else
+        {
+          first = false;
+        }
+        regionBuilder.append(range[0]).append(between).append(range[1]);
+
       }
-    }
 
-    return true;
+      return regionBuilder.toString();
+    } finally
+    {
+      LOCK.readLock().unlock();
+    }
   }
 
   /**
-   * ColumnSelection
+   * Find the number of hidden columns
+   * 
+   * @return number of hidden columns
    */
-  public HiddenColumns()
+  public int getSize()
   {
+    return numColumns;
   }
 
   /**
-   * Copy constructor
+   * Get the number of distinct hidden regions
    * 
-   * @param copy
+   * @return number of regions
    */
-  public HiddenColumns(HiddenColumns copy)
+  public int getNumberOfRegions()
   {
-    if (copy != null)
+    try
     {
-      if (copy.hiddenColumns != null)
-      {
-        hiddenColumns = new Vector<int[]>(copy.hiddenColumns.size());
-        for (int i = 0, j = copy.hiddenColumns.size(); i < j; i++)
-        {
-          int[] rh, cp;
-          rh = copy.hiddenColumns.elementAt(i);
-          if (rh != null)
-          {
-            cp = new int[rh.length];
-            System.arraycopy(rh, 0, cp, 0, rh.length);
-            hiddenColumns.addElement(cp);
-          }
-        }
-      }
+      LOCK.readLock().lock();
+      return hiddenColumns.size();
+    } finally
+    {
+      LOCK.readLock().unlock();
     }
   }
 
-  /**
-   * propagate shift in alignment columns to column selection
-   * 
-   * @param start
-   *          beginning of edit
-   * @param left
-   *          shift in edit (+ve for removal, or -ve for inserts)
-   */
-  public List<int[]> compensateForEdit(int start, int change,
-          ColumnSelection sel)
+  @Override
+  public boolean equals(Object obj)
   {
-    List<int[]> deletedHiddenColumns = null;
-
-    if (hiddenColumns != null)
+    try
     {
-      deletedHiddenColumns = new ArrayList<int[]>();
-      int hSize = hiddenColumns.size();
-      for (int i = 0; i < hSize; i++)
+      LOCK.readLock().lock();
+
+      if (!(obj instanceof HiddenColumns))
       {
-        int[] region = hiddenColumns.elementAt(i);
-        if (region[0] > start && start + change > region[1])
-        {
-          deletedHiddenColumns.add(region);
+        return false;
+      }
+      HiddenColumns that = (HiddenColumns) obj;
 
-          hiddenColumns.removeElementAt(i);
-          i--;
-          hSize--;
-          continue;
-        }
+      /*
+       * check hidden columns are either both null, or match
+       */
 
-        if (region[0] > start)
-        {
-          region[0] -= change;
-          region[1] -= change;
-        }
+      if (that.hiddenColumns.size() != this.hiddenColumns.size())
+      {
+        return false;
+      }
 
-        if (region[0] < 0)
+      Iterator<int[]> it = this.iterator();
+      Iterator<int[]> thatit = that.iterator();
+      while (it.hasNext())
+      {
+        if (!(Arrays.equals(it.next(), thatit.next())))
         {
-          region[0] = 0;
+          return false;
         }
-
       }
+      return true;
 
-      this.revealHiddenColumns(0, sel);
+    } finally
+    {
+      LOCK.readLock().unlock();
     }
-
-    return deletedHiddenColumns;
   }
 
   /**
-   * propagate shift in alignment columns to column selection special version of
-   * compensateForEdit - allowing for edits within hidden regions
+   * Return absolute column index for a visible column index
    * 
-   * @param start
-   *          beginning of edit
-   * @param left
-   *          shift in edit (+ve for removal, or -ve for inserts)
+   * @param column
+   *          int column index in alignment view (count from zero)
+   * @return alignment column index for column
    */
-  public void compensateForDelEdits(int start, int change)
+  public int visibleToAbsoluteColumn(int column)
   {
-    if (hiddenColumns != null)
+    try
     {
-      for (int i = 0; i < hiddenColumns.size(); i++)
-      {
-        int[] region = hiddenColumns.elementAt(i);
-        if (region[0] >= start)
-        {
-          region[0] -= change;
-        }
-        if (region[1] >= start)
-        {
-          region[1] -= change;
-        }
-        if (region[1] < region[0])
-        {
-          hiddenColumns.removeElementAt(i--);
-        }
+      LOCK.readLock().lock();
+      int result = column;
 
-        if (region[0] < 0)
-        {
-          region[0] = 0;
-        }
-        if (region[1] < 0)
-        {
-          region[1] = 0;
-        }
+      if (!hiddenColumns.isEmpty())
+      {
+        result += cursor.findRegionForColumn(column, true)
+                .getHiddenSoFar();
       }
+
+      return result;
+    } finally
+    {
+      LOCK.readLock().unlock();
     }
   }
 
   /**
-   * return all visible segments between the given start and end boundaries
+   * Use this method to find out where a column will appear in the visible
+   * alignment when hidden columns exist. If the column is not visible, then the
+   * index of the next visible column on the left will be returned (or 0 if
+   * there is no visible column on the left)
    * 
-   * @param start
-   *          (first column inclusive from 0)
-   * @param end
-   *          (last column - not inclusive)
-   * @return int[] {i_start, i_end, ..} where intervals lie in
-   *         start<=i_start<=i_end<end
+   * @param hiddenColumn
+   *          the column index in the full alignment including hidden columns
+   * @return the position of the column in the visible alignment
    */
-  public int[] getVisibleContigs(int start, int end)
+  public int absoluteToVisibleColumn(int hiddenColumn)
   {
-    if (hiddenColumns != null && hiddenColumns.size() > 0)
+    try
     {
-      List<int[]> visiblecontigs = new ArrayList<int[]>();
-      List<int[]> regions = getHiddenRegions();
-
-      int vstart = start;
-      int[] region;
-      int hideStart, hideEnd;
+      LOCK.readLock().lock();
+      int result = hiddenColumn;
 
-      for (int j = 0; vstart < end && j < regions.size(); j++)
+      if (!hiddenColumns.isEmpty())
       {
-        region = regions.get(j);
-        hideStart = region[0];
-        hideEnd = region[1];
-
-        if (hideEnd < vstart)
+        HiddenCursorPosition cursorPos = cursor
+                .findRegionForColumn(hiddenColumn, false);
+        int index = cursorPos.getRegionIndex();
+        int hiddenBeforeCol = cursorPos.getHiddenSoFar();
+    
+        // just subtract hidden cols count - this works fine if column is
+        // visible
+        result = hiddenColumn - hiddenBeforeCol;
+    
+        // now check in case column is hidden - it will be in the returned
+        // hidden region
+        if (index < hiddenColumns.size())
         {
-          continue;
-        }
-        if (hideStart > vstart)
-        {
-          visiblecontigs.add(new int[] { vstart, hideStart - 1 });
+          int[] region = hiddenColumns.get(index);
+          if (hiddenColumn >= region[0] && hiddenColumn <= region[1])
+          {
+            // actually col is hidden, return region[0]-1
+            // unless region[0]==0 in which case return 0
+            if (region[0] == 0)
+            {
+              result = 0;
+            }
+            else
+            {
+              result = region[0] - 1 - hiddenBeforeCol;
+            }
+          }
         }
-        vstart = hideEnd + 1;
       }
 
-      if (vstart < end)
-      {
-        visiblecontigs.add(new int[] { vstart, end - 1 });
-      }
-      int[] vcontigs = new int[visiblecontigs.size() * 2];
-      for (int i = 0, j = visiblecontigs.size(); i < j; i++)
-      {
-        int[] vc = visiblecontigs.get(i);
-        visiblecontigs.set(i, null);
-        vcontigs[i * 2] = vc[0];
-        vcontigs[i * 2 + 1] = vc[1];
-      }
-      visiblecontigs.clear();
-      return vcontigs;
-    }
-    else
+      return result; // return the shifted position after removing hidden
+                     // columns.
+    } finally
     {
-      return new int[] { start, end - 1 };
+      LOCK.readLock().unlock();
     }
   }
 
-  public String[] getVisibleSequenceStrings(int start, int end,
-          SequenceI[] seqs)
+  /**
+   * Find the visible column which is a given visible number of columns to the
+   * left (negative visibleDistance) or right (positive visibleDistance) of
+   * startColumn. If startColumn is not visible, we use the visible column at
+   * the left boundary of the hidden region containing startColumn.
+   * 
+   * @param visibleDistance
+   *          the number of visible columns to offset by (left offset = negative
+   *          value; right offset = positive value)
+   * @param startColumn
+   *          the position of the column to start from (absolute position)
+   * @return the position of the column which is <visibleDistance> away
+   *         (absolute position)
+   */
+  public int offsetByVisibleColumns(int visibleDistance, int startColumn)
   {
-    int i, iSize = seqs.length;
-    String selections[] = new String[iSize];
-    if (hiddenColumns != null && hiddenColumns.size() > 0)
+    try
     {
-      for (i = 0; i < iSize; i++)
-      {
-        StringBuffer visibleSeq = new StringBuffer();
-        List<int[]> regions = getHiddenRegions();
-
-        int blockStart = start, blockEnd = end;
-        int[] region;
-        int hideStart, hideEnd;
-
-        for (int j = 0; j < regions.size(); j++)
-        {
-          region = regions.get(j);
-          hideStart = region[0];
-          hideEnd = region[1];
-
-          if (hideStart < start)
-          {
-            continue;
-          }
-
-          blockStart = Math.min(blockStart, hideEnd + 1);
-          blockEnd = Math.min(blockEnd, hideStart);
-
-          if (blockStart > blockEnd)
-          {
-            break;
-          }
-
-          visibleSeq.append(seqs[i].getSequence(blockStart, blockEnd));
-
-          blockStart = hideEnd + 1;
-          blockEnd = end;
-        }
-
-        if (end > blockStart)
-        {
-          visibleSeq.append(seqs[i].getSequence(blockStart, end));
-        }
+      LOCK.readLock().lock();
+      int start = absoluteToVisibleColumn(startColumn);
+      return visibleToAbsoluteColumn(start + visibleDistance);
 
-        selections[i] = visibleSeq.toString();
-      }
-    }
-    else
+    } finally
     {
-      for (i = 0; i < iSize; i++)
-      {
-        selections[i] = seqs[i].getSequenceAsString(start, end);
-      }
+      LOCK.readLock().unlock();
     }
-
-    return selections;
   }
 
   /**
-   * Locate the first and last position visible for this sequence. if seq isn't
-   * visible then return the position of the left and right of the hidden
-   * boundary region, and the corresponding alignment column indices for the
-   * extent of the sequence
+   * This method returns the rightmost limit of a region of an alignment with
+   * hidden columns. In otherwords, the next hidden column.
    * 
-   * @param seq
-   * @return int[] { visible start, visible end, first seqpos, last seqpos,
-   *         alignment index for seq start, alignment index for seq end }
+   * @param alPos
+   *          the absolute (visible) alignmentPosition to find the next hidden
+   *          column for
+   * @return the index of the next hidden column, or alPos if there is no next
+   *         hidden column
    */
-  public int[] locateVisibleBoundsOfSequence(SequenceI seq)
+  public int getNextHiddenBoundary(boolean left, int alPos)
   {
-    int fpos = seq.getStart(), lpos = seq.getEnd();
-    int start = 0;
-
-    if (hiddenColumns == null || hiddenColumns.size() == 0)
-    {
-      int ifpos = seq.findIndex(fpos) - 1, ilpos = seq.findIndex(lpos) - 1;
-      return new int[] { ifpos, ilpos, fpos, lpos, ifpos, ilpos };
-    }
-
-    // Simply walk along the sequence whilst watching for hidden column
-    // boundaries
-    List<int[]> regions = getHiddenRegions();
-    int spos = fpos, lastvispos = -1, rcount = 0, hideStart = seq
-            .getLength(), hideEnd = -1;
-    int visPrev = 0, visNext = 0, firstP = -1, lastP = -1;
-    boolean foundStart = false;
-    for (int p = 0, pLen = seq.getLength(); spos <= seq.getEnd()
-            && p < pLen; p++)
+    try
     {
-      if (!Comparison.isGap(seq.getCharAt(p)))
+      LOCK.readLock().lock();
+      if (!hiddenColumns.isEmpty())
       {
-        // keep track of first/last column
-        // containing sequence data regardless of visibility
-        if (firstP == -1)
-        {
-          firstP = p;
-        }
-        lastP = p;
-        // update hidden region start/end
-        while (hideEnd < p && rcount < regions.size())
-        {
-          int[] region = regions.get(rcount++);
-          visPrev = visNext;
-          visNext += region[0] - visPrev;
-          hideStart = region[0];
-          hideEnd = region[1];
-        }
-        if (hideEnd < p)
+        int index = cursor.findRegionForColumn(alPos, false)
+                .getRegionIndex();
+
+        if (left && index > 0)
         {
-          hideStart = seq.getLength();
+          int[] region = hiddenColumns.get(index - 1);
+          return region[1];
         }
-        // update visible boundary for sequence
-        if (p < hideStart)
+        else if (!left && index < hiddenColumns.size())
         {
-          if (!foundStart)
+          int[] region = hiddenColumns.get(index);
+          if (alPos < region[0])
+          {
+            return region[0];
+          }
+          else if ((alPos <= region[1])
+                  && (index + 1 < hiddenColumns.size()))
           {
-            fpos = spos;
-            start = p;
-            foundStart = true;
+            // alPos is within a hidden region, return the next one
+            // if there is one
+            region = hiddenColumns.get(index + 1);
+            return region[0];
           }
-          lastvispos = p;
-          lpos = spos;
         }
-        // look for next sequence position
-        spos++;
       }
-    }
-    if (foundStart)
+      return alPos;
+    } finally
     {
-      return new int[] { findColumnPosition(start),
-          findColumnPosition(lastvispos), fpos, lpos, firstP, lastP };
+      LOCK.readLock().unlock();
     }
-    // otherwise, sequence was completely hidden
-    return new int[] { visPrev, visNext, 0, 0, firstP, lastP };
   }
 
   /**
-   * delete any columns in alignmentAnnotation that are hidden (including
-   * sequence associated annotation).
+   * Answers if a column in the alignment is visible
    * 
-   * @param alignmentAnnotation
-   */
-  public void makeVisibleAnnotation(AlignmentAnnotation alignmentAnnotation)
-  {
-    makeVisibleAnnotation(-1, -1, alignmentAnnotation);
-  }
-
-  /**
-   * delete any columns in alignmentAnnotation that are hidden (including
-   * sequence associated annotation).
-   * 
-   * @param start
-   *          remove any annotation to the right of this column
-   * @param end
-   *          remove any annotation to the left of this column
-   * @param alignmentAnnotation
-   *          the annotation to operate on
+   * @param column
+   *          absolute position of column in the alignment
+   * @return true if column is visible
    */
-  public void makeVisibleAnnotation(int start, int end,
-          AlignmentAnnotation alignmentAnnotation)
+  public boolean isVisible(int column)
   {
-    if (alignmentAnnotation.annotations == null)
-    {
-      return;
-    }
-    if (start == end && end == -1)
-    {
-      start = 0;
-      end = alignmentAnnotation.annotations.length;
-    }
-    if (hiddenColumns != null && hiddenColumns.size() > 0)
+    try
     {
-      // then mangle the alignmentAnnotation annotation array
-      Vector<Annotation[]> annels = new Vector<Annotation[]>();
-      Annotation[] els = null;
-      List<int[]> regions = getHiddenRegions();
-      int blockStart = start, blockEnd = end;
-      int[] region;
-      int hideStart, hideEnd, w = 0;
-
-      for (int j = 0; j < regions.size(); j++)
-      {
-        region = regions.get(j);
-        hideStart = region[0];
-        hideEnd = region[1];
-
-        if (hideStart < start)
-        {
-          continue;
-        }
-
-        blockStart = Math.min(blockStart, hideEnd + 1);
-        blockEnd = Math.min(blockEnd, hideStart);
-
-        if (blockStart > blockEnd)
-        {
-          break;
-        }
-
-        annels.addElement(els = new Annotation[blockEnd - blockStart]);
-        System.arraycopy(alignmentAnnotation.annotations, blockStart, els,
-                0, els.length);
-        w += els.length;
-        blockStart = hideEnd + 1;
-        blockEnd = end;
-      }
+      LOCK.readLock().lock();
 
-      if (end > blockStart)
+      int regionindex = cursor.findRegionForColumn(column, false)
+              .getRegionIndex();
+      if (regionindex > -1 && regionindex < hiddenColumns.size())
       {
-        annels.addElement(els = new Annotation[end - blockStart + 1]);
-        if ((els.length + blockStart) <= alignmentAnnotation.annotations.length)
+        int[] region = hiddenColumns.get(regionindex);
+        // already know that column <= region[1] as cursor returns containing
+        // region or region to right
+        if (column >= region[0])
         {
-          // copy just the visible segment of the annotation row
-          System.arraycopy(alignmentAnnotation.annotations, blockStart,
-                  els, 0, els.length);
-        }
-        else
-        {
-          // copy to the end of the annotation row
-          System.arraycopy(alignmentAnnotation.annotations, blockStart,
-                  els, 0,
-                  (alignmentAnnotation.annotations.length - blockStart));
+          return false;
         }
-        w += els.length;
-      }
-      if (w == 0)
-      {
-        return;
       }
+      return true;
 
-      alignmentAnnotation.annotations = new Annotation[w];
-      w = 0;
-
-      for (Annotation[] chnk : annels)
-      {
-        System.arraycopy(chnk, 0, alignmentAnnotation.annotations, w,
-                chnk.length);
-        w += chnk.length;
-      }
-    }
-    else
+    } finally
     {
-      alignmentAnnotation.restrict(start, end);
+      LOCK.readLock().unlock();
     }
   }
 
@@ -865,400 +708,401 @@ public class HiddenColumns
    */
   public boolean hasHiddenColumns()
   {
-    return hiddenColumns != null && hiddenColumns.size() > 0;
+    try
+    {
+      LOCK.readLock().lock();
+
+      // we don't use getSize()>0 here because it has to iterate over
+      // the full hiddenColumns collection and so will be much slower
+      return (!hiddenColumns.isEmpty());
+    } finally
+    {
+      LOCK.readLock().unlock();
+    }
   }
 
   /**
    * 
-   * @return true if there are more than one set of columns hidden
+   * @return true if there is more than one hidden column region
    */
-  public boolean hasManyHiddenColumns()
+  public boolean hasMultiHiddenColumnRegions()
   {
-    return hiddenColumns != null && hiddenColumns.size() > 1;
+    try
+    {
+      LOCK.readLock().lock();
+      return !hiddenColumns.isEmpty() && hiddenColumns.size() > 1;
+    } finally
+    {
+      LOCK.readLock().unlock();
+    }
   }
 
+
   /**
-   * mark the columns corresponding to gap characters as hidden in the column
-   * selection
-   * 
-   * @param sr
+   * Returns a hashCode built from hidden column ranges
    */
-  public void hideInsertionsFor(SequenceI sr)
+  @Override
+  public int hashCode()
   {
-    List<int[]> inserts = sr.getInsertions();
-    for (int[] r : inserts)
+    try
     {
-      hideColumns(r[0], r[1]);
+      LOCK.readLock().lock();
+      int hashCode = 1;
+
+      for (int[] hidden : hiddenColumns)
+      {
+        hashCode = HASH_MULTIPLIER * hashCode + hidden[0];
+        hashCode = HASH_MULTIPLIER * hashCode + hidden[1];
+      }
+      return hashCode;
+    } finally
+    {
+      LOCK.readLock().unlock();
     }
   }
 
   /**
-   * Unhides, and adds to the selection list, all hidden columns
+   * Hide columns corresponding to the marked bits
+   * 
+   * @param inserts
+   *          - columns mapped to bits starting from zero
    */
-  public void revealAllHiddenColumns(ColumnSelection sel)
+  public void hideColumns(BitSet inserts)
   {
-    if (hiddenColumns != null)
+    try
     {
-      for (int i = 0; i < hiddenColumns.size(); i++)
+      LOCK.writeLock().lock();
+      for (int firstSet = inserts
+              .nextSetBit(0), lastSet = 0; firstSet >= 0; firstSet = inserts
+                      .nextSetBit(lastSet))
       {
-        int[] region = hiddenColumns.elementAt(i);
-        for (int j = region[0]; j < region[1] + 1; j++)
-        {
-          sel.addElement(j);
-        }
+        lastSet = inserts.nextClearBit(firstSet);
+        hideColumns(firstSet, lastSet - 1);
       }
+      cursor = new HiddenColumnsCursor(hiddenColumns);
+    } finally
+    {
+      LOCK.writeLock().unlock();
     }
-
-    hiddenColumns = null;
   }
 
   /**
-   * Reveals, and marks as selected, the hidden column range with the given
-   * start column
+   * Hide columns corresponding to the marked bits, within the range
+   * [start,end]. Entries in tohide which are outside [start,end] are ignored.
    * 
+   * @param tohide
+   *          columns mapped to bits starting from zero
    * @param start
+   *          start of range to hide columns within
+   * @param end
+   *          end of range to hide columns within
    */
-  public void revealHiddenColumns(int start, ColumnSelection sel)
+  public void hideColumns(BitSet tohide, int start, int end)
   {
-    for (int i = 0; i < hiddenColumns.size(); i++)
-    {
-      int[] region = hiddenColumns.elementAt(i);
-      if (start == region[0])
-      {
-        for (int j = region[0]; j < region[1] + 1; j++)
-        {
-          sel.addElement(j);
-        }
+    clearHiddenColumnsInRange(start, end);
 
-        hiddenColumns.removeElement(region);
-        break;
-      }
-    }
-    if (hiddenColumns.size() == 0)
+    // make sure only bits between start and end are set
+    if (!tohide.isEmpty())
     {
-      hiddenColumns = null;
+      tohide.clear(0, start);
+      tohide.clear(Math.min(end + 1, tohide.length() + 1),
+              tohide.length() + 1);
     }
+
+    hideColumns(tohide);
   }
 
   /**
-   * removes intersection of position,length ranges in deletions from the
-   * start,end regions marked in intervals.
+   * Make all columns in the range [start,end] visible
    * 
-   * @param shifts
-   * @param intervals
-   * @return
+   * @param start
+   *          start of range to show columns
+   * @param end
+   *          end of range to show columns
    */
-  private boolean pruneIntervalVector(final List<int[]> shifts,
-          Vector<int[]> intervals)
+  private void clearHiddenColumnsInRange(int start, int end)
   {
-    boolean pruned = false;
-    int i = 0, j = intervals.size() - 1, s = 0, t = shifts.size() - 1;
-    int hr[] = intervals.elementAt(i);
-    int sr[] = shifts.get(s);
-    while (i <= j && s <= t)
+    try
     {
-      boolean trailinghn = hr[1] >= sr[0];
-      if (!trailinghn)
+      LOCK.writeLock().lock();
+      
+      if (!hiddenColumns.isEmpty())
       {
-        if (i < j)
-        {
-          hr = intervals.elementAt(++i);
-        }
-        else
-        {
-          i++;
-        }
-        continue;
-      }
-      int endshift = sr[0] + sr[1]; // deletion ranges - -ve means an insert
-      if (endshift < hr[0] || endshift < sr[0])
-      { // leadinghc disjoint or not a deletion
-        if (s < t)
-        {
-          sr = shifts.get(++s);
-        }
-        else
-        {
-          s++;
-        }
-        continue;
-      }
-      boolean leadinghn = hr[0] >= sr[0];
-      boolean leadinghc = hr[0] < endshift;
-      boolean trailinghc = hr[1] < endshift;
-      if (leadinghn)
-      {
-        if (trailinghc)
-        { // deleted hidden region.
-          intervals.removeElementAt(i);
-          pruned = true;
-          j--;
-          if (i <= j)
-          {
-            hr = intervals.elementAt(i);
-          }
-          continue;
-        }
-        if (leadinghc)
-        {
-          hr[0] = endshift; // clip c terminal region
-          leadinghn = !leadinghn;
-          pruned = true;
-        }
-      }
-      if (!leadinghn)
-      {
-        if (trailinghc)
-        {
-          if (trailinghn)
-          {
-            hr[1] = sr[0] - 1;
-            pruned = true;
-          }
-        }
-        else
+        HiddenCursorPosition pos = cursor.findRegionForColumn(start, false);
+        int index = pos.getRegionIndex();
+
+        if (index != -1 && index != hiddenColumns.size())
         {
-          // sr contained in hr
-          if (s < t)
+          // regionIndex is the region which either contains start
+          // or lies to the right of start
+          int[] region = hiddenColumns.get(index);
+          if (region[0] < start && region[1] >= start)
           {
-            sr = shifts.get(++s);
+            // region contains start, truncate so that it ends just before start
+            numColumns -= region[1] - start + 1;
+            region[1] = start - 1;
+            index++;
           }
-          else
+
+          int endi = index;
+          while (endi < hiddenColumns.size())
           {
-            s++;
+            region = hiddenColumns.get(endi);
+
+            if (region[1] > end)
+            {
+              if (region[0] <= end)
+              {
+                // region contains end, truncate so it starts just after end
+                numColumns -= end - region[0] + 1;
+                region[0] = end + 1;
+              }
+              break;
+            }
+
+            numColumns -= region[1] - region[0] + 1;
+            endi++;
           }
-          continue;
+          hiddenColumns.subList(index, endi).clear();
+
         }
+
+        cursor = new HiddenColumnsCursor(hiddenColumns);
       }
+    } finally
+    {
+      LOCK.writeLock().unlock();
     }
-    return pruned; // true if any interval was removed or modified by
-    // operations.
   }
 
   /**
-   * remove any hiddenColumns or selected columns and shift remaining based on a
-   * series of position, range deletions.
    * 
-   * @param deletions
+   * @param updates
+   *          BitSet where hidden columns will be marked
    */
-  public void pruneDeletions(List<int[]> shifts)
+  protected void andNot(BitSet updates)
   {
-    // delete any intervals intersecting.
-    if (hiddenColumns != null)
+    try
     {
-      pruneIntervalVector(shifts, hiddenColumns);
-      if (hiddenColumns != null && hiddenColumns.size() == 0)
+      LOCK.writeLock().lock();
+
+      BitSet hiddenBitSet = new BitSet();
+      for (int[] range : hiddenColumns)
       {
-        hiddenColumns = null;
+        hiddenBitSet.set(range[0], range[1] + 1);
       }
+      hiddenBitSet.andNot(updates);
+      hiddenColumns.clear();
+      hideColumns(hiddenBitSet);
+    } finally
+    {
+      LOCK.writeLock().unlock();
     }
   }
 
   /**
-   * Add gaps into the sequences aligned to profileseq under the given
-   * AlignmentView
+   * Calculate the visible start and end index of an alignment.
    * 
-   * @param profileseq
-   * @param al
-   *          - alignment to have gaps inserted into it
-   * @param input
-   *          - alignment view where sequence corresponding to profileseq is
-   *          first entry
-   * @return new HiddenColumns for new alignment view, with insertions into
-   *         profileseq marked as hidden.
+   * @param width
+   *          full alignment width
+   * @return integer array where: int[0] = startIndex, and int[1] = endIndex
    */
-  public static HiddenColumns propagateInsertions(SequenceI profileseq,
-          AlignmentI al, AlignmentView input)
+  public int[] getVisibleStartAndEndIndex(int width)
   {
-    int profsqpos = 0;
-
-    char gc = al.getGapCharacter();
-    Object[] alandhidden = input.getAlignmentAndHiddenColumns(gc);
-    HiddenColumns nview = (HiddenColumns) alandhidden[1];
-    SequenceI origseq = ((SequenceI[]) alandhidden[0])[profsqpos];
-    nview.propagateInsertions(profileseq, al, origseq);
-    return nview;
+    try
+    {
+      LOCK.readLock().lock();
+
+      int firstVisible = 0;
+      int lastVisible = width - 1;
+
+      if (!hiddenColumns.isEmpty())
+      {
+        // first visible col with index 0, convert to absolute index
+        firstVisible = visibleToAbsoluteColumn(0);
+
+        // last visible column is either immediately to left of
+        // last hidden region, or is just the last column in the alignment
+        int[] lastregion = hiddenColumns.get(hiddenColumns.size() - 1);
+        if (lastregion[1] == width - 1)
+        {
+          // last region is at very end of alignment
+          // last visible column immediately precedes it
+          lastVisible = lastregion[0] - 1;
+        }
+      }
+      return new int[] { firstVisible, lastVisible };
+
+    } finally
+    {
+      LOCK.readLock().unlock();
+    }
   }
 
   /**
+   * Finds the hidden region (if any) which starts or ends at res
    * 
-   * @param profileseq
-   *          - sequence in al which corresponds to origseq
-   * @param al
-   *          - alignment which is to have gaps inserted into it
-   * @param origseq
-   *          - sequence corresponding to profileseq which defines gap map for
-   *          modifying al
+   * @param res
+   *          visible residue position, unadjusted for hidden columns
+   * @return region as [start,end] or null if no matching region is found. If
+   *         res is adjacent to two regions, returns the left region.
    */
-  private void propagateInsertions(SequenceI profileseq, AlignmentI al,
-          SequenceI origseq)
+  public int[] getRegionWithEdgeAtRes(int res)
   {
-    char gc = al.getGapCharacter();
-    // recover mapping between sequence's non-gap positions and positions
-    // mapping to view.
-    pruneDeletions(ShiftList.parseMap(origseq.gapMap()));
-    int[] viscontigs = al.getHiddenColumns().getVisibleContigs(0,
-            profileseq.getLength());
-    int spos = 0;
-    int offset = 0;
-
-    // add profile to visible contigs
-    for (int v = 0; v < viscontigs.length; v += 2)
+    try
     {
-      if (viscontigs[v] > spos)
+      LOCK.readLock().lock();
+      int adjres = visibleToAbsoluteColumn(res);
+
+      int[] reveal = null;
+
+      if (!hiddenColumns.isEmpty())
       {
-        StringBuffer sb = new StringBuffer();
-        for (int s = 0, ns = viscontigs[v] - spos; s < ns; s++)
+        // look for a region ending just before adjres
+        int regionindex = cursor.findRegionForColumn(adjres - 1, false)
+                .getRegionIndex();
+        if (regionindex < hiddenColumns.size()
+                && hiddenColumns.get(regionindex)[1] == adjres - 1)
         {
-          sb.append(gc);
+          reveal = hiddenColumns.get(regionindex);
         }
-        for (int s = 0, ns = al.getHeight(); s < ns; s++)
+        // check if the region ends just after adjres
+        else if (regionindex < hiddenColumns.size()
+                && hiddenColumns.get(regionindex)[0] == adjres + 1)
         {
-          SequenceI sqobj = al.getSequenceAt(s);
-          if (sqobj != profileseq)
-          {
-            String sq = al.getSequenceAt(s).getSequenceAsString();
-            if (sq.length() <= spos + offset)
-            {
-              // pad sequence
-              int diff = spos + offset - sq.length() - 1;
-              if (diff > 0)
-              {
-                // pad gaps
-                sq = sq + sb;
-                while ((diff = spos + offset - sq.length() - 1) > 0)
-                {
-                  // sq = sq
-                  // + ((diff >= sb.length()) ? sb.toString() : sb
-                  // .substring(0, diff));
-                  if (diff >= sb.length())
-                  {
-                    sq += sb.toString();
-                  }
-                  else
-                  {
-                    char[] buf = new char[diff];
-                    sb.getChars(0, diff, buf, 0);
-                    sq += buf.toString();
-                  }
-                }
-              }
-              sq += sb.toString();
-            }
-            else
-            {
-              al.getSequenceAt(s).setSequence(
-                      sq.substring(0, spos + offset) + sb.toString()
-                              + sq.substring(spos + offset));
-            }
-          }
+          reveal = hiddenColumns.get(regionindex);
         }
-        // offset+=sb.length();
       }
-      spos = viscontigs[v + 1] + 1;
+      return reveal;
+
+    } finally
+    {
+      LOCK.readLock().unlock();
     }
-    if ((offset + spos) < profileseq.getLength())
+  }
+
+  /**
+   * Return an iterator over the hidden regions
+   */
+  public Iterator<int[]> iterator()
+  {
+    try
     {
-      // pad the final region with gaps.
-      StringBuffer sb = new StringBuffer();
-      for (int s = 0, ns = profileseq.getLength() - spos - offset; s < ns; s++)
-      {
-        sb.append(gc);
-      }
-      for (int s = 0, ns = al.getHeight(); s < ns; s++)
-      {
-        SequenceI sqobj = al.getSequenceAt(s);
-        if (sqobj == profileseq)
-        {
-          continue;
-        }
-        String sq = sqobj.getSequenceAsString();
-        // pad sequence
-        int diff = origseq.getLength() - sq.length();
-        while (diff > 0)
-        {
-          // sq = sq
-          // + ((diff >= sb.length()) ? sb.toString() : sb
-          // .substring(0, diff));
-          if (diff >= sb.length())
-          {
-            sq += sb.toString();
-          }
-          else
-          {
-            char[] buf = new char[diff];
-            sb.getChars(0, diff, buf, 0);
-            sq += buf.toString();
-          }
-          diff = origseq.getLength() - sq.length();
-        }
-      }
+      LOCK.readLock().lock();
+      return new HiddenColsIterator(hiddenColumns);
+    } finally
+    {
+      LOCK.readLock().unlock();
     }
   }
 
   /**
-   * remove any hiddenColumns or selected columns and shift remaining based on a
-   * series of position, range deletions.
+   * Return a bounded iterator over the hidden regions
    * 
-   * @param deletions
+   * @param start
+   *          position to start from (inclusive, absolute column position)
+   * @param end
+   *          position to end at (inclusive, absolute column position)
+   * @return
    */
-  private void pruneDeletions(ShiftList deletions)
+  public Iterator<int[]> getBoundedIterator(int start, int end)
   {
-    if (deletions != null)
+    try
     {
-      final List<int[]> shifts = deletions.getShifts();
-      if (shifts != null && shifts.size() > 0)
-      {
-        pruneDeletions(shifts);
-
-        // and shift the rest.
-        this.compensateForEdits(deletions);
-      }
+      LOCK.readLock().lock();
+      return new HiddenColsIterator(start, end, hiddenColumns);
+    } finally
+    {
+      LOCK.readLock().unlock();
     }
   }
 
   /**
-   * Adjust hidden column boundaries based on a series of column additions or
-   * deletions in visible regions.
+   * Return a bounded iterator over the *visible* start positions of hidden
+   * regions
    * 
-   * @param shiftrecord
-   * @return
+   * @param start
+   *          position to start from (inclusive, visible column position)
+   * @param end
+   *          position to end at (inclusive, visible column position)
    */
-  private ShiftList compensateForEdits(ShiftList shiftrecord)
+  public Iterator<Integer> getBoundedStartIterator(int start, int end)
   {
-    if (shiftrecord != null)
+    try
     {
-      final List<int[]> shifts = shiftrecord.getShifts();
-      if (shifts != null && shifts.size() > 0)
-      {
-        int shifted = 0;
-        for (int i = 0, j = shifts.size(); i < j; i++)
-        {
-          int[] sh = shifts.get(i);
-          compensateForDelEdits(shifted + sh[0], sh[1]);
-          shifted -= sh[1];
-        }
-      }
-      return shiftrecord.getInverse();
+      LOCK.readLock().lock();
+
+      // get absolute position of column in alignment
+      int absoluteStart = visibleToAbsoluteColumn(start);
+
+      // Get cursor position and supply it to the iterator:
+      // Since we want visible region start, we look for a cursor for the
+      // (absoluteStart-1), then if absoluteStart is the start of a visible
+      // region we'll get the cursor pointing to the region before, which is
+      // what we want
+      HiddenCursorPosition pos = cursor
+              .findRegionForColumn(absoluteStart - 1, false);
+
+      return new BoundedStartRegionIterator(pos, start, end,
+              hiddenColumns);
+    } finally
+    {
+      LOCK.readLock().unlock();
     }
-    return null;
   }
 
   /**
-   * Returns a hashCode built from hidden column ranges
+   * Return an iterator over visible *columns* (not regions) between the given
+   * start and end boundaries
+   * 
+   * @param start
+   *          first column (inclusive)
+   * @param end
+   *          last column (inclusive)
    */
-  public int hashCode(int hc)
+  public Iterator<Integer> getVisibleColsIterator(int start, int end)
   {
-    int hashCode = hc;
-    if (hiddenColumns != null)
+    try
     {
-      for (int[] hidden : hiddenColumns)
-      {
-        hashCode = 31 * hashCode + hidden[0];
-        hashCode = 31 * hashCode + hidden[1];
-      }
+      LOCK.readLock().lock();
+      return new VisibleColsIterator(start, end, hiddenColumns);
+    } finally
+    {
+      LOCK.readLock().unlock();
     }
-    return hashCode;
   }
 
+  /**
+   * return an iterator over visible segments between the given start and end
+   * boundaries
+   * 
+   * @param start
+   *          first column, inclusive from 0
+   * @param end
+   *          last column - not inclusive
+   * @param useVisibleCoords
+   *          if true, start and end are visible column positions, not absolute
+   *          positions*
+   */
+  public VisibleContigsIterator getVisContigsIterator(int start,
+          int end,
+          boolean useVisibleCoords)
+  {
+    int adjstart = start;
+    int adjend = end;
+    if (useVisibleCoords)
+    {
+      adjstart = visibleToAbsoluteColumn(start);
+      adjend = visibleToAbsoluteColumn(end);
+    }
+
+    try
+    {
+      LOCK.readLock().lock();
+      return new VisibleContigsIterator(adjstart, adjend, hiddenColumns);
+    } finally
+    {
+      LOCK.readLock().unlock();
+    }
+  }
 }