X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fjalview%2Fdatamodel%2FSequenceGroup.java;h=dc22704ffebd62006b2d55be030b5ac20ee2e6d3;hb=23169813062957122bc246f05c2479cb36a9c509;hp=054896b2eca8854988efd7ebb52e5f8aa5cf6582;hpb=efc31b4a8d5cee63555586804a2b79c06bdb5a14;p=jalview.git diff --git a/src/jalview/datamodel/SequenceGroup.java b/src/jalview/datamodel/SequenceGroup.java index 054896b..dc22704 100755 --- a/src/jalview/datamodel/SequenceGroup.java +++ b/src/jalview/datamodel/SequenceGroup.java @@ -1,6 +1,6 @@ /* * Jalview - A Sequence Alignment Editor and Viewer - * Copyright (C) 2005 AM Waterhouse, J Procter, G Barton, M Clamp, S Searle + * Copyright (C) 2006 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 @@ -41,9 +41,7 @@ public class SequenceGroup boolean displayBoxes; boolean displayText; boolean colourText; - - /** DOCUMENT ME!! */ - public Vector sequences = new Vector(); + private Vector sequences = new Vector(); int width = -1; /** DOCUMENT ME!! */ @@ -115,6 +113,106 @@ public class SequenceGroup endRes = end; } + public SequenceI [] getSelectionAsNewSequences(AlignmentI align) + { + int iSize = sequences.size(); + SequenceI [] seqs = new SequenceI[iSize]; + SequenceI [] inorder = getSequencesInOrder(align); + + + for (int i = 0; i < iSize; i++) + { + SequenceI seq = inorder[i]; + + seqs[i] = new Sequence(seq.getName(), + seq.getSequence(startRes, endRes + 1), + seq.findPosition(startRes), + findEndRes(seq)); + + seqs[i].setDescription(seq.getDescription()); + seqs[i].setDBRef(seq.getDBRef()); + seqs[i].setSequenceFeatures(seq.getSequenceFeatures()); + if (seq.getDatasetSequence() != null) + seqs[i].setDatasetSequence(seq.getDatasetSequence()); + + if(seq.getAnnotation()!=null) + { + for(int a=0; a 0) + { + eres += seq.getStart() - 1; + } + + return eres; + } + + public Vector getSequences(boolean includeHidden) + { + if(!includeHidden) + return sequences; + else + { + Vector allSequences = new Vector(); + SequenceI seq; + for (int i = 0; i < sequences.size(); i++) + { + seq = (SequenceI) sequences.elementAt(i); + allSequences.addElement(seq); + if (seq.getHiddenSequences() != null) + { + for (int h = 0; h < seq.getHiddenSequences().getSize(false); h++) + { + allSequences.addElement( + seq.getHiddenSequences().getSequenceAt(h) + ); + } + } + } + + return allSequences; + } + } + + public SequenceI[] getSequencesAsArray(boolean includeHidden) + { + Vector tmp = getSequences(includeHidden); + if(tmp==null) + return null; + SequenceI [] result = new SequenceI[tmp.size()]; + for(int i=0; i