photon-grid-core 0.0.1

package/engines/tree/tree-data-service.js

@@ -0,0 +1,296 @@
+import { GridEventType } from '../../types/event.types';
+import { resolveEdges, buildTree, flattenTree } from './tree-node';
+/**
+ * Orchestrates Tree Data end to end: builds the hierarchy from raw row data,
+ * filters it, sorts it, and flattens it into the plain `RowNode[]` the rest
+ * of the pipeline already expects. Plays the same role for self-referential
+ * hierarchies that `GroupingEngine` plays for column-value grouping —
+ * expansion state lives in the separate `TreeExpansionService`, and
+ * filtering/sorting are done by *calling* `FilterEngine`/`SortEngine`, never
+ * by re-implementing condition matching or comparison here.
+ */
+export class TreeDataService {
+    constructor(store, eventBus, filterEngine, sortEngine, expansionService) {
+        this.store = store;
+        this.eventBus = eventBus;
+        this.filterEngine = filterEngine;
+        this.sortEngine = sortEngine;
+        this.expansionService = expansionService;
+        this.config = null;
+        /** The last-built, unfiltered/unsorted tree — kept so `moveNode`/`loadChildren`/selection cascades can resolve a node by id without re-walking raw data. */
+        this.lastRoots = [];
+        this.lastNodesById = new Map();
+        /** Node ids already evaluated against `defaultExpanded` — mirrors `MasterDetailEngine.defaultAppliedNodeIds` so a user-collapsed node is never silently re-expanded on the next pipeline run. */
+        this.defaultAppliedNodeIds = new Set();
+        this.pendingLoadNodeIds = new Set();
+        this.refreshCallback = null;
+    }
+    /** Applies the grid's `treeData` option block. Called once from `GridCore.initialize`. */
+    configure(config) {
+        this.config = config?.enabled ? config : null;
+    }
+    isEnabled() {
+        return this.config !== null;
+    }
+    getConfig() {
+        return this.config;
+    }
+    /** Registers the callback used to re-run the pipeline after an async lazy-load resolves or a reparent commits. Wired from `GridCore`. */
+    setRefreshCallback(fn) {
+        this.refreshCallback = fn;
+    }
+    /** `'parentId'`/`'childrenField'` hierarchies are stored data and can be mutated by drag-to-reparent; `'dataPath'`/`'custom'` are derived and read-only. */
+    supportsReparenting() {
+        return this.config?.mode === 'parentId' || this.config?.mode === 'childrenField';
+    }
+    /**
+     * The full build → filter → sort → flatten sequence `GridApi.applyPipeline`
+     * calls when Tree Data is enabled, replacing the flat filter/sort/group
+     * steps for this pipeline run.
+     */
+    getFlatVisibleRows(allRows, columns) {
+        if (!this.config)
+            return allRows;
+        let roots = this.buildRoots(allRows);
+        this.applyDefaultExpansion(roots);
+        roots = this.filterTree(roots, columns);
+        roots = this.sortTree(roots, columns);
+        return flattenTree(roots, this.expansionService.getExpandedIds());
+    }
+    /** O(n) hierarchy construction from the grid's raw (flat, un-treed) row data. Caches the result for `moveNode`/`loadChildren`/selection-cascade lookups. */
+    buildRoots(allRows) {
+        if (!this.config)
+            return [];
+        const rawRecords = allRows.map((r) => r.data);
+        const edges = resolveEdges(this.config, rawRecords);
+        const roots = buildTree(edges, allRows[0]?.height ?? 50);
+        this.lastRoots = roots;
+        this.lastNodesById = new Map();
+        const index = (nodes) => {
+            for (const node of nodes) {
+                this.lastNodesById.set(node.nodeId, node);
+                if (node.children.length > 0)
+                    index(node.children);
+            }
+        };
+        index(roots);
+        return roots;
+    }
+    /**
+     * Tree-aware filtering: a node survives if it matches the active filters
+     * itself (via `FilterEngine.matchesRow` — the exact predicate the flat
+     * path uses) **or** any descendant does, so a matching leaf's ancestor
+     * chain stays visible. Builds filtered node copies rather than mutating
+     * the cached hierarchy, so `lastRoots`/`lastNodesById` stay the true,
+     * unfiltered tree for reparenting/selection.
+     */
+    filterTree(roots, columns) {
+        if (!this.filterEngine.hasActiveFilters())
+            return roots;
+        const filterNode = (node) => {
+            const filteredChildren = node.children
+                .map(filterNode)
+                .filter((n) => n !== null);
+            const selfMatches = this.filterEngine.matchesRow(node, columns);
+            if (!selfMatches && filteredChildren.length === 0)
+                return null;
+            return { ...node, children: filteredChildren, hasChildren: filteredChildren.length > 0 || node.hasChildren };
+        };
+        return roots.map(filterNode).filter((n) => n !== null);
+    }
+    /**
+     * Tree-aware sorting: reuses `SortEngine.applySorting` completely
+     * unchanged, once per sibling array (including the roots array itself).
+     * `applySorting` already no-ops when no sort is configured, so an
+     * unsorted tree walk costs one cheap pass with zero allocation.
+     */
+    sortTree(roots, columns) {
+        const sortChildren = (nodes) => {
+            const sorted = this.sortEngine.applySorting(nodes, columns);
+            for (const node of sorted) {
+                if (node.children.length > 0)
+                    node.children = sortChildren(node.children);
+            }
+            return sorted;
+        };
+        return sortChildren(roots);
+    }
+    /**
+     * Computes `RowNode.subtreeEndTop` for every tree row in the final,
+     * laid-out `visibleRows` array. Must run *after* `RowModel.setVisibleRows`
+     * assigns `top`/`height` — subtree extents can't be known before layout —
+     * so `GridApi.applyPipeline` calls this as a separate step, not from
+     * `getFlatVisibleRows`. One O(n) stack-based pass: whenever a row appears
+     * whose `level` is <= an open ancestor's level, that ancestor's subtree
+     * just ended at the new row's `top`.
+     */
+    annotateSubtreeExtents(rows) {
+        if (!this.config || rows.length === 0)
+            return;
+        const stack = [];
+        for (const row of rows) {
+            if (row.type !== 'data')
+                continue;
+            while (stack.length > 0 && stack[stack.length - 1].level >= row.level) {
+                stack.pop().subtreeEndTop = row.top;
+            }
+            stack.push(row);
+        }
+        const lastRow = rows[rows.length - 1];
+        const end = lastRow.top + lastRow.height;
+        for (const open of stack)
+            open.subtreeEndTop = end;
+    }
+    getNode(nodeId) {
+        return this.lastNodesById.get(nodeId);
+    }
+    /** The full, unfiltered/unsorted hierarchy from the most recent `getFlatVisibleRows`/`buildRoots` call — what `expandAllTreeNodes`/`collapseAllTreeNodes` walk. */
+    getRoots() {
+        return this.lastRoots;
+    }
+    /**
+     * Mutates the underlying raw hierarchy so a subsequent pipeline run
+     * rebuilds the tree with `draggedId` under its new parent, then requests a
+     * refresh — never hand-splices `visibleRows`, since tree mode always
+     * rebuilds it from raw data on every pipeline run anyway.
+     *
+     * `position: 'before'/'after'` reparents onto the *same parent as*
+     * `targetId`; precise sibling ordering within that parent is not yet
+     * tracked (a follow-up — see plan notes), so the node lands as that
+     * parent's last child rather than at the exact hover position.
+     */
+    moveNode(draggedId, targetId, position) {
+        if (!this.config || !this.supportsReparenting()) {
+            console.warn(`[PhotonGrid] Tree Data drag-to-reparent isn't supported for mode "${this.config?.mode}" (only "parentId"/"childrenField" have a mutable hierarchy).`);
+            return false;
+        }
+        const dragged = this.lastNodesById.get(draggedId);
+        const target = this.lastNodesById.get(targetId);
+        if (!dragged || !target || dragged.isTreeFiller || target.isTreeFiller)
+            return false;
+        const newParent = position === 'inside' ? target : target.parent;
+        if (newParent === dragged || this.isDescendantOf(newParent, dragged))
+            return false; // never drop a node inside its own subtree
+        if (this.config.mode === 'parentId') {
+            const idField = this.config.idField ?? 'id';
+            const parentIdField = this.config.parentIdField ?? 'parentId';
+            dragged.data[parentIdField] = newParent ? newParent.data[idField] : null;
+        }
+        else {
+            this.reparentChildrenField(dragged, newParent);
+        }
+        this.refreshCallback?.();
+        return true;
+    }
+    /** `'childrenField'` mode: splice the raw record out of its old parent's `children` array and into the new one — both are live references shared with `RowModel`'s raw data, so this mutation is visible on the next pipeline run. */
+    reparentChildrenField(dragged, newParent) {
+        const childrenField = this.config.childrenField ?? 'children';
+        const oldParentChildren = dragged.parent
+            ? (dragged.parent.data[childrenField] ?? [])
+            : null;
+        if (oldParentChildren) {
+            const idx = oldParentChildren.indexOf(dragged.data);
+            if (idx !== -1)
+                oldParentChildren.splice(idx, 1);
+        }
+        if (newParent) {
+            const newSiblings = newParent.data[childrenField] ?? [];
+            newSiblings.push(dragged.data);
+            newParent.data[childrenField] = newSiblings;
+        }
+    }
+    isDescendantOf(candidate, ancestor) {
+        let node = candidate;
+        while (node) {
+            if (node === ancestor)
+                return true;
+            node = node.parent;
+        }
+        return false;
+    }
+    /**
+     * Lazy-loads a node's children via `TreeDataConfig.lazyLoadChildren`.
+     * No-ops if lazy loading isn't configured, children are already loaded, or
+     * a fetch for this node is already in flight. On resolve, appends the
+     * fetched raw records as children of `node.data` (mode-appropriate: sets
+     * `parentId` for `'parentId'` mode, pushes into the `children` array for
+     * `'childrenField'` mode) and refreshes.
+     */
+    loadChildren(nodeId) {
+        const fn = this.config?.lazyLoadChildren;
+        const node = this.lastNodesById.get(nodeId);
+        if (!fn || !node || node.childrenLoaded || this.pendingLoadNodeIds.has(nodeId))
+            return;
+        this.pendingLoadNodeIds.add(nodeId);
+        fn(node)
+            .then((children) => {
+            this.attachLoadedChildren(node, children);
+            node.childrenLoaded = true;
+            this.eventBus.emit(GridEventType.TREE_CHILDREN_LOADED, { nodeId, children });
+        })
+            .catch((err) => {
+            console.error(`[PhotonGrid] treeData.lazyLoadChildren failed for node "${nodeId}":`, err);
+        })
+            .finally(() => {
+            this.pendingLoadNodeIds.delete(nodeId);
+            this.refreshCallback?.();
+        });
+    }
+    isLoadPending(nodeId) {
+        return this.pendingLoadNodeIds.has(nodeId);
+    }
+    attachLoadedChildren(node, children) {
+        if (!this.config)
+            return;
+        if (this.config.mode === 'parentId') {
+            const idField = this.config.idField ?? 'id';
+            const parentIdField = this.config.parentIdField ?? 'parentId';
+            const parentId = node.data[idField];
+            for (const child of children)
+                child[parentIdField] = parentId;
+        }
+        else if (this.config.mode === 'childrenField') {
+            const childrenField = this.config.childrenField ?? 'children';
+            node.data[childrenField] = children;
+        }
+    }
+    /**
+     * Applies `TreeDataConfig.defaultExpanded` — but only to nodes never seen
+     * before (tracked in `defaultAppliedNodeIds`, mirroring
+     * `MasterDetailEngine.defaultAppliedNodeIds`). This runs on *every*
+     * pipeline refresh (including the one right after a user collapses a
+     * node), so re-evaluating already-seen nodes here would immediately
+     * stomp a manual collapse back open — the exact bug this guard prevents.
+     * `maxLevel` is `Infinity` for `defaultExpanded: true` (expand everything)
+     * or the configured depth for a number.
+     */
+    applyDefaultExpansion(roots) {
+        const { defaultExpanded } = this.config ?? {};
+        if (!defaultExpanded)
+            return;
+        const maxLevel = defaultExpanded === true ? Infinity : defaultExpanded;
+        const toExpand = [];
+        const collect = (nodes) => {
+            for (const node of nodes) {
+                const isEligible = node.level < maxLevel && (node.children.length > 0 || node.hasChildren);
+                if (isEligible && !this.defaultAppliedNodeIds.has(node.nodeId)) {
+                    this.defaultAppliedNodeIds.add(node.nodeId);
+                    toExpand.push(node);
+                }
+                if (node.children.length > 0)
+                    collect(node.children);
+            }
+        };
+        collect(roots);
+        for (const node of toExpand)
+            this.expansionService.expand(node);
+    }
+    destroy() {
+        this.lastRoots = [];
+        this.lastNodesById.clear();
+        this.defaultAppliedNodeIds.clear();
+        this.pendingLoadNodeIds.clear();
+        this.refreshCallback = null;
+    }
+}
+//# sourceMappingURL=tree-data-service.js.map

