X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fjalview%2Fdatamodel%2FSequenceGroup.java;h=76a350f9a757c4c9af615592420b5f7b0fd78c74;hb=1d6bdfa4ce1d88c055a257e542de6b8542144d91;hp=ecdf2bce7313e603b86fdd444d8cbb0ce542a978;hpb=df9b85c1cf39894039018499fe802406cc37f209;p=jalview.git

diff --git a/src/jalview/datamodel/SequenceGroup.java b/src/jalview/datamodel/SequenceGroup.java
index ecdf2bc..76a350f 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
@@ -49,6 +49,10 @@ public class SequenceGroup
     int startRes = 0;
     int endRes = 0;
     Color outlineColour = Color.black;
+    public int thresholdTextColour = 0;
+    public Color textColour = Color.black;
+    public Color textColour2 = Color.white;
+
 
     /**
      * Creates a new SequenceGroup object.
@@ -113,25 +117,88 @@ public class SequenceGroup
         endRes = end;
     }
 
-    public Vector getSequences(boolean includeHidden)
+    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<seq.getAnnotation().length; a++)
+          seqs[i].addAlignmentAnnotation(seq.getAnnotation()[a]);
+      }
+    }
+
+    return seqs;
+
+    }
+
+    /**
+     * If sequence ends in gaps, the end residue can
+     * be correctly calculated here
+     * @param seq SequenceI
+     * @return int
+     */
+    public int findEndRes(SequenceI seq)
     {
-      if(!includeHidden)
+      int eres = 0;
+      char ch;
+
+      for (int j = 0; j < endRes + 1 && j < seq.getLength(); j++)
+      {
+        ch = seq.getCharAt(j);
+        if (!jalview.util.Comparison.isGap( (ch)))
+        {
+          eres++;
+        }
+      }
+
+      if (eres > 0)
+      {
+        eres += seq.getStart() - 1;
+      }
+
+      return eres;
+    }
+
+    public Vector getSequences(Hashtable hiddenReps)
+    {
+      if(hiddenReps == null)
         return sequences;
       else
       {
         Vector allSequences = new Vector();
-        SequenceI seq;
+        SequenceI seq, seq2;
         for (int i = 0; i < sequences.size(); i++)
         {
           seq = (SequenceI) sequences.elementAt(i);
           allSequences.addElement(seq);
-          if (seq.getHiddenSequences() != null)
+          if (hiddenReps.containsKey(seq) )
           {
-            for (int h = 0; h < seq.getHiddenSequences().getSize(false); h++)
+            SequenceGroup hsg = (SequenceGroup)hiddenReps.get(seq);
+            for (int h = 0; h < hsg.getSize(); h++)
             {
-              allSequences.addElement(
-                  seq.getHiddenSequences().getSequenceAt(h)
-                  );
+              seq2 = hsg.getSequenceAt(h);
+              if (seq2 != seq
+                  && !allSequences.contains(seq2))
+                allSequences.addElement(seq2);
             }
           }
         }
@@ -140,6 +207,18 @@ public class SequenceGroup
       }
     }
 
+    public SequenceI[] getSequencesAsArray(Hashtable hiddenReps)
+    {
+      Vector tmp = getSequences(hiddenReps);
+      if(tmp==null)
+        return null;
+      SequenceI [] result = new SequenceI[tmp.size()];
+      for(int i=0; i<result.length; i++)
+        result[i] = (SequenceI)tmp.elementAt(i);
+
+      return result;
+    }
+
     /**
      * DOCUMENT ME!
      *
@@ -244,7 +323,7 @@ public class SequenceGroup
      */
     public void addSequence(SequenceI s, boolean recalc)
     {
-        if (!sequences.contains(s))
+        if (s!=null && !sequences.contains(s))
         {
             sequences.addElement(s);
         }
@@ -263,31 +342,37 @@ public class SequenceGroup
         if(cs == null)
           return;
 
-        cs.setConsensus(AAFrequency.calculate(sequences, 0, getWidth()));
-
-
-        if (cs instanceof ClustalxColourScheme)
+        try
         {
-            ((ClustalxColourScheme) cs).resetClustalX(sequences, getWidth());
-        }
+          cs.setConsensus(AAFrequency.calculate(sequences, startRes, endRes+1));
 
+          if (cs instanceof ClustalxColourScheme)
+          {
+            ( (ClustalxColourScheme) cs).resetClustalX(sequences, getWidth());
+          }
 
-        if (cs.conservationApplied())
-        {
+          if (cs.conservationApplied())
+          {
             Conservation c = new Conservation(groupName,
-                    ResidueProperties.propHash, 3, sequences, 0, getWidth());
+                                              ResidueProperties.propHash, 3, sequences,
+                                              startRes, endRes+1);
             c.calculate();
             c.verdict(false, 25);
 
-
             cs.setConservation(c);
 
             if (cs instanceof ClustalxColourScheme)
             {
-                ((ClustalxColourScheme) cs).resetClustalX(sequences,
-                    getWidth());
+              ( (ClustalxColourScheme) cs).resetClustalX(sequences,
+                                                         getWidth());
             }
+          }
         }
+        catch (java.lang.OutOfMemoryError err)
+        {
+          System.out.println("Out of memory loading groups: " + err);
+        }
+
     }
 
     /**
@@ -369,24 +454,9 @@ public class SequenceGroup
      *
      * @return DOCUMENT ME!
      */
-    public int getSize(boolean includeHidden)
+    public int getSize()
     {
-      if(!includeHidden)
         return sequences.size();
-      else
-      {
-        int total = sequences.size();
-        SequenceI seq;
-        for (int i = 0; i < sequences.size(); i++)
-        {
-          seq = (SequenceI) sequences.elementAt(i);
-          if (seq.getHiddenSequences() != null)
-          {
-            total += seq.getHiddenSequences().getSize(false);
-          }
-        }
-        return total;
-      }
     }
 
     /**
@@ -516,25 +586,16 @@ public class SequenceGroup
      */
     public SequenceI[] getSequencesInOrder(AlignmentI al)
     {
-        int sz = sequences.size();
-        java.util.Hashtable orderedSeqs = new java.util.Hashtable();
-        SequenceI[] seqs = new SequenceI[sz];
+        int sSize = sequences.size();
+        int alHeight = al.getHeight();
 
-        for (int i = 0; i < sz; i++)
-        {
-            SequenceI seq = (SequenceI) sequences.elementAt(i);
-            int index = al.findIndex(seq);
-            orderedSeqs.put(index + "", seq);
-        }
+        SequenceI[] seqs = new SequenceI[sSize];
 
         int index = 0;
-
-        for (int i = 0; i < al.getHeight(); i++)
+        for (int i = 0; i < alHeight && index<sSize; i++)
         {
-            if (orderedSeqs.containsKey(i + ""))
-            {
-                seqs[index++] = (SequenceI) orderedSeqs.get(i + "");
-            }
+          if(sequences.contains( al.getSequenceAt(i) ) )
+            seqs[index++] = al.getSequenceAt(i);
         }
 
         return seqs;