Package urban.model

Examples of urban.model.Agent

125
126
127
128
129
130
131
132
133
    }
  }
  private static Collection<Agent> toAgents(Map<Node, List<Site>> lhs, List<Node> ordering) {
    List<Agent> agents = new ArrayList<Agent>();
    for(Node n : ordering){
      agents.add(new Agent(n.getName(), lhs.get(n)));
    }
    return agents;
  }
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
  }

  private void fillDAG(Data data) {
    while(!data.q.isEmpty()){
      Pair<Agent,RuleGraph> p = data.q.poll();
      Agent aL = p.fst;
      RuleGraph current = p.snd;
      for(Site s : aL.getSites()){
        String m = s.getBindingMark();
        if (m != null && !"?".equals(m) && !"_".equals(m)){
          Pair<Agent,Site> p2 = data.getLinked(aL, m);
          if (p2 != null){
            Agent a = p2.fst;
            int indexOf = data.lhs.indexOf(a);
            if (data.rgArrays[indexOf] == null){
              data.rgArrays[indexOf] = new RuleGraph(new Node(a));
              data.q.add(pairOf(a,data.rgArrays[indexOf]));
            }
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
54
55
      this.lhs = new LinkedList<Agent>(lhs);
      this.rgArrays = new RuleGraph[this.lhs.size()];
     
      Iterator<Agent> lhsIt = this.lhs.iterator();
      while(lhsIt.hasNext()) {
        Agent a = lhsIt.next();

        Iterator<Site> asIt = a.getSites().iterator();
        while(asIt.hasNext()){
          Site s = asIt.next();
         
          String m = s.getBindingMark();
          if (m != null && !"?".equals(m) && !"_".equals(m)){
View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
  @Override
  public Collection<Agent> transform(Collection<Agent> list) {
    if (list == null)
      return null;
    Agent agent = findAgentWithMostSites(list);
   
    Set<String> bindings = new HashSet<String>();
   
    for(Agent a : list){
      if (a != null){
        for (Site s : a.getSites()){
          String x = s.getBindingMark();
          if (x != null && Character.isDigit(x.charAt(0)))
            bindings.add(x);
        }
      }
    }
   
    if (bindings.size() < 1)
      return list;
   
    HashMap<String,String> mapping = new HashMap<String,String>();
   
    int i=1;
    for(Site s : agent.getSites()){
      String x = s.getBindingMark();
      if (x != null && Character.isDigit(x.charAt(0))){
        mapping.put(x, ""+i++);
        bindings.remove(x);
      }
    }
    for(String x : bindings){
      mapping.put(x, ""+i++);
    }
   
    List<Agent> result = new ArrayList<Agent>();
   
    for(Agent a : list){
      List<Site> sites = new ArrayList<Site>();
      for (Site s : a.getSites()){
        String x = s.getBindingMark();
        if (x != null && Character.isDigit(x.charAt(0))){
          sites.add(s.clone().setBindingMark(mapping.get(x)));
        } else {
          sites.add(s);
        }
      }
      result.add(new Agent(a.getName(),sites));
    }
   
    return result;
  }
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
  private Agent findAgentWithMostSites(Collection<Agent> list) {
    if (list == null)
      return null;
    int maxS =0;
    Agent maxA = null;
   
    for(Agent a : list){
      if (a != null && a.getSites() != null && a.getSites().size() > maxS){
        maxA = a;
        maxS = a.getSites().size();
View Full Code Here
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
   * @param permutations
   * @param checked
   * @param added
   */
  private static void addPinchPermutations(List<List<Agent>> permutations, List<Agent> checked, List<Agent> added) {
    Agent previous = null;
    List<Agent> checked2 = new ArrayList<Agent>();
   
    int i=0;
    for (Agent constraint : added) {
      if (previous == null){
        previous = constraint;
      } else {
        if (constraint.getName().equals(previous.getName())){
          if (canBeMerged(previous, constraint)){
            // (A.x, A.z) plus A.x (A.z .. from continuing loop
            List<Agent> todo = new ArrayList<Agent>();
            todo.add(merge(previous,constraint)); // could still be merged further
            todo.addAll(added.subList(i+1, added.size()));
View Full Code Here
132
133
134
135
136
137
138
  }
  private static Agent merge(Agent previous, Agent constraint) {
    Set<Site> set = new HashSet<Site>();
    set.addAll(previous.getSites());
    set.addAll(constraint.getSites());
    return new Agent(previous.getName(), set);
  }
View Full Code Here
144
145
146
147
148
149
150
151
152
    }
  };
 
  private void addAgent(Collection<Agent> list) {
    for(Agent a : list){
      final Agent mergeAgent = mergeAgent(a, agents.get(a.getName()));
      agents.put(a.getName(), mergeAgent);
    }
  }
View Full Code Here
155
156
157
158
159
160
161
    if (a1 == null)
      return a2;
    if (a2 == null)
      return a1;
   
    return new Agent(a1.getName(), mergeSites(a1.getSites(), a2.getSites()));
  }   
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82

  private void fillDAG(Data data) {
    while(!data.q.isEmpty()){
      Pair<Agent,RuleGraph> p = data.q.poll();
      Agent aL = p.fst;
      RuleGraph current = p.snd;
      for(Site s : aL.getSites()){
        String m = s.getBindingMark();
        if (m != null && !"?".equals(m) && !"_".equals(m)){
          Agent a = getLinked(aL, m, data.first, data.second);
          if (a != null){
            int indexOf = data.lhs.indexOf(a);
            if (data.rgArrays[indexOf] == null){
              data.rgArrays[indexOf] = new RuleGraph(new Node(a));
              data.q.add(pairOf(a,data.rgArrays[indexOf]));
View Full Code Here
TOP

Related Classes of urban.model.Agent

  • org.antlr.stringtemplate.StringTemplate
  • urban.model.info.ModelInfo
  • urban.shapes.RateCalculatorTest
  • urban.shapes.RuleFactoryTest
  • urban.transformers.AddPinchesModelTransformer
  • urban.transformers.CanonicalBindingsTransformer
  • urban.transformers.RuleGraphToRuleTransformer
  • urban.transformers.RuleToRuleGraphTransformer
  • urban.transformers.ShapeToRuleGraphTransformer
  • urban.transformers.ShapeToRuleGraphTransformer$Data
    • Copyright © 2018 www.massapicom. 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.