X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fjalview%2Fdatamodel%2FAlignmentOrder.java;h=639dd470fba2e157f9cd4d61962e5bc9d039fa03;hb=0bdaa0deb6ee514912d2ed730e19f618bc44cb69;hp=1fa3b96c90f53ae42f0118709fc1b7bb5fde2cf9;hpb=efc31b4a8d5cee63555586804a2b79c06bdb5a14;p=jalview.git

diff --git a/src/jalview/datamodel/AlignmentOrder.java b/src/jalview/datamodel/AlignmentOrder.java
index 1fa3b96..639dd47 100755
--- a/src/jalview/datamodel/AlignmentOrder.java
+++ b/src/jalview/datamodel/AlignmentOrder.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
@@ -167,7 +167,98 @@ public class AlignmentOrder
     {
         return Order;
     }
-
+    /**
+     * replaces oldref with newref in the alignment order.
+     * @param oldref
+     * @param newref
+     * @return true if oldref was contained in order and replaced with newref
+     */
+    public boolean updateSequence(SequenceI oldref, SequenceI newref) {
+      int found=Order.indexOf(oldref);
+      if (found>-1) {
+        Order.setElementAt(newref, found);
+      }
+      return found>-1;
+    }
+    /**
+     * Exact equivalence of two AlignmentOrders
+     * @param o
+     * @return true if o orders the same sequenceI objects in the same way
+     */
+    public boolean equals(AlignmentOrder o) {
+      return equals(o, true);
+    }
+    /**
+     * Exact equivalence of two AlignmentOrders
+     *  // TODO: Weak SequenceI equivalence - will throw Error at moment
+     * @param o
+     * @param identity - false - use weak equivalence (refers to same or different parts of same sequence)
+     * @return true if o orders equivalent sequenceI objects in the same way
+     */
+    public boolean equals(AlignmentOrder o, boolean identity) {
+      if (o!=this) {
+        if (o==null)
+          return false;
+        if (Order!=null && o.Order!=null && Order.size()==o.Order.size()) {
+          if (!identity) {
+            throw new Error("Weak sequenceI equivalence not yet implemented.");
+          } else {
+            for (int i=0,j=o.Order.size(); i<j; i++) {
+            if (Order.elementAt(i)!=o.Order.elementAt(i))
+              return false;
+            }
+          }
+        } else
+          return false;
+      }
+      return true;
+    }
+    /**
+     * Consistency test for alignmentOrders
+     * @param o
+     * @return true if o contains or is contained by this and the common SequenceI objects are ordered in the same way
+     */
+    public boolean isConsistent(AlignmentOrder o) {
+      return isConsistent(o, true);
+    }
+    /**
+     * Consistency test for alignmentOrders
+     * @param o
+     *  // TODO: Weak SequenceI equivalence - will throw Error at moment
+     * @param identity - false - use weak equivalence (refers to same or different parts of same sequence)
+     * @return true if o contains or is contained by this and the common SequenceI objects are ordered in the same way
+     */
+    public boolean isConsistent(AlignmentOrder o, boolean identity) {
+      if (o!=this) {
+        if (o==null)
+          return false;
+        if (Order!=null && o.Order!=null) {
+          Vector c,s;
+          if (o.Order.size()>Order.size()) {
+            c = o.Order;
+            s = Order;
+          } else {
+            c = Order;
+            s = o.Order;
+          }
+          if (!identity) {
+            throw new Error("Weak sequenceI equivalence not yet implemented.");
+          } else {
+            // test if c contains s and order in s is conserved in c
+            int last=-1;
+            for (int i=0,j=s.size(); i<j; i++) {
+              int pos=c.indexOf(s.elementAt(i)); // JBPNote - optimize by incremental position search
+              if (pos>last) {
+                last=pos;
+              } else
+                return false;
+            }
+          }
+        } else
+          return false;
+      }
+      return true;
+    }
     /**
      * AlignmentOrder
      *