package/engines/tree/tree-data-service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-data-service.js","sourceRoot":"","sources":["../../../src/engines/tree/tree-data-service.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,YAAY,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAEnE;;;;;;;;GAQG;AACH,MAAM,OAAO,eAAe;IAa1B,YACU,KAAgB,EAChB,QAAkB,EAClB,YAA0B,EAC1B,UAAsB,EACtB,gBAAsC;QAJtC,UAAK,GAAL,KAAK,CAAW;QAChB,aAAQ,GAAR,QAAQ,CAAU;QAClB,iBAAY,GAAZ,YAAY,CAAc;QAC1B,eAAU,GAAV,UAAU,CAAY;QACtB,qBAAgB,GAAhB,gBAAgB,CAAsB;QAjBxC,WAAM,GAA0B,IAAI,CAAC;QAE7C,4JAA4J;QACpJ,cAAS,GAAc,EAAE,CAAC;QAC1B,kBAAa,GAAG,IAAI,GAAG,EAAmB,CAAC;QAEnD,iMAAiM;QACzL,0BAAqB,GAAG,IAAI,GAAG,EAAU,CAAC;QAE1C,uBAAkB,GAAG,IAAI,GAAG,EAAU,CAAC;QACvC,oBAAe,GAAwB,IAAI,CAAC;IAQjD,CAAC;IAEJ,0FAA0F;IAC1F,SAAS,CAAC,MAAkC;QAC1C,IAAI,CAAC,MAAM,GAAG,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;IAChD,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC;IAC9B,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,yIAAyI;IACzI,kBAAkB,CAAC,EAAc;QAC/B,IAAI,CAAC,eAAe,GAAG,EAAE,CAAC;IAC5B,CAAC;IAED,4JAA4J;IAC5J,mBAAmB;QACjB,OAAO,IAAI,CAAC,MAAM,EAAE,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,MAAM,EAAE,IAAI,KAAK,eAAe,CAAC;IACnF,CAAC;IAED;;;;OAIG;IACH,kBAAkB,CAAC,OAAkB,EAAE,OAAoB;QACzD,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,OAAO,OAAO,CAAC;QAEjC,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACrC,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;QAClC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACxC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACtC,OAAO,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,gBAAgB,CAAC,cAAc,EAAE,CAAC,CAAC;IACpE,CAAC;IAED,4JAA4J;IAC5J,UAAU,CAAC,OAAkB;QAC3B,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,OAAO,EAAE,CAAC;QAC5B,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC9C,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QACpD,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,EAAE,CAAC,CAAC;QAEzD,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;QACvB,IAAI,CAAC,aAAa,GAAG,IAAI,GAAG,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,CAAC,KAAgB,EAAQ,EAAE;YACvC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBAC1C,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrD,CAAC;QACH,CAAC,CAAC;QACF,KAAK,CAAC,KAAK,CAAC,CAAC;QAEb,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;OAOG;IACH,UAAU,CAAC,KAAgB,EAAE,OAAoB;QAC/C,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,gBAAgB,EAAE;YAAE,OAAO,KAAK,CAAC;QAExD,MAAM,UAAU,GAAG,CAAC,IAAa,EAAkB,EAAE;YACnD,MAAM,gBAAgB,GAAG,IAAI,CAAC,QAAQ;iBACnC,GAAG,CAAC,UAAU,CAAC;iBACf,MAAM,CAAC,CAAC,CAAC,EAAgB,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;YAE3C,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YAChE,IAAI,CAAC,WAAW,IAAI,gBAAgB,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YAE/D,OAAO,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,gBAAgB,EAAE,WAAW,EAAE,gBAAgB,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;QAC/G,CAAC,CAAC;QAEF,OAAO,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAgB,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;IACvE,CAAC;IAED;;;;;OAKG;IACH,QAAQ,CAAC,KAAgB,EAAE,OAAoB;QAC7C,MAAM,YAAY,GAAG,CAAC,KAAgB,EAAa,EAAE;YACnD,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC5D,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;gBAC1B,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;oBAAE,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC5E,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC;QACF,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC;IAED;;;;;;;;OAQG;IACH,sBAAsB,CAAC,IAAe;QACpC,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAC9C,MAAM,KAAK,GAAc,EAAE,CAAC;QAC5B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM;gBAAE,SAAS;YAClC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;gBACtE,KAAK,CAAC,GAAG,EAAG,CAAC,aAAa,GAAG,GAAG,CAAC,GAAG,CAAC;YACvC,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAClB,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACtC,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC;QACzC,KAAK,MAAM,IAAI,IAAI,KAAK;YAAE,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC;IACrD,CAAC;IAED,OAAO,CAAC,MAAc;QACpB,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACxC,CAAC;IAED,mKAAmK;IACnK,QAAQ;QACN,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;;;;;;;;;OAUG;IACH,QAAQ,CAAC,SAAiB,EAAE,QAAgB,EAAE,QAAuC;QACnF,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,mBAAmB,EAAE,EAAE,CAAC;YAChD,OAAO,CAAC,IAAI,CAAC,qEAAqE,IAAI,CAAC,MAAM,EAAE,IAAI,+DAA+D,CAAC,CAAC;YACpK,OAAO,KAAK,CAAC;QACf,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAClD,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAChD,IAAI,CAAC,OAAO,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC,YAAY,IAAI,MAAM,CAAC,YAAY;YAAE,OAAO,KAAK,CAAC;QAErF,MAAM,SAAS,GAAG,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QACjE,IAAI,SAAS,KAAK,OAAO,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,OAAO,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,2CAA2C;QAE/H,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YACpC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,IAAI,CAAC;YAC5C,MAAM,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,IAAI,UAAU,CAAC;YAC7D,OAAO,CAAC,IAAgC,CAAC,aAAa,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACxG,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QACjD,CAAC;QAED,IAAI,CAAC,eAAe,EAAE,EAAE,CAAC;QACzB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,sOAAsO;IAC9N,qBAAqB,CAAC,OAAgB,EAAE,SAAyB;QACvE,MAAM,aAAa,GAAG,IAAI,CAAC,MAAO,CAAC,aAAa,IAAI,UAAU,CAAC;QAC/D,MAAM,iBAAiB,GAAG,OAAO,CAAC,MAAM;YACtC,CAAC,CAAC,CAAE,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAA2C,IAAI,EAAE,CAAC;YACvF,CAAC,CAAC,IAAI,CAAC;QAET,IAAI,iBAAiB,EAAE,CAAC;YACtB,MAAM,GAAG,GAAG,iBAAiB,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACpD,IAAI,GAAG,KAAK,CAAC,CAAC;gBAAE,iBAAiB,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACnD,CAAC;QAED,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,WAAW,GAAI,SAAS,CAAC,IAAI,CAAC,aAAa,CAA2C,IAAI,EAAE,CAAC;YACnG,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC/B,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,WAAW,CAAC;QAC9C,CAAC;IACH,CAAC;IAEO,cAAc,CAAC,SAAyB,EAAE,QAAiB;QACjE,IAAI,IAAI,GAAG,SAAS,CAAC;QACrB,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,IAAI,KAAK,QAAQ;gBAAE,OAAO,IAAI,CAAC;YACnC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;OAOG;IACH,YAAY,CAAC,MAAc;QACzB,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,gBAAgB,CAAC;QACzC,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO;QAEvF,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpC,EAAE,CAAC,IAAI,CAAC;aACL,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE;YACjB,IAAI,CAAC,oBAAoB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAC1C,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;YAC3B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,oBAAoB,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC/E,CAAC,CAAC;aACD,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE;YACb,OAAO,CAAC,KAAK,CAAC,2DAA2D,MAAM,IAAI,EAAE,GAAG,CAAC,CAAC;QAC5F,CAAC,CAAC;aACD,OAAO,CAAC,GAAG,EAAE;YACZ,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACvC,IAAI,CAAC,eAAe,EAAE,EAAE,CAAC;QAC3B,CAAC,CAAC,CAAC;IACP,CAAC;IAED,aAAa,CAAC,MAAc;QAC1B,OAAO,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7C,CAAC;IAEO,oBAAoB,CAAC,IAAa,EAAE,QAAmC;QAC7E,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,OAAO;QACzB,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YACpC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,IAAI,CAAC;YAC5C,MAAM,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,IAAI,UAAU,CAAC;YAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACpC,KAAK,MAAM,KAAK,IAAI,QAAQ;gBAAE,KAAK,CAAC,aAAa,CAAC,GAAG,QAAQ,CAAC;QAChE,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;YAChD,MAAM,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,IAAI,UAAU,CAAC;YAC9D,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,QAAQ,CAAC;QACtC,CAAC;IACH,CAAC;IAED;;;;;;;;;OASG;IACK,qBAAqB,CAAC,KAAgB;QAC5C,MAAM,EAAE,eAAe,EAAE,GAAG,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC;QAC9C,IAAI,CAAC,eAAe;YAAE,OAAO;QAE7B,MAAM,QAAQ,GAAG,eAAe,KAAK,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,eAAe,CAAC;QACvE,MAAM,QAAQ,GAAc,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAG,CAAC,KAAgB,EAAQ,EAAE;YACzC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,GAAG,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC;gBAC3F,IAAI,UAAU,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC/D,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC5C,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACtB,CAAC;gBACD,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;oBAAE,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvD,CAAC;QACH,CAAC,CAAC;QACF,OAAO,CAAC,KAAK,CAAC,CAAC;QACf,KAAK,MAAM,IAAI,IAAI,QAAQ;YAAE,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAClE,CAAC;IAED,OAAO;QACL,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,CAAC;QACnC,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,CAAC;QAChC,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC;IAC9B,CAAC;CACF"}

