1 /*******************************************************************************
2 * Copyright (c) 2007, 2010 Association for Decentralized Information Management
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
10 * VTT Technical Research Centre of Finland - initial API and implementation
11 *******************************************************************************/
12 package org.simantics.db.impl.query;
14 import java.util.ArrayList;
15 import java.util.concurrent.Semaphore;
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;
22 final public class OrderedSet extends CollectionUnaryQuery<IntProcedure> {
24 public OrderedSet(final int r) {
28 final static OrderedSet entry(final QueryProcessor provider, final int r) {
30 return (OrderedSet)provider.cache.orderedSetMap.get(r);
34 final static void runner(ReadGraphImpl graph, final int r, final QueryProcessor provider, OrderedSet cached, final CacheEntry parent, ListenerBase listener, final IntProcedure procedure) {
36 OrderedSet entry = cached != null ? cached : (OrderedSet)provider.cache.orderedSetMap.get(r);
39 entry = new OrderedSet(r);
41 entry.clearResult(provider.querySupport);
42 entry.putEntry(provider);
44 provider.performForEach(graph, entry, parent, listener, procedure);
48 if(entry.isPending()) {
50 if(entry.isPending()) {
51 throw new IllegalStateException();
52 // if(entry.procs == null) entry.procs = new ArrayList<IntProcedure>();
53 // entry.procs.add(procedure);
54 // provider.registerDependencies(graph, entry, parent, listener, procedure, false);
59 provider.performForEach(graph, entry, parent, listener, procedure);
64 final public static void queryEach(ReadGraphImpl graph, final int r, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final IntProcedure procedure) {
68 final OrderedSet entry = (OrderedSet)provider.cache.orderedSetMap.get(r);
70 if(parent == null && !(listener != null)) {
71 if(entry != null && entry.isReady()) {
72 entry.performFromCache(graph, provider, procedure);
77 runner(graph, r, provider, entry, parent, listener, procedure);
82 public UnaryQuery<IntProcedure> getEntry(QueryProcessor provider) {
83 return provider.cache.orderedSetMap.get(id);
87 public void putEntry(QueryProcessor provider) {
88 provider.cache.orderedSetMap.put(id, this);
92 final public void removeEntry(QueryProcessor provider) {
93 provider.cache.orderedSetMap.remove(id);
96 private int current = 0;
98 private boolean nextElement(ReadGraphImpl graph, final QueryProcessor provider, final IntProcedure procedure, final boolean store) {
100 provider.querySupport.ensureLoaded(graph, current);
102 boolean found = provider.querySupport.getObjects(graph, current, id, new IntProcedure() {
105 public void execute(ReadGraphImpl graph, int i) {
108 procedure.execute(graph, i);
114 public void exception(ReadGraphImpl graph, Throwable t) {
115 if(DebugException.DEBUG) new DebugException(t).printStackTrace();
116 procedure.exception(graph, t);
120 public void finished(ReadGraphImpl graph) {
125 if(!found) current = id;
128 finish(graph, provider);
129 procedure.finished(graph);
138 public void clearResult(QuerySupport support) {
140 setResult(new IntArray());
144 public Object computeForEach(ReadGraphImpl graph, final QueryProcessor provider, final IntProcedure procedure, final boolean store) {
146 while(nextElement(graph, provider, procedure, store));
153 public String toString() {
154 return "OrderedSet[" + id + "]";
157 final private void finish(ReadGraphImpl graph, QueryProcessor provider) {
161 // ArrayList<IntProcedure> p = null;
172 // IntArray v = (IntArray)getResult();
173 // if(v.data == null) {
174 // if(v.sizeOrData != IntArray.NO_DATA) {
175 // for(IntProcedure proc : p) proc.execute(graph, v.sizeOrData);
178 // for(IntProcedure proc : p) {
179 // for(int i = 0;i < v.sizeOrData ; i++) proc.execute(graph, v.data[i]);
182 // for(IntProcedure proc : p) proc.finished(graph);
187 final public void addOrSet(int add) {
191 IntArray value = (IntArray)getResult();
197 public Object performFromCache(ReadGraphImpl graph, QueryProcessor provider, final IntProcedure procedure) {
201 if(handleException(graph, procedure)) return EXCEPTED;
203 final IntArray value = (IntArray)getResult();
204 if(value.data == null) {
205 if(value.sizeOrData != IntArray.NO_DATA) procedure.execute(graph, value.sizeOrData);
207 for(int i = 0;i < value.sizeOrData ; i++) procedure.execute(graph, value.data[i]);
210 procedure.finished(graph);
217 public void recompute(ReadGraphImpl graph, QueryProcessor provider) {
219 final Semaphore s = new Semaphore(0);
221 computeForEach(graph, provider, new IntProcedureAdapter() {
224 public void finished(ReadGraphImpl graph) {
229 public void exception(ReadGraphImpl graph, Throwable t) {
230 throw new Error("Error in recompute.", t);
235 while(!s.tryAcquire()) {
236 provider.resume(graph);