]> gerrit.simantics Code Review - simantics/platform.git/blob - bundles/org.simantics.db.layer0/src/org/simantics/db/layer0/util/TGRepresentationUtils.java
Fail safe import fixes made by Antti
[simantics/platform.git] / bundles / org.simantics.db.layer0 / src / org / simantics / db / layer0 / util / TGRepresentationUtils.java
1 /*******************************************************************************
2  * Copyright (c) 2016 Association for Decentralized Information Management
3  * in Industry THTH ry.
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
8  *
9  * Contributors:
10  *     Semantum Oy - initial API and implementation
11  *******************************************************************************/
12 package org.simantics.db.layer0.util;
13
14 import java.util.Collections;
15 import java.util.List;
16 import java.util.Map;
17 import java.util.Set;
18
19 import org.simantics.datatypes.literal.GUID;
20 import org.simantics.db.ReadGraph;
21 import org.simantics.db.Resource;
22 import org.simantics.db.Statement;
23 import org.simantics.db.common.request.PossibleIndexRoot;
24 import org.simantics.db.exception.DatabaseException;
25 import org.simantics.db.layer0.adapter.impl.EntityInstances.QueryIndex;
26 import org.simantics.db.layer0.util.ConsistsOfProcess.InternalEntry;
27 import org.simantics.db.layer0.util.DomainProcessor3.ExclusionDecision;
28 import org.simantics.layer0.Layer0;
29 import org.simantics.scl.runtime.function.Function1;
30 import org.simantics.utils.datastructures.Pair;
31
32 /**
33  * @author Antti Villberg
34  * @author Tuukka Lehtonen
35  * @since 1.22
36  */
37 public class TGRepresentationUtils {
38
39     public static boolean findByIdentifier(ReadGraph graph, Resource targetIndex, Resource source) throws DatabaseException {
40         Layer0 L0 = Layer0.getInstance(graph);
41         GUID guid = graph.getPossibleRelatedValue(source, L0.identifier, GUID.BINDING);
42         if(guid != null) {
43             List<Resource> exist = graph.syncRequest(new QueryIndex(targetIndex, L0.Entity, "GUID:" + guid.indexString()));
44             return !exist.isEmpty();
45         }
46         return false;
47     }
48
49     public static Function1<Statement, ExclusionDecision> computeExclusionFunction(ReadGraph graph, Resource[] resources, Map<String,Object> hints) throws DatabaseException {
50         Resource targetResource = (Resource)hints.get(ClipboardUtils.HINT_TARGET_RESOURCE);
51         if(targetResource != null) {
52             Resource targetRoot = graph.syncRequest(new PossibleIndexRoot(targetResource));
53             if(targetRoot != null) {
54                 for(Resource r : resources) {
55                     Resource sourceRoot = graph.syncRequest(new PossibleIndexRoot(r));
56                     // We are copying a complete index root => no need to change guids
57                     if(r.equals(sourceRoot))
58                         continue;
59                     if(targetRoot.equals(sourceRoot)) {
60                         // Copy into same index root => guid rewrite is needed
61                         return new GUIDExclusionFunction(graph);
62                     }
63                     // First try the root GUID
64                     if(findByIdentifier(graph, targetRoot, r))
65                         return new GUIDExclusionFunction(graph);
66
67                     // The root is OK - check everything beneath
68                     Pair<List<InternalEntry>,Set<Resource>> pair = ConsistsOfProcess.walk(graph, null, Collections.singleton(r), Collections.emptySet(), true); 
69                     List<InternalEntry> entries = pair.first;
70                     for(InternalEntry entry : entries) {
71                         if(findByIdentifier(graph, targetRoot, entry.resource))
72                             return new GUIDExclusionFunction(graph);
73                     }
74                 }
75             }
76         }
77
78         return null;
79     }
80
81 }