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.Arrays;
16 import java.util.concurrent.Semaphore;
18 import org.simantics.db.impl.graph.ReadGraphImpl;
19 import org.simantics.db.impl.procedure.IntProcedureAdapter;
20 import org.simantics.db.impl.procedure.InternalProcedure;
21 import org.simantics.db.procedure.ListenerBase;
23 import gnu.trove.procedure.TIntProcedure;
24 import gnu.trove.set.hash.TIntHashSet;
26 final public class PrincipalTypes extends CollectionUnaryQuery<IntProcedure> {
28 private PrincipalTypes(final int resource) {
32 final static PrincipalTypes entry(final QueryProcessor provider, final int r) {
33 return (PrincipalTypes)provider.cache.principalTypesMap.get(r);
36 final static void runner(ReadGraphImpl graph, final int r, final CacheEntry parent, final ListenerBase listener, final IntProcedure procedure) {
38 QueryProcessor processor = graph.processor;
40 PrincipalTypes entry = (PrincipalTypes)processor.cache.principalTypesMap.get(r);
43 entry = new PrincipalTypes(r);
45 entry.clearResult(processor.querySupport);
46 entry.putEntry(processor);
48 processor.performForEach(graph, entry, parent, listener, procedure);
52 if(entry.isPending()) {
54 if(entry.isPending()) {
55 throw new IllegalStateException();
56 // if(entry.procs == null) entry.procs = new ArrayList<IntProcedure>(1);
57 // entry.procs.add(procedure);
58 // processor.registerDependencies(graph, entry, parent, listener, procedure, false);
63 processor.performForEach(graph, entry, parent, listener, procedure);
68 final public static void queryEach(ReadGraphImpl graph, final int r, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final IntProcedure procedure) {
72 if(parent == null && listener == null) {
73 PrincipalTypes.computeForEach(graph, r, null, graph.processor, procedure);
75 runner(graph, r, parent, listener, procedure);
81 public UnaryQuery<IntProcedure> getEntry(QueryProcessor provider) {
82 return provider.cache.principalTypesMap.get(id);
86 public void putEntry(QueryProcessor provider) {
87 provider.cache.principalTypesMap.put(id, this);
91 final public void removeEntry(QueryProcessor provider) {
92 provider.cache.principalTypesMap.remove(id);
97 private TIntHashSet set = null;
98 public int single = 0;
100 public boolean add(int val) {
101 if(single == val) return false;
106 if(set == null) set = new TIntHashSet(4);
113 if(single == 0) return 0;
114 if(set == null) return 1;
115 return set.size() + 1;
119 public int[] toArray() {
121 int[] result = Arrays.copyOf(set.toArray(), set.size() + 1);
122 result[set.size()] = single;
127 public void forEach(TIntProcedure proc) {
128 proc.execute(single);
129 if(set != null) set.forEach(proc);
135 public Object computeForEach(final ReadGraphImpl procedureGraph, final QueryProcessor provider, final IntProcedure proc, final boolean store) {
137 return computeForEach(procedureGraph, id, this, provider, proc);
141 public static Object computeForEach(final ReadGraphImpl graph, final int id, final PrincipalTypes entry, final QueryProcessor provider, final IntProcedure proc) {
143 provider.querySupport.ensureLoaded(graph, id);
146 int ret = provider.querySupport.getSingleInstance(id);
150 entry.finish(graph, provider);
152 proc.execute(graph, ret);
153 proc.finished(graph);
157 final int instanceOf = provider.getInstanceOf();
158 final int inherits = provider.getInherits();
159 final int subrelationOf = provider.getSubrelationOf();
161 final Koss indirect = new Koss();
162 final Koss material = new Koss();
164 IntProcedure directProc = new IntProcedure() {
167 public void execute(ReadGraphImpl graph, int i) {
172 public void exception(ReadGraphImpl graph, Throwable t) {
173 proc.exception(graph, t);
177 public void finished(ReadGraphImpl graph) {
182 IntProcedure indirectProc = new IntProcedure() {
185 public void execute(ReadGraphImpl graph, int i) {
190 public void exception(ReadGraphImpl graph, Throwable t) {
191 proc.exception(graph, t);
195 public void finished(ReadGraphImpl graph) {
200 provider.querySupport.getObjects(graph, id, instanceOf, directProc);
201 provider.querySupport.getObjects(graph, id, inherits, indirectProc);
202 provider.querySupport.getObjects(graph, id, subrelationOf, indirectProc);
204 if(indirect.size() == 0) {
205 int size = material.size();
207 if(entry != null) entry.finish(graph, provider);
208 proc.finished(graph);
210 } else if(size == 1) {
211 int single = material.single;
214 entry.finish(graph, provider);
216 proc.execute(graph, single);
217 proc.finished(graph);
220 addPrincipalType(graph, new TIntHashSet(4), material.toArray(), 0, provider, entry, proc);
225 // final AtomicInteger finishes = new AtomicInteger(0);
227 indirect.forEach(new TIntProcedure() {
232 public boolean execute(final int arg0) {
236 int current = (++finishes);
237 if(current == indirect.size()) {
238 int size = material.size();
240 if(entry != null) entry.finish(graph, provider);
241 proc.finished(graph);
243 } else if(size == 1) {
244 int single = material.single;
247 entry.finish(graph, provider);
249 proc.execute(graph, single);
250 proc.finished(graph);
253 addPrincipalType(graph, new TIntHashSet(4), material.toArray(), 0, provider, entry, proc);
260 PrincipalTypes.queryEach(graph, arg0, provider, entry, null, new IntProcedure() {
263 public void execute(ReadGraphImpl graph, int i) {
264 synchronized(material) {
270 public void finished(ReadGraphImpl graph) {
272 int current = (++finishes);
273 if(current == indirect.size()) {
274 int size = material.size();
276 if(entry != null) entry.finish(graph, provider);
277 proc.finished(graph);
279 } else if(size == 1) {
280 int single = material.single;
283 entry.finish(graph, provider);
285 proc.execute(graph, single);
286 proc.finished(graph);
289 addPrincipalType(graph, new TIntHashSet(4), material.toArray(), 0, provider, entry, proc);
297 public void exception(ReadGraphImpl graph, Throwable t) {
298 proc.exception(graph, t);
313 private static void finish(ReadGraphImpl graph, final TIntHashSet rejects, final int[] material, final PrincipalTypes entry, final QueryProcessor provider, final IntProcedure proc) {
316 for(int i : material) {
317 if(!rejects.contains(i)) {
321 entry.finish(graph, provider);
324 for(int i : material) {
325 if(!rejects.contains(i)) {
326 proc.execute(graph, i);
330 proc.finished(graph);
336 private static void addPrincipalType(final ReadGraphImpl graph, final TIntHashSet rejects, final int[] material, int index, final QueryProcessor provider, final PrincipalTypes entry, final IntProcedure proc) {
338 // if((counter++ % 500) == 0) System.out.println("PT " + counter + " mat = " + material.length);
340 if(index == material.length) {
341 finish(graph, rejects, material, entry, provider, proc);
345 int type = material[index++];
346 while(rejects.contains(type)) {
347 if(index == material.length) {
348 finish(graph, rejects, material, entry, provider, proc);
351 type = material[index++];
353 final int nextIndex = index;
355 SuperTypes.queryEach(graph, type, provider, entry, null, new InternalProcedure<IntSet>() {
358 public void execute(ReadGraphImpl graph, IntSet supers) {
360 synchronized(rejects) {
362 supers.forEach(new TIntProcedure() {
365 public boolean execute(int arg0) {
374 addPrincipalType(graph, rejects, material, nextIndex, provider, entry, proc);
379 public void exception(ReadGraphImpl graph, Throwable t) {
380 proc.exception(graph, t);
388 public String toString() {
389 return "PrincipalTypes[" + id + "]";
392 final private void add(int val) {
394 IntArray v = (IntArray)getResult();
398 final private void finish(ReadGraphImpl graph, QueryProcessor provider) {
402 // ArrayList<IntProcedure> p = null;
414 // IntArray v = (IntArray)getResult();
416 // if(v.data == null) {
417 // if(v.sizeOrData != IntArray.NO_DATA) {
418 // for(IntProcedure proc : p) proc.execute(graph, v.sizeOrData);
421 // for(IntProcedure proc : p) {
422 // for(int i = 0;i < v.sizeOrData ; i++) proc.execute(graph, v.data[i]);
427 // for(IntProcedure proc : p) proc.finished(graph);
435 public Object performFromCache(ReadGraphImpl graph, QueryProcessor provider, final IntProcedure procedure) {
439 if(handleException(graph, procedure)) return EXCEPTED;
441 final IntArray value = (IntArray)getResult();
442 if(value.data == null) {
443 if(value.sizeOrData != IntArray.NO_DATA) procedure.execute(graph, value.sizeOrData);
445 for(int i = 0;i < value.sizeOrData ; i++) procedure.execute(graph, value.data[i]);
448 procedure.finished(graph);
455 public void recompute(ReadGraphImpl graph, QueryProcessor provider) {
457 final Semaphore s = new Semaphore(0);
459 computeForEach(graph, provider, new IntProcedureAdapter() {
462 public void finished(ReadGraphImpl graph) {
467 public void exception(ReadGraphImpl graph, Throwable t) {
469 new Error("Error in recompute.", t).printStackTrace();
474 while(!s.tryAcquire()) {
475 provider.resume(graph);
482 boolean isImmutable(ReadGraphImpl graph) {
483 return graph.processor.isImmutable(id);
487 protected void fillImpliedParents(QueryProcessor processor, ArrayList<CacheEntry> result) {
488 // for(Objects o : Objects.entries(processor, id)) result.add(o);