package/engines/tree/tree-expansion-service.d.ts

@@ -0,0 +1,35 @@
+import type { RowNode } from '../../types/row.types';
+import type { GridStore } from '../../core/grid-store';
+import type { EventBus } from '../../event-bus/event-bus';
+/**
+ * Owns Tree Data's expand/collapse state — `expandedTreeNodeIds` on
+ * `GridStore` — and nothing else. Deliberately kept separate from
+ * `TreeDataService` (which builds/filters/sorts the hierarchy) even though
+ * `GroupingEngine` inlines this exact same responsibility for column-value
+ * groups; splitting it out here is what the tree feature asked for, and
+ * doesn't require touching grouping's already-working code to match.
+ *
+ * Method shapes mirror `GroupingEngine.expandGroup`/`collapseGroup`/
+ * `toggleGroup`/`isGroupExpanded` (`grouping-engine.ts:72-107`) almost
+ * verbatim — same pattern, different key namespace.
+ */
+export declare class TreeExpansionService {
+    private store;
+    private eventBus;
+    constructor(store: GridStore, eventBus: EventBus);
+    expand(node: RowNode): void;
+    collapse(node: RowNode): void;
+    toggle(node: RowNode): void;
+    isExpanded(nodeId: string): boolean;
+    /** Expands every node in `roots` (and their descendants) — "expand all". */
+    expandAll(roots: RowNode[]): void;
+    collapseAll(): void;
+    /**
+     * Expands every node whose depth is less than `maxLevel` — backs
+     * `TreeDataConfig.defaultExpanded` when it's a number (e.g. `1` expands
+     * just the roots). `maxLevel <= 0` leaves everything collapsed.
+     */
+    expandToLevel(roots: RowNode[], maxLevel: number): void;
+    getExpandedIds(): ReadonlySet<string>;
+}
+//# sourceMappingURL=tree-expansion-service.d.ts.map

