treenode.ts 0.5.0 → 0.7.0

package/dist/TreeNode.d.ts

@@ -3,12 +3,17 @@ import { IParseable } from "./IParseable";
  * Search callback passed to `.pre`, `.post`, and `.breadth`.
  * @public
  */
-export declare type SearchCallback<T> = (node: TreeNode<T>) => boolean | void;
+export type SearchCallback<T> = (node: TreeNode<T>) => boolean | void;
 /**
  * Search methods on TreeNode, passed to `.flatten`.
  * @public
  */
-export declare type SearchStrategy = "pre" | "post" | "breadth";
+export type SearchStrategy = "pre" | "post" | "breadth";
+/**
+ * Nested array representation of a tree.
+ * @public
+ */
+export type NestedArray<T> = T | [T, ...(NestedArray<T> | T[])[]];
 /**
  * @public
  */
@@ -16,6 +21,7 @@ export declare class TreeNode<T> {
     model: T;
     parent: TreeNode<T> | null;
     children: TreeNode<T>[];
+    private _index;
     constructor(model: T, parent?: TreeNode<T> | null, children?: TreeNode<T>[]);
     /**
      * Parses object into a tree and returns the root node.
@@ -29,10 +35,35 @@ export declare class TreeNode<T> {
      * Indices from the root to the node.
      */
     get indices(): number[];
+    /**
+     * Compressed path key: positive = run of first-children, negative = child index.
+     * e.g. [0,0,0,1,0,0] -> "3,-1,2"
+     */
+    get pathKey(): string;
     /**
      * Returns true if the node has children.
      */
     get hasChildren(): boolean;
+    /**
+     * Returns true if the node is the root (has no parent).
+     */
+    get isRoot(): boolean;
+    /**
+     * Returns true if the node is a leaf (has no children).
+     */
+    get isLeaf(): boolean;
+    /**
+     * Returns the root node of the tree.
+     */
+    get root(): TreeNode<T>;
+    /**
+     * Returns the depth of the node (root is 0).
+     */
+    get depth(): number;
+    /**
+     * Returns siblings of this node (excluding self).
+     */
+    get siblings(): TreeNode<T>[];
     /**
      * Add node as a child.
      */
@@ -46,13 +77,18 @@ export declare class TreeNode<T> {
      */
     drop(): TreeNode<T>;
     /**
-     * Returns a shallow-copy.
+     * Returns a deep copy of structure, shallow copy of model.
      */
     clone(): TreeNode<T>;
     /**
      * Returns a node given a list of indices
      */
     fetch(indices: number[]): TreeNode<T> | null;
+    /**
+     * Returns a node given a pathKey string.
+     * @see pathKey
+     */
+    fetchByPathKey(pathKey: string): TreeNode<T> | null;
     /**
      * Returns list of nodes to the root.
      */
@@ -61,6 +97,10 @@ export declare class TreeNode<T> {
      * Iterates over a node's children and returns a new root node.
      */
     map<U>(callback: (node: TreeNode<T>) => U): TreeNode<U>;
+    /**
+     * Iterates over a node's children and returns a new root node.
+     */
+    mapAsync<U>(callback: (node: TreeNode<T>, parent: TreeNode<U> | undefined) => Promise<U>, parent?: TreeNode<U>): Promise<TreeNode<U>>;
     /**
      * Breadth-first search, return true in the callback to end iteration.
      */
@@ -73,10 +113,31 @@ export declare class TreeNode<T> {
      * Depth-first post-order search, return true in the callback to end iteration.
      */
     post(callback: SearchCallback<T>): TreeNode<T> | null;
+    /**
+     * Find the first node matching the predicate.
+     */
+    find(predicate: (node: TreeNode<T>) => boolean, method?: SearchStrategy): TreeNode<T> | null;
+    /**
+     * Find all nodes matching the predicate.
+     */
+    findAll(predicate: (node: TreeNode<T>) => boolean, method?: SearchStrategy): TreeNode<T>[];
     /**
      * Returns a list of nodes.
      */
     flatten(method: SearchStrategy): TreeNode<T>[];
+    /**
+     * Returns a nested array representation of the tree.
+     * - Leaf -> value
+     * - Single child -> [model, ...childResult]
+     * - Multiple leaf children -> [model, [leaves...]]
+     * - Multiple mixed children -> [model, child1Result, child2Result, ...]
+     */
+    toNestedArray(): NestedArray<T>;
+    /**
+     * Creates a tree from a nested array representation.
+     * @see toNestedArray
+     */
+    static fromNestedArray<T>(input: NestedArray<T>): TreeNode<T>;
     /**
      * Returns an object representation of the tree.
      */

package/dist/TreeNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"TreeNode.d.ts","sourceRoot":"","sources":["../src/TreeNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1C;;;GAGG;AACH,oBAAY,cAAc,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,OAAO,GAAG,IAAI,CAAC;AAEtE;;;GAGG;AACH,oBAAY,cAAc,GAAG,KAAK,GAAG,MAAM,GAAG,SAAS,CAAC;AAExD;;GAEG;AACH,qBAAa,QAAQ,CAAC,CAAC;IAEZ,KAAK,EAAE,CAAC;IACR,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI;IAC1B,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE;gBAFvB,KAAK,EAAE,CAAC,EACR,MAAM,GAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAW,EACjC,QAAQ,GAAE,QAAQ,CAAC,CAAC,CAAC,EAAO;IAGrC;;OAEG;IACH,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IAMjD;;OAEG;IACH,IAAI,KAAK,IAAI,MAAM,CAGlB;IAED;;OAEG;IACH,IAAI,OAAO,IAAI,MAAM,EAAE,CAGtB;IAED;;OAEG;IACH,IAAI,WAAW,IAAI,OAAO,CAEzB;IAED;;OAEG;IACH,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IAMpC;;OAEG;IACH,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IAI/B;;OAEG;IACH,IAAI,IAAI,QAAQ,CAAC,CAAC,CAAC;IASnB;;OAEG;IACH,KAAK,IAAI,QAAQ,CAAC,CAAC,CAAC;IAUpB;;OAEG;IACH,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI;IAS5C;;OAEG;IACH,IAAI,IAAI,QAAQ,CAAC,CAAC,CAAC,EAAE;IAUrB;;OAEG;IACH,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IAUvD;;OAEG;IACH,OAAO,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI;IAcxD;;OAEG;IACH,GAAG,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI;IAWpD;;OAEG;IACH,IAAI,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI;IAWrD;;OAEG;IACH,OAAO,CAAC,MAAM,EAAE,cAAc,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE;IAQ9C;;OAEG;IACH,QAAQ,IAAI,UAAU,CAAC,CAAC,CAAC;CAM1B"}
+{"version":3,"file":"TreeNode.d.ts","sourceRoot":"","sources":["../src/TreeNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1C;;;GAGG;AACH,MAAM,MAAM,cAAc,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,OAAO,GAAG,IAAI,CAAC;AAEtE;;;GAGG;AACH,MAAM,MAAM,cAAc,GAAG,KAAK,GAAG,MAAM,GAAG,SAAS,CAAC;AAExD;;;GAGG;AACH,MAAM,MAAM,WAAW,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AAElE;;GAEG;AACH,qBAAa,QAAQ,CAAC,CAAC;IAIZ,KAAK,EAAE,CAAC;IACR,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI;IAC1B,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE;IALhC,OAAO,CAAC,MAAM,CAAa;gBAGlB,KAAK,EAAE,CAAC,EACR,MAAM,GAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAW,EACjC,QAAQ,GAAE,QAAQ,CAAC,CAAC,CAAC,EAAO;IAGrC;;OAEG;IACH,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IAMjD;;OAEG;IACH,IAAI,KAAK,IAAI,MAAM,CAElB;IAED;;OAEG;IACH,IAAI,OAAO,IAAI,MAAM,EAAE,CAQtB;IAED;;;OAGG;IACH,IAAI,OAAO,IAAI,MAAM,CAwBpB;IAED;;OAEG;IACH,IAAI,WAAW,IAAI,OAAO,CAEzB;IAED;;OAEG;IACH,IAAI,MAAM,IAAI,OAAO,CAEpB;IAED;;OAEG;IACH,IAAI,MAAM,IAAI,OAAO,CAEpB;IAED;;OAEG;IACH,IAAI,IAAI,IAAI,QAAQ,CAAC,CAAC,CAAC,CAOtB;IAED;;OAEG;IACH,IAAI,KAAK,IAAI,MAAM,CAElB;IAED;;OAEG;IACH,IAAI,QAAQ,IAAI,QAAQ,CAAC,CAAC,CAAC,EAAE,CAG5B;IAED;;OAEG;IACH,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IAOpC;;OAEG;IACH,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IAI/B;;OAEG;IACH,IAAI,IAAI,QAAQ,CAAC,CAAC,CAAC;IAcnB;;OAEG;IACH,KAAK,IAAI,QAAQ,CAAC,CAAC,CAAC;IAWpB;;OAEG;IACH,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI;IAU5C;;;OAGG;IACH,cAAc,CAAC,OAAO,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI;IAmBnD;;OAEG;IACH,IAAI,IAAI,QAAQ,CAAC,CAAC,CAAC,EAAE;IAUrB;;OAEG;IACH,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IAWvD;;OAEG;IACG,QAAQ,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,KAAK,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAW3I;;OAEG;IACH,OAAO,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI;IAexD;;OAEG;IACH,GAAG,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI;IAWpD;;OAEG;IACH,IAAI,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI;IAWrD;;OAEG;IACH,IAAI,CAAC,SAAS,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,OAAO,EAAE,MAAM,GAAE,cAAsB,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI;IAInG;;OAEG;IACH,OAAO,CAAC,SAAS,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,OAAO,EAAE,MAAM,GAAE,cAAsB,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE;IAQjG;;OAEG;IACH,OAAO,CAAC,MAAM,EAAE,cAAc,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE;IAQ9C;;;;;;OAMG;IACH,aAAa,IAAI,WAAW,CAAC,CAAC,CAAC;IAqB/B;;;OAGG;IACH,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IA8C7D;;OAEG;IACH,QAAQ,IAAI,UAAU,CAAC,CAAC,CAAC;CAM1B"}

package/dist/TreeNode.js

@@ -1,8 +1,48 @@
 "use strict";
-var __spreadArray = (this && this.__spreadArray) || function (to, from) {
-    for (var i = 0, il = from.length, j = to.length; i < il; i++, j++)
-        to[j] = from[i];
-    return to;
+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+};
+var __generator = (this && this.__generator) || function (thisArg, body) {
+    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g = Object.create((typeof Iterator === "function" ? Iterator : Object).prototype);
+    return g.next = verb(0), g["throw"] = verb(1), g["return"] = verb(2), typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
+    function verb(n) { return function (v) { return step([n, v]); }; }
+    function step(op) {
+        if (f) throw new TypeError("Generator is already executing.");
+        while (g && (g = 0, op[0] && (_ = 0)), _) try {
+            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
+            if (y = 0, t) op = [op[0] & 2, t.value];
+            switch (op[0]) {
+                case 0: case 1: t = op; break;
+                case 4: _.label++; return { value: op[1], done: false };
+                case 5: _.label++; y = op[1]; op = [0]; continue;
+                case 7: op = _.ops.pop(); _.trys.pop(); continue;
+                default:
+                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
+                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
+                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
+                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
+                    if (t[2]) _.ops.pop();
+                    _.trys.pop(); continue;
+            }
+            op = body.call(thisArg, _);
+        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
+        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
+    }
+};
+var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
+    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+        if (ar || !(i in from)) {
+            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+            ar[i] = from[i];
+        }
+    }
+    return to.concat(ar || Array.prototype.slice.call(from));
 };
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.TreeNode = void 0;
@@ -16,6 +56,7 @@ var TreeNode = /** @class */ (function () {
         this.model = model;
         this.parent = parent;
         this.children = children;
+        this._index = 0;
     }
     /**
      * Parses object into a tree and returns the root node.
@@ -30,9 +71,7 @@ var TreeNode = /** @class */ (function () {
          * Index of the node among its siblings.
          */
         get: function () {
-            if (!this.parent)
-                return 0;
-            return this.parent.children.indexOf(this);
+            return this._index;
         },
         enumerable: false,
         configurable: true
@@ -42,9 +81,45 @@ var TreeNode = /** @class */ (function () {
          * Indices from the root to the node.
          */
         get: function () {
-            if (!this.parent)
-                return []; // Root
-            return __spreadArray(__spreadArray([], this.parent.indices), [this.index]);
+            var indices = [];
+            var node = this;
+            while (node.parent) {
+                indices.push(node.index);
+                node = node.parent;
+            }
+            return indices.reverse();
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(TreeNode.prototype, "pathKey", {
+        /**
+         * Compressed path key: positive = run of first-children, negative = child index.
+         * e.g. [0,0,0,1,0,0] -> "3,-1,2"
+         */
+        get: function () {
+            var indices = this.indices;
+            if (indices.length === 0)
+                return '';
+            var parts = [];
+            var zeroCount = 0;
+            for (var _i = 0, indices_1 = indices; _i < indices_1.length; _i++) {
+                var idx = indices_1[_i];
+                if (idx === 0) {
+                    zeroCount++;
+                }
+                else {
+                    if (zeroCount > 0) {
+                        parts.push(zeroCount);
+                        zeroCount = 0;
+                    }
+                    parts.push(-idx);
+                }
+            }
+            if (zeroCount > 0) {
+                parts.push(zeroCount);
+            }
+            return parts.join(',');
         },
         enumerable: false,
         configurable: true
@@ -59,11 +134,70 @@ var TreeNode = /** @class */ (function () {
         enumerable: false,
         configurable: true
     });
+    Object.defineProperty(TreeNode.prototype, "isRoot", {
+        /**
+         * Returns true if the node is the root (has no parent).
+         */
+        get: function () {
+            return this.parent === null;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(TreeNode.prototype, "isLeaf", {
+        /**
+         * Returns true if the node is a leaf (has no children).
+         */
+        get: function () {
+            return !this.hasChildren;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(TreeNode.prototype, "root", {
+        /**
+         * Returns the root node of the tree.
+         */
+        get: function () {
+            // eslint-disable-next-line @typescript-eslint/no-this-alias
+            var node = this;
+            while (node.parent) {
+                node = node.parent;
+            }
+            return node;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(TreeNode.prototype, "depth", {
+        /**
+         * Returns the depth of the node (root is 0).
+         */
+        get: function () {
+            return this.parent ? this.parent.depth + 1 : 0;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(TreeNode.prototype, "siblings", {
+        /**
+         * Returns siblings of this node (excluding self).
+         */
+        get: function () {
+            var _this = this;
+            if (this.isRoot)
+                return [];
+            return this.parent.children.filter(function (child) { return child !== _this; });
+        },
+        enumerable: false,
+        configurable: true
+    });
     /**
      * Add node as a child.
      */
     TreeNode.prototype.add = function (child) {
         child.parent = this;
+        child._index = this.children.length;
         this.children.push(child);
         return child;
     };
@@ -77,21 +211,27 @@ var TreeNode = /** @class */ (function () {
      * Remove current node and its children from the tree and return.
      */
     TreeNode.prototype.drop = function () {
-        if (this.parent !== null) {
-            var idx = this.parent.children.indexOf(this);
+        if (!this.isRoot) {
+            var idx = this._index;
             this.parent.children.splice(idx, 1);
+            // Update indices of subsequent siblings
+            for (var i = idx; i < this.parent.children.length; i++) {
+                this.parent.children[i]._index = i;
+            }
             this.parent = null;
+            this._index = 0;
         }
         return this;
     };
     /**
-     * Returns a shallow-copy.
+     * Returns a deep copy of structure, shallow copy of model.
      */
     TreeNode.prototype.clone = function () {
         var node = new TreeNode(this.model);
-        node.children = this.children.map(function (child) {
+        node.children = this.children.map(function (child, i) {
             var newChild = child.clone();
             newChild.parent = node;
+            newChild._index = i;
             return newChild;
         });
         return node;
@@ -100,47 +240,106 @@ var TreeNode = /** @class */ (function () {
      * Returns a node given a list of indices
      */
     TreeNode.prototype.fetch = function (indices) {
+        // eslint-disable-next-line @typescript-eslint/no-this-alias
         var node = this;
-        for (var _i = 0, indices_1 = indices; _i < indices_1.length; _i++) {
-            var i = indices_1[_i];
+        for (var _i = 0, indices_2 = indices; _i < indices_2.length; _i++) {
+            var i = indices_2[_i];
             node = node.children[i];
             if (!node)
                 return null;
         }
-        return node || null;
+        return node;
+    };
+    /**
+     * Returns a node given a pathKey string.
+     * @see pathKey
+     */
+    TreeNode.prototype.fetchByPathKey = function (pathKey) {
+        if (pathKey === '')
+            return this;
+        var indices = [];
+        var parts = pathKey.split(',').map(Number);
+        for (var _i = 0, parts_1 = parts; _i < parts_1.length; _i++) {
+            var part = parts_1[_i];
+            if (part >= 0) {
+                for (var i = 0; i < part; i++) {
+                    indices.push(0);
+                }
+            }
+            else {
+                indices.push(-part);
+            }
+        }
+        return this.fetch(indices);
     };
     /**
      * Returns list of nodes to the root.
      */
     TreeNode.prototype.path = function () {
         var path = [];
-        var addToPath = function (node) {
-            path.unshift(node);
-            if (node.parent)
-                addToPath(node.parent);
-        };
-        addToPath(this);
-        return path;
+        var node = this;
+        while (node) {
+            path.push(node);
+            node = node.parent;
+        }
+        return path.reverse();
     };
     /**
      * Iterates over a node's children and returns a new root node.
      */
     TreeNode.prototype.map = function (callback) {
         var node = new TreeNode(callback(this));
-        node.children = this.children.map(function (child) {
+        node.children = this.children.map(function (child, i) {
             var newChild = child.map(callback);
             newChild.parent = node;
+            newChild._index = i;
             return newChild;
         });
         return node;
     };
+    /**
+     * Iterates over a node's children and returns a new root node.
+     */
+    TreeNode.prototype.mapAsync = function (callback, parent) {
+        return __awaiter(this, void 0, void 0, function () {
+            var node, _a, _b;
+            var _this = this;
+            return __generator(this, function (_c) {
+                switch (_c.label) {
+                    case 0:
+                        _a = TreeNode.bind;
+                        return [4 /*yield*/, callback(this, parent)];
+                    case 1:
+                        node = new (_a.apply(TreeNode, [void 0, _c.sent()]))();
+                        _b = node;
+                        return [4 /*yield*/, Promise.all(this.children.map(function (child, i) { return __awaiter(_this, void 0, void 0, function () {
+                                var newChild;
+                                return __generator(this, function (_a) {
+                                    switch (_a.label) {
+                                        case 0: return [4 /*yield*/, child.mapAsync(callback, node)];
+                                        case 1:
+                                            newChild = _a.sent();
+                                            newChild.parent = node;
+                                            newChild._index = i;
+                                            return [2 /*return*/, newChild];
+                                    }
+                                });
+                            }); }))];
+                    case 2:
+                        _b.children = _c.sent();
+                        return [2 /*return*/, node];
+                }
+            });
+        });
+    };
     /**
      * Breadth-first search, return true in the callback to end iteration.
      */
     TreeNode.prototype.breadth = function (callback) {
         var queue = [this];
-        while (queue.length) {
-            var node = queue.shift();
+        var head = 0;
+        while (head < queue.length) {
+            var node = queue[head++];
             if (callback(node))
                 return node;
             for (var i = 0, childCount = node.children.length; i < childCount; i++) {
@@ -175,6 +374,25 @@ var TreeNode = /** @class */ (function () {
             return this;
         return null;
     };
+    /**
+     * Find the first node matching the predicate.
+     */
+    TreeNode.prototype.find = function (predicate, method) {
+        if (method === void 0) { method = "pre"; }
+        return this[method](function (node) { return predicate(node); });
+    };
+    /**
+     * Find all nodes matching the predicate.
+     */
+    TreeNode.prototype.findAll = function (predicate, method) {
+        if (method === void 0) { method = "pre"; }
+        var results = [];
+        this[method](function (node) {
+            if (predicate(node))
+                results.push(node);
+        });
+        return results;
+    };
     /**
      * Returns a list of nodes.
      */
@@ -185,6 +403,77 @@ var TreeNode = /** @class */ (function () {
         });
         return list;
     };
+    /**
+     * Returns a nested array representation of the tree.
+     * - Leaf -> value
+     * - Single child -> [model, ...childResult]
+     * - Multiple leaf children -> [model, [leaves...]]
+     * - Multiple mixed children -> [model, child1Result, child2Result, ...]
+     */
+    TreeNode.prototype.toNestedArray = function () {
+        if (this.isLeaf) {
+            return this.model;
+        }
+        if (this.children.length === 1) {
+            var childResult = this.children[0].toNestedArray();
+            if (Array.isArray(childResult)) {
+                return __spreadArray([this.model], childResult, true);
+            }
+            return [this.model, childResult];
+        }
+        // Multiple children
+        var allLeaves = this.children.every(function (c) { return c.isLeaf; });
+        if (allLeaves) {
+            return [this.model, this.children.map(function (c) { return c.model; })];
+        }
+        return __spreadArray([this.model], this.children.map(function (c) { return c.toNestedArray(); }), true);
+    };
+    /**
+     * Creates a tree from a nested array representation.
+     * @see toNestedArray
+     */
+    TreeNode.fromNestedArray = function (input) {
+        if (!Array.isArray(input)) {
+            return new TreeNode(input);
+        }
+        var model = input[0], rest = input.slice(1);
+        var node = new TreeNode(model);
+        if (rest.length === 0) {
+            return node;
+        }
+        if (rest.length === 1 && Array.isArray(rest[0])) {
+            var inner = rest[0];
+            var hasArrays_1 = inner.some(function (x) { return Array.isArray(x); });
+            if (!hasArrays_1) {
+                // Multiple leaf children
+                for (var _i = 0, _a = inner; _i < _a.length; _i++) {
+                    var leaf = _a[_i];
+                    node.addModel(leaf);
+                }
+            }
+            else {
+                // Single non-leaf child
+                node.add(TreeNode.fromNestedArray(inner));
+            }
+            return node;
+        }
+        var hasArrays = rest.some(function (x) { return Array.isArray(x); });
+        if (!hasArrays) {
+            // Chain: [model, a, b, c] = model -> a -> b -> c
+            var current = node;
+            for (var _b = 0, _c = rest; _b < _c.length; _b++) {
+                var val = _c[_b];
+                current = current.addModel(val);
+            }
+            return node;
+        }
+        // Multiple children with at least one non-leaf
+        for (var _d = 0, rest_1 = rest; _d < rest_1.length; _d++) {
+            var childResult = rest_1[_d];
+            node.add(TreeNode.fromNestedArray(childResult));
+        }
+        return node;
+    };
     /**
      * Returns an object representation of the tree.
      */

package/dist/TreeNode.js.map

@@ -1 +1 @@
-{"version":3,"file":"TreeNode.js","sourceRoot":"","sources":["../src/TreeNode.ts"],"names":[],"mappings":";;;;;;;;AAcA;;GAEG;AACH;IACE,kBACS,KAAQ,EACR,MAAiC,EACjC,QAA4B;QAD5B,uBAAA,EAAA,aAAiC;QACjC,yBAAA,EAAA,aAA4B;QAF5B,UAAK,GAAL,KAAK,CAAG;QACR,WAAM,GAAN,MAAM,CAA2B;QACjC,aAAQ,GAAR,QAAQ,CAAoB;IAClC,CAAC;IAEJ;;OAEG;IACI,cAAK,GAAZ,UAAgB,IAAmB;QACjC,IAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAC,KAAK,IAAK,OAAA,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAA/B,CAA+B,CAAC,CAAC;QAClE,OAAO,IAAI,CAAC;IACd,CAAC;IAKD,sBAAI,2BAAK;QAHT;;WAEG;aACH;YACE,IAAI,CAAC,IAAI,CAAC,MAAM;gBAAE,OAAO,CAAC,CAAC;YAC3B,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC5C,CAAC;;;OAAA;IAKD,sBAAI,6BAAO;QAHX;;WAEG;aACH;YACE,IAAI,CAAC,IAAI,CAAC,MAAM;gBAAE,OAAO,EAAE,CAAC,CAAC,OAAO;YACpC,uCAAW,IAAI,CAAC,MAAM,CAAC,OAAO,IAAE,IAAI,CAAC,KAAK,GAAE;QAC9C,CAAC;;;OAAA;IAKD,sBAAI,iCAAW;QAHf;;WAEG;aACH;YACE,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QAClC,CAAC;;;OAAA;IAED;;OAEG;IACH,sBAAG,GAAH,UAAI,KAAkB;QACpB,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC;QACpB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1B,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,2BAAQ,GAAR,UAAS,KAAQ;QACf,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAI,KAAK,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,uBAAI,GAAJ;QACE,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE;YACxB,IAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC/C,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACpC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;SACpB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,wBAAK,GAAL;QACE,IAAM,IAAI,GAAG,IAAI,QAAQ,CAAI,IAAI,CAAC,KAAK,CAAC,CAAC;QACzC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAC,KAAK;YACtC,IAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC;YACvB,OAAO,QAAQ,CAAC;QAClB,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,wBAAK,GAAL,UAAM,OAAiB;QACrB,IAAI,IAAI,GAAgB,IAAI,CAAC;QAC7B,KAAc,UAAO,EAAP,mBAAO,EAAP,qBAAO,EAAP,IAAO,EAAE;YAAlB,IAAI,CAAC,gBAAA;YACR,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,CAAC,IAAI;gBAAE,OAAO,IAAI,CAAC;SACxB;QACD,OAAO,IAAI,IAAI,IAAI,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,uBAAI,GAAJ;QACE,IAAM,IAAI,GAAkB,EAAE,CAAC;QAC/B,IAAM,SAAS,GAAG,UAAC,IAAiB;YAClC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACnB,IAAI,IAAI,CAAC,MAAM;gBAAE,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC1C,CAAC,CAAC;QACF,SAAS,CAAC,IAAI,CAAC,CAAC;QAChB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,sBAAG,GAAH,UAAO,QAAkC;QACvC,IAAM,IAAI,GAAG,IAAI,QAAQ,CAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAC,KAAK;YACtC,IAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACrC,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC;YACvB,OAAO,QAAQ,CAAC;QAClB,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,0BAAO,GAAP,UAAQ,QAA2B;QACjC,IAAM,KAAK,GAAkB,CAAC,IAAI,CAAC,CAAC;QAEpC,OAAO,KAAK,CAAC,MAAM,EAAE;YACnB,IAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAiB,CAAC;YAC1C,IAAI,QAAQ,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;gBACtE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;aAC9B;SACF;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,sBAAG,GAAH,UAAI,QAA2B;QAC7B,IAAI,QAAQ,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;YACtE,IAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC5C,IAAI,IAAI;gBAAE,OAAO,IAAI,CAAC;SACvB;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,uBAAI,GAAJ,UAAK,QAA2B;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;YACtE,IAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC7C,IAAI,IAAI;gBAAE,OAAO,IAAI,CAAC;SACvB;QAED,IAAI,QAAQ,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAEhC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,0BAAO,GAAP,UAAQ,MAAsB;QAC5B,IAAM,IAAI,GAAkB,EAAE,CAAC;QAC/B,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,UAAC,IAAI;YAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClB,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,2BAAQ,GAAR;QACE,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAC,KAAK,IAAK,OAAA,KAAK,CAAC,QAAQ,EAAE,EAAhB,CAAgB,CAAC;SACzD,CAAC;IACJ,CAAC;IACH,eAAC;AAAD,CAAC,AAvLD,IAuLC;AAvLY,4BAAQ"}
+{"version":3,"file":"TreeNode.js","sourceRoot":"","sources":["../src/TreeNode.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoBA;;GAEG;AACH;IAGE,kBACS,KAAQ,EACR,MAAiC,EACjC,QAA4B;QAD5B,uBAAA,EAAA,aAAiC;QACjC,yBAAA,EAAA,aAA4B;QAF5B,UAAK,GAAL,KAAK,CAAG;QACR,WAAM,GAAN,MAAM,CAA2B;QACjC,aAAQ,GAAR,QAAQ,CAAoB;QAL7B,WAAM,GAAW,CAAC,CAAC;IAMxB,CAAC;IAEJ;;OAEG;IACI,cAAK,GAAZ,UAAgB,IAAmB;QACjC,IAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAC,KAAK,IAAK,OAAA,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAA/B,CAA+B,CAAC,CAAC;QAClE,OAAO,IAAI,CAAC;IACd,CAAC;IAKD,sBAAI,2BAAK;QAHT;;WAEG;aACH;YACE,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;;;OAAA;IAKD,sBAAI,6BAAO;QAHX;;WAEG;aACH;YACE,IAAM,OAAO,GAAa,EAAE,CAAC;YAC7B,IAAI,IAAI,GAAuB,IAAI,CAAC;YACpC,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC;gBACnB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzB,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;YACrB,CAAC;YACD,OAAO,OAAO,CAAC,OAAO,EAAE,CAAC;QAC3B,CAAC;;;OAAA;IAMD,sBAAI,6BAAO;QAJX;;;WAGG;aACH;YACE,IAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;YAC7B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,EAAE,CAAC;YAEpC,IAAM,KAAK,GAAa,EAAE,CAAC;YAC3B,IAAI,SAAS,GAAG,CAAC,CAAC;YAElB,KAAkB,UAAO,EAAP,mBAAO,EAAP,qBAAO,EAAP,IAAO,EAAE,CAAC;gBAAvB,IAAM,GAAG,gBAAA;gBACZ,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;oBACd,SAAS,EAAE,CAAC;gBACd,CAAC;qBAAM,CAAC;oBACN,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;wBAClB,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;wBACtB,SAAS,GAAG,CAAC,CAAC;oBAChB,CAAC;oBACD,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACnB,CAAC;YACH,CAAC;YAED,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;gBAClB,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACxB,CAAC;YAED,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACzB,CAAC;;;OAAA;IAKD,sBAAI,iCAAW;QAHf;;WAEG;aACH;YACE,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QAClC,CAAC;;;OAAA;IAKD,sBAAI,4BAAM;QAHV;;WAEG;aACH;YACE,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC;QAC9B,CAAC;;;OAAA;IAKD,sBAAI,4BAAM;QAHV;;WAEG;aACH;YACE,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC;QAC3B,CAAC;;;OAAA;IAKD,sBAAI,0BAAI;QAHR;;WAEG;aACH;YACE,4DAA4D;YAC5D,IAAI,IAAI,GAAgB,IAAI,CAAC;YAC7B,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC;gBACnB,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;YACrB,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;;;OAAA;IAKD,sBAAI,2BAAK;QAHT;;WAEG;aACH;YACE,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC;;;OAAA;IAKD,sBAAI,8BAAQ;QAHZ;;WAEG;aACH;YAAA,iBAGC;YAFC,IAAI,IAAI,CAAC,MAAM;gBAAE,OAAO,EAAE,CAAC;YAC3B,OAAO,IAAI,CAAC,MAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,UAAC,KAAK,IAAK,OAAA,KAAK,KAAK,KAAI,EAAd,CAAc,CAAC,CAAC;QACjE,CAAC;;;OAAA;IAED;;OAEG;IACH,sBAAG,GAAH,UAAI,KAAkB;QACpB,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC;QACpB,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QACpC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1B,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,2BAAQ,GAAR,UAAS,KAAQ;QACf,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAI,KAAK,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,uBAAI,GAAJ;QACE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACjB,IAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;YACxB,IAAI,CAAC,MAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACrC,wCAAwC;YACxC,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,MAAO,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxD,IAAI,CAAC,MAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;YACtC,CAAC;YACD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;YACnB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAClB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,wBAAK,GAAL;QACE,IAAM,IAAI,GAAG,IAAI,QAAQ,CAAI,IAAI,CAAC,KAAK,CAAC,CAAC;QACzC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAC,KAAK,EAAE,CAAC;YACzC,IAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC;YACvB,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YACpB,OAAO,QAAQ,CAAC;QAClB,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,wBAAK,GAAL,UAAM,OAAiB;QACrB,4DAA4D;QAC5D,IAAI,IAAI,GAAgB,IAAI,CAAC;QAC7B,KAAgB,UAAO,EAAP,mBAAO,EAAP,qBAAO,EAAP,IAAO,EAAE,CAAC;YAArB,IAAM,CAAC,gBAAA;YACV,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,CAAC,IAAI;gBAAE,OAAO,IAAI,CAAC;QACzB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,iCAAc,GAAd,UAAe,OAAe;QAC5B,IAAI,OAAO,KAAK,EAAE;YAAE,OAAO,IAAI,CAAC;QAEhC,IAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,IAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAE7C,KAAmB,UAAK,EAAL,eAAK,EAAL,mBAAK,EAAL,IAAK,EAAE,CAAC;YAAtB,IAAM,IAAI,cAAA;YACb,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;gBACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC9B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAClB,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,uBAAI,GAAJ;QACE,IAAM,IAAI,GAAkB,EAAE,CAAC;QAC/B,IAAI,IAAI,GAAuB,IAAI,CAAC;QACpC,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChB,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;QACD,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,sBAAG,GAAH,UAAO,QAAkC;QACvC,IAAM,IAAI,GAAG,IAAI,QAAQ,CAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAC,KAAK,EAAE,CAAC;YACzC,IAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACrC,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC;YACvB,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YACpB,OAAO,QAAQ,CAAC;QAClB,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACG,2BAAQ,GAAd,UAAkB,QAA4E,EAAE,MAAoB;;;;;;;6BACjG,QAAQ;wBAAI,qBAAM,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,EAAA;;wBAAnD,IAAI,GAAG,cAAI,QAAQ,WAAI,SAA4B,KAAC;wBAC1D,KAAA,IAAI,CAAA;wBAAY,qBAAM,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAO,KAAK,EAAE,CAAC;;;;gDAChD,qBAAM,KAAK,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAA;;4CAA/C,QAAQ,GAAG,SAAoC;4CACrD,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC;4CACvB,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;4CACpB,sBAAO,QAAQ,EAAC;;;iCACjB,CAAC,CAAC,EAAA;;wBALH,GAAK,QAAQ,GAAG,SAKb,CAAC;wBACJ,sBAAO,IAAI,EAAC;;;;KACb;IAED;;OAEG;IACH,0BAAO,GAAP,UAAQ,QAA2B;QACjC,IAAM,KAAK,GAAkB,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,IAAI,GAAG,CAAC,CAAC;QAEb,OAAO,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;YAC3B,IAAM,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;YAC3B,IAAI,QAAQ,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,sBAAG,GAAH,UAAI,QAA2B;QAC7B,IAAI,QAAQ,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACvE,IAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC5C,IAAI,IAAI;gBAAE,OAAO,IAAI,CAAC;QACxB,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,uBAAI,GAAJ,UAAK,QAA2B;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACvE,IAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC7C,IAAI,IAAI;gBAAE,OAAO,IAAI,CAAC;QACxB,CAAC;QAED,IAAI,QAAQ,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAEhC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,uBAAI,GAAJ,UAAK,SAAyC,EAAE,MAA8B;QAA9B,uBAAA,EAAA,cAA8B;QAC5E,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,UAAC,IAAI,IAAK,OAAA,SAAS,CAAC,IAAI,CAAC,EAAf,CAAe,CAAC,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,0BAAO,GAAP,UAAQ,SAAyC,EAAE,MAA8B;QAA9B,uBAAA,EAAA,cAA8B;QAC/E,IAAM,OAAO,GAAkB,EAAE,CAAC;QAClC,IAAI,CAAC,MAAM,CAAC,CAAC,UAAC,IAAI;YAChB,IAAI,SAAS,CAAC,IAAI,CAAC;gBAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QACH,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,0BAAO,GAAP,UAAQ,MAAsB;QAC5B,IAAM,IAAI,GAAkB,EAAE,CAAC;QAC/B,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,UAAC,IAAI;YAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClB,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;OAMG;IACH,gCAAa,GAAb;QACE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;QAED,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,IAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;YACrD,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC/B,sBAAQ,IAAI,CAAC,KAAK,GAAK,WAAW,QAAE;YACtC,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;QACnC,CAAC;QAED,oBAAoB;QACpB,IAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,MAAM,EAAR,CAAQ,CAAC,CAAC;QACvD,IAAI,SAAS,EAAE,CAAC;YACd,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,KAAK,EAAP,CAAO,CAAC,CAAC,CAAC;QACzD,CAAC;QACD,sBAAQ,IAAI,CAAC,KAAK,GAAK,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,aAAa,EAAE,EAAjB,CAAiB,CAAC,QAAE;IACtE,CAAC;IAED;;;OAGG;IACI,wBAAe,GAAtB,UAA0B,KAAqB;QAC7C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,IAAI,QAAQ,CAAI,KAAK,CAAC,CAAC;QAChC,CAAC;QAEM,IAAA,KAAK,GAAa,KAAK,GAAlB,EAAK,IAAI,GAAI,KAAK,SAAT,CAAU;QAC/B,IAAM,IAAI,GAAG,IAAI,QAAQ,CAAI,KAAK,CAAC,CAAC;QAEpC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAChD,IAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACtB,IAAM,WAAS,GAAG,KAAK,CAAC,IAAI,CAAC,UAAC,CAAC,IAAK,OAAA,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAhB,CAAgB,CAAC,CAAC;YAEtD,IAAI,CAAC,WAAS,EAAE,CAAC;gBACf,yBAAyB;gBACzB,KAAmB,UAAY,EAAZ,KAAA,KAAY,EAAZ,cAAY,EAAZ,IAAY,EAAE,CAAC;oBAA7B,IAAM,IAAI,SAAA;oBACb,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBACtB,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,wBAAwB;gBACxB,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,eAAe,CAAI,KAAuB,CAAC,CAAC,CAAC;YACjE,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,UAAC,CAAC,IAAK,OAAA,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAhB,CAAgB,CAAC,CAAC;QAErD,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,iDAAiD;YACjD,IAAI,OAAO,GAAG,IAAI,CAAC;YACnB,KAAkB,UAAW,EAAX,KAAA,IAAW,EAAX,cAAW,EAAX,IAAW,EAAE,CAAC;gBAA3B,IAAM,GAAG,SAAA;gBACZ,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YAClC,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,+CAA+C;QAC/C,KAA0B,UAAI,EAAJ,aAAI,EAAJ,kBAAI,EAAJ,IAAI,EAAE,CAAC;YAA5B,IAAM,WAAW,aAAA;YACpB,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,eAAe,CAAI,WAA6B,CAAC,CAAC,CAAC;QACvE,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,2BAAQ,GAAR;QACE,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAC,KAAK,IAAK,OAAA,KAAK,CAAC,QAAQ,EAAE,EAAhB,CAAgB,CAAC;SACzD,CAAC;IACJ,CAAC;IACH,eAAC;AAAD,CAAC,AAnZD,IAmZC;AAnZY,4BAAQ"}

package/dist/index.d.ts

@@ -1,3 +1,3 @@
-export { TreeNode, SearchCallback, SearchStrategy } from './TreeNode';
+export { TreeNode, SearchCallback, SearchStrategy, NestedArray } from './TreeNode';
 export { IParseable } from './IParseable';
 //# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AACtE,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,cAAc,EAAE,cAAc,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACnF,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC"}

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;AAAA,uCAAsE;AAA7D,oGAAA,QAAQ,OAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;AAAA,uCAAmF;AAA1E,oGAAA,QAAQ,OAAA"}

package/dist/treenode.ts.d.ts

@@ -1,4 +1,3 @@
-
 /**
  * @public
  */
@@ -7,6 +6,12 @@ export declare interface IParseable<T> {
     children: IParseable<T>[];
 }
 
+/**
+ * Nested array representation of a tree.
+ * @public
+ */
+export declare type NestedArray<T> = T | [T, ...(NestedArray<T> | T[])[]];
+
 /**
  * Search callback passed to `.pre`, `.post`, and `.breadth`.
  * @public
@@ -26,6 +31,7 @@ export declare class TreeNode<T> {
     model: T;
     parent: TreeNode<T> | null;
     children: TreeNode<T>[];
+    private _index;
     constructor(model: T, parent?: TreeNode<T> | null, children?: TreeNode<T>[]);
     /**
      * Parses object into a tree and returns the root node.
@@ -39,10 +45,35 @@ export declare class TreeNode<T> {
      * Indices from the root to the node.
      */
     get indices(): number[];
+    /**
+     * Compressed path key: positive = run of first-children, negative = child index.
+     * e.g. [0,0,0,1,0,0] -> "3,-1,2"
+     */
+    get pathKey(): string;
     /**
      * Returns true if the node has children.
      */
     get hasChildren(): boolean;
+    /**
+     * Returns true if the node is the root (has no parent).
+     */
+    get isRoot(): boolean;
+    /**
+     * Returns true if the node is a leaf (has no children).
+     */
+    get isLeaf(): boolean;
+    /**
+     * Returns the root node of the tree.
+     */
+    get root(): TreeNode<T>;
+    /**
+     * Returns the depth of the node (root is 0).
+     */
+    get depth(): number;
+    /**
+     * Returns siblings of this node (excluding self).
+     */
+    get siblings(): TreeNode<T>[];
     /**
      * Add node as a child.
      */
@@ -56,13 +87,18 @@ export declare class TreeNode<T> {
      */
     drop(): TreeNode<T>;
     /**
-     * Returns a shallow-copy.
+     * Returns a deep copy of structure, shallow copy of model.
      */
     clone(): TreeNode<T>;
     /**
      * Returns a node given a list of indices
      */
     fetch(indices: number[]): TreeNode<T> | null;
+    /**
+     * Returns a node given a pathKey string.
+     * @see pathKey
+     */
+    fetchByPathKey(pathKey: string): TreeNode<T> | null;
     /**
      * Returns list of nodes to the root.
      */
@@ -71,6 +107,10 @@ export declare class TreeNode<T> {
      * Iterates over a node's children and returns a new root node.
      */
     map<U>(callback: (node: TreeNode<T>) => U): TreeNode<U>;
+    /**
+     * Iterates over a node's children and returns a new root node.
+     */
+    mapAsync<U>(callback: (node: TreeNode<T>, parent: TreeNode<U> | undefined) => Promise<U>, parent?: TreeNode<U>): Promise<TreeNode<U>>;
     /**
      * Breadth-first search, return true in the callback to end iteration.
      */
@@ -83,10 +123,31 @@ export declare class TreeNode<T> {
      * Depth-first post-order search, return true in the callback to end iteration.
      */
     post(callback: SearchCallback<T>): TreeNode<T> | null;
+    /**
+     * Find the first node matching the predicate.
+     */
+    find(predicate: (node: TreeNode<T>) => boolean, method?: SearchStrategy): TreeNode<T> | null;
+    /**
+     * Find all nodes matching the predicate.
+     */
+    findAll(predicate: (node: TreeNode<T>) => boolean, method?: SearchStrategy): TreeNode<T>[];
     /**
      * Returns a list of nodes.
      */
     flatten(method: SearchStrategy): TreeNode<T>[];
+    /**
+     * Returns a nested array representation of the tree.
+     * - Leaf -> value
+     * - Single child -> [model, ...childResult]
+     * - Multiple leaf children -> [model, [leaves...]]
+     * - Multiple mixed children -> [model, child1Result, child2Result, ...]
+     */
+    toNestedArray(): NestedArray<T>;
+    /**
+     * Creates a tree from a nested array representation.
+     * @see toNestedArray
+     */
+    static fromNestedArray<T>(input: NestedArray<T>): TreeNode<T>;
     /**
      * Returns an object representation of the tree.
      */

package/dist/tsdoc-metadata.json

@@ -5,7 +5,7 @@
   "toolPackages": [
     {
       "packageName": "@microsoft/api-extractor",
-      "packageVersion": "7.15.1"
+      "packageVersion": "7.55.2"
     }
   ]
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "treenode.ts",
-  "version": "0.5.0",
+  "version": "0.7.0",
   "description": "Tree-like data structure for typescript",
   "main": "dist/index.js",
   "typings": "dist/index.d.ts",
@@ -10,7 +10,8 @@
     "build:docs": "npm run build:api && api-documenter markdown --input ./temp --output ./docs",
     "lint": "eslint . --ext .js,.jsx,.ts,.tsx",
     "prepare": "tsc",
-    "test": "jest"
+    "test": "jest",
+    "test:coverage": "jest --coverage"
   },
   "repository": {
     "type": "git",
@@ -26,15 +27,15 @@
   },
   "homepage": "https://github.com/lubert/treenode.ts#readme",
   "devDependencies": {
-    "@microsoft/api-documenter": "^7.17.17",
-    "@microsoft/api-extractor": "^7.15.1",
-    "@types/jest": "^26.0.23",
-    "@typescript-eslint/eslint-plugin": "^4.23.0",
-    "@typescript-eslint/parser": "^4.23.0",
-    "eslint": "^7.26.0",
-    "jest": "^26.6.3",
-    "ts-jest": "^26.5.6",
-    "typescript": "^4.2.4"
+    "@microsoft/api-documenter": "^7.28.2",
+    "@microsoft/api-extractor": "^7.55.2",
+    "@types/jest": "^29.5.14",
+    "@typescript-eslint/eslint-plugin": "^7.18.0",
+    "@typescript-eslint/parser": "^7.18.0",
+    "eslint": "^8.57.1",
+    "jest": "^29.7.0",
+    "ts-jest": "^29.2.6",
+    "typescript": "^5.7.3"
   },
   "dependencies": {}
 }