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