package/engines/tree/tree-expansion-service.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-expansion-service.d.ts","sourceRoot":"","sources":["../../../src/engines/tree/tree-expansion-service.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,2BAA2B,CAAC;AAG1D;;;;;;;;;;;GAWG;AACH,qBAAa,oBAAoB;IAE7B,OAAO,CAAC,KAAK;IACb,OAAO,CAAC,QAAQ;gBADR,KAAK,EAAE,SAAS,EAChB,QAAQ,EAAE,QAAQ;IAG5B,MAAM,CAAC,IAAI,EAAE,OAAO,GAAG,IAAI;IAO3B,QAAQ,CAAC,IAAI,EAAE,OAAO,GAAG,IAAI;IAO7B,MAAM,CAAC,IAAI,EAAE,OAAO,GAAG,IAAI;IAK3B,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAInC,4EAA4E;IAC5E,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,IAAI;IAYjC,WAAW,IAAI,IAAI;IAInB;;;;OAIG;IACH,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI;IAkBvD,cAAc,IAAI,WAAW,CAAC,MAAM,CAAC;CAGtC"}

package/engines/tree/tree-expansion-service.js

@@ -0,0 +1,84 @@
+import { GridEventType } from '../../types/event.types';
+/**
+ * Owns Tree Data's expand/collapse state — `expandedTreeNodeIds` on
+ * `GridStore` — and nothing else. Deliberately kept separate from
+ * `TreeDataService` (which builds/filters/sorts the hierarchy) even though
+ * `GroupingEngine` inlines this exact same responsibility for column-value
+ * groups; splitting it out here is what the tree feature asked for, and
+ * doesn't require touching grouping's already-working code to match.
+ *
+ * Method shapes mirror `GroupingEngine.expandGroup`/`collapseGroup`/
+ * `toggleGroup`/`isGroupExpanded` (`grouping-engine.ts:72-107`) almost
+ * verbatim — same pattern, different key namespace.
+ */
+export class TreeExpansionService {
+    constructor(store, eventBus) {
+        this.store = store;
+        this.eventBus = eventBus;
+    }
+    expand(node) {
+        const ids = new Set(this.store.get('expandedTreeNodeIds'));
+        ids.add(node.nodeId);
+        this.store.set('expandedTreeNodeIds', ids);
+        this.eventBus.emit(GridEventType.TREE_NODE_EXPANDED, { nodeId: node.nodeId, row: node });
+    }
+    collapse(node) {
+        const ids = new Set(this.store.get('expandedTreeNodeIds'));
+        ids.delete(node.nodeId);
+        this.store.set('expandedTreeNodeIds', ids);
+        this.eventBus.emit(GridEventType.TREE_NODE_COLLAPSED, { nodeId: node.nodeId, row: node });
+    }
+    toggle(node) {
+        if (this.isExpanded(node.nodeId))
+            this.collapse(node);
+        else
+            this.expand(node);
+    }
+    isExpanded(nodeId) {
+        return this.store.get('expandedTreeNodeIds').has(nodeId);
+    }
+    /** Expands every node in `roots` (and their descendants) — "expand all". */
+    expandAll(roots) {
+        const ids = new Set();
+        const collect = (nodes) => {
+            for (const node of nodes) {
+                if (node.children.length > 0 || node.hasChildren)
+                    ids.add(node.nodeId);
+                if (node.children.length > 0)
+                    collect(node.children);
+            }
+        };
+        collect(roots);
+        this.store.set('expandedTreeNodeIds', ids);
+    }
+    collapseAll() {
+        this.store.set('expandedTreeNodeIds', new Set());
+    }
+    /**
+     * Expands every node whose depth is less than `maxLevel` — backs
+     * `TreeDataConfig.defaultExpanded` when it's a number (e.g. `1` expands
+     * just the roots). `maxLevel <= 0` leaves everything collapsed.
+     */
+    expandToLevel(roots, maxLevel) {
+        if (maxLevel <= 0) {
+            this.collapseAll();
+            return;
+        }
+        const ids = new Set();
+        const collect = (nodes) => {
+            for (const node of nodes) {
+                if (node.level < maxLevel && (node.children.length > 0 || node.hasChildren)) {
+                    ids.add(node.nodeId);
+                    if (node.children.length > 0)
+                        collect(node.children);
+                }
+            }
+        };
+        collect(roots);
+        this.store.set('expandedTreeNodeIds', ids);
+    }
+    getExpandedIds() {
+        return this.store.get('expandedTreeNodeIds');
+    }
+}
+//# sourceMappingURL=tree-expansion-service.js.map

