View Javadoc

1   /*
2   * The contents of this file are subject to the BT "ZEUS" Open Source 
3   * Licence (L77741), Version 1.0 (the "Licence"); you may not use this file 
4   * except in compliance with the Licence. You may obtain a copy of the Licence
5   * from $ZEUS_INSTALL/licence.html or alternatively from
6   * http://www.labs.bt.com/projects/agents/zeus/licence.htm
7   * 
8   * Except as stated in Clause 7 of the Licence, software distributed under the
9   * Licence is distributed WITHOUT WARRANTY OF ANY KIND, either express or 
10  * implied. See the Licence for the specific language governing rights and 
11  * limitations under the Licence.
12  * 
13  * The Original Code is within the package zeus.*.
14  * The Initial Developer of the Original Code is British Telecommunications
15  * public limited company, whose registered office is at 81 Newgate Street, 
16  * London, EC1A 7AJ, England. Portions created by British Telecommunications 
17  * public limited company are Copyright 1996-9. All Rights Reserved.
18  * 
19  * THIS NOTICE MUST BE INCLUDED ON ANY COPY OF THIS FILE
20  */
21  
22  /*
23   * @(#)s4.java 1.03b
24   */
25  
26  package zeus.actors.graphs;
27  
28  import java.util.*;
29  import zeus.util.*;
30  import zeus.concepts.*;
31  import zeus.actors.*;
32  import zeus.actors.rtn.*;
33  import zeus.actors.rtn.util.*;
34  
35  public class s4 extends Node {
36      
37     // ST 050500 1.03bB node description due to CVB
38     private String node_desc = "do/reject unwanted";
39     
40     
41     public final String getDesc()
42        {return node_desc;}
43     
44     
45     public final void setDesc(String node_desc) 
46        {this.node_desc = node_desc;}
47     // ST 050500 1.03bE 
48     
49     public s4() {
50        super("s4");
51     }
52  
53     // memory useful for backtracking
54  
55     protected int exec() {
56        // prepare output
57        Planner table = context.Planner();
58        Engine engine = context.Engine();
59  
60        //first perform join
61        Object[] data = (Object[]) input;
62        GraphStruct gs = ((DStruct)data[0]).gs;
63        gs.d_results = new Vector();
64        for(int i = 0; i < data.length; i++ ) {
65           for(int j = 0; j < ((DStruct)data[i]).results.size(); j++ )
66              gs.d_results.addElement(((DStruct)data[i]).results.elementAt(j));
67        }
68  
69        Core.DEBUG(2,"s4 Input gs " + gs);
70  
71        BindResults b = table.bind(gs.goal,gs.d_results,Planner.PLAN);
72  
73        Core.DEBUG(2,"s4 BindResults " + b);
74  
75        DelegationStruct ds;
76        if ( !b.ok ) { // send-reject to all children: they are all unselected
77           for( int i = 0; i < gs.d_results.size(); i++ ) {
78              ds = (DelegationStruct) gs.d_results.elementAt(i);
79              engine.continue_dialogue(ds.key,ds.agent,"reject-proposal",ds.goals);
80           }
81           return FAIL;
82        }
83  
84        gs.external = b.external;
85        gs.selection = Misc.union(gs.selection,b.selection);
86  
87        // send-reject to unselected children
88        for(int i = 0; i < b.rejection.size(); i++ ) {
89           ds = (DelegationStruct) b.rejection.elementAt(i);
90           engine.continue_dialogue(ds.key,ds.agent,"reject-proposal",ds.goals);
91        }
92  
93        Core.DEBUG(2,"s4 Current gs " + gs);
94        output = gs;
95        return OK;
96     }
97     protected void reset() {
98        // reset any state changed by exec()
99        Object[] data = (Object[]) input;
100       GraphStruct gs = ((DStruct)data[0]).gs;
101       gs.d_results = null;
102    }
103 }