1 /*******************************************************************************
2 * Copyright (c) 2007, 2010 Association for Decentralized Information Management
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
10 * VTT Technical Research Centre of Finland - initial API and implementation
11 *******************************************************************************/
12 package org.simantics.diagram.content;
14 import java.util.HashSet;
16 import java.util.concurrent.ConcurrentLinkedQueue;
17 import java.util.concurrent.atomic.AtomicInteger;
19 import org.simantics.db.AsyncReadGraph;
20 import org.simantics.db.Resource;
21 import org.simantics.db.common.request.ResourceAsyncRead;
22 import org.simantics.db.procedure.AsyncMultiProcedure;
23 import org.simantics.db.procedure.AsyncProcedure;
24 import org.simantics.diagram.stubs.DiagramResource;
25 import org.simantics.diagram.synchronization.ErrorHandler;
28 * @author Antti Villberg
29 * @author Tuukka Lehtonen
31 public class RouteGraphConnectionPartRequest extends ResourceAsyncRead<RouteGraphConnectionPartData> {
33 final ErrorHandler errorHandler;
34 final DiagramResource DIA;
36 public RouteGraphConnectionPartRequest(ErrorHandler errorHandler, DiagramResource dia, Resource resource) {
38 this.errorHandler = errorHandler;
43 public void perform(AsyncReadGraph graph, final AsyncProcedure<RouteGraphConnectionPartData> procedure) {
45 final AtomicInteger ready = new AtomicInteger(3);
46 final RouteGraphConnectionPartData result = new RouteGraphConnectionPartData();
47 final HashSet<EdgeResource> connectorLinks = new HashSet<EdgeResource>();
48 final HashSet<EdgeResource> routeLinks = new HashSet<EdgeResource>();
50 result.links = connectorLinks;
51 result.routeLines = new ConcurrentLinkedQueue<Resource>();
52 result.routePoints = new ConcurrentLinkedQueue<Resource>();
54 AsyncMultiProcedure<Resource> locationProcedure = new AsyncMultiProcedure<Resource>() {
57 public void exception(AsyncReadGraph graph, Throwable throwable) {
58 errorHandler.error("forEachObject(connection, Has I/O) failure", throwable);
62 public void execute(AsyncReadGraph graph, final Resource location) {
64 ready.incrementAndGet();
66 graph.forEachObject(location, DIA.AreConnected, new AsyncMultiProcedure<Resource>() {
69 public void exception(AsyncReadGraph graph, Throwable throwable) {
70 errorHandler.error("forEachObject(:I/O Connector, Are Connected) failure", throwable);
74 public void execute(AsyncReadGraph graph, Resource connectedTo) {
75 synchronized (connectorLinks) {
76 connectorLinks.add(new EdgeResource(location, connectedTo));
81 public void finished(AsyncReadGraph graph) {
82 if (ready.decrementAndGet() == 0) {
83 connectorLinks.addAll(routeLinks);
84 procedure.execute(graph, result);
93 public void finished(AsyncReadGraph graph) {
94 if (ready.decrementAndGet() == 0) {
95 connectorLinks.addAll(routeLinks);
96 procedure.execute(graph, result);
102 AsyncMultiProcedure<Resource> locationProcedure2 = new AsyncMultiProcedure<Resource>() {
105 public void exception(AsyncReadGraph graph, Throwable throwable) {
106 errorHandler.error("forEachObject(connection, Has Branch Point) failure", throwable);
110 public void execute(AsyncReadGraph graph, final Resource location) {
112 ready.incrementAndGet();
114 graph.forTypes(location, new AsyncProcedure<Set<Resource>>() {
116 public void execute(AsyncReadGraph graph, Set<Resource> types) {
117 if (types.contains(DIA.RouteLine)) {
118 result.routeLines.add(location);
119 } else if (types.contains(DIA.RoutePoint)) {
120 result.routePoints.add(location);
122 errorHandler.error("unrecognized interior route node: " + location, new Exception("trace"));
125 graph.forEachObject(location, DIA.AreConnected, new AsyncMultiProcedure<Resource>() {
128 public void exception(AsyncReadGraph graph, Throwable throwable) {
129 errorHandler.error("forEachObject(:Branch Point, Are Connected) failure", throwable);
133 public void execute(AsyncReadGraph graph, Resource connectedTo) {
134 synchronized (routeLinks) {
135 routeLinks.add(new EdgeResource(location, connectedTo));
140 public void finished(AsyncReadGraph graph) {
141 if (ready.decrementAndGet() == 0) {
142 connectorLinks.addAll(routeLinks);
143 procedure.execute(graph, result);
150 public void exception(AsyncReadGraph graph, Throwable throwable) {
151 errorHandler.error("forEachObject(:Branch Point, Are Connected) failure", throwable);
157 public void finished(AsyncReadGraph graph) {
158 if (ready.decrementAndGet() == 0) {
159 connectorLinks.addAll(routeLinks);
160 procedure.execute(graph, result);
166 AsyncMultiProcedure<Resource> locationProcedure3 = new AsyncMultiProcedure<Resource>() {
169 public void exception(AsyncReadGraph graph, Throwable throwable) {
170 errorHandler.error("forEachObject(connection, Has I/O) failure", throwable);
174 public void execute(AsyncReadGraph graph, final Resource location) {
176 ready.incrementAndGet();
178 graph.forEachObject(location, DIA.AreConnected, new AsyncMultiProcedure<Resource>() {
181 public void exception(AsyncReadGraph graph, Throwable throwable) {
182 errorHandler.error("forEachObject(:I/O Connector, Are Connected) failure", throwable);
186 public void execute(AsyncReadGraph graph, Resource connectedTo) {
187 synchronized (connectorLinks) {
188 connectorLinks.add(new EdgeResource(connectedTo, location));
193 public void finished(AsyncReadGraph graph) {
194 if (ready.decrementAndGet() == 0) {
195 connectorLinks.addAll(routeLinks);
196 procedure.execute(graph, result);
205 public void finished(AsyncReadGraph graph) {
206 if (ready.decrementAndGet() == 0) {
207 connectorLinks.addAll(routeLinks);
208 procedure.execute(graph, result);
214 graph.forEachObject(resource, DIA.HasPlainConnector, locationProcedure);
215 graph.forEachObject(resource, DIA.HasInteriorRouteNode, locationProcedure2);
216 graph.forEachObject(resource, DIA.HasArrowConnector, locationProcedure3);