2 * Jalview - A Sequence Alignment Editor and Viewer (Version 2.5)
3 * Copyright (C) 2010 J Procter, AM Waterhouse, G Barton, M Clamp, S Searle
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 of the License, or (at your option) any later version.
11 * Jalview is distributed in the hope that it will be useful, but
12 * WITHOUT ANY WARRANTY; without even the implied warranty
13 * of MERCHANTABILITY or FITNESS FOR A PARTICULAR
14 * PURPOSE. See the GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License along with Jalview. If not, see <http://www.gnu.org/licenses/>.
18 package jalview.datamodel;
22 public class HiddenSequences
25 * holds a list of hidden sequences associated with an alignment.
27 public SequenceI[] hiddenSequences;
31 public HiddenSequences(AlignmentI al)
38 if (hiddenSequences == null)
43 for (int i = 0; i < hiddenSequences.length; i++)
45 if (hiddenSequences[i] != null)
57 for (int i = 0; i < hiddenSequences.length; i++)
59 if (hiddenSequences[i] != null
60 && hiddenSequences[i].getLength() > width)
62 width = hiddenSequences[i].getLength();
70 * Call this method if sequences are removed from the main alignment
72 public void adjustHeightSequenceDeleted(int seqIndex)
74 if (hiddenSequences == null)
79 int alHeight = alignment.getHeight();
81 SequenceI[] tmp = new SequenceI[alHeight + getSize()];
82 int deletionIndex = adjustForHiddenSeqs(seqIndex);
84 for (int i = 0; i < hiddenSequences.length; i++)
86 if (hiddenSequences[i] == null)
91 if (i > deletionIndex)
93 tmp[i - 1] = hiddenSequences[i];
97 tmp[i] = hiddenSequences[i];
101 hiddenSequences = tmp;
106 * Call this method if sequences are added to or removed from the main
109 public void adjustHeightSequenceAdded()
111 if (hiddenSequences == null)
116 int alHeight = alignment.getHeight();
118 SequenceI[] tmp = new SequenceI[alHeight + getSize()];
119 System.arraycopy(hiddenSequences, 0, tmp, 0, hiddenSequences.length);
120 hiddenSequences = tmp;
123 public void hideSequence(SequenceI sequence)
125 if (hiddenSequences == null)
127 hiddenSequences = new SequenceI[alignment.getHeight()];
130 int alignmentIndex = alignment.findIndex(sequence);
131 alignmentIndex = adjustForHiddenSeqs(alignmentIndex);
133 if (hiddenSequences[alignmentIndex] != null)
135 System.out.println("ERROR!!!!!!!!!!!");
138 hiddenSequences[alignmentIndex] = sequence;
140 alignment.deleteSequence(sequence);
143 public Vector showAll(Hashtable hiddenReps)
145 Vector revealedSeqs = new Vector();
146 for (int i = 0; i < hiddenSequences.length; i++)
148 if (hiddenSequences[i] != null)
150 Vector tmp = showSequence(i, hiddenReps);
151 for (int t = 0; t < tmp.size(); t++)
153 revealedSeqs.addElement(tmp.elementAt(t));
160 public Vector showSequence(int alignmentIndex, Hashtable hiddenReps)
162 Vector revealedSeqs = new Vector();
163 SequenceI repSequence = alignment.getSequenceAt(alignmentIndex);
164 if (repSequence != null && hiddenReps != null
165 && hiddenReps.containsKey(repSequence))
167 hiddenReps.remove(repSequence);
168 revealedSeqs.addElement(repSequence);
171 int start = adjustForHiddenSeqs(alignmentIndex - 1);
172 int end = adjustForHiddenSeqs(alignmentIndex);
173 if (end >= hiddenSequences.length)
175 end = hiddenSequences.length - 1;
178 for (int index = end; index > start; index--)
180 SequenceI seq = hiddenSequences[index];
181 hiddenSequences[index] = null;
185 if (seq.getLength() > 0)
187 revealedSeqs.addElement(seq);
188 alignment.getSequences().insertElementAt(seq, alignmentIndex);
192 System.out.println(seq.getName()
193 + " has been deleted whilst hidden");
202 public SequenceI getHiddenSequence(int alignmentIndex)
204 return hiddenSequences[alignmentIndex];
207 public int findIndexWithoutHiddenSeqs(int alignmentIndex)
211 if (hiddenSequences.length <= alignmentIndex)
213 alignmentIndex = hiddenSequences.length - 1;
216 while (index <= alignmentIndex)
218 if (hiddenSequences[index] != null)
226 return (alignmentIndex - hiddenSeqs);
229 public int adjustForHiddenSeqs(int alignmentIndex)
232 int hSize = hiddenSequences.length;
233 while (index <= alignmentIndex && index < hSize)
235 if (hiddenSequences[index] != null)
243 return alignmentIndex;
246 public AlignmentI getFullAlignment()
248 int isize = hiddenSequences.length;
249 SequenceI[] seq = new Sequence[isize];
252 for (int i = 0; i < hiddenSequences.length; i++)
254 if (hiddenSequences[i] != null)
256 seq[i] = hiddenSequences[i];
260 seq[i] = alignment.getSequenceAt(index);
265 return new Alignment(seq);
268 public boolean isHidden(SequenceI seq)
270 for (int i = 0; i < hiddenSequences.length; i++)
272 if (hiddenSequences[i] != null && hiddenSequences[i] == seq)