-/*******************************************************************************\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.layer0.utils.binaryPredicates;\r
-\r
-import java.util.ArrayDeque;\r
-import java.util.Collection;\r
-import java.util.Deque;\r
-import java.util.HashSet;\r
-import java.util.Set;\r
-\r
-import org.simantics.db.Resource;\r
-import org.simantics.db.ReadGraph;\r
-import org.simantics.db.WriteGraph;\r
-import org.simantics.db.exception.DatabaseException;\r
-import org.simantics.utils.datastructures.Pair;\r
-\r
-public class TransitiveClosure extends BinaryPredicate {\r
- IBinaryPredicate predicate;\r
- \r
-\r
- public TransitiveClosure(IBinaryPredicate predicate) {\r
- this.predicate = predicate;\r
- }\r
-\r
- @Override\r
- public void add(WriteGraph g, Resource subject, Resource object) throws DatabaseException {\r
- if(!has(g, subject, object))\r
- predicate.add(g, subject, object);\r
- }\r
-\r
- @Override\r
- public Collection<Resource> getObjects(ReadGraph g, Resource subject) throws DatabaseException {\r
- Deque<Resource> unprocessed = new ArrayDeque<Resource>();\r
- unprocessed.add(subject);\r
- Set<Resource> result = new HashSet<Resource>();\r
- while(!unprocessed.isEmpty())\r
- for(Resource r : predicate.getObjects(g, unprocessed.pop()))\r
- if(result.add(r))\r
- unprocessed.push(r);\r
- return result;\r
- }\r
-\r
- @Override\r
- public Collection<Pair<Resource, Resource>> getStatements(ReadGraph g) {\r
- // TODO Auto-generated method stub\r
- return null;\r
- }\r
-\r
- @Override\r
- public Collection<Resource> getSubjects(ReadGraph g, Resource object) throws DatabaseException {\r
- Deque<Resource> unprocessed = new ArrayDeque<Resource>();\r
- unprocessed.add(object);\r
- Set<Resource> result = new HashSet<Resource>();\r
- while(!unprocessed.isEmpty())\r
- for(Resource r : predicate.getSubjects(g, unprocessed.pop()))\r
- if(result.add(r))\r
- unprocessed.push(r);\r
- return result;\r
- }\r
-\r
- @Override\r
- public boolean has(ReadGraph g, Resource subject, Resource object) throws DatabaseException {\r
- Deque<Resource> unprocessed = new ArrayDeque<Resource>();\r
- unprocessed.add(subject);\r
- Set<Resource> objects = new HashSet<Resource>();\r
- while(!unprocessed.isEmpty())\r
- for(Resource r : predicate.getObjects(g, unprocessed.pop()))\r
- if(r.equals(object))\r
- return true;\r
- else if(objects.add(r))\r
- unprocessed.push(r);\r
- return false;\r
- }\r
-\r
- @Override\r
- public void remove(WriteGraph g, Resource subject, Resource object) {\r
- throw new UnsupportedOperationException();\r
- }\r
-\r
- @Override\r
- public boolean supportsAdditions() {\r
- return predicate.supportsAdditions();\r
- }\r
-\r
- @Override\r
- public boolean supportsGetObjects() {\r
- return predicate.supportsGetObjects();\r
- }\r
-\r
- @Override\r
- public boolean supportsGetStatements() {\r
- return false; // FIXME: just unimplemented\r
- }\r
-\r
- @Override\r
- public boolean supportsGetSubjects() {\r
- return predicate.supportsGetSubjects();\r
- }\r
-\r
- @Override\r
- public boolean supportsRemovals() {\r
- return false;\r
- }\r
-\r
- @Override\r
- public int hashCode() {\r
- final int prime = 31;\r
- int result = 1;\r
- result = prime * result\r
- + ((predicate == null) ? 0 : predicate.hashCode());\r
- return result;\r
- }\r
-\r
- @Override\r
- public boolean equals(Object obj) {\r
- if (this == obj)\r
- return true;\r
- if (obj == null)\r
- return false;\r
- if (getClass() != obj.getClass())\r
- return false;\r
- TransitiveClosure other = (TransitiveClosure) obj;\r
- if (predicate == null) {\r
- if (other.predicate != null)\r
- return false;\r
- } else if (!predicate.equals(other.predicate))\r
- return false;\r
- return true;\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.layer0.utils.binaryPredicates;
+
+import java.util.ArrayDeque;
+import java.util.Collection;
+import java.util.Deque;
+import java.util.HashSet;
+import java.util.Set;
+
+import org.simantics.db.Resource;
+import org.simantics.db.ReadGraph;
+import org.simantics.db.WriteGraph;
+import org.simantics.db.exception.DatabaseException;
+import org.simantics.utils.datastructures.Pair;
+
+public class TransitiveClosure extends BinaryPredicate {
+ IBinaryPredicate predicate;
+
+
+ public TransitiveClosure(IBinaryPredicate predicate) {
+ this.predicate = predicate;
+ }
+
+ @Override
+ public void add(WriteGraph g, Resource subject, Resource object) throws DatabaseException {
+ if(!has(g, subject, object))
+ predicate.add(g, subject, object);
+ }
+
+ @Override
+ public Collection<Resource> getObjects(ReadGraph g, Resource subject) throws DatabaseException {
+ Deque<Resource> unprocessed = new ArrayDeque<Resource>();
+ unprocessed.add(subject);
+ Set<Resource> result = new HashSet<Resource>();
+ while(!unprocessed.isEmpty())
+ for(Resource r : predicate.getObjects(g, unprocessed.pop()))
+ if(result.add(r))
+ unprocessed.push(r);
+ return result;
+ }
+
+ @Override
+ public Collection<Pair<Resource, Resource>> getStatements(ReadGraph g) {
+ // TODO Auto-generated method stub
+ return null;
+ }
+
+ @Override
+ public Collection<Resource> getSubjects(ReadGraph g, Resource object) throws DatabaseException {
+ Deque<Resource> unprocessed = new ArrayDeque<Resource>();
+ unprocessed.add(object);
+ Set<Resource> result = new HashSet<Resource>();
+ while(!unprocessed.isEmpty())
+ for(Resource r : predicate.getSubjects(g, unprocessed.pop()))
+ if(result.add(r))
+ unprocessed.push(r);
+ return result;
+ }
+
+ @Override
+ public boolean has(ReadGraph g, Resource subject, Resource object) throws DatabaseException {
+ Deque<Resource> unprocessed = new ArrayDeque<Resource>();
+ unprocessed.add(subject);
+ Set<Resource> objects = new HashSet<Resource>();
+ while(!unprocessed.isEmpty())
+ for(Resource r : predicate.getObjects(g, unprocessed.pop()))
+ if(r.equals(object))
+ return true;
+ else if(objects.add(r))
+ unprocessed.push(r);
+ return false;
+ }
+
+ @Override
+ public void remove(WriteGraph g, Resource subject, Resource object) {
+ throw new UnsupportedOperationException();
+ }
+
+ @Override
+ public boolean supportsAdditions() {
+ return predicate.supportsAdditions();
+ }
+
+ @Override
+ public boolean supportsGetObjects() {
+ return predicate.supportsGetObjects();
+ }
+
+ @Override
+ public boolean supportsGetStatements() {
+ return false; // FIXME: just unimplemented
+ }
+
+ @Override
+ public boolean supportsGetSubjects() {
+ return predicate.supportsGetSubjects();
+ }
+
+ @Override
+ public boolean supportsRemovals() {
+ return false;
+ }
+
+ @Override
+ public int hashCode() {
+ final int prime = 31;
+ int result = 1;
+ result = prime * result
+ + ((predicate == null) ? 0 : predicate.hashCode());
+ return result;
+ }
+
+ @Override
+ public boolean equals(Object obj) {
+ if (this == obj)
+ return true;
+ if (obj == null)
+ return false;
+ if (getClass() != obj.getClass())
+ return false;
+ TransitiveClosure other = (TransitiveClosure) obj;
+ if (predicate == null) {
+ if (other.predicate != null)
+ return false;
+ } else if (!predicate.equals(other.predicate))
+ return false;
+ return true;
+ }
+
+}