Package jpl

Examples of jpl.Term.arg()

1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
            Term decomposition = visit.arg(2).arg(2).arg(2).arg(2);
            res += "\n((["; //BU
            {
              Boolean first = true;
              //System.err.println(decomposition.arg(1).arg(1).debugString());
              for (Term t : decomposition.arg(1).arg(1).toTermArray()) {
                if (first) first = false;
                else res += ",";
                res += t.toString();
              }       
            }
View Full Code Here
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
            }
            res += "],["; //Inorder
            {
              Boolean first = true;
              //System.err.println(decomposition.arg(1).arg(2).debugString());
              for (Term t : decomposition.arg(1).arg(2).toTermArray()) {
                if (first) first = false;
                else res += ",";
                res += t.toString();
              }       
            }
View Full Code Here
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
            }
            res += "]),(_,\n["; //BUInorder (subset of Inorder)
            {
              Boolean first = true;
              //System.err.println(decomposition.arg(2).arg(2).arg(1).debugString());
              for (Term t : decomposition.arg(2).arg(2).arg(1).toTermArray()) {
                if (first) first = false;
                else res += ",";
                res += t.toString();
              }       
            }
View Full Code Here
132
133
134
135
136
137
138
139
140
141
142
      HashMap<AGEval.Class, Vector<SingleVisitRaw> > res,  HashSet<AGEval.Class> bus, HashSet<AGEval.Class> buInorders) {
    Term visitO = visit.arg(2).arg(2).arg(2).arg(2);
       
    HashSet<AGEval.Class> postorderClasses = new HashSet<AGEval.Class>();
    HashSet<AGEval.Class> inorderWithPostorderParentClasses = new HashSet<AGEval.Class>();
    for (Term bu : visitO.arg(1).arg(1).toTermArray())
      postorderClasses.add(plNameToClass(sched, bu.toString()));
    for (Term buInorder : visitO.arg(2).arg(2).arg(1).toTermArray())
      inorderWithPostorderParentClasses.add(plNameToClass(sched, buInorder.toString()));
    HashSet<AGEval.Class> inorderWithInorderParentClasses = new HashSet<AGEval.Class>(ast.classes);
    inorderWithInorderParentClasses.removeAll(postorderClasses);
View Full Code Here
134
135
136
137
138
139
140
141
142
143
144
       
    HashSet<AGEval.Class> postorderClasses = new HashSet<AGEval.Class>();
    HashSet<AGEval.Class> inorderWithPostorderParentClasses = new HashSet<AGEval.Class>();
    for (Term bu : visitO.arg(1).arg(1).toTermArray())
      postorderClasses.add(plNameToClass(sched, bu.toString()));
    for (Term buInorder : visitO.arg(2).arg(2).arg(1).toTermArray())
      inorderWithPostorderParentClasses.add(plNameToClass(sched, buInorder.toString()));
    HashSet<AGEval.Class> inorderWithInorderParentClasses = new HashSet<AGEval.Class>(ast.classes);
    inorderWithInorderParentClasses.removeAll(postorderClasses);
    inorderWithInorderParentClasses.removeAll(inorderWithPostorderParentClasses);
           
View Full Code Here
143
144
145
146
147
148
149
150
151
152
153
    inorderWithInorderParentClasses.removeAll(inorderWithPostorderParentClasses);
           
    for (AGEval.Class cls : ast.classes)     
      res.get(cls).add(new SingleVisitRaw(cls, postorderClasses.contains(cls.toString().toLowerCase()) ? Visits.POSTORDER : Visits.RECURSIVE));
           
    handleMixed(sched, visitI, postorderClasses, visitO.arg(2).arg(1), res);
    bus.addAll(postorderClasses);
    handleMixed(sched, visitI, inorderWithPostorderParentClasses, visitO.arg(2).arg(2).arg(2).arg(1), res);
    buInorders.addAll(inorderWithPostorderParentClasses);
    handleMixed(sched, visitI, inorderWithInorderParentClasses, visitO.arg(2).arg(2).arg(2).arg(2), res);
  }
View Full Code Here
145
146
147
148
149
150
151
152
153
154
155
    for (AGEval.Class cls : ast.classes)     
      res.get(cls).add(new SingleVisitRaw(cls, postorderClasses.contains(cls.toString().toLowerCase()) ? Visits.POSTORDER : Visits.RECURSIVE));
           
    handleMixed(sched, visitI, postorderClasses, visitO.arg(2).arg(1), res);
    bus.addAll(postorderClasses);
    handleMixed(sched, visitI, inorderWithPostorderParentClasses, visitO.arg(2).arg(2).arg(2).arg(1), res);
    buInorders.addAll(inorderWithPostorderParentClasses);
    handleMixed(sched, visitI, inorderWithInorderParentClasses, visitO.arg(2).arg(2).arg(2).arg(2), res);
  }
 
  private HashMap<AGEval.Class, Vector<SingleVisitRaw> >  marshalRaw(Schedule sched) {
View Full Code Here
147
148
149
150
151
152
153
154
155
156
157
           
    handleMixed(sched, visitI, postorderClasses, visitO.arg(2).arg(1), res);
    bus.addAll(postorderClasses);
    handleMixed(sched, visitI, inorderWithPostorderParentClasses, visitO.arg(2).arg(2).arg(2).arg(1), res);
    buInorders.addAll(inorderWithPostorderParentClasses);
    handleMixed(sched, visitI, inorderWithInorderParentClasses, visitO.arg(2).arg(2).arg(2).arg(2), res);
  }
 
  private HashMap<AGEval.Class, Vector<SingleVisitRaw> >  marshalRaw(Schedule sched) {
  /*     
    System.err.println("\n==================================\n");
 
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.