-/*******************************************************************************\r
- * Copyright (c) 2007, 2010 Association for Decentralized Information Management\r
- * in Industry THTH ry.\r
- * All rights reserved. This program and the accompanying materials\r
- * are made available under the terms of the Eclipse Public License v1.0\r
- * which accompanies this distribution, and is available at\r
- * http://www.eclipse.org/legal/epl-v10.html\r
- *\r
- * Contributors:\r
- * VTT Technical Research Centre of Finland - initial API and implementation\r
- *******************************************************************************/\r
-package org.simantics.db.impl.query;\r
-\r
-import java.util.ArrayList;\r
-import java.util.concurrent.Semaphore;\r
-\r
-import org.simantics.db.RelationInfo;\r
-import org.simantics.db.impl.graph.ReadGraphImpl;\r
-import org.simantics.db.impl.procedure.IntProcedureAdapter;import org.simantics.db.impl.procedure.InternalProcedure;\r
-import org.simantics.db.procedure.ListenerBase;\r
-\r
-\r
-final public class AssertedPredicates extends CollectionUnaryQuery<IntProcedure> {\r
- \r
-// public ArrayList<IntProcedure> procs = null;\r
- \r
- public AssertedPredicates(final int r) {\r
- super(r);\r
- }\r
-\r
- public static AssertedPredicates newInstance(final int r) {\r
- return new AssertedPredicates(r);\r
- }\r
- \r
- final static void runner(ReadGraphImpl graph, final int r, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final IntProcedure procedure) {\r
-\r
- AssertedPredicates entry = (AssertedPredicates)provider.assertedPredicatesMap.get(r);\r
- if(entry == null) {\r
- \r
- entry = new AssertedPredicates(r);\r
- entry.setPending();\r
- entry.clearResult(provider.querySupport);\r
- entry.putEntry(provider);\r
- \r
- provider.performForEach(graph, entry, parent, listener, procedure);\r
- \r
- } else {\r
- \r
- if(!entry.isReady()) {\r
- synchronized(entry) {\r
- if(!entry.isReady()) {\r
- throw new IllegalStateException();\r
-// if(entry.procs == null) entry.procs = new ArrayList<IntProcedure>();\r
-// entry.procs.add(procedure);\r
-// return;\r
- }\r
- }\r
- }\r
- provider.performForEach(graph, entry, parent, listener, procedure);\r
- }\r
-\r
- }\r
- \r
- final public static void queryEach(ReadGraphImpl graph, final int r, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final IntProcedure procedure) {\r
- \r
- if(parent == null && listener == null) {\r
- AssertedPredicates entry = (AssertedPredicates)provider.assertedPredicatesMap.get(r);\r
- if(entry != null && entry.isReady()) { \r
- entry.performFromCache(graph, provider, procedure);\r
- return;\r
- }\r
- }\r
- \r
- runner(graph, r, provider, parent, listener, procedure);\r
- \r
- }\r
-\r
- @Override\r
- public UnaryQuery<IntProcedure> getEntry(QueryProcessor provider) {\r
- return provider.assertedPredicatesMap.get(id);\r
- }\r
- \r
- @Override\r
- public void putEntry(QueryProcessor provider) {\r
- provider.assertedPredicatesMap.put(id, this);\r
- }\r
-\r
- @Override\r
- final public void removeEntry(QueryProcessor provider) {\r
- provider.assertedPredicatesMap.remove(id);\r
- }\r
- \r
- void computeInheritedAssertions(ReadGraphImpl graph, int type, final QueryProcessor queryProvider, final IntProcedure proc, final boolean store) {\r
-\r
- DirectObjects.queryEach(graph, type, queryProvider.getInherits(), queryProvider, this, null, new SyncIntProcedure() {\r
-\r
- @Override\r
- public void run(ReadGraphImpl graph) {\r
- \r
-// finish(graph, queryProvider);\r
-// proc.finished(graph);\r
- \r
- }\r
-\r
- @Override\r
- public void execute(ReadGraphImpl graph,int inh) {\r
-\r
- inc();\r
- \r
- AssertedPredicates.queryEach(graph, inh, queryProvider, AssertedPredicates.this, null, new IntProcedure() {\r
-\r
- @Override\r
- public void execute(ReadGraphImpl graph, int ass) {\r
- \r
- addOrSet(ass);\r
-// proc.execute(graph, ass);\r
- \r
- }\r
-\r
- @Override\r
- public void finished(ReadGraphImpl graph) {\r
- dec(graph);\r
- }\r
- \r
- @Override\r
- public void exception(ReadGraphImpl graph, Throwable t) {\r
-// proc.exception(graph, t);\r
- }\r
- \r
- });\r
- \r
- }\r
-\r
- @Override\r
- public void finished(ReadGraphImpl graph) {\r
- \r
- dec(graph);\r
- \r
- }\r
- \r
- });\r
-\r
- }\r
-\r
- @Override\r
- public Object computeForEach(ReadGraphImpl graph, final QueryProcessor queryProvider, final IntProcedure proc, final boolean store) {\r
-\r
- computeInheritedAssertions(graph, id, queryProvider, proc, store);\r
-\r
- DirectObjects.queryEach(graph, id, queryProvider.getAsserts(), queryProvider, this, null, new IntProcedure() {\r
-\r
- @Override\r
- public void execute(ReadGraphImpl graph, final int ass) {\r
- \r
- DirectObjects.queryEach(graph, ass, queryProvider.getHasPredicate(), queryProvider, AssertedPredicates.this, null, new IntProcedure() {\r
-\r
- @Override\r
- public void execute(ReadGraphImpl graph, final int pred) {\r
-\r
- addOrSetHiding(graph, pred, AssertedPredicates.this);\r
-// proc.execute(graph, pred);\r
- return;\r
- \r
- }\r
-\r
- @Override\r
- public void finished(ReadGraphImpl graph) {\r
- }\r
- \r
- @Override\r
- public void exception(ReadGraphImpl graph, Throwable t) {\r
-// proc.exception(graph, t);\r
- }\r
-\r
- });\r
- \r
- }\r
-\r
- @Override\r
- public void finished(ReadGraphImpl graph) {\r
- }\r
-\r
- @Override\r
- public void exception(ReadGraphImpl graph, Throwable t) {\r
-// proc.exception(graph, t);\r
- }\r
- \r
- });\r
- \r
- finish(graph, queryProvider);\r
-\r
- performFromCache(graph, queryProvider, proc);\r
- \r
- return getResult();\r
- \r
- }\r
- \r
- @Override\r
- public String toString() {\r
- return "AssertedPredicates[" + id + "]";\r
- }\r
- \r
- final public void finish(ReadGraphImpl graph, QueryProcessor provider) {\r
- \r
- assert(!isReady());\r
-\r
-// ArrayList<IntProcedure> p = null;\r
-\r
- synchronized(this) {\r
-\r
- setReady();\r
-// p = procs;\r
-// procs = null; \r
- \r
- }\r
-\r
-// if(p != null) {\r
-// IntArray v = (IntArray)getResult();\r
-// if(v.data == null) {\r
-// if(v.sizeOrData != IntArray.NO_DATA) {\r
-// for(IntProcedure proc : p) proc.execute(graph, v.sizeOrData);\r
-// }\r
-// } else {\r
-// for(IntProcedure proc : p) {\r
-// for(int i = 0;i < v.sizeOrData ; i++) proc.execute(graph, v.data[i]);\r
-// }\r
-// }\r
-// \r
-// for(IntProcedure proc : p) proc.finished(graph);\r
-// }\r
-\r
- }\r
-\r
- synchronized private void addOrSet(int add) {\r
-\r
- assert(isPending());\r
- \r
- IntArray value = (IntArray)getResult(); \r
- value.add(add);\r
- \r
- }\r
-\r
- final static InternalProcedure<RelationInfo> ip = new InternalProcedure<RelationInfo>() {\r
-\r
- @Override\r
- public void execute(ReadGraphImpl graph, RelationInfo result) {\r
- }\r
-\r
- @Override\r
- public void exception(ReadGraphImpl graph, Throwable throwable) {\r
- }\r
-\r
- };\r
-\r
- final static InternalProcedure<IntSet> ip2 = new InternalProcedure<IntSet>() {\r
-\r
- @Override\r
- public void execute(ReadGraphImpl graph, IntSet result) {\r
- }\r
-\r
- @Override\r
- public void exception(ReadGraphImpl graph, Throwable throwable) {\r
- }\r
-\r
- };\r
-\r
- synchronized private void addOrSetHiding(ReadGraphImpl graph, int add, CacheEntry parent) {\r
-\r
- assert(isPending());\r
- \r
- IntArray value = (IntArray)getResult(); \r
- RelationInfo ri = RelationInfoQuery.queryEach(graph, add, graph.processor, parent, null, ip);\r
- if(ri.isFunctional) {\r
- // Replace existing functional predicate if found\r
- try {\r
- IntSet supers = SuperRelations.queryEach2(graph, add, graph.processor, parent, null, ip2);\r
- if(value.data == null) {\r
- if(value.sizeOrData != IntArray.NO_DATA) {\r
- if(supers.contains(value.sizeOrData)) {\r
- value.sizeOrData = add;\r
- return;\r
- }\r
- }\r
- } else {\r
- for(int i = 0;i < value.sizeOrData ; i++) {\r
- if(supers.contains(value.data[i])) {\r
- value.data[i] = add;\r
- return;\r
- }\r
- }\r
- }\r
- } catch (Throwable e) {\r
- except(e);\r
- return;\r
- }\r
- }\r
- \r
- // No replacement - append\r
- value.add(add);\r
-\r
- }\r
- \r
- @Override\r
- public Object performFromCache(ReadGraphImpl graph, QueryProcessor provider, final IntProcedure procedure) {\r
-\r
- assert(isReady());\r
- \r
- if(handleException(graph, procedure)) return EXCEPTED;\r
- \r
- final IntArray value = (IntArray)getResult();\r
- if(value.data == null) {\r
- if(value.sizeOrData != IntArray.NO_DATA) procedure.execute(graph, value.sizeOrData);\r
- } else {\r
- for(int i = 0;i < value.sizeOrData ; i++) procedure.execute(graph, value.data[i]);\r
- }\r
-\r
- procedure.finished(graph);\r
- \r
- return value;\r
- \r
- }\r
- \r
- @Override\r
- public void recompute(ReadGraphImpl graph, QueryProcessor provider) {\r
- \r
- final Semaphore s = new Semaphore(0);\r
-\r
- computeForEach(graph, provider, new IntProcedureAdapter() {\r
-\r
- @Override\r
- public void finished(ReadGraphImpl graph) {\r
- s.release();\r
- }\r
-\r
- @Override\r
- public void exception(ReadGraphImpl graph, Throwable t) {\r
- s.release();\r
- new Error("Error in recompute.", t).printStackTrace();\r
- }\r
-\r
- }, true);\r
-\r
- while(!s.tryAcquire()) {\r
- provider.resume(graph);\r
- }\r
- \r
- }\r
- \r
- \r
-}\r
+/*******************************************************************************
+ * Copyright (c) 2007, 2010 Association for Decentralized Information Management
+ * in Industry THTH ry.
+ * All rights reserved. This program and the accompanying materials
+ * are made available under the terms of the Eclipse Public License v1.0
+ * which accompanies this distribution, and is available at
+ * http://www.eclipse.org/legal/epl-v10.html
+ *
+ * Contributors:
+ * VTT Technical Research Centre of Finland - initial API and implementation
+ *******************************************************************************/
+package org.simantics.db.impl.query;
+
+import java.util.concurrent.Semaphore;
+
+import org.simantics.db.RelationInfo;
+import org.simantics.db.impl.graph.ReadGraphImpl;
+import org.simantics.db.impl.procedure.IntProcedureAdapter;
+import org.simantics.db.impl.procedure.InternalProcedure;
+import org.simantics.db.procedure.ListenerBase;
+
+
+final public class AssertedPredicates extends CollectionUnaryQuery<IntProcedure> {
+
+// public ArrayList<IntProcedure> procs = null;
+
+ public AssertedPredicates(final int r) {
+ super(r);
+ }
+
+ public static AssertedPredicates newInstance(final int r) {
+ return new AssertedPredicates(r);
+ }
+
+ final static void runner(ReadGraphImpl graph, final int r, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final IntProcedure procedure) {
+
+ AssertedPredicates entry = (AssertedPredicates)provider.assertedPredicatesMap.get(r);
+ if(entry == null) {
+
+ entry = new AssertedPredicates(r);
+ entry.setPending();
+ entry.clearResult(provider.querySupport);
+ entry.putEntry(provider);
+
+ provider.performForEach(graph, entry, parent, listener, procedure);
+
+ } else {
+
+ if(!entry.isReady()) {
+ synchronized(entry) {
+ if(!entry.isReady()) {
+ throw new IllegalStateException();
+// if(entry.procs == null) entry.procs = new ArrayList<IntProcedure>();
+// entry.procs.add(procedure);
+// return;
+ }
+ }
+ }
+ provider.performForEach(graph, entry, parent, listener, procedure);
+ }
+
+ }
+
+ final public static void queryEach(ReadGraphImpl graph, final int r, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final IntProcedure procedure) {
+
+ if(parent == null && listener == null) {
+ AssertedPredicates entry = (AssertedPredicates)provider.assertedPredicatesMap.get(r);
+ if(entry != null && entry.isReady()) {
+ entry.performFromCache(graph, provider, procedure);
+ return;
+ }
+ }
+
+ runner(graph, r, provider, parent, listener, procedure);
+
+ }
+
+ @Override
+ public UnaryQuery<IntProcedure> getEntry(QueryProcessor provider) {
+ return provider.assertedPredicatesMap.get(id);
+ }
+
+ @Override
+ public void putEntry(QueryProcessor provider) {
+ provider.assertedPredicatesMap.put(id, this);
+ }
+
+ @Override
+ final public void removeEntry(QueryProcessor provider) {
+ provider.assertedPredicatesMap.remove(id);
+ }
+
+ void computeInheritedAssertions(ReadGraphImpl graph, int type, final QueryProcessor queryProvider, final IntProcedure proc, final boolean store) {
+
+ DirectObjects.queryEach(graph, type, queryProvider.getInherits(), queryProvider, this, null, new SyncIntProcedure() {
+
+ @Override
+ public void run(ReadGraphImpl graph) {
+
+// finish(graph, queryProvider);
+// proc.finished(graph);
+
+ }
+
+ @Override
+ public void execute(ReadGraphImpl graph,int inh) {
+
+ inc();
+
+ AssertedPredicates.queryEach(graph, inh, queryProvider, AssertedPredicates.this, null, new IntProcedure() {
+
+ @Override
+ public void execute(ReadGraphImpl graph, int ass) {
+
+ addOrSet(ass);
+// proc.execute(graph, ass);
+
+ }
+
+ @Override
+ public void finished(ReadGraphImpl graph) {
+ dec(graph);
+ }
+
+ @Override
+ public void exception(ReadGraphImpl graph, Throwable t) {
+// proc.exception(graph, t);
+ }
+
+ });
+
+ }
+
+ @Override
+ public void finished(ReadGraphImpl graph) {
+
+ dec(graph);
+
+ }
+
+ });
+
+ }
+
+ @Override
+ public Object computeForEach(ReadGraphImpl graph, final QueryProcessor queryProvider, final IntProcedure proc, final boolean store) {
+
+ computeInheritedAssertions(graph, id, queryProvider, proc, store);
+
+ DirectObjects.queryEach(graph, id, queryProvider.getAsserts(), queryProvider, this, null, new IntProcedure() {
+
+ @Override
+ public void execute(ReadGraphImpl graph, final int ass) {
+
+ DirectObjects.queryEach(graph, ass, queryProvider.getHasPredicate(), queryProvider, AssertedPredicates.this, null, new IntProcedure() {
+
+ @Override
+ public void execute(ReadGraphImpl graph, final int pred) {
+
+ addOrSetHiding(graph, pred, AssertedPredicates.this);
+// proc.execute(graph, pred);
+ return;
+
+ }
+
+ @Override
+ public void finished(ReadGraphImpl graph) {
+ }
+
+ @Override
+ public void exception(ReadGraphImpl graph, Throwable t) {
+// proc.exception(graph, t);
+ }
+
+ });
+
+ }
+
+ @Override
+ public void finished(ReadGraphImpl graph) {
+ }
+
+ @Override
+ public void exception(ReadGraphImpl graph, Throwable t) {
+// proc.exception(graph, t);
+ }
+
+ });
+
+ finish(graph, queryProvider);
+
+ performFromCache(graph, queryProvider, proc);
+
+ return getResult();
+
+ }
+
+ @Override
+ public String toString() {
+ return "AssertedPredicates[" + id + "]";
+ }
+
+ final public void finish(ReadGraphImpl graph, QueryProcessor provider) {
+
+ assert(!isReady());
+
+// ArrayList<IntProcedure> p = null;
+
+ synchronized(this) {
+
+ setReady();
+// p = procs;
+// procs = null;
+
+ }
+
+// if(p != null) {
+// IntArray v = (IntArray)getResult();
+// if(v.data == null) {
+// if(v.sizeOrData != IntArray.NO_DATA) {
+// for(IntProcedure proc : p) proc.execute(graph, v.sizeOrData);
+// }
+// } else {
+// for(IntProcedure proc : p) {
+// for(int i = 0;i < v.sizeOrData ; i++) proc.execute(graph, v.data[i]);
+// }
+// }
+//
+// for(IntProcedure proc : p) proc.finished(graph);
+// }
+
+ }
+
+ synchronized private void addOrSet(int add) {
+
+ assert(isPending());
+
+ IntArray value = (IntArray)getResult();
+ value.add(add);
+
+ }
+
+ final static InternalProcedure<RelationInfo> ip = new InternalProcedure<RelationInfo>() {
+
+ @Override
+ public void execute(ReadGraphImpl graph, RelationInfo result) {
+ }
+
+ @Override
+ public void exception(ReadGraphImpl graph, Throwable throwable) {
+ }
+
+ };
+
+ final static InternalProcedure<IntSet> ip2 = new InternalProcedure<IntSet>() {
+
+ @Override
+ public void execute(ReadGraphImpl graph, IntSet result) {
+ }
+
+ @Override
+ public void exception(ReadGraphImpl graph, Throwable throwable) {
+ }
+
+ };
+
+ synchronized private void addOrSetHiding(ReadGraphImpl graph, int add, CacheEntry parent) {
+
+ assert(isPending());
+
+ IntArray value = (IntArray)getResult();
+ RelationInfo ri = RelationInfoQuery.queryEach(graph, add, graph.processor, parent, null, ip);
+ if(ri.isFunctional) {
+ // Replace existing functional predicate if found
+ try {
+ IntSet supers = SuperRelations.queryEach2(graph, add, graph.processor, parent, null, ip2);
+ if(value.data == null) {
+ if(value.sizeOrData != IntArray.NO_DATA) {
+ if(supers.contains(value.sizeOrData)) {
+ value.sizeOrData = add;
+ return;
+ }
+ }
+ } else {
+ for(int i = 0;i < value.sizeOrData ; i++) {
+ if(supers.contains(value.data[i])) {
+ value.data[i] = add;
+ return;
+ }
+ }
+ }
+ } catch (Throwable e) {
+ except(e);
+ return;
+ }
+ }
+
+ // No replacement - append
+ value.add(add);
+
+ }
+
+ @Override
+ public Object performFromCache(ReadGraphImpl graph, QueryProcessor provider, final IntProcedure procedure) {
+
+ assert(isReady());
+
+ if(handleException(graph, procedure)) return EXCEPTED;
+
+ final IntArray value = (IntArray)getResult();
+ if(value.data == null) {
+ if(value.sizeOrData != IntArray.NO_DATA) procedure.execute(graph, value.sizeOrData);
+ } else {
+ for(int i = 0;i < value.sizeOrData ; i++) procedure.execute(graph, value.data[i]);
+ }
+
+ procedure.finished(graph);
+
+ return value;
+
+ }
+
+ @Override
+ public void recompute(ReadGraphImpl graph, QueryProcessor provider) {
+
+ final Semaphore s = new Semaphore(0);
+
+ computeForEach(graph, provider, new IntProcedureAdapter() {
+
+ @Override
+ public void finished(ReadGraphImpl graph) {
+ s.release();
+ }
+
+ @Override
+ public void exception(ReadGraphImpl graph, Throwable t) {
+ s.release();
+ new Error("Error in recompute.", t).printStackTrace();
+ }
+
+ }, true);
+
+ while(!s.tryAcquire()) {
+ provider.resume(graph);
+ }
+
+ }
+
+
+}
Code Review / simantics / platform.git / blobdiff