X-Git-Url: https://gerrit.simantics.org/r/gitweb?a=blobdiff_plain;f=bundles%2Forg.simantics.scenegraph%2Fsrc%2Forg%2Fsimantics%2Fscenegraph%2Futils%2FNodeUtil.java;h=9439369a5927a89b9cfb714f15a296ef1c0ed678;hb=b61161c26b1711e075a685b00d961978640acb82;hp=c3bb2144108256319a21368469d2385216db658e;hpb=9d4a145fef9bcec16e3d1f1477894cba6429b9c4;p=simantics%2Fplatform.git

diff --git a/bundles/org.simantics.scenegraph/src/org/simantics/scenegraph/utils/NodeUtil.java b/bundles/org.simantics.scenegraph/src/org/simantics/scenegraph/utils/NodeUtil.java
index c3bb21441..9439369a5 100644
--- a/bundles/org.simantics.scenegraph/src/org/simantics/scenegraph/utils/NodeUtil.java
+++ b/bundles/org.simantics.scenegraph/src/org/simantics/scenegraph/utils/NodeUtil.java
@@ -32,6 +32,7 @@ import java.util.concurrent.TimeUnit;
 import java.util.concurrent.locks.Condition;
 import java.util.concurrent.locks.Lock;
 import java.util.concurrent.locks.ReentrantLock;
+import java.util.function.Function;
 
 import org.simantics.scenegraph.IDynamicSelectionPainterNode;
 import org.simantics.scenegraph.ILookupService;
@@ -96,6 +97,18 @@ public final class NodeUtil {
         }
     }
 
+    public static INode getPossibleNearestParentOfType(INode node, Class<?> clazz) {
+        ParentNode<?> parent = null;
+        while (true) {
+            parent = node.getParent();
+            if (parent == null)
+                return null;
+            node = parent;
+            if (clazz.isInstance(node))
+                return node;
+        }
+    }
+
     public static INode getRootNode(INode node) {
         ParentNode<?> parent = null;
         while (true) {
@@ -276,6 +289,7 @@ public final class NodeUtil {
         printSceneGraph(System.out, 0, node);
     }
 
+    @FunctionalInterface
     public static interface NodeProcedure<T> {
         T execute(INode node, String id);
     }
@@ -324,6 +338,47 @@ public final class NodeUtil {
         return result;
     }
 
+    /**
+     * Recursively iterates through all child nodes of the specified node and
+     * for those nodes that are of class <code>ofClass</code>, invokes
+     * <code>consumer</code>.
+     * 
+     * @param node
+     * @param ofClass
+     * @param consumer
+     */
+    @SuppressWarnings("unchecked")
+    public static <T extends INode> INode forChildrenDeep(INode node, Class<T> ofClass, Function<T, INode> func) {
+        return forChildrenDeep(node, n -> ofClass.isInstance(n) ? func.apply((T) n) : null);
+    }
+
+    public static <T extends INode> INode forChildrenDeep(INode node, Function<INode, INode> func) {
+        INode ret = func.apply(node);
+        if (ret != null)
+            return ret;
+
+        if (node instanceof ParentNode<?>) {
+            if (node instanceof G2DParentNode) {
+                G2DParentNode g2dpn = (G2DParentNode) node;
+                for (IG2DNode n : g2dpn.getSortedNodes()) {
+                    INode r = forChildrenDeep(n, func);
+                    if (r != null) {
+                        return r;
+                    }
+                }
+            } else {
+                for (INode n : ((ParentNode<?>) node).getNodes()) {
+                    INode r = forChildrenDeep(n, func);
+                    if (r != null) {
+                        return r;
+                    }
+                }
+            }
+        }
+
+        return null;
+    }
+
     public static final int countTreeNodes(INode node) {
         int result = 1;
         if (node instanceof ParentNode<?>) {