package/engines/tree/tree-expansion-service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-expansion-service.js","sourceRoot":"","sources":["../../../src/engines/tree/tree-expansion-service.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AAExD;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,oBAAoB;IAC/B,YACU,KAAgB,EAChB,QAAkB;QADlB,UAAK,GAAL,KAAK,CAAW;QAChB,aAAQ,GAAR,QAAQ,CAAU;IACzB,CAAC;IAEJ,MAAM,CAAC,IAAa;QAClB,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC,CAAC;QAC3D,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,qBAAqB,EAAE,GAAG,CAAC,CAAC;QAC3C,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,kBAAkB,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC;IAC3F,CAAC;IAED,QAAQ,CAAC,IAAa;QACpB,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC,CAAC;QAC3D,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,qBAAqB,EAAE,GAAG,CAAC,CAAC;QAC3C,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,mBAAmB,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC;IAC5F,CAAC;IAED,MAAM,CAAC,IAAa;QAClB,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;;YACjD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,UAAU,CAAC,MAAc;QACvB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC3D,CAAC;IAED,4EAA4E;IAC5E,SAAS,CAAC,KAAgB;QACxB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;QAC9B,MAAM,OAAO,GAAG,CAAC,KAAgB,EAAQ,EAAE;YACzC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,WAAW;oBAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACvE,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;oBAAE,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvD,CAAC;QACH,CAAC,CAAC;QACF,OAAO,CAAC,KAAK,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,qBAAqB,EAAE,GAAG,CAAC,CAAC;IAC7C,CAAC;IAED,WAAW;QACT,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,qBAAqB,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IACnD,CAAC;IAED;;;;OAIG;IACH,aAAa,CAAC,KAAgB,EAAE,QAAgB;QAC9C,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;YAClB,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,OAAO;QACT,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;QAC9B,MAAM,OAAO,GAAG,CAAC,KAAgB,EAAQ,EAAE;YACzC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,IAAI,CAAC,KAAK,GAAG,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;oBAC5E,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACrB,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;wBAAE,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACvD,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QACF,OAAO,CAAC,KAAK,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,qBAAqB,EAAE,GAAG,CAAC,CAAC;IAC7C,CAAC;IAED,cAAc;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC;IAC/C,CAAC;CACF"}

