]> gerrit.simantics Code Review - simantics/platform.git/blob - bundles/org.simantics.db.impl/src/org/simantics/db/impl/query/OrderedSet.java
65cfb007ce4e040f8014696dec1694ad58c678df
[simantics/platform.git] / bundles / org.simantics.db.impl / src / org / simantics / db / impl / query / OrderedSet.java
1 /*******************************************************************************
2  * Copyright (c) 2007, 2010 Association for Decentralized Information Management
3  * in Industry THTH ry.
4  * All rights reserved. This program and the accompanying materials
5  * are made available under the terms of the Eclipse Public License v1.0
6  * which accompanies this distribution, and is available at
7  * http://www.eclipse.org/legal/epl-v10.html
8  *
9  * Contributors:
10  *     VTT Technical Research Centre of Finland - initial API and implementation
11  *******************************************************************************/
12 package org.simantics.db.impl.query;
13
14 import java.util.ArrayList;
15 import java.util.concurrent.Semaphore;
16
17 import org.simantics.db.common.exception.DebugException;
18 import org.simantics.db.impl.graph.ReadGraphImpl;
19 import org.simantics.db.impl.procedure.IntProcedureAdapter;
20 import org.simantics.db.procedure.ListenerBase;
21
22 final public class OrderedSet extends CollectionUnaryQuery<IntProcedure> {
23         
24 //      public ArrayList<IntProcedure> procs = null;
25
26         public OrderedSet(final int r) {
27         super(r);
28     }
29
30     final static OrderedSet entry(final QueryProcessor provider, final int r) {
31         
32         return (OrderedSet)provider.orderedSetMap.get(r);
33
34     }
35         
36     final static void runner(ReadGraphImpl graph, final int r, final QueryProcessor provider, OrderedSet cached, final CacheEntry parent, ListenerBase listener, final IntProcedure procedure) {
37         
38         OrderedSet entry = cached != null ? cached : (OrderedSet)provider.orderedSetMap.get(r); 
39         if(entry == null) {
40                 
41                 entry = new OrderedSet(r);
42                 entry.setPending();
43                 entry.clearResult(provider.querySupport);
44                 entry.putEntry(provider);
45                 
46             provider.performForEach(graph, entry, parent, listener, procedure);
47             
48         } else {
49
50             if(entry.isPending()) {
51                 synchronized(entry) {
52                     if(entry.isPending()) {
53                         throw new IllegalStateException();
54 //                      if(entry.procs == null) entry.procs = new ArrayList<IntProcedure>();
55 //                      entry.procs.add(procedure);
56 //                        provider.registerDependencies(graph, entry, parent, listener, procedure, false);
57 //                      return;
58                     }
59                 }
60             }
61             provider.performForEach(graph, entry, parent, listener, procedure);
62         }
63
64     }
65     
66     final public static void queryEach(ReadGraphImpl graph, final int r, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final IntProcedure procedure) {
67         
68         assert(r != 0);
69         
70         final OrderedSet entry = (OrderedSet)provider.orderedSetMap.get(r);
71         
72         if(parent == null && !(listener != null)) {
73                 if(entry != null && entry.isReady()) { 
74                         entry.performFromCache(graph, provider, procedure);
75                         return;
76                 }
77         }
78
79         runner(graph, r, provider, entry, parent, listener, procedure);
80          
81     }
82
83     @Override
84     public UnaryQuery<IntProcedure> getEntry(QueryProcessor provider) {
85         return provider.orderedSetMap.get(id);
86     }
87         
88         @Override
89         public void putEntry(QueryProcessor provider) {
90             provider.orderedSetMap.put(id, this);
91         }
92
93         @Override
94         final public void removeEntry(QueryProcessor provider) {
95         provider.orderedSetMap.remove(id);
96         }
97     
98         private int current = 0;
99
100         private boolean nextElement(ReadGraphImpl graph, final QueryProcessor provider, final IntProcedure procedure, final boolean store) {
101             
102                 provider.querySupport.ensureLoaded(graph, current);             
103                 
104                 boolean found = provider.querySupport.getObjects(graph, current, id, new IntProcedure() {
105
106                         @Override
107                         public void execute(ReadGraphImpl graph, int i) {
108                                 if(i != id) {
109                                         addOrSet(i);
110                                         procedure.execute(graph, i);
111                                 }
112                                 current = i;
113                         }
114
115                         @Override
116                         public void exception(ReadGraphImpl graph, Throwable t) {
117                                 if(DebugException.DEBUG) new DebugException(t).printStackTrace();
118                                 procedure.exception(graph, t);
119                         }
120
121                         @Override
122                         public void finished(ReadGraphImpl graph) {
123                         }
124
125                 });
126
127                 if(!found) current = id;
128
129                 if(current == id) {
130                         finish(graph, provider);
131                         procedure.finished(graph);
132                         return false;
133                 } else {
134                         return true;
135                 }
136
137         }
138         
139     @Override
140     public void clearResult(QuerySupport support) {
141         current = id;
142         setResult(new IntArray());
143     }
144         
145     @Override
146     public Object computeForEach(ReadGraphImpl graph, final QueryProcessor provider, final IntProcedure procedure, final boolean store) {
147
148         while(nextElement(graph, provider, procedure, store));
149         
150         return getResult();
151         
152     }
153     
154     @Override
155     public String toString() {
156         return "OrderedSet[" + id + "]";
157     }
158
159     final private void finish(ReadGraphImpl graph, QueryProcessor provider) {
160         
161         assert(isPending());
162
163 //        ArrayList<IntProcedure> p = null;
164
165         synchronized(this) {
166
167                 setReady();
168 //            p = procs;
169 //            procs = null; 
170         
171         }
172         
173 //        if(p != null) {
174 //              IntArray v = (IntArray)getResult();
175 //              if(v.data == null) {
176 //                  if(v.sizeOrData != IntArray.NO_DATA) {
177 //                      for(IntProcedure proc : p) proc.execute(graph, v.sizeOrData);
178 //                  }
179 //              } else {
180 //                  for(IntProcedure proc : p) {
181 //                      for(int i = 0;i < v.sizeOrData ; i++) proc.execute(graph, v.data[i]);
182 //                  }
183 //              }
184 //              for(IntProcedure proc : p) proc.finished(graph);
185 //        }
186
187     }
188
189     final public void addOrSet(int add) {
190         
191         assert(isPending());
192         
193         IntArray value = (IntArray)getResult();
194         value.add(add);
195         
196     }
197
198     @Override
199     public Object performFromCache(ReadGraphImpl graph, QueryProcessor provider, final IntProcedure procedure) {
200         
201         assert(isReady());
202
203         if(handleException(graph, procedure)) return EXCEPTED;
204         
205         final IntArray value = (IntArray)getResult();
206         if(value.data == null) {
207             if(value.sizeOrData != IntArray.NO_DATA) procedure.execute(graph, value.sizeOrData);
208         } else {
209             for(int i = 0;i < value.sizeOrData ; i++) procedure.execute(graph, value.data[i]);
210         }
211
212         procedure.finished(graph);
213         
214         return value;
215         
216     }
217     
218     @Override
219     public void recompute(ReadGraphImpl graph, QueryProcessor provider) {
220         
221         final Semaphore s = new Semaphore(0);
222         
223         computeForEach(graph, provider, new IntProcedureAdapter() {
224
225             @Override
226             public void finished(ReadGraphImpl graph) {
227                 s.release();
228             }
229                         
230                         @Override
231                         public void exception(ReadGraphImpl graph, Throwable t) {
232                                 throw new Error("Error in recompute.", t);
233             }
234
235         }, true);
236         
237         while(!s.tryAcquire()) {
238                 provider.resume(graph);
239         }
240         
241     }
242     
243 }