X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fjalview%2Fdatamodel%2FAlignment.java;h=afe70328877239ab9a727083384405a44644bb14;hb=73ffad785a317d4014bc448ea4d8a7303e8a4350;hp=61735eeb1d763b0b8c78d8a32efe9b6f8deebca9;hpb=8c6e707d6d9b1b8ad6385eb7eeef0bc78cb46f6e;p=jalview.git diff --git a/src/jalview/datamodel/Alignment.java b/src/jalview/datamodel/Alignment.java index 61735ee..afe7032 100755 --- a/src/jalview/datamodel/Alignment.java +++ b/src/jalview/datamodel/Alignment.java @@ -1,686 +1,1154 @@ -/* - * 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 - * 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. - * - * 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 - */ -package jalview.datamodel; - -import jalview.analysis.*; - -import jalview.util.*; - -import java.util.*; - - -/** Data structure to hold and manipulate a multiple sequence alignment - */ -public class Alignment implements AlignmentI -{ - protected Vector sequences; - protected Vector groups = new Vector(); - protected Vector superGroup = new Vector(); - protected char gapCharacter = '-'; - - /** DOCUMENT ME!! */ - public AlignmentAnnotation[] annotations; - - /** DOCUMENT ME!! */ - public boolean featuresAdded = false; - - /** Make an alignment from an array of Sequences. - * - * @param sequences - */ - public Alignment(SequenceI[] seqs) - { - sequences = new Vector(); - - for (int i = 0; i < seqs.length; i++) - { - sequences.addElement(seqs[i]); - } - - getWidth(); - } - - /** - * DOCUMENT ME! - * - * @return DOCUMENT ME! - */ - public Vector getSequences() - { - return sequences; - } - - /** - * DOCUMENT ME! - * - * @param i DOCUMENT ME! - * - * @return DOCUMENT ME! - */ - public SequenceI getSequenceAt(int i) - { - if (i < sequences.size()) - { - return (SequenceI) sequences.elementAt(i); - } - - return null; - } - - /** Adds a sequence to the alignment. Recalculates maxLength and size. - * - * @param snew - */ - public void addSequence(SequenceI snew) - { - sequences.addElement(snew); - } - - /** - * DOCUMENT ME! - * - * @param seq DOCUMENT ME! - */ - public void addSequence(SequenceI[] seq) - { - for (int i = 0; i < seq.length; i++) - { - addSequence(seq[i]); - } - } - - /** Adds a sequence to the alignment. Recalculates maxLength and size. - * - * @param snew - */ - public void setSequenceAt(int i, SequenceI snew) - { - SequenceI oldseq = getSequenceAt(i); - deleteSequence(oldseq); - - sequences.setElementAt(snew, i); - } - - /** - * DOCUMENT ME! - * - * @return DOCUMENT ME! - */ - public Vector getGroups() - { - return groups; - } - - /** Takes out columns consisting entirely of gaps (-,.," ") - */ - public void removeGaps() - { - SequenceI current; - int iSize = getWidth(); - - for (int i = 0; i < iSize; i++) - { - boolean delete = true; - - for (int j = 0; j < getHeight(); j++) - { - current = getSequenceAt(j); - - if (current.getLength() > i) - { - /* MC Should move this to a method somewhere */ - if (!jalview.util.Comparison.isGap(current.getCharAt(i))) - { - delete = false; - } - } - } - - if (delete) - { - deleteColumns(i, i); - iSize--; - i--; - } - } - } - - /** Removes a range of columns (start to end inclusive). - * - * @param start Start column in the alignment - * @param end End column in the alignment - */ - public void deleteColumns(int start, int end) - { - deleteColumns(0, getHeight() - 1, start, end); - } - - /** - * DOCUMENT ME! - * - * @param seq1 DOCUMENT ME! - * @param seq2 DOCUMENT ME! - * @param start DOCUMENT ME! - * @param end DOCUMENT ME! - */ - public void deleteColumns(int seq1, int seq2, int start, int end) - { - for (int i = 0; i <= (end - start); i++) - { - for (int j = seq1; j <= seq2; j++) - { - getSequenceAt(j).deleteCharAt(start); - } - } - } - - /** - * DOCUMENT ME! - * - * @param i DOCUMENT ME! - */ - public void trimLeft(int i) - { - for (int j = 0; j < getHeight(); j++) - { - SequenceI s = getSequenceAt(j); - int newstart = s.findPosition(i); - - s.setStart(newstart); - s.setSequence(s.getSequence().substring(i)); - } - } - - /** - * DOCUMENT ME! - * - * @param i DOCUMENT ME! - */ - public void trimRight(int i) - { - for (int j = 0; j < getHeight(); j++) - { - SequenceI s = getSequenceAt(j); - int newend = s.findPosition(i); - - s.setEnd(newend); - s.setSequence(s.getSequence().substring(0, i + 1)); - } - } - - /** - * DOCUMENT ME! - * - * @param s DOCUMENT ME! - */ - public void deleteSequence(SequenceI s) - { - for (int i = 0; i < getHeight(); i++) - { - if (getSequenceAt(i) == s) - { - deleteSequence(i); - } - } - } - - /** - * DOCUMENT ME! - * - * @param i DOCUMENT ME! - */ - public void deleteSequence(int i) - { - sequences.removeElementAt(i); - } - - /** - * DOCUMENT ME! - * - * @param threshold DOCUMENT ME! - * @param sel DOCUMENT ME! - * - * @return DOCUMENT ME! - */ - public Vector removeRedundancy(float threshold, Vector sel) - { - Vector del = new Vector(); - - for (int i = 1; i < sel.size(); i++) - { - for (int j = 0; j < i; j++) - { - // Only do the comparison if either have not been deleted - if (!del.contains((SequenceI) sel.elementAt(i)) || - !del.contains((SequenceI) sel.elementAt(j))) - { - // use PID instead of Comparison (which is really not pleasant) - float pid = Comparison.PID((SequenceI) sel.elementAt(j), - (SequenceI) sel.elementAt(i)); - - if (pid >= threshold) - { - // Delete the shortest one - if (((SequenceI) sel.elementAt(j)).getSequence().length() > ((SequenceI) sel - .elementAt( - i)).getSequence().length()) - { - del.addElement(sel.elementAt(i)); - } - else - { - del.addElement(sel.elementAt(i)); - } - } - } - } - } - - // Now delete the sequences - for (int i = 0; i < del.size(); i++) - { - deleteSequence((SequenceI) del.elementAt(i)); - } - - return del; - } - - /** */ - public SequenceGroup findGroup(int i) - { - return findGroup(getSequenceAt(i)); - } - - /** */ - public SequenceGroup findGroup(SequenceI s) - { - for (int i = 0; i < this.groups.size(); i++) - { - SequenceGroup sg = (SequenceGroup) groups.elementAt(i); - - if (sg.sequences.contains(s)) - { - return sg; - } - } - - return null; - } - - /** - * DOCUMENT ME! - * - * @param s DOCUMENT ME! - * - * @return DOCUMENT ME! - */ - public SequenceGroup[] findAllGroups(SequenceI s) - { - Vector temp = new Vector(); - - int gSize = groups.size(); - for (int i = 0; i < gSize; i++) - { - SequenceGroup sg = (SequenceGroup) groups.elementAt(i); - if(sg==null || sg.sequences==null) - { - this.deleteGroup(sg); - gSize--; - continue; - } - - if (sg.sequences.contains(s)) - { - temp.addElement(sg); - } - } - - SequenceGroup[] ret = new SequenceGroup[temp.size()]; - - for (int i = 0; i < temp.size(); i++) - { - ret[i] = (SequenceGroup) temp.elementAt(i); - } - - return ret; - } - - /** - * DOCUMENT ME! - * - * @param sg DOCUMENT ME! - */ - public void addSuperGroup(SuperGroup sg) - { - superGroup.addElement(sg); - } - - /** - * DOCUMENT ME! - * - * @param sg DOCUMENT ME! - */ - public void removeSuperGroup(SuperGroup sg) - { - superGroup.removeElement(sg); - } - - /** - * DOCUMENT ME! - * - * @param sg DOCUMENT ME! - * - * @return DOCUMENT ME! - */ - public SuperGroup getSuperGroup(SequenceGroup sg) - { - for (int i = 0; i < this.superGroup.size(); i++) - { - SuperGroup temp = (SuperGroup) superGroup.elementAt(i); - - if (temp.sequenceGroups.contains(sg)) - { - return temp; - } - } - - return null; - } - - /** */ - public void addGroup(SequenceGroup sg) - { - if (!groups.contains(sg)) - { - groups.addElement(sg); - } - } - - /** - * DOCUMENT ME! - */ - public void deleteAllGroups() - { - groups.removeAllElements(); - superGroup.removeAllElements(); - - int i = 0; - - while (i < sequences.size()) - { - SequenceI s = getSequenceAt(i); - s.setColor(java.awt.Color.white); - i++; - } - } - - /** */ - public void deleteGroup(SequenceGroup g) - { - if (groups.contains(g)) - { - groups.removeElement(g); - } - } - - /** */ - public SequenceI findName(String name) - { - int i = 0; - - while (i < sequences.size()) - { - SequenceI s = getSequenceAt(i); - - if (s.getName().equals(name)) - { - return s; - } - - i++; - } - - return null; - } - - /** */ - public SequenceI findbyDisplayId(String name) - { - int i = 0; - - while (i < sequences.size()) - { - SequenceI s = getSequenceAt(i); - - if (s.getDisplayId().equals(name)) - { - return s; - } - - i++; - } - - return null; - } - - /** */ - public int findIndex(SequenceI s) - { - int i = 0; - - while (i < sequences.size()) - { - if (s == getSequenceAt(i)) - { - return i; - } - - i++; - } - - return -1; - } - - /** - * DOCUMENT ME! - * - * @return DOCUMENT ME! - */ - public int getHeight() - { - return sequences.size(); - } - - /** - * DOCUMENT ME! - * - * @return DOCUMENT ME! - */ - public int getWidth() - { - int maxLength = -1; - - for (int i = 0; i < sequences.size(); i++) - { - if (getSequenceAt(i).getLength() > maxLength) - { - maxLength = getSequenceAt(i).getLength(); - } - } - - return maxLength; - } - - /** - * DOCUMENT ME! - * - * @return DOCUMENT ME! - */ - public int getMaxIdLength() - { - int max = 0; - int i = 0; - - while (i < sequences.size()) - { - SequenceI seq = getSequenceAt(i); - String tmp = seq.getName() + "/" + seq.getStart() + "-" + - seq.getEnd(); - - if (tmp.length() > max) - { - max = tmp.length(); - } - - i++; - } - - return max; - } - - /** - * DOCUMENT ME! - * - * @param gc DOCUMENT ME! - */ - public void setGapCharacter(char gc) - { - gapCharacter = gc; - - for (int i = 0; i < sequences.size(); i++) - { - Sequence seq = (Sequence) sequences.elementAt(i); - seq.sequence = seq.sequence.replace('.', gc); - seq.sequence = seq.sequence.replace('-', gc); - seq.sequence = seq.sequence.replace(' ', gc); - } - } - - /** - * DOCUMENT ME! - * - * @return DOCUMENT ME! - */ - public char getGapCharacter() - { - return gapCharacter; - } - - /** - * DOCUMENT ME! - * - * @return DOCUMENT ME! - */ - public Vector getAAFrequency() - { - return AAFrequency.calculate(sequences, 0, getWidth()); - } - - /** - * DOCUMENT ME! - * - * @return DOCUMENT ME! - */ - public boolean isAligned() - { - int width = getWidth(); - - for (int i = 0; i < sequences.size(); i++) - { - if (getSequenceAt(i).getLength() != width) - { - return false; - } - } - - return true; - } - - /** - * DOCUMENT ME! - * - * @param aa DOCUMENT ME! - */ - public void deleteAnnotation(AlignmentAnnotation aa) - { - int aSize = 1; - - if (annotations != null) - { - aSize = annotations.length; - } - - AlignmentAnnotation[] temp = new AlignmentAnnotation[aSize - 1]; - - int tIndex = 0; - - for (int i = 0; i < aSize; i++) - { - if (annotations[i] == aa) - { - continue; - } - - temp[tIndex] = annotations[i]; - tIndex++; - } - - annotations = temp; - } - - /** - * DOCUMENT ME! - * - * @param aa DOCUMENT ME! - */ - public void addAnnotation(AlignmentAnnotation aa) - { - int aSize = 1; - - if (annotations != null) - { - aSize = annotations.length + 1; - } - - AlignmentAnnotation[] temp = new AlignmentAnnotation[aSize]; - int i = 0; - - if (aSize > 1) - { - for (i = 0; i < (aSize - 1); i++) - { - temp[i] = annotations[i]; - } - } - - temp[i] = aa; - - annotations = temp; - } - - /** - * DOCUMENT ME! - * - * @return DOCUMENT ME! - */ - public AlignmentAnnotation[] getAlignmentAnnotation() - { - return annotations; - } -} +/* + * Jalview - A Sequence Alignment Editor and Viewer (Development Version 2.4.1) + * Copyright (C) 2009 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 + * 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. + * + * 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 + */ +package jalview.datamodel; + +import java.util.*; + +import jalview.analysis.*; + +/** + * Data structure to hold and manipulate a multiple sequence alignment + */ +/** + * @author JimP + * + */ +public class Alignment implements AlignmentI +{ + protected Alignment dataset; + + protected Vector sequences; + + protected Vector groups = new Vector(); + + protected char gapCharacter = '-'; + + protected int type = NUCLEOTIDE; + + public static final int PROTEIN = 0; + + public static final int NUCLEOTIDE = 1; + + /** DOCUMENT ME!! */ + public AlignmentAnnotation[] annotations; + + HiddenSequences hiddenSequences = new HiddenSequences(this); + + public Hashtable alignmentProperties; + + private void initAlignment(SequenceI[] seqs) + { + int i = 0; + + if (jalview.util.Comparison.isNucleotide(seqs)) + { + type = NUCLEOTIDE; + } + else + { + type = PROTEIN; + } + + sequences = new Vector(); + + for (i = 0; i < seqs.length; i++) + { + sequences.addElement(seqs[i]); + } + + } + + /** + * Make an alignment from an array of Sequences. + * + * @param sequences + */ + public Alignment(SequenceI[] seqs) + { + initAlignment(seqs); + } + + /** + * Make a new alignment from an array of SeqCigars + * + * @param seqs + * SeqCigar[] + */ + public Alignment(SeqCigar[] alseqs) + { + SequenceI[] seqs = SeqCigar.createAlignmentSequences(alseqs, + gapCharacter, new ColumnSelection(), null); + initAlignment(seqs); + } + + /** + * Make a new alignment from an CigarArray JBPNote - can only do this when + * compactAlignment does not contain hidden regions. JBPNote - must also check + * that compactAlignment resolves to a set of SeqCigars - or construct them + * appropriately. + * + * @param compactAlignment + * CigarArray + */ + public static AlignmentI createAlignment(CigarArray compactAlignment) + { + throw new Error("Alignment(CigarArray) not yet implemented"); + // this(compactAlignment.refCigars); + } + + /** + * DOCUMENT ME! + * + * @return DOCUMENT ME! + */ + public Vector getSequences() + { + return sequences; + } + + public SequenceI[] getSequencesArray() + { + if (sequences == null) + return null; + SequenceI[] reply = new SequenceI[sequences.size()]; + for (int i = 0; i < sequences.size(); i++) + { + reply[i] = (SequenceI) sequences.elementAt(i); + } + return reply; + } + + /** + * DOCUMENT ME! + * + * @param i + * DOCUMENT ME! + * + * @return DOCUMENT ME! + */ + public SequenceI getSequenceAt(int i) + { + if (i < sequences.size()) + { + return (SequenceI) sequences.elementAt(i); + } + + return null; + } + + /** + * Adds a sequence to the alignment. Recalculates maxLength and size. + * + * @param snew + */ + public void addSequence(SequenceI snew) + { + if (dataset != null) + { + // maintain dataset integrity + if (snew.getDatasetSequence() != null) + { + getDataset().addSequence(snew.getDatasetSequence()); + } + else + { + // derive new sequence + SequenceI adding = snew.deriveSequence(); + getDataset().addSequence(adding.getDatasetSequence()); + snew = adding; + } + } + if (sequences == null) + { + initAlignment(new SequenceI[] + { snew }); + } + else + { + sequences.addElement(snew); + } + if (hiddenSequences != null) + hiddenSequences.adjustHeightSequenceAdded(); + } + + /** + * Adds a sequence to the alignment. Recalculates maxLength and size. + * + * @param snew + */ + public void setSequenceAt(int i, SequenceI snew) + { + SequenceI oldseq = getSequenceAt(i); + deleteSequence(oldseq); + + sequences.setElementAt(snew, i); + } + + /** + * DOCUMENT ME! + * + * @return DOCUMENT ME! + */ + public Vector getGroups() + { + return groups; + } + + public void finalize() + { + if (getDataset() != null) + getDataset().removeAlignmentRef(); + + dataset = null; + sequences = null; + groups = null; + annotations = null; + hiddenSequences = null; + } + + /** + * decrement the alignmentRefs counter by one and call finalize if it goes to + * zero. + */ + private void removeAlignmentRef() + { + if (--alignmentRefs == 0) + { + finalize(); + } + } + + /** + * DOCUMENT ME! + * + * @param s + * DOCUMENT ME! + */ + public void deleteSequence(SequenceI s) + { + deleteSequence(findIndex(s)); + } + + /** + * DOCUMENT ME! + * + * @param i + * DOCUMENT ME! + */ + public void deleteSequence(int i) + { + if (i > -1 && i < getHeight()) + { + sequences.removeElementAt(i); + hiddenSequences.adjustHeightSequenceDeleted(i); + } + } + + /** */ + public SequenceGroup findGroup(SequenceI s) + { + for (int i = 0; i < this.groups.size(); i++) + { + SequenceGroup sg = (SequenceGroup) groups.elementAt(i); + + if (sg.getSequences(null).contains(s)) + { + return sg; + } + } + + return null; + } + + /** + * DOCUMENT ME! + * + * @param s + * DOCUMENT ME! + * + * @return DOCUMENT ME! + */ + public SequenceGroup[] findAllGroups(SequenceI s) + { + Vector temp = new Vector(); + + int gSize = groups.size(); + for (int i = 0; i < gSize; i++) + { + SequenceGroup sg = (SequenceGroup) groups.elementAt(i); + if (sg == null || sg.getSequences(null) == null) + { + this.deleteGroup(sg); + gSize--; + continue; + } + + if (sg.getSequences(null).contains(s)) + { + temp.addElement(sg); + } + } + + SequenceGroup[] ret = new SequenceGroup[temp.size()]; + + for (int i = 0; i < temp.size(); i++) + { + ret[i] = (SequenceGroup) temp.elementAt(i); + } + + return ret; + } + + /** */ + public void addGroup(SequenceGroup sg) + { + if (!groups.contains(sg)) + { + if (hiddenSequences.getSize() > 0) + { + int i, iSize = sg.getSize(); + for (i = 0; i < iSize; i++) + { + if (!sequences.contains(sg.getSequenceAt(i))) + { + sg.deleteSequence(sg.getSequenceAt(i), false); + iSize--; + i--; + } + } + + if (sg.getSize() < 1) + { + return; + } + } + + groups.addElement(sg); + } + } + + /** + * DOCUMENT ME! + */ + public void deleteAllGroups() + { + groups.removeAllElements(); + } + + /** */ + public void deleteGroup(SequenceGroup g) + { + if (groups.contains(g)) + { + if (annotations!=null && annotations.length>0) + { + if (g.hasAnnotationRows()) + { // remove any annotation references. + deleteAnnotation(g.getConsensus());// todo - create=false flag so we don't create another object unnecessarily + deleteAnnotation(g.getConservationRow()); + } + } + groups.removeElement(g); + } + } + + /** */ + public SequenceI findName(String name) + { + return findName(name, false); + } + + /* + * (non-Javadoc) + * + * @see jalview.datamodel.AlignmentI#findName(java.lang.String, boolean) + */ + public SequenceI findName(String token, boolean b) + { + return findName(null, token, b); + } + + /* + * (non-Javadoc) + * + * @see jalview.datamodel.AlignmentI#findName(SequenceI, java.lang.String, + * boolean) + */ + public SequenceI findName(SequenceI startAfter, String token, boolean b) + { + + int i = 0; + SequenceI sq = null; + String sqname = null; + if (startAfter != null) + { + // try to find the sequence in the alignment + boolean matched = false; + while (i < sequences.size()) + { + if (getSequenceAt(i++) == startAfter) + { + matched = true; + break; + } + } + if (!matched) + { + i = 0; + } + } + while (i < sequences.size()) + { + sq = getSequenceAt(i); + sqname = sq.getName(); + if (sqname.equals(token) // exact match + || (b && // allow imperfect matches - case varies + (sqname.equalsIgnoreCase(token)))) + { + return getSequenceAt(i); + } + + i++; + } + + return null; + } + + public SequenceI[] findSequenceMatch(String name) + { + Vector matches = new Vector(); + int i = 0; + + while (i < sequences.size()) + { + if (getSequenceAt(i).getName().equals(name)) + { + matches.addElement(getSequenceAt(i)); + } + i++; + } + + SequenceI[] result = new SequenceI[matches.size()]; + for (i = 0; i < result.length; i++) + { + result[i] = (SequenceI) matches.elementAt(i); + } + + return result; + + } + + /* + * (non-Javadoc) + * + * @see jalview.datamodel.AlignmentI#findIndex(jalview.datamodel.SequenceI) + */ + public int findIndex(SequenceI s) + { + int i = 0; + + while (i < sequences.size()) + { + if (s == getSequenceAt(i)) + { + return i; + } + + i++; + } + + return -1; + } + + /* + * (non-Javadoc) + * + * @see jalview.datamodel.AlignmentI#findIndex(jalview.datamodel.SearchResults) + */ + public int findIndex(SearchResults results) + { + int i = 0; + + while (i < sequences.size()) + { + if (results.involvesSequence(getSequenceAt(i))) + { + return i; + } + i++; + } + return -1; + } + + /** + * DOCUMENT ME! + * + * @return DOCUMENT ME! + */ + public int getHeight() + { + return sequences.size(); + } + + /** + * DOCUMENT ME! + * + * @return DOCUMENT ME! + */ + public int getWidth() + { + int maxLength = -1; + + for (int i = 0; i < sequences.size(); i++) + { + if (getSequenceAt(i).getLength() > maxLength) + { + maxLength = getSequenceAt(i).getLength(); + } + } + + return maxLength; + } + + /** + * DOCUMENT ME! + * + * @param gc + * DOCUMENT ME! + */ + public void setGapCharacter(char gc) + { + gapCharacter = gc; + + for (int i = 0; i < sequences.size(); i++) + { + Sequence seq = (Sequence) sequences.elementAt(i); + seq.setSequence(seq.getSequenceAsString().replace('.', gc).replace( + '-', gc).replace(' ', gc)); + } + } + + /** + * DOCUMENT ME! + * + * @return DOCUMENT ME! + */ + public char getGapCharacter() + { + return gapCharacter; + } + + /** + * DOCUMENT ME! + * + * @return DOCUMENT ME! + */ + public boolean isAligned() + { + int width = getWidth(); + + for (int i = 0; i < sequences.size(); i++) + { + if (getSequenceAt(i).getLength() != width) + { + return false; + } + } + + return true; + } + + /* + * (non-Javadoc) + * + * @see jalview.datamodel.AlignmentI#deleteAnnotation(jalview.datamodel.AlignmentAnnotation) + */ + public boolean deleteAnnotation(AlignmentAnnotation aa) + { + int aSize = 1; + + if (annotations != null) + { + aSize = annotations.length; + } + + if (aSize < 1) + { + return false; + } + + AlignmentAnnotation[] temp = new AlignmentAnnotation[aSize - 1]; + + boolean swap = false; + int tIndex = 0; + + for (int i = 0; i < aSize; i++) + { + if (annotations[i] == aa) + { + swap = true; + continue; + } + if (tIndex < temp.length) + temp[tIndex++] = annotations[i]; + } + + if (swap) + { + annotations = temp; + if (aa.sequenceRef != null) + aa.sequenceRef.removeAlignmentAnnotation(aa); + } + return swap; + } + + /* (non-Javadoc) + * @see jalview.datamodel.AlignmentI#addAnnotation(jalview.datamodel.AlignmentAnnotation) + */ + public void addAnnotation(AlignmentAnnotation aa) + { + addAnnotation(aa, -1); + } + + /* (non-Javadoc) + * @see jalview.datamodel.AlignmentI#addAnnotation(jalview.datamodel.AlignmentAnnotation, int) + */ + public void addAnnotation(AlignmentAnnotation aa, int pos) + { + int aSize = 1; + if (annotations != null) + { + aSize = annotations.length + 1; + } + + AlignmentAnnotation[] temp = new AlignmentAnnotation[aSize]; + int i = 0; + if (pos==-1 || pos>=aSize) { + temp[aSize - 1] = aa; + } else { + temp[pos] = aa; + } + if (aSize > 1) + { + int p=0; + for (i = 0; i < (aSize-1); i++,p++) + { + if (p==pos) + { + p++; + } + if (p maxLength; j--) + { + if (j > maxLength + && !jalview.util.Comparison.isGap(current.getCharAt(j))) + { + maxLength = j; + break; + } + } + } + + maxLength++; + + int cLength; + for (int i = 0; i < sequences.size(); i++) + { + current = getSequenceAt(i); + cLength = current.getLength(); + + if (cLength < maxLength) + { + current.insertCharAt(cLength, maxLength - cLength, gapCharacter); + modified = true; + } + else if (current.getLength() > maxLength) + { + current.deleteChars(maxLength, current.getLength()); + } + } + return modified; + } + /** + * Justify the sequences to the left or right by deleting and inserting gaps before the initial residue or after the terminal residue + * @param right true if alignment padded to right, false to justify to left + * @return true if alignment was changed + */ + public boolean justify(boolean right) + { + boolean modified = false; + + // Remove excess gaps from the end of alignment + int maxLength = -1; + int ends[] = new int[sequences.size()*2]; + SequenceI current; + for (int i = 0; i < sequences.size(); i++) + { + current = getSequenceAt(i); + // This should really be a sequence method + ends[i*2] = current.findIndex(current.getStart()); + ends[i*2+1] = current.findIndex(current.getStart()+current.getLength()); + boolean hitres=false; + for (int j = 0,rs=0,ssiz=current.getLength(); jmaxLength) + { + maxLength = j-ends[i*2]; + } + } + } + } + } + + maxLength++; + // now edit the flanking gaps to justify to either left or right + int cLength,extent,diff; + for (int i = 0; i < sequences.size(); i++) + { + current = getSequenceAt(i); + + cLength = 1+ends[i*2+1]-ends[i*2]; + diff = maxLength-cLength; // number of gaps to indent + extent = current.getLength(); + if (right) + { + // right justify + if (extent>ends[i*2+1]) + { + current.deleteChars(ends[i*2+1]+1, extent); + modified = true; + } + if (ends[i*2]>diff) + { + current.deleteChars(0, ends[i*2]-diff); + modified = true; + } else { + if (ends[i*2]0) + { + current.deleteChars(0, ends[i*2]); + modified = true; + ends[i*2+1]-=ends[i*2]; + extent-=ends[i*2]; + } + if (extent>maxLength) + { + current.deleteChars(maxLength+1, extent); + modified = true; + } else { + if (extent