package/engines/tree/tree-node.d.ts

@@ -0,0 +1,40 @@
+import type { RowNode } from '../../types/row.types';
+import type { TreeDataConfig, TreeEdge } from '../../types/tree-data.types';
+/**
+ * Resolves raw row data into `{id, parentId, record}` edges, ready for
+ * {@link buildTree}. Dispatches on `config.mode` — this is the only place
+ * that branches on hierarchy source; everything downstream is source-agnostic.
+ */
+export declare function resolveEdges(config: TreeDataConfig, rawRecords: Record<string, unknown>[]): TreeEdge[];
+/**
+ * `childrenField` mode: input is already nested (`data[i][childrenField]` is
+ * an array of raw child records, not `RowNode`s), so it needs one O(n) DFS
+ * walk before it can be treated like every other mode's flat edge list.
+ *
+ * Ids fall back to a positional path (`"0"`, `"0.1"`, `"0.1.2"`, ...) when a
+ * record has no `idField` value — stable across rebuilds as long as the
+ * caller's array order/shape doesn't change between pipeline runs, which is
+ * what keeps `expandedTreeNodeIds` (keyed by these ids) from losing state on
+ * every `refresh()`.
+ */
+export declare function flattenNestedChildren(rootsRaw: Record<string, unknown>[], childrenField: string, idField: string): TreeEdge[];
+/**
+ * Builds the `RowNode` tree from resolved edges — classic two-pass O(n)
+ * construction (no O(n²) parent scanning): pass 1 creates every node keyed
+ * by id, pass 2 wires `children`/`parent`/`level` by looking up each edge's
+ * `parentId`. An edge whose `parentId` doesn't resolve to a known id (a
+ * dangling reference, or a genuine root) becomes a root.
+ *
+ * `expanded` is intentionally left `false` here — it's set per-node by
+ * {@link flattenTree} at flatten time, since expansion state is external,
+ * mutable, and this function is called fresh on every pipeline run.
+ */
+export declare function buildTree(edges: TreeEdge[], defaultRowHeight?: number): RowNode[];
+/**
+ * Flattens an expanded subset of the tree into the flat `RowNode[]` every
+ * downstream consumer (pagination, Master/Detail injection, virtualization)
+ * already expects — mirrors `flattenGroupTree` (`group-node.ts`) exactly:
+ * push a node, recurse into its children only if it's expanded.
+ */
+export declare function flattenTree(roots: RowNode[], expandedIds: ReadonlySet<string>): RowNode[];
+//# sourceMappingURL=tree-node.d.ts.map

package/engines/tree/tree-node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-node.d.ts","sourceRoot":"","sources":["../../../src/engines/tree/tree-node.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAwB5E;;;;GAIG;AACH,wBAAgB,YAAY,CAC1B,MAAM,EAAE,cAAc,EACtB,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,GACpC,QAAQ,EAAE,CAaZ;AAkED;;;;;;;;;;GAUG;AACH,wBAAgB,qBAAqB,CACnC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,EACnC,aAAa,EAAE,MAAM,EACrB,OAAO,EAAE,MAAM,GACd,QAAQ,EAAE,CAqBZ;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,gBAAgB,SAAK,GAAG,OAAO,EAAE,CA+C7E;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,WAAW,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,OAAO,EAAE,CAazF"}