1 package org.simantics.db.common.utils;
\r
3 import java.util.ArrayList;
\r
4 import java.util.Collection;
\r
5 import java.util.Collections;
\r
6 import java.util.HashSet;
\r
7 import java.util.Iterator;
\r
8 import java.util.List;
\r
9 import java.util.Set;
\r
11 import org.simantics.databoard.Bindings;
\r
12 import org.simantics.db.ReadGraph;
\r
13 import org.simantics.db.Resource;
\r
14 import org.simantics.db.Statement;
\r
15 import org.simantics.db.WriteGraph;
\r
16 import org.simantics.db.common.request.IsParent;
\r
17 import org.simantics.db.common.request.ObjectsWithType;
\r
18 import org.simantics.db.common.request.PossibleObjectWithType;
\r
19 import org.simantics.db.common.request.PossibleOwner;
\r
20 import org.simantics.db.exception.DatabaseException;
\r
21 import org.simantics.db.service.ClusteringSupport;
\r
22 import org.simantics.layer0.Layer0;
\r
23 import org.simantics.utils.datastructures.collections.CollectionUtils;
\r
25 public class CommonDBUtils {
\r
27 public static boolean isParent(ReadGraph graph, Resource possibleParent, Resource possibleChild) throws DatabaseException {
\r
28 return graph.sync(new IsParent(possibleParent, possibleChild));
\r
31 public static Resource parent(ReadGraph graph, Resource child) throws DatabaseException {
\r
32 return graph.getSingleObject(child, Layer0.getInstance(graph).PartOf);
\r
35 public static String possibleRelatedString(ReadGraph graph, Resource subject, Resource relation) throws DatabaseException {
\r
36 return graph.getRelatedValue(subject, relation, Bindings.STRING);
\r
39 public static Integer possibleRelatedInteger(ReadGraph graph, Resource subject, Resource relation) throws DatabaseException {
\r
40 return graph.getRelatedValue(subject, relation, Bindings.INTEGER);
\r
43 public static Resource getPossibleOwner(ReadGraph graph, Resource resource) throws DatabaseException {
\r
44 return graph.syncRequest(new PossibleOwner(resource));
\r
47 public static Resource commonAncestor(ReadGraph graph, Resource r1, Resource r2) throws DatabaseException {
\r
48 Layer0 L0 = Layer0.getInstance(graph);
\r
49 if(r1.equals(r2)) return r1;
\r
50 HashSet<Resource> visited = new HashSet<Resource>();
\r
55 r1 = graph.getPossibleObject(r1, L0.IsOwnedBy);
\r
57 if(!visited.add(r1)) return r1;
\r
59 else if(r2 == null) return null;
\r
61 r2 = graph.getPossibleObject(r2, L0.IsOwnedBy);
\r
63 if(!visited.add(r2)) return r2;
\r
68 public static Resource getNearestOwner(ReadGraph graph, Collection<Resource> resources) throws DatabaseException {
\r
70 Layer0 L0 = Layer0.getInstance(graph);
\r
73 Set<Resource> direct = new HashSet<Resource>();
\r
74 Set<Resource> owners = new HashSet<Resource>();
\r
76 for(Resource r : resources) {
\r
78 Collection<Resource> objects = graph.getObjects(r, L0.IsOwnedBy);
\r
80 // 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
\r
81 if (objects.size() > 1) objects = new HashSet<Resource>(objects);
\r
83 if (objects.size() == 1)
\r
84 direct.addAll(objects);
\r
85 else if (objects.isEmpty()) {
\r
86 for(Statement stm : graph.getStatements(r, L0.IsWeaklyRelatedTo)) {
\r
87 Resource inverse = graph.getPossibleInverse(stm.getPredicate());
\r
88 if(inverse != null) {
\r
89 if(graph.isSubrelationOf(inverse, L0.IsRelatedTo)) {
\r
91 if(!r.equals(stm.getObject()))
\r
92 owners.add(stm.getObject());
\r
97 System.err.println("Multiple owners for " + graph.getPossibleURI(r) + " id : " + r);
\r
98 for (Resource r2 : objects)
\r
99 System.err.println("owner : " + graph.getPossibleURI(r2) + " id " + r2);
\r
104 if(!direct.isEmpty()) {
\r
105 Iterator<Resource> iter = direct.iterator();
\r
106 Resource common = iter.next();
\r
107 while (iter.hasNext()) {
\r
108 Resource other = iter.next();
\r
109 common = commonAncestor(graph, common, other);
\r
110 if (common == null) break;
\r
113 owners.add(common);
\r
116 if(!Collections.disjoint(owners, resources)) {
\r
117 System.err.println("Overlapping owners:");
\r
118 for(Resource r : resources)
\r
119 System.err.println("-resource " + NameUtils.getSafeName(graph, r, true));
\r
120 for(Resource r : owners)
\r
121 System.err.println("-owner " + NameUtils.getSafeName(graph, r, true));
\r
125 if(owners.size() == 1) return owners.iterator().next();
\r
126 if(owners.size() == 0) return null;
\r
128 return getNearestOwner(graph, owners);
\r
132 public static Resource getClusterSetForNewResource(ReadGraph graph, Resource ... resources) throws DatabaseException {
\r
134 if(resources.length == 1) return getClusterSetForNewResource(graph, resources[0]);
\r
136 Resource owner = getNearestOwner(graph, CollectionUtils.toList(resources));
\r
137 if(owner == null) return null;
\r
138 return getClusterSetForNewResource(graph, owner, new HashSet<Resource>());
\r
142 public static Resource getClusterSetForNewResource(ReadGraph graph, Collection<Resource> resources) throws DatabaseException {
\r
144 if(resources.size() == 1) return getClusterSetForNewResource(graph, resources.iterator().next());
\r
146 Resource owner = getNearestOwner(graph, resources);
\r
147 return getClusterSetForNewResource(graph, owner, new HashSet<Resource>());
\r
151 public static Resource getClusterSetForNewResource(ReadGraph graph, Resource resource, Set<Resource> visited) throws DatabaseException {
\r
153 ClusteringSupport cs = graph.getService(ClusteringSupport.class);
\r
154 if(cs.isClusterSet(resource)) return resource;
\r
156 Resource owner = getPossibleOwner(graph, resource);
\r
158 if(owner == null || owner == resource) return null;
\r
159 if(!visited.add(owner)) return null;
\r
161 return getClusterSetForNewResource(graph, owner, visited);
\r
165 public static Resource getClusterSetForNewResource(ReadGraph graph, Resource r) throws DatabaseException {
\r
166 return getClusterSetForNewResource(graph, r, new HashSet<Resource>());
\r
170 public static void selectClusterSet(WriteGraph graph, Collection<Resource> resources) throws DatabaseException {
\r
171 Resource clusterSet = getClusterSetForNewResource(graph, resources);
\r
172 if(clusterSet == null) clusterSet = graph.getRootLibrary();
\r
173 graph.setClusterSet4NewResource(clusterSet);
\r
176 public static void selectClusterSet(WriteGraph graph, Resource ... resources) throws DatabaseException {
\r
177 Resource clusterSet = getClusterSetForNewResource(graph, resources);
\r
178 if(clusterSet == null) clusterSet = graph.getRootLibrary();
\r
179 graph.setClusterSet4NewResource(clusterSet);
\r
182 public static void selectClusterSet(WriteGraph graph, Resource resource) throws DatabaseException {
\r
183 Resource clusterSet = getClusterSetForNewResource(graph, resource);
\r
184 if(clusterSet == null) clusterSet = graph.getRootLibrary();
\r
185 graph.setClusterSet4NewResource(clusterSet);
\r
188 public static List<Resource> objectsWithType(ReadGraph graph, Resource subject, Resource relation, Resource type) throws DatabaseException {
\r
189 return new ArrayList<Resource>(graph.syncRequest(new ObjectsWithType(subject, relation, type)));
\r
192 public static Resource possibleObjectWithType(ReadGraph graph, Resource subject, Resource relation, Resource type) throws DatabaseException {
\r
193 return graph.syncRequest(new PossibleObjectWithType(subject, relation, type));
\r