layerchart 0.3.1 → 0.3.2

package/package.json

@@ -3,7 +3,7 @@
   "author": "Sean Lynch <techniq35@gmail.com>",
   "license": "MIT",
   "repository": "techniq/layerchart",
-  "version": "0.3.1",
+  "version": "0.3.2",
   "devDependencies": {
     "@sveltejs/adapter-vercel": "^1.0.0-next.47",
     "@sveltejs/kit": "^1.0.0-next.303",
@@ -91,6 +91,7 @@
     "./utils/event": "./utils/event.js",
     "./utils/genData": "./utils/genData.js",
     "./utils/graph": "./utils/graph.js",
+    "./utils/hierarchy": "./utils/hierarchy.js",
     "./utils": "./utils/index.js",
     "./utils/math": "./utils/math.js",
     "./utils/path": "./utils/path.js",

package/utils/hierarchy.d.ts

@@ -0,0 +1,6 @@
+import type { HierarchyNode } from 'd3-hierarchy';
+/**
+ *  Find first ancestor matching filter, including node.
+ *  Similar to `node.find()` (https://github.com/d3/d3-hierarchy#node_find) but checks ancestors instead of descendants
+ */
+export declare function findAncestor<T = any>(node: HierarchyNode<T>, filter: (node: any) => boolean): HierarchyNode<T>;

package/utils/hierarchy.js

@@ -0,0 +1,13 @@
+/**
+ *  Find first ancestor matching filter, including node.
+ *  Similar to `node.find()` (https://github.com/d3/d3-hierarchy#node_find) but checks ancestors instead of descendants
+ */
+export function findAncestor(node, filter) {
+    while (node) {
+        if (filter(node)) {
+            return node;
+        }
+        node = node.parent;
+    }
+    return null;
+}