--- /dev/null
+/*******************************************************************************\r
+ * Copyright (c) 2007, 2010 Association for Decentralized Information Management\r
+ * in Industry THTH ry.\r
+ * All rights reserved. This program and the accompanying materials\r
+ * are made available under the terms of the Eclipse Public License v1.0\r
+ * which accompanies this distribution, and is available at\r
+ * http://www.eclipse.org/legal/epl-v10.html\r
+ *\r
+ * Contributors:\r
+ * VTT Technical Research Centre of Finland - initial API and implementation\r
+ *******************************************************************************/\r
+package org.simantics.scenegraph.tests;\r
+\r
+import static junit.framework.Assert.assertSame;\r
+\r
+import java.util.ArrayList;\r
+import java.util.List;\r
+import java.util.UUID;\r
+import java.util.concurrent.CyclicBarrier;\r
+import java.util.concurrent.Semaphore;\r
+import java.util.concurrent.atomic.AtomicBoolean;\r
+\r
+import org.junit.Test;\r
+import org.simantics.scenegraph.INode;\r
+import org.simantics.scenegraph.ParentNode;\r
+import org.simantics.scenegraph.g2d.G2DParentNode;\r
+import org.simantics.scenegraph.g2d.G2DSceneGraph;\r
+import org.simantics.scenegraph.g2d.nodes.DataNode;\r
+import org.simantics.scenegraph.g2d.nodes.NavigationNode;\r
+import org.simantics.scenegraph.utils.NodeUtil;\r
+\r
+\r
+/**\r
+ * @author Tuukka Lehtonen\r
+ */\r
+public class LookupServiceTests {\r
+\r
+ AtomicBoolean endTest;\r
+ CyclicBarrier startBarrier;\r
+ Semaphore ended;\r
+\r
+ G2DSceneGraph root = new G2DSceneGraph();\r
+ List<INode> nodes = new ArrayList<INode>();\r
+ List<String> nodeIds = new ArrayList<String>();\r
+ List<String> mappedIds = new ArrayList<String>();\r
+\r
+ List<Throwable> errors = new ArrayList<Throwable>();\r
+\r
+\r
+ <T extends INode> T addAndMapNode(ParentNode<?> parent, String id, Class<T> clazz) {\r
+ T node = parent.addNode(id, clazz);\r
+ nodes.add( node );\r
+ nodeIds.add( id );\r
+ NodeUtil.map(node, id);\r
+ return node;\r
+ }\r
+\r
+ <T extends INode> T addNode(ParentNode<?> parent, String id, Class<T> clazz) {\r
+ T node = parent.addNode(id, clazz);\r
+ nodes.add( node );\r
+ nodeIds.add( id );\r
+ return node;\r
+ }\r
+\r
+ <T extends INode> T addNode(ParentNode<?> parent, Class<T> clazz) {\r
+ return addNode(parent, UUID.randomUUID().toString(), clazz);\r
+ }\r
+\r
+ @Test\r
+ public void testLookup() throws Exception {\r
+ NavigationNode nav = addAndMapNode(root, "navigation", NavigationNode.class);\r
+ DataNode data = addAndMapNode(root, "data", DataNode.class);\r
+ G2DParentNode elements = addAndMapNode(nav, "elements", G2DParentNode.class);\r
+ @SuppressWarnings("unused")\r
+ G2DParentNode ghosts = addAndMapNode(nav, "ghosts", G2DParentNode.class);\r
+\r
+ // Basic checks\r
+ assertSame(nav, root.lookupNode("navigation"));\r
+ assertSame(data, root.lookupNode("data"));\r
+ assertSame(nav, NodeUtil.lookup(nav, "navigation"));\r
+ assertSame(data, NodeUtil.lookup(data, "data"));\r
+\r
+ String id1 = UUID.randomUUID().toString();\r
+ String id2 = UUID.randomUUID().toString();\r
+ String id3_1 = UUID.randomUUID().toString();\r
+ String id3_2 = UUID.randomUUID().toString();\r
+ String id4 = UUID.randomUUID().toString();\r
+ G2DParentNode e1 = addAndMapNode(elements, id1, G2DParentNode.class);\r
+ G2DParentNode e2 = addAndMapNode(elements, id2, G2DParentNode.class);\r
+ G2DParentNode e3 = addNode(elements, G2DParentNode.class);\r
+ G2DParentNode e3_1 = addAndMapNode(e3, id3_1, G2DParentNode.class);\r
+ G2DParentNode e3_2 = addAndMapNode(e3, id3_2, G2DParentNode.class);\r
+ G2DParentNode e4 = addAndMapNode(elements, id4, G2DParentNode.class);\r
+\r
+ assertSame(e1, NodeUtil.lookup(e1, id1));\r
+ assertSame(e2, NodeUtil.lookup(e2, id2));\r
+ assertSame(e3_1, NodeUtil.lookup(e3_1, id3_1));\r
+ assertSame(e3_2, NodeUtil.lookup(e3_2, id3_2));\r
+ assertSame(e4, NodeUtil.lookup(e4, id4));\r
+ }\r
+\r
+}\r