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
10 * VTT Technical Research Centre of Finland - initial API and implementation
\r
11 *******************************************************************************/
\r
12 package org.simantics.db.impl.query;
\r
14 import java.util.ArrayList;
\r
15 import java.util.concurrent.Semaphore;
\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
22 final public class OrderedSet extends CollectionUnaryQuery<IntProcedure> {
\r
24 // public ArrayList<IntProcedure> procs = null;
\r
26 public OrderedSet(final int r) {
\r
30 final static OrderedSet entry(final QueryProcessor provider, final int r) {
\r
32 return (OrderedSet)provider.orderedSetMap.get(r);
\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
38 OrderedSet entry = cached != null ? cached : (OrderedSet)provider.orderedSetMap.get(r);
\r
41 entry = new OrderedSet(r);
\r
43 entry.clearResult(provider.querySupport);
\r
44 entry.putEntry(provider);
\r
46 provider.performForEach(graph, entry, parent, listener, procedure);
\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
61 provider.performForEach(graph, entry, parent, listener, procedure);
\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
70 final OrderedSet entry = (OrderedSet)provider.orderedSetMap.get(r);
\r
72 if(parent == null && !(listener != null)) {
\r
73 if(entry != null && entry.isReady()) {
\r
74 entry.performFromCache(graph, provider, procedure);
\r
79 runner(graph, r, provider, entry, parent, listener, procedure);
\r
84 public UnaryQuery<IntProcedure> getEntry(QueryProcessor provider) {
\r
85 return provider.orderedSetMap.get(id);
\r
89 public void putEntry(QueryProcessor provider) {
\r
90 provider.orderedSetMap.put(id, this);
\r
94 final public void removeEntry(QueryProcessor provider) {
\r
95 provider.orderedSetMap.remove(id);
\r
98 private int current = 0;
\r
100 private boolean nextElement(ReadGraphImpl graph, final QueryProcessor provider, final IntProcedure procedure, final boolean store) {
\r
102 provider.querySupport.ensureLoaded(graph, current);
\r
104 boolean found = provider.querySupport.getObjects(graph, current, id, new IntProcedure() {
\r
107 public void execute(ReadGraphImpl graph, int i) {
\r
110 procedure.execute(graph, i);
\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
122 public void finished(ReadGraphImpl graph) {
\r
127 if(!found) current = id;
\r
129 if(current == id) {
\r
130 finish(graph, provider);
\r
131 procedure.finished(graph);
\r
140 public void clearResult(QuerySupport support) {
\r
142 setResult(new IntArray());
\r
146 public Object computeForEach(ReadGraphImpl graph, final QueryProcessor provider, final IntProcedure procedure, final boolean store) {
\r
148 while(nextElement(graph, provider, procedure, store));
\r
150 return getResult();
\r
155 public String toString() {
\r
156 return "OrderedSet[" + id + "]";
\r
159 final private void finish(ReadGraphImpl graph, QueryProcessor provider) {
\r
161 assert(isPending());
\r
163 // ArrayList<IntProcedure> p = null;
\r
165 synchronized(this) {
\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
180 // for(IntProcedure proc : p) {
\r
181 // for(int i = 0;i < v.sizeOrData ; i++) proc.execute(graph, v.data[i]);
\r
184 // for(IntProcedure proc : p) proc.finished(graph);
\r
189 final public void addOrSet(int add) {
\r
191 assert(isPending());
\r
193 IntArray value = (IntArray)getResult();
\r
199 public Object performFromCache(ReadGraphImpl graph, QueryProcessor provider, final IntProcedure procedure) {
\r
203 if(handleException(graph, procedure)) return EXCEPTED;
\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
209 for(int i = 0;i < value.sizeOrData ; i++) procedure.execute(graph, value.data[i]);
\r
212 procedure.finished(graph);
\r
219 public void recompute(ReadGraphImpl graph, QueryProcessor provider) {
\r
221 final Semaphore s = new Semaphore(0);
\r
223 computeForEach(graph, provider, new IntProcedureAdapter() {
\r
226 public void finished(ReadGraphImpl graph) {
\r
231 public void exception(ReadGraphImpl graph, Throwable t) {
\r
232 throw new Error("Error in recompute.", t);
\r
237 while(!s.tryAcquire()) {
\r
238 provider.resume(graph);
\r