1 /*******************************************************************************
\r
2 * Copyright (c) 2010, 2011 Association for Decentralized Information Management in
\r
4 * All rights reserved. This program and the accompanying materials
\r
5 * are made available under the terms of the Eclipse Public License v1.0
\r
6 * which accompanies this distribution, and is available at
\r
7 * http://www.eclipse.org/legal/epl-v10.html
\r
10 * VTT Technical Research Centre of Finland - initial API and implementation
\r
11 *******************************************************************************/
\r
12 package org.simantics.browsing.ui.model.children;
\r
14 import java.util.ArrayList;
\r
15 import java.util.Collection;
\r
16 import java.util.Collections;
\r
18 import org.simantics.browsing.ui.BuiltinKeys;
\r
19 import org.simantics.browsing.ui.NodeContext;
\r
20 import org.simantics.browsing.ui.model.InvalidContribution;
\r
21 import org.simantics.browsing.ui.model.nodetypes.NodeType;
\r
22 import org.simantics.databoard.Bindings;
\r
23 import org.simantics.db.ReadGraph;
\r
24 import org.simantics.db.Resource;
\r
25 import org.simantics.db.common.utils.NameUtils;
\r
26 import org.simantics.db.exception.DatabaseException;
\r
27 import org.simantics.db.layer0.exception.PendingVariableException;
\r
28 import org.simantics.viewpoint.ontology.ViewpointResource;
\r
31 * A child contribution adds child nodes to the instances of a specific node type.
\r
32 * @author Hannu Niemistö
\r
34 public class ChildContribution {
\r
38 NodeType parentNodeType;
\r
39 NodeType childNodeType;
\r
40 ChildRule childRule;
\r
42 public ChildContribution(String identifier, double priority, NodeType parentNodeType, NodeType childNodeType,
\r
43 ChildRule childRule) throws InvalidContribution {
\r
44 if(!childRule.isCompatible(
\r
45 parentNodeType.getContentType()
\r
47 throw new InvalidContribution("Child rule is not compatible with the parent content type.");
\r
48 this.parentNodeType = parentNodeType;
\r
49 this.childNodeType = childNodeType;
\r
50 this.childRule = childRule;
\r
51 this.identifier = identifier;
\r
52 this.priority = priority;
\r
55 public static ChildContribution create(ReadGraph g, Resource childContributionResource) throws DatabaseException, InvalidContribution {
\r
56 ViewpointResource vr = ViewpointResource.getInstance(g);
\r
58 Resource parentNodeTypeResource = g.getSingleObject(childContributionResource, vr.ChildContribution_HasParentNodeType);
\r
59 NodeType parentNodeType = g.adapt(parentNodeTypeResource, NodeType.class);
\r
61 Resource childNodeTypeResource = g.getSingleObject(childContributionResource, vr.ChildContribution_HasChildNodeType);
\r
62 NodeType childNodeType = g.adapt(childNodeTypeResource, NodeType.class);
\r
64 Resource childRuleResource = g.getSingleObject(childContributionResource, vr.ChildContribution_HasRule);
\r
65 ChildRule childRule = g.adapt(childRuleResource, ChildRule.class);
\r
67 String identifier = g.getPossibleRelatedValue(childContributionResource, vr.ChildContribution_identifier, Bindings.STRING);
\r
68 if(identifier == null) identifier = "";
\r
69 if("".equals(identifier)) {
\r
70 identifier = g.getPossibleURI(childContributionResource);
\r
71 if(identifier == null) identifier = NameUtils.getSafeName(g, childContributionResource, true);
\r
74 Double priority = g.getPossibleRelatedValue(childContributionResource, vr.ChildContribution_priority, Bindings.DOUBLE);
\r
75 if(priority == null) priority = 0.0;
\r
77 return new ChildContribution(identifier, priority, parentNodeType, childNodeType, childRule);
\r
81 public NodeType getParentNodeType() {
\r
82 return parentNodeType;
\r
85 public NodeType getChildNodeType() {
\r
86 return childNodeType;
\r
89 public String getIdentifier() {
\r
93 public double getPriority() {
\r
98 * Given a parent node context returns a child node contexts contributed by
\r
99 * this contribution.
\r
101 public Collection<NodeContext> getChildren(ReadGraph graph, NodeContext parent) {
\r
103 Object parentContent = parent.getConstant(BuiltinKeys.INPUT);
\r
104 Collection<?> childContents = childRule.getChildren(graph, parentContent);
\r
105 if(childContents.isEmpty())
\r
106 return Collections.emptyList();
\r
107 ArrayList<NodeContext> children = new ArrayList<NodeContext>(childContents.size());
\r
108 for(Object childContent : childContents) {
\r
109 NodeContext child = childNodeType.createNodeContext(graph, childContent);
\r
111 children.add(child);
\r
114 } catch(PendingVariableException e) {
\r
115 return Collections.emptyList();
\r
116 } catch(DatabaseException e) {
\r
117 e.printStackTrace();
\r
118 // TODO return some kind of error node
\r
119 return Collections.emptyList();
\r
124 * Given a child node context returns a collection of possible parent node contexts.
\r
126 public Collection<NodeContext> getParents(ReadGraph graph, NodeContext child) {
\r
128 Object childContent = child.getConstant(BuiltinKeys.INPUT);
\r
129 Collection<?> parentContents = childRule.getParents(graph, childContent);
\r
130 if(parentContents.isEmpty())
\r
131 return Collections.emptyList();
\r
132 ArrayList<NodeContext> parents = new ArrayList<NodeContext>(parentContents.size());
\r
133 for(Object parentContent : parentContents) {
\r
134 NodeContext parent = parentNodeType.createNodeContext(graph, parentContent);
\r
136 parents.add(parent);
\r
139 } catch(DatabaseException e) {
\r
140 e.printStackTrace();
\r
141 return Collections.emptyList();
\r
145 public boolean hasChildren(ReadGraph graph, NodeContext parent) {
\r
147 Object parentContent = parent.getConstant(BuiltinKeys.INPUT);
\r
148 Collection<?> childContents = childRule.getChildren(graph, parentContent);
\r
149 if(childContents.isEmpty())
\r
151 for(Object childContent : childContents) {
\r
152 NodeContext child = childNodeType.createNodeContext(graph, childContent);
\r
156 } catch(DatabaseException e) {
\r
157 e.printStackTrace();
\r
163 public String toString() {
\r