X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fjalview%2Fdatamodel%2FColumnSelection.java;h=4d69fa4ef3ea1355c83ca89ffe2454d9c4ed20d2;hb=536a4a9c407a4c07b71e86e75135eaa2ba5e8850;hp=3421c410a96265382df8afd323a665935c3d75f5;hpb=5c26e2d28ac9f6f0b2d95ecf271ed46fbb29fa4a;p=jalview.git diff --git a/src/jalview/datamodel/ColumnSelection.java b/src/jalview/datamodel/ColumnSelection.java index 3421c41..4d69fa4 100644 --- a/src/jalview/datamodel/ColumnSelection.java +++ b/src/jalview/datamodel/ColumnSelection.java @@ -1,464 +1,1047 @@ /* - * Jalview - A Sequence Alignment Editor and Viewer - * Copyright (C) 2005 AM Waterhouse, J Procter, G Barton, M Clamp, S Searle - * - * This program 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 2 + * 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. - * - * This program 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. - * + * + * 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 this program; if not, write to the Free Software - * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA + * along with Jalview. If not, see . + * The Jalview Authors are detailed in the 'AUTHORS' file. */ package jalview.datamodel; -import java.util.*; +import jalview.util.ShiftList; +import jalview.viewmodel.annotationfilter.AnnotationFilterParameter; +import jalview.viewmodel.annotationfilter.AnnotationFilterParameter.SearchableAnnotationField; + +import java.util.ArrayList; +import java.util.BitSet; +import java.util.Collections; +import java.util.List; /** - * NOTE: Columns are zero based. + * Data class holding the selected columns and hidden column ranges for a view. + * Ranges are base 1. */ public class ColumnSelection { - Vector selected = new Vector(); + /** + * A class to hold an efficient representation of selected columns + */ + private class IntList + { + /* + * list of selected columns (ordered by selection order, not column order) + */ + private List order; - //Vector of int [] {startCol, endCol} - Vector hiddenColumns; + /* + * an unmodifiable view of the selected columns list + */ + private List _uorder; /** - * Add a column to the selection - * - * @param col index of column + * bitfield for column selection - allows quick lookup */ - public void addElement(int col) - { - Integer column = new Integer(col); - if (!selected.contains(column)) - { - selected.addElement(column); - } - } + private BitSet selected; /** - * clears column selection + * Constructor */ - public void clear() + IntList() { - selected.removeAllElements(); + order = new ArrayList(); + _uorder = Collections.unmodifiableList(order); + selected = new BitSet(); } /** - * removes col from selection - * - * @param col index of column to be removed + * Copy constructor + * + * @param other */ - public void removeElement(int col) + IntList(IntList other) { - Integer colInt = new Integer(col); - - if (selected.contains(colInt)) + this(); + if (other != null) + { + int j = other.size(); + for (int i = 0; i < j; i++) { - selected.removeElement(colInt); + add(other.elementAt(i)); } + } } /** - * removes a range of columns from the selection - * @param start int - first column in range to be removed - * @param end int - last col + * adds a new column i to the selection - only if i is not already selected + * + * @param i */ - public void removeElements(int start, int end) + void add(int i) { - Integer colInt; - for(int i=start; i getList() { - return selected.size(); + return _uorder; + } + + int size() + { + return order.size(); } /** - * DOCUMENT ME! - * - * @return DOCUMENT ME! + * gets the column that was selected first, second or i'th + * + * @param i + * @return */ - public int getMax() + int elementAt(int i) { - int max = -1; + return order.get(i); + } - for (int i = 0; i < selected.size(); i++) + protected boolean pruneColumnList(final List shifts) + { + int s = 0, t = shifts.size(); + int[] sr = shifts.get(s++); + boolean pruned = false; + int i = 0, j = order.size(); + while (i < j && s <= t) + { + int c = order.get(i++).intValue(); + if (sr[0] <= c) { - if (columnAt(i) > max) + if (sr[1] + sr[0] >= c) + { // sr[1] -ve means inseriton. + order.remove(--i); + selected.clear(c); + j--; + } + else + { + if (s < t) { - max = columnAt(i); + sr = shifts.get(s); } + s++; + } } - - return max; + } + return pruned; } /** - * DOCUMENT ME! - * - * @return DOCUMENT ME! + * shift every selected column at or above start by change + * + * @param start + * - leftmost column to be shifted + * @param change + * - delta for shift */ - public int getMin() + void compensateForEdits(int start, int change) { - int min = 1000000000; + BitSet mask = new BitSet(); + for (int i = 0; i < order.size(); i++) + { + int temp = order.get(i); - for (int i = 0; i < selected.size(); i++) + if (temp >= start) { - if (columnAt(i) < min) - { - min = columnAt(i); - } + // clear shifted bits and update List of selected columns + selected.clear(temp); + mask.set(temp - change); + order.set(i, new Integer(temp - change)); } + } + // lastly update the bitfield all at once + selected.or(mask); + } - return min; + boolean isSelected(int column) + { + return selected.get(column); + } + + int getMaxColumn() + { + return selected.length() - 1; } + int getMinColumn() + { + return selected.get(0) ? 0 : selected.nextSetBit(0); + } /** - * propagate shift in alignment columns to column selection - * - * @param start beginning of edit - * @param change shift in edit (-ve or +ve number of columns) + * @return a series of selection intervals along the range */ - public void compensateForEdit(int start, int change) + List getRanges() { - for (int i = 0; i < size(); i++) - { - int temp = columnAt(i); + List rlist = new ArrayList(); + if (selected.isEmpty()) + { + return rlist; + } + int next = selected.nextSetBit(0), clear = -1; + while (next != -1) + { + clear = selected.nextClearBit(next); + rlist.add(new int[] { next, clear - 1 }); + next = selected.nextSetBit(clear); + } + return rlist; + } - if (temp >= start) - { - selected.setElementAt(new Integer(temp - change), i); - } - } + @Override + public int hashCode() + { + // TODO Auto-generated method stub + return selected.hashCode(); + } - if(hiddenColumns!=null) - { - for(int i=0; i start) - { - region[0] -= change; - region[1] -= change; - } - if(region[0]<0) - region[0] = 0; - if(region[1] <0) - region[1] = 0; - } - } + @Override + public boolean equals(Object obj) + { + if (obj instanceof IntList) + { + return ((IntList) obj).selected.equals(selected); + } + return false; } + } - /** - * This Method is used to return all the HiddenColumn regions - * less than the given index. - * @param end int - * @return Vector - */ - public Vector getHiddenColumns() + IntList selection = new IntList(); + + HiddenColumns hiddenColumns = new HiddenColumns(); + + /** + * Add a column to the selection + * + * @param col + * index of column + */ + public void addElement(int col) + { + selection.add(col); + } + + /** + * clears column selection + */ + public void clear() + { + selection.clear(); + } + + /** + * Removes value 'col' from the selection (not the col'th item) + * + * @param col + * index of column to be removed + */ + public void removeElement(int col) + { + selection.remove(col); + } + + /** + * removes a range of columns from the selection + * + * @param start + * int - first column in range to be removed + * @param end + * int - last col + */ + public void removeElements(int start, int end) + { + Integer colInt; + for (int i = start; i < end; i++) + { + colInt = new Integer(i); + if (selection.contains(colInt)) + { + selection.remove(colInt); + } + } + } + + /** + * Returns a read-only view of the (possibly empty) list of selected columns + *

+ * The list contains no duplicates but is not necessarily ordered. It also may + * include columns hidden from the current view. To modify (for example sort) + * the list, you should first make a copy. + *

+ * The list is not thread-safe: iterating over it could result in + * ConcurrentModificationException if it is modified by another thread. + */ + public List getSelected() + { + return selection.getList(); + } + + /** + * @return list of int arrays containing start and end column position for + * runs of selected columns ordered from right to left. + */ + public List getSelectedRanges() + { + return selection.getRanges(); + } + + /** + * + * @param col + * index to search for in column selection + * + * @return true if col is selected + */ + public boolean contains(int col) + { + return (col > -1) ? selection.isSelected(col) : false; + } + + /** + * Answers true if no columns are selected, else false + */ + public boolean isEmpty() + { + return selection == null || selection.isEmpty(); + } + + /** + * rightmost selected column + * + * @return rightmost column in alignment that is selected + */ + public int getMax() + { + if (selection.isEmpty()) { - return hiddenColumns; + return -1; } - /** - * Return absolute column index for a visible column index - * @param column int column index in alignment view - * @return alignment column index for column - */ - public int adjustForHiddenColumns(int column) + return selection.getMaxColumn(); + } + + /** + * Leftmost column in selection + * + * @return column index of leftmost column in selection + */ + public int getMin() + { + if (selection.isEmpty()) + { + return 1000000000; + } + return selection.getMinColumn(); + } + + /** + * 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 compensateForEdit(int start, int change) + { + selection.compensateForEdits(start, change); + return hiddenColumns.compensateForEdit(start, change, this); + } + */ + /** + * propagate shift in alignment columns to column selection special version of + * compensateForEdit - allowing for edits within hidden regions + * + * @param start + * beginning of edit + * @param left + * shift in edit (+ve for removal, or -ve for inserts) + */ + private void compensateForDelEdits(int start, int change) + { + selection.compensateForEdits(start, change); + hiddenColumns.compensateForDelEdits(start, change); + } + + /** + * Adjust hidden column boundaries based on a series of column additions or + * deletions in visible regions. + * + * @param shiftrecord + * @return + */ + private ShiftList compensateForEdits(ShiftList shiftrecord) + { + if (shiftrecord != null) { - int result = column; - if (hiddenColumns != null) + final List shifts = shiftrecord.getShifts(); + if (shifts != null && shifts.size() > 0) { - for (int i = 0; i < hiddenColumns.size(); i++) + int shifted = 0; + for (int i = 0, j = shifts.size(); i < j; i++) { - int[] region = (int[]) hiddenColumns.elementAt(i); - if (result >= region[0]) - { - result += region[1] - region[0] + 1; - } + int[] sh = shifts.get(i); + compensateForDelEdits(shifted + sh[0], sh[1]); + shifted -= sh[1]; } } - return result; + return shiftrecord.getInverse(); } + return null; + } - /** - * Use this method to find out where a visible column is in the alignment - * when hidden columns exist - * @param hiddenColumn int - * @return int - */ - public int findColumnPosition(int hiddenColumn) + + /** + * remove any hiddenColumns or selected columns and shift remaining based on a + * series of position, range deletions. + * + * @param deletions + */ + private void pruneDeletions(ShiftList deletions) + { + if (deletions != null) { - int result = hiddenColumn; - if (hiddenColumns != null) + final List shifts = deletions.getShifts(); + if (shifts != null && shifts.size() > 0) { - int index = 0; - int gaps = 0; - do + hiddenColumns.pruneDeletions(shifts); + + if (selection != null && selection.size() > 0) { - int[] region = (int[]) hiddenColumns.elementAt(index); - if (hiddenColumn > region[1]) + selection.pruneColumnList(shifts); + if (selection != null && selection.size() == 0) { - result -= region[1]+1-region[0]; + selection = null; } - index++; } - while (index < hiddenColumns.size()); - - result -= gaps; + // and shift the rest. + this.compensateForEdits(deletions); } - - return result; } + } - /** - * Use this method to determine where the next hiddenRegion starts - */ - public int findHiddenRegionPosition(int hiddenRegion) + + public void hideSelectedColumns(AlignmentI al) + { + synchronized (selection) { - int result = 0; - if (hiddenColumns != null) + for (int[] selregions : selection.getRanges()) { - int index = 0; - int gaps = 0; - do - { - int[] region = (int[]) hiddenColumns.elementAt(index); - if(hiddenRegion==0) - { - return region[0]; - } + al.getHiddenColumns().hideColumns(selregions[0], selregions[1]); + } + selection.clear(); + } - gaps += region[1] +1 - region[0]; - result = region[1] +1; - index++; - } - while(index < hiddenRegion+1); + } - result -= gaps; - } - return result; + /** + * Hides the specified column and any adjacent selected columns + * + * @param res + * int + */ + public void hideSelectedColumns(int col, HiddenColumns hidden) + { + /* + * deselect column (whether selected or not!) + */ + removeElement(col); + + /* + * find adjacent selected columns + */ + int min = col - 1, max = col + 1; + while (contains(min)) + { + removeElement(min); + min--; } - /** - * THis method returns the rightmost limit of a - * region of an alignment with hidden columns. - * In otherwords, the next hidden column. - * @param index int + while (contains(max)) + { + removeElement(max); + max++; + } + + /* + * min, max are now the closest unselected columns */ - public int getHiddenBoundaryRight(int alPos) + min++; + max--; + if (min > max) { - if (hiddenColumns != null) - { - int index = 0; - do - { - int[] region = (int[]) hiddenColumns.elementAt(index); - if(alPos < region[0]) - return region[0]; + min = max; + } + + hidden.hideColumns(min, max); + } + - index++; - } - while(index < hiddenColumns.size()); - } - return alPos; + + /** + * Copy constructor + * + * @param copy + */ + public ColumnSelection(ColumnSelection copy) + { + if (copy != null) + { + selection = new IntList(copy.selection); } - /** - * 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 getHiddenBoundaryLeft(int alPos) + } + + /** + * ColumnSelection + */ + public ColumnSelection() + { + } + + + + + + + /** + * Invert the column selection from first to end-1. leaves hiddenColumns + * untouched (and unselected) + * + * @param first + * @param end + */ + public void invertColumnSelection(int first, int width, AlignmentI al) + { + boolean hasHidden = al.getHiddenColumns().hasHidden(); + for (int i = first; i < width; i++) { - if (hiddenColumns != null) + if (contains(i)) { - int index = hiddenColumns.size()-1; - do + removeElement(i); + } + else + { + if (!hasHidden || al.getHiddenColumns().isVisible(i)) { - int[] region = (int[]) hiddenColumns.elementAt(index); - if(alPos > region[1]) - return region[1]; - - index--; + addElement(i); } - while(index >-1); } - - return alPos; - } + } - public void hideSelectedColumns() + /** + * add in any unselected columns from the given column selection, excluding + * any that are hidden. + * + * @param colsel + */ + public void addElementsFrom(ColumnSelection colsel) + { + if (colsel != null && !colsel.isEmpty()) { - while (size() > 0) + for (Integer col : colsel.getSelected()) { - int column = ( (Integer) getSelected().firstElement()).intValue(); - hideColumns(column); + if (hiddenColumns != null + && hiddenColumns.isVisible(col.intValue())) + { + selection.add(col); + } } - } + } - public void hideColumns(int start, int end) + /** + * set the selected columns the given column selection, excluding any columns + * that are hidden. + * + * @param colsel + */ + public void setElementsFrom(ColumnSelection colsel) + { + selection = new IntList(); + if (colsel.selection != null && colsel.selection.size() > 0) { - if(hiddenColumns==null) - hiddenColumns = new Vector(); + if (hiddenColumns.hasHidden()) + { + // only select visible columns in this columns selection + addElementsFrom(colsel); + } + else + { + // add everything regardless + for (Integer col : colsel.getSelected()) + { + addElement(col); + } + } + } + } - boolean added = false; - boolean overlap = false; + /** + * Add gaps into the sequences aligned to profileseq under the given + * AlignmentView + * + * @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 Column selection for new alignment view, with insertions into + * profileseq marked as hidden. + */ + public static ColumnSelection propagateInsertions(SequenceI profileseq, + AlignmentI al, AlignmentView input) + { + int profsqpos = 0; - for (int i = 0; i < hiddenColumns.size(); i++) + // return propagateInsertions(profileseq, al, ) + char gc = al.getGapCharacter(); + Object[] alandcolsel = input.getAlignmentAndHiddenColumns(gc); + ColumnSelection nview = (ColumnSelection) alandcolsel[1]; + SequenceI origseq = ((SequenceI[]) alandcolsel[0])[profsqpos]; + nview.propagateInsertions(profileseq, al, origseq); + return nview; + } + + /** + * + * @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 + */ + private void propagateInsertions(SequenceI profileseq, AlignmentI al, + SequenceI origseq) + { + char gc = al.getGapCharacter(); + // recover mapping between sequence's non-gap positions and positions + // mapping to view. + pruneDeletions(ShiftList.parseMap(origseq.gapMap())); + int[] viscontigs = hiddenColumns.getVisibleContigs(0, + profileseq.getLength()); + int spos = 0; + int offset = 0; + + // add profile to visible contigs + for (int v = 0; v < viscontigs.length; v += 2) + { + if (viscontigs[v] > spos) { - int[] region = (int[]) hiddenColumns.elementAt(i); - if ( start<=region[1] && end>=region[0]) + StringBuffer sb = new StringBuffer(); + for (int s = 0, ns = viscontigs[v] - spos; s < ns; s++) { - hiddenColumns.removeElementAt(i); - overlap = true; - break; + sb.append(gc); } - else if (end < region[0] && start < region[0]) + for (int s = 0, ns = al.getHeight(); s < ns; s++) { - hiddenColumns.insertElementAt(new int[] - {start, end}, i); - added = true; - break; + 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)); + } + } } + // offset+=sb.length(); } - - if(overlap) + spos = viscontigs[v + 1] + 1; + } + if ((offset + spos) < profileseq.getLength()) + { + // pad the final region with gaps. + StringBuffer sb = new StringBuffer(); + for (int s = 0, ns = profileseq.getLength() - spos - offset; s < ns; s++) { - hideColumns(start, end); + 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(); + } } - else if (!added) - hiddenColumns.addElement(new int[] {start, end}); - } + } - /** - * This method will find a range of selected columns - * around the column specified - * @param res int - */ - public void hideColumns(int col) - { - // First find out range of columns to hide - int min = col, max = col+1; - while( contains(min) ) - { removeElement(min); min --; } + /** + * + * @return true if there are columns marked + */ + public boolean hasSelectedColumns() + { + return (selection != null && selection.size() > 0); + } - while( contains(max) ) - { removeElement(max); max ++; } - min++; max--; - hideColumns(min, max); - } - - public void revealAllHiddenColumns() + public boolean filterAnnotations(Annotation[] annotations, + AnnotationFilterParameter filterParams) + { + // JBPNote - this method needs to be refactored to become independent of + // viewmodel package + hiddenColumns.revealAllHiddenColumns(this); + this.clear(); + int count = 0; + do { - if(hiddenColumns!=null) + if (annotations[count] != null) { - for (int i = 0; i < hiddenColumns.size(); i++) + + boolean itemMatched = false; + + if (filterParams.getThresholdType() == AnnotationFilterParameter.ThresholdType.ABOVE_THRESHOLD + && annotations[count].value >= filterParams + .getThresholdValue()) { - int[] region = (int[]) hiddenColumns.elementAt(i); - for (int j = region[0]; j < region[1]+1; j++) + itemMatched = true; + } + if (filterParams.getThresholdType() == AnnotationFilterParameter.ThresholdType.BELOW_THRESHOLD + && annotations[count].value <= filterParams + .getThresholdValue()) + { + itemMatched = true; + } + + if (filterParams.isFilterAlphaHelix() + && annotations[count].secondaryStructure == 'H') + { + itemMatched = true; + } + + if (filterParams.isFilterBetaSheet() + && annotations[count].secondaryStructure == 'E') + { + itemMatched = true; + } + + if (filterParams.isFilterTurn() + && annotations[count].secondaryStructure == 'S') + { + itemMatched = true; + } + + String regexSearchString = filterParams.getRegexString(); + if (regexSearchString != null + && !filterParams.getRegexSearchFields().isEmpty()) + { + List fields = filterParams + .getRegexSearchFields(); + try + { + if (fields.contains(SearchableAnnotationField.DISPLAY_STRING) + && annotations[count].displayCharacter + .matches(regexSearchString)) + { + itemMatched = true; + } + } catch (java.util.regex.PatternSyntaxException pse) + { + if (annotations[count].displayCharacter + .equals(regexSearchString)) + { + itemMatched = true; + } + } + if (fields.contains(SearchableAnnotationField.DESCRIPTION) + && annotations[count].description != null + && annotations[count].description + .matches(regexSearchString)) { - addElement(j); + itemMatched = true; } } + + if (itemMatched) + { + this.addElement(count); + } } + count++; + } while (count < annotations.length); + return false; + } + + /** + * Returns a hashCode built from selected columns and hidden column ranges + */ + @Override + public int hashCode() + { + int hashCode = selection.hashCode(); + return hiddenColumns.hashCode(hashCode); + } - hiddenColumns = null; + /** + * Answers true if comparing to a ColumnSelection with the same selected + * columns and hidden columns, else false + */ + @Override + public boolean equals(Object obj) + { + if (!(obj instanceof ColumnSelection)) + { + return false; + } + ColumnSelection that = (ColumnSelection) obj; + + /* + * check columns selected are either both null, or match + */ + if (this.selection == null) + { + if (that.selection != null) + { + return false; + } + } + if (!this.selection.equals(that.selection)) + { + return false; } - public void revealHiddenColumns(int res) + return this.hiddenColumns.equals(that.hiddenColumns); + } + + /** + * Updates the column selection depending on the parameters, and returns true + * if any change was made to the selection + * + * @param markedColumns + * a set identifying marked columns (base 0) + * @param startCol + * the first column of the range to operate over (base 0) + * @param endCol + * the last column of the range to operate over (base 0) + * @param invert + * if true, deselect marked columns and select unmarked + * @param extendCurrent + * if true, extend rather than replacing the current column selection + * @param toggle + * if true, toggle the selection state of marked columns + * + * @return + */ + public boolean markColumns(BitSet markedColumns, int startCol, + int endCol, boolean invert, boolean extendCurrent, boolean toggle) + { + boolean changed = false; + if (!extendCurrent && !toggle) + { + changed = !this.isEmpty(); + clear(); + } + if (invert) { - for(int i=0; i= startCol && i <= endCol) { - int [] region = (int[])hiddenColumns.elementAt(i); - if( res == region[0]) + if (ibs < 0 || i < ibs) { - for (int j = region[0]; j < region[1]+1; j++) + changed = true; + if (toggle && contains(i)) { - addElement(j); + removeElement(i++); } - - hiddenColumns.removeElement(region); - break; + else + { + addElement(i++); + } + } + else + { + i = markedColumns.nextClearBit(ibs); + ibs = markedColumns.nextSetBit(i); } } - if(hiddenColumns.size()==0) - hiddenColumns = null; } - - public boolean isVisible(int column) + else { - for(int i=0; i= startCol && i <= endCol) { - int [] region = (int[])hiddenColumns.elementAt(i); - if( column >= region[0] && column <= region[1]) + changed = true; + if (toggle && contains(i)) + { + removeElement(i); + } + else { - return false; + addElement(i); } + i = markedColumns.nextSetBit(i + 1); } - return true; } + return changed; + } + /** + * Adjusts column selections, and the given selection group, to match the + * range of a stretch (e.g. mouse drag) operation + *

+ * Method refactored from ScalePanel.mouseDragged + * + * @param res + * current column position, adjusted for hidden columns + * @param sg + * current selection group + * @param min + * start position of the stretch group + * @param max + * end position of the stretch group + */ + public void stretchGroup(int res, SequenceGroup sg, int min, int max) + { + if (!contains(res)) + { + addElement(res); + } + + if (res > sg.getStartRes()) + { + // expand selection group to the right + sg.setEndRes(res); + } + if (res < sg.getStartRes()) + { + // expand selection group to the left + sg.setStartRes(res); + } + + /* + * expand or shrink column selection to match the + * range of the drag operation + */ + for (int col = min; col <= max; col++) + { + if (col < sg.getStartRes() || col > sg.getEndRes()) + { + // shrinking drag - remove from selection + removeElement(col); + } + else + { + // expanding drag - add to selection + addElement(col); + } + } + } }