Add files via upload

Author: kevinlano

version24/Pattern.class

@@ -0,0 +1,101 @@
+import java.util.*;
+
+/* Package: Statemachine */
+/******************************
+* Copyright (c) 2003,2019 Kevin Lano
+* This program and the accompanying materials are made available under the
+* terms of the Eclipse Public License 2.0 which is available at
+* http://www.eclipse.org/legal/epl-2.0
+*
+* SPDX-License-Identifier: EPL-2.0
+* *****************************/
+
+
+class PossibleLoop
+{ State s;
+  Vector trs = new Vector();
+  Vector sts = new Vector();
+  State loophead = null;
+
+  PossibleLoop(State ss, Transition tr)
+  { // pre: tr.source == ss
+    s = ss;
+    trs.add(tr);
+  }
+
+  public boolean isLoop()
+  { if (trs.size() > 0)
+    { Transition tr = (Transition) trs.get(trs.size()-1);
+      return tr.target == s;
+    }
+    return false;
+  }
+
+  public State endState()
+  { if (trs.size() > 0)
+    { Transition tr = (Transition) trs.get(trs.size()-1);
+      return tr.target;
+    }
+    return s;
+  }
+
+  public State getLoophead()
+  { return loophead; } 
+
+  public Vector getStates()
+  { return sts; } 
+
+  public boolean extend(Transition tr)
+  { if (trs.contains(tr)) 
+    { return false; }
+    else 
+    { trs.add(tr);
+      return true;
+    }
+  }
+
+  public void calculateStates()
+  { sts.clear(); 
+    sts.add(s);
+    for (int i = 0; i < trs.size(); i++)
+    { Transition t = (Transition) trs.get(i);
+      if (sts.contains(t.target)) { }
+      else
+      { sts.add(t.target); }
+    }
+  }
+
+  public boolean checkLoop()
+  { loophead = null;
+    boolean res = true;
+    for (int i = 0; i < sts.size(); i++)
+    { State st = (State) sts.get(i);
+      Vector outt = st.outgoingTransitions();
+      Vector intt = st.incomingTransitions();
+      for (int j = 0; j < outt.size(); j++)
+      { Transition tt = (Transition) outt.get(j);
+        if (sts.contains(tt.target)) { } // add to trs?
+        else if (loophead == null)
+        { loophead = st; }
+        else if (loophead != st) 
+        { System.out.println("Error: state " + st + " exits loop " + sts); 
+          res = false;
+        }
+      }
+      for (int j = 0; j < intt.size(); j++)
+      { Transition tt = (Transition) intt.get(j);
+        if (sts.contains(tt.source)) { } // add to trs?
+        else if (loophead == null)
+        { loophead = st; }
+        else if (loophead != st) 
+        { System.out.println("Error: state " + st + " enters loop " + sts); 
+          res = false;
+        }
+      }
+    }
+    return res;
+  }
+
+  public String toString()
+  { return s + " ==> " + trs; }
+}

version24/Pattern.java

@@ -0,0 +1,73 @@
+import java.util.Vector;
+
+/******************************
+* Copyright (c) 2003-2023 Kevin Lano
+* This program and the accompanying materials are made available under the
+* terms of the Eclipse Public License 2.0 which is available at
+* http://www.eclipse.org/legal/epl-2.0
+*
+* SPDX-License-Identifier: EPL-2.0
+* *****************************/
+/* Package: class diagram */
+
+public class PreAssociation
+{ String e1name;
+  String e2name;
+  int card1;
+  int card2;
+  int xs, xe;
+  int ys, ye;
+  String role2;
+  String role1;
+  Expression initialExpression; 
+  Vector stereotypes; 
+  Vector wpoints; 
+
+  public PreAssociation()
+  { e1name = ""; e2name = ""; 
+    role1 = ""; role2 = ""; 
+    stereotypes = new Vector(); 
+    card1 = ModelElement.MANY; card2 = ModelElement.MANY; 
+  } 
+
+  public PreAssociation(String e1n, String e2n, int c1,
+                        int c2, int x1, int y1, int x2,
+                        int y2, String r2, String r1, Vector sts, Vector wps)
+  { e1name = e1n;
+    e2name = e2n;
+    card1 = c1;
+    card2 = c2;
+    xs = x1;
+    ys = y1;
+    xe = x2;
+    ye = y2;
+    role2 = r2;
+    role1 = r1; 
+    stereotypes = sts; 
+    wpoints = wps; 
+  }
+
+  public void setInitialExpression(Expression expr)
+  { initialExpression = expr; } 
+
+  public boolean isDualTo(PreAssociation pinv)
+  { if (pinv.role1 != null && pinv.role1.equals(role2) && 
+        role1 != null && role1.equals(pinv.role2) && 
+        e1name.equals(pinv.e2name) && e2name.equals(pinv.e1name))
+    { return true; }
+    return false; 
+  } 
+
+  public PreAssociation combineWith(PreAssociation pinv)
+  { PreAssociation res = new PreAssociation(e1name, e2name, 
+                               card1, card2, xs, ys, xe, ye, 
+                               role2, role1, stereotypes, wpoints); 
+    if (card1 == ModelElement.MANY) 
+    { res.card1 = pinv.card2; } 
+    if (card2 == ModelElement.MANY) 
+    { res.card2 = pinv.card1; } 
+    return res; 
+  } 
+
+}
+

version24/PositionTextAction.class

@@ -0,0 +1,21 @@
+/******************************
+* Copyright (c) 2003,2019 Kevin Lano
+* This program and the accompanying materials are made available under the
+* terms of the Eclipse Public License 2.0 which is available at
+* http://www.eclipse.org/legal/epl-2.0
+*
+* SPDX-License-Identifier: EPL-2.0
+* *****************************/
+
+public class PreBehaviour
+{ String behaviouredClassifier = null; 
+  String specification = null; 
+  Statement code; 
+
+  public PreBehaviour(String owner, String bf, Statement cde)
+  { behaviouredClassifier = owner; 
+    specification = bf; 
+    code = cde; 
+  } 
+}
+