import java.util.Collection;
import java.util.Collections;
import java.util.HashSet;
-import java.util.Iterator;
import java.util.List;
import java.util.Set;
import org.simantics.db.common.procedure.adapter.DirectStatementProcedure;
import org.simantics.db.common.request.IsParent;
import org.simantics.db.common.request.ObjectsWithType;
+import org.simantics.db.common.request.PossibleChild;
import org.simantics.db.common.request.PossibleObjectWithType;
import org.simantics.db.common.request.PossibleOwner;
+import org.simantics.db.common.request.ResourceRead;
+import org.simantics.db.common.request.RuntimeEnvironmentRequest;
+import org.simantics.db.exception.AdaptionException;
import org.simantics.db.exception.DatabaseException;
import org.simantics.db.exception.InvalidResourceReferenceException;
import org.simantics.db.service.ClusterUID;
import org.simantics.db.service.SerialisationSupport;
import org.simantics.db.service.XSupport;
import org.simantics.layer0.Layer0;
+import org.simantics.scl.compiler.environment.Environments;
+import org.simantics.scl.compiler.runtime.RuntimeEnvironment;
+import org.simantics.scl.compiler.top.SCLExpressionCompilationException;
+import org.simantics.scl.compiler.types.Type;
import org.simantics.utils.datastructures.collections.CollectionUtils;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import gnu.trove.list.array.TIntArrayList;
import gnu.trove.procedure.TIntProcedure;
+import gnu.trove.set.hash.THashSet;
import gnu.trove.set.hash.TIntHashSet;
public class CommonDBUtils {
return graph.syncRequest(new PossibleOwner(resource));
}
+ /**
+ * Finds a resource that is reachable from both input resources by as short as possible IsOwnedBy chain
+ */
public static Resource commonAncestor(ReadGraph graph, Resource r1, Resource r2) throws DatabaseException {
+ if(r1.equals(r2))
+ return r1;
+
Layer0 L0 = Layer0.getInstance(graph);
- if(r1.equals(r2)) return r1;
- HashSet<Resource> visited = new HashSet<Resource>();
- visited.add(r1);
- visited.add(r2);
- while(true) {
- if(r1 != null) {
- r1 = graph.getPossibleObject(r1, L0.IsOwnedBy);
- if(r1 != null)
- if(!visited.add(r1)) return r1;
- }
- else if(r2 == null) return null;
- if(r2 != null) {
- r2 = graph.getPossibleObject(r2, L0.IsOwnedBy);
- if(r2 != null)
- if(!visited.add(r2)) return r2;
- }
- }
+ HashSet<Resource> visited = new HashSet<Resource>();
+ visited.add(r1);
+ visited.add(r2);
+ while(true) {
+ if(r1 != null) {
+ r1 = graph.getPossibleObject(r1, L0.IsOwnedBy);
+ if(r1 != null && !visited.add(r1))
+ return r1;
+ }
+ else if(r2 == null)
+ return null;
+ if(r2 != null) {
+ r2 = graph.getPossibleObject(r2, L0.IsOwnedBy);
+ if(r2 != null && !visited.add(r2))
+ return r2;
+ }
+ }
}
-
- public static Resource getNearestOwner(ReadGraph graph, Collection<Resource> resources) throws DatabaseException {
-
- Layer0 L0 = Layer0.getInstance(graph);
-
+
+ private static Collection<Resource> getDirectOwners(ReadGraph graph, Resource resource) throws DatabaseException {
+ // TODO is necessary?
+ if(resource.equals(graph.getRootLibrary()))
+ return Collections.emptyList();
- Set<Resource> direct = new HashSet<Resource>();
- Set<Resource> owners = new HashSet<Resource>();
+ Layer0 L0 = Layer0.getInstance(graph);
- for(Resource r : resources) {
+ Collection<Resource> owners = graph.getObjects(resource, L0.IsOwnedBy);
+ if(owners.isEmpty()) {
+ owners = new THashSet<Resource>();
- Collection<Resource> objects = graph.getObjects(r, L0.IsOwnedBy);
- // FIXME:
- // TODO: getObjects returns duplicate entries (https://www.simantics.org/redmine/issues/4885) and therefore direct is Set<Resource>. Fix getObjects to not return duplicate entries
- if (objects.size() > 1) objects = new HashSet<Resource>(objects);
-
- if (objects.size() == 1)
- direct.addAll(objects);
- else if (objects.isEmpty()) {
- for(Statement stm : graph.getStatements(r, L0.IsWeaklyRelatedTo)) {
- Resource inverse = graph.getPossibleInverse(stm.getPredicate());
- if(inverse != null) {
- if(graph.isSubrelationOf(inverse, L0.IsRelatedTo)) {
- // Filter away tags
- if(!r.equals(stm.getObject()))
- owners.add(stm.getObject());
- }
+ // If there are no owners, collect resources referring to this resource by IsRelatedTo
+ for(Statement statement : graph.getStatements(resource, L0.IsWeaklyRelatedTo)) {
+ Resource inverse = graph.getPossibleInverse(statement.getPredicate());
+ if(inverse != null) {
+ if(graph.isSubrelationOf(inverse, L0.IsRelatedTo)) {
+ // Filter away tags
+ if(resource.equals(statement.getObject()))
+ continue;
+ owners.add(statement.getObject());
}
}
- } else {
- System.err.println("Multiple owners for " + graph.getPossibleURI(r) + " id : " + r);
- for (Resource r2 : objects)
- System.err.println("owner : " + graph.getPossibleURI(r2) + " id " + r2);
- return null;
}
}
-
- if(!direct.isEmpty()) {
- Iterator<Resource> iter = direct.iterator();
- Resource common = iter.next();
- while (iter.hasNext()) {
- Resource other = iter.next();
- common = commonAncestor(graph, common, other);
- if (common == null) break;
- }
- if(common != null)
- owners.add(common);
+ else if(owners.size() > 1) {
+ // TODO: getObjects returns duplicate entries (https://www.simantics.org/redmine/issues/4885) and therefore direct is Set<Resource>.
+ // Fix getObjects to not return duplicate entries
+ owners = new HashSet<Resource>(owners);
}
-
- if(!Collections.disjoint(owners, resources)) {
- System.err.println("Overlapping owners:");
- for(Resource r : resources)
- System.err.println("-resource " + NameUtils.getSafeName(graph, r, true));
- for(Resource r : owners)
- System.err.println("-owner " + NameUtils.getSafeName(graph, r, true));
- return null;
- }
-
- if(owners.size() == 1) return owners.iterator().next();
- if(owners.size() == 0) return null;
-
- return getNearestOwner(graph, owners);
-
+
+ return owners;
+ }
+
+ /**
+ * This method didn't have a clear specification and therefore should not be used. Use instead
+ * the methods in the class {@link NearestOwnerFinder}.
+ */
+ @Deprecated
+ public static Resource getNearestOwner(ReadGraph graph, Collection<Resource> resources) throws DatabaseException {
+ if(resources.size() == 1)
+ return NearestOwnerFinder.getNearestOwner(graph, resources.iterator().next());
+ else
+ return NearestOwnerFinder.getNearestOwnerFromDirectOwners(graph, resources);
}
public static Resource getClusterSetForNewResource(ReadGraph graph, Resource ... resources) throws DatabaseException {
if(resources.length == 1) return getClusterSetForNewResource(graph, resources[0]);
- Resource owner = getNearestOwner(graph, CollectionUtils.toList(resources));
+ Resource owner = NearestOwnerFinder.getNearestOwnerFromDirectOwners(graph, CollectionUtils.toList(resources));
if(owner == null) return null;
return getClusterSetForNewResource(graph, owner, new HashSet<Resource>());
if(resources.size() == 1) return getClusterSetForNewResource(graph, resources.iterator().next());
- Resource owner = getNearestOwner(graph, resources);
+ Resource owner = NearestOwnerFinder.getNearestOwnerFromDirectOwners(graph, resources);
return getClusterSetForNewResource(graph, owner, new HashSet<Resource>());
}
DirectStatementProcedure proc = new DirectStatementProcedure();
if (ignoreVirtual) {
- dqs.forEachDirectPersistentStatement(graph, resource, proc);
+ return dqs.getDirectPersistentStatements(graph, resource);
} else {
- dqs.forEachDirectStatement(graph, resource, proc);
+ return dqs.getDirectStatements(graph, resource);
}
-
- return proc.getOrThrow();
}
return xs.isClusterLoaded(clusterUID);
}
-
+ public static void setImmutable(ReadGraph graph, Resource resource, boolean value) throws DatabaseException {
+ XSupport xs = graph.getService(XSupport.class);
+ xs.setImmutable(resource, value);
+ }
+
+ public static Type getSCLType(ReadGraph graph, RuntimeEnvironment runtimeEnvironment, String typeText) throws DatabaseException {
+ try {
+ return Environments.getType(runtimeEnvironment.getEnvironment(), typeText);
+ } catch (SCLExpressionCompilationException e) {
+ throw new DatabaseException(e);
+ }
+ }
+
+ public static Type getSCLType(ReadGraph graph, Resource resource, String typeText) throws DatabaseException {
+ try {
+ RuntimeEnvironment runtimeEnvironment = graph.syncRequest(new RuntimeEnvironmentRequest(resource));
+ return Environments.getType(runtimeEnvironment.getEnvironment(), typeText);
+ } catch (SCLExpressionCompilationException e) {
+ throw new DatabaseException(e);
+ }
+ }
+
+ public static Resource getPossibleChild(ReadGraph graph, Resource resource, String name) throws DatabaseException {
+ return graph.sync(new PossibleChild(resource, name));
+ }
+
+ public static Resource getPossibleChild(ReadGraph graph, Resource resource, Resource type, String name) throws DatabaseException {
+ Resource child = graph.sync(new PossibleChild(resource, name));
+ if(child == null) return null;
+ if(!graph.isInstanceOf(child, type)) return null;
+ return child;
+ }
+
+ public static String getEnumerationValueName(ReadGraph graph, Resource resource) throws DatabaseException {
+ Layer0 L0 = Layer0.getInstance(graph);
+ String label = graph.getPossibleRelatedValue(resource, L0.HasLabel, Bindings.STRING);
+ if(label != null)
+ return label;
+ return safeName(graph, resource);
+ }
+
+ private static String safeName(ReadGraph graph, Resource value) throws DatabaseException {
+ return graph.syncRequest(new StringAdapterRequest(value));
+ }
+
+ public static class StringAdapterRequest extends ResourceRead<String> {
+ public StringAdapterRequest(Resource resource) {
+ super(resource);
+ }
+ @Override
+ public String perform(ReadGraph graph) throws DatabaseException {
+ try {
+ return graph.adapt(resource, String.class);
+ } catch (AdaptionException e) {
+ return NameUtils.getSafeName(graph, resource);
+ }
+ }
+ }
+
}
Code Review / simantics / platform.git / blobdiff