Package abstrasy

Examples of abstrasy.Node.exec()

26
27
28
29
30
31
32
33
34
35
36
  public Node call(Node argvList) throws Exception {
        Node expr=Node.createExpr().append(methode);//.append(symbol); (optimisation l.bruninx, 2012-06-26)
        if(argvList!=null) expr.appendChildsOf(argvList);
        //Heap.push(); (optimisation l.bruninx, 2012-06-26)
        //Heap.setSELF(object);
    return expr.exec(false);
        //Heap.pull();
        //return result;
  }

    /**
 
View Full Code Here
276
277
278
279
280
281
282
283
284
285
286
            }
            else{
                Node expr = Node.createExpr();
                expr.addElement(fx);
                expr.addElement(new Node(fl[i].getAbsolutePath()));
                expr.exec(true);
            }
        }
    }
   
  public Node external_walk_files(Node startAt) throws Exception {
View Full Code Here
42
43
44
45
46
47
48
49
50
51
52
   * @throws Exception
   */
  public Node call(Node argvList,int index) throws Exception {
        Node expr=Node.createExpr().append(methode);
        if(argvList!=null) expr.appendChildsOf(argvList,index);
    return expr.exec(false);
  }
    /**
   * Réalise l'appel de la méthode en assignant le contexte d'évaluation.
     *
     * On notera que call_unary() est une optimisation spéciale de call(). En effet, call_unary() correspond au cas où la méthode est unaire (un seul argument).
View Full Code Here
59
60
61
62
63
64
65
66
67
68
69
  public Node call_unary(Node arg0) throws Exception {
        Node expr=Node.createExpr().append(methode);//.append(symbol); (optimisation l.bruninx, 2012-06-26)
        if(arg0!=null)expr.append(arg0);
    //Heap.push(); (optimisation l.bruninx, 2012-06-26)
        //Heap.setSELF(object);
    return expr.exec(false);
        //Heap.pull();
        //return result;
  }
   
  /**
 
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
        }
        else{
            // évaluation d'une expression (similaire à une réification)
            Node enode = new Node().append(xnode);
            enode.appendChildsOf(startAt, 2);
            return enode.exec(false);
        }
       
    }

}
View Full Code Here
95
96
97
98
99
100
101
102
103
104
105
             *   
             */
            boolean loop = true;
            while (loop) {
                _clear_closure_(local);
                xnode = enode.exec(true);
                loop = xnode==null && interpreter.isCanIterate() && (untilLoop ? !xPC_Condition(local, cnode): xPC_Condition(local, cnode));
            }
            //
            global.pull();

View Full Code Here
151
152
153
154
155
156
157
158
159
160
161
         *    la retourner directement comme résultat.
         *   
         */
        while (xnode==null && interpreter.isCanIterate()) {
            _clear_closure_(local);
            xnode = enode.exec(true);
        }
        global.pull();


        //global.getTailStack().setLock(tlock); // restore la tail recursive Stack...
View Full Code Here
122
123
124
125
126
127
128
129
130
131
132
                //
                boolean loop = true;
                while (loop && interpreter.isCanIterate()) {

                    global.push();
                    rnode = enode.exec(true);
                    global.pull();

                    if (rnode != null)
                        xnode.addElement(rnode.secure());
                   
View Full Code Here
139
140
141
142
143
144
145
146
147
148
149
                     *   
                     */
                    while (interpreter.isCanIterate() && tmpn != null && xnode==null) {
                        fxarg.setNumber(nlist);
                        _clear_closure_(local);
                        tmpn = fxn.exec(true);
                        if (tmpn != null) {
                            local.clear();
                            argv = Node.createCList();
                            argv.addElement(tmpn); // argv0 = element
                            argv.addElement(new Node(nlist++)); // argv1 = index
View Full Code Here
209
210
211
212
213
214
215
216
217
218
219
                    Heap local=Heap.current();
                   
                    while (interpreter.isCanIterate() && tmpn != null) {
                        fxarg.setNumber(nlist);
                        _clear_closure_(local);
                        tmpn = fxn.exec(true);
                        if (tmpn != null) {
                            argv = Node.createCList();
                            argv.addElement(tmpn); // argv0 = element
                            argv.addElement(new Node(nlist++)); // argv1 = index
                            local.clear();
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.