@snack-uikit/tree 0.10.2-preview-013112d8.0 → 0.10.2

package/CHANGELOG.md

@@ -3,6 +3,16 @@
 All notable changes to this project will be documented in this file.
 See [Conventional Commits](https://conventionalcommits.org) for commit guidelines.
 
+## 0.10.2 (2026-03-17)
+
+### Only dependencies have been changed
+* [@snack-uikit/list@0.32.16]($PUBLIC_PROJECT_URL/blob/master/packages/list/CHANGELOG.md)
+* [@snack-uikit/truncate-string@0.7.10]($PUBLIC_PROJECT_URL/blob/master/packages/truncate-string/CHANGELOG.md)
+
+
+
+
+
 ## 0.10.1 (2026-03-11)
 
 ### Only dependencies have been changed

package/README.md

@@ -90,18 +90,6 @@ function TreeAsyncLoadExample() {
 
 [//]: DOCUMENTATION_SECTION_START
 [//]: THIS_SECTION_IS_AUTOGENERATED_PLEASE_DONT_EDIT_IT
-## getSearchedTreeItems
-### Props
-| name | type | default value | description |
-|------|------|---------------|-------------|
-| tree* | `ExtendedTreeNodeProps[]` | - |  |
-| searchOptions | `Partial<{ query: string; includeChildrenMatchedParent: boolean; }>` | - |  |
-## getSearchedTreeNodeById
-### Props
-| name | type | default value | description |
-|------|------|---------------|-------------|
-| searchOptions* | `{ id: I; includeNested?: boolean; }` | - |  |
-| tree* | `T[]` | - |  |
 ## Tree
 ### Props
 | name | type | default value | description |

package/dist/cjs/helpers/index.d.ts

@@ -6,5 +6,3 @@ export * from './getSearchedTreeNodeById';
 export * from './lookupTreeForSelectedNodes';
 export * from './sortTreeItemsByTitle';
 export * from './traverse';
-export * from './setChildrenOfTreeNode';
-export * from './collectEmptyNestedNodesInExpanded';

package/dist/cjs/helpers/index.js

@@ -29,6 +29,4 @@ __exportStar(require("./getSearchedTreeItems"), exports);
 __exportStar(require("./getSearchedTreeNodeById"), exports);
 __exportStar(require("./lookupTreeForSelectedNodes"), exports);
 __exportStar(require("./sortTreeItemsByTitle"), exports);
-__exportStar(require("./traverse"), exports);
-__exportStar(require("./setChildrenOfTreeNode"), exports);
-__exportStar(require("./collectEmptyNestedNodesInExpanded"), exports);
+__exportStar(require("./traverse"), exports);

package/dist/cjs/helpers/sortTreeItemsByTitle.js

@@ -6,8 +6,8 @@ Object.defineProperty(exports, "__esModule", {
 exports.sortTreeItemsByTitle = void 0;
 const extractTreeNodeTitle_1 = require("./extractTreeNodeTitle");
 const sortTreeItemsByTitle = items => items === null || items === void 0 ? void 0 : items.toSorted((itemA, itemB) => {
-  const valueA = (0, extractTreeNodeTitle_1.extractTreeNodeTitle)(itemA).toLowerCase();
-  const valueB = (0, extractTreeNodeTitle_1.extractTreeNodeTitle)(itemB).toLowerCase();
+  const valueA = (0, extractTreeNodeTitle_1.extractTreeNodeTitle)(itemA);
+  const valueB = (0, extractTreeNodeTitle_1.extractTreeNodeTitle)(itemB);
   return valueA.localeCompare(valueB);
 });
 exports.sortTreeItemsByTitle = sortTreeItemsByTitle;

package/dist/cjs/helpers/traverse.d.ts

@@ -1,8 +1,2 @@
-import { TreeNodeProps } from '../types';
+import { TreeNodeProps } from '../';
 export declare const traverse: <T extends TreeNodeProps>(nodes: T[], callback: (node: T, depth: number) => void) => void;
-/**
- * BFS с указанием целевого списка для каждого узла.
- * Очередь хранит (node, depth, targetList). Callback добавляет узел в targetList
- * и возвращает массив для детей (или undefined, чтобы не обходить детей).
- */
-export declare const traverseWithTarget: <T extends TreeNodeProps>(nodes: T[], rootTargetList: T[], callback: (node: T, depth: number, targetList: T[]) => T[] | undefined) => void;

package/dist/cjs/helpers/traverse.js

@@ -8,7 +8,7 @@ var __importDefault = void 0 && (void 0).__importDefault || function (mod) {
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.traverseWithTarget = exports.traverse = void 0;
+exports.traverse = void 0;
 const queue_fifo_1 = __importDefault(require("queue-fifo"));
 const traverse = (nodes, callback) => {
   var _a;
@@ -37,40 +37,4 @@ const traverse = (nodes, callback) => {
     }
   }
 };
-exports.traverse = traverse;
-/**
- * BFS с указанием целевого списка для каждого узла.
- * Очередь хранит (node, depth, targetList). Callback добавляет узел в targetList
- * и возвращает массив для детей (или undefined, чтобы не обходить детей).
- */
-const traverseWithTarget = (nodes, rootTargetList, callback) => {
-  var _a;
-  const queue = new queue_fifo_1.default();
-  for (const node of nodes) {
-    queue.enqueue({
-      node,
-      depth: 0,
-      targetList: rootTargetList
-    });
-  }
-  while (!queue.isEmpty()) {
-    const item = queue.dequeue();
-    if (!item) continue;
-    const {
-      node,
-      depth,
-      targetList
-    } = item;
-    const childTargetList = callback(node, depth, targetList);
-    if (childTargetList !== undefined && ((_a = node.nested) === null || _a === void 0 ? void 0 : _a.length)) {
-      for (const child of node.nested) {
-        queue.enqueue({
-          node: child,
-          depth: depth + 1,
-          targetList: childTargetList
-        });
-      }
-    }
-  }
-};
-exports.traverseWithTarget = traverseWithTarget;
+exports.traverse = traverse;

package/dist/cjs/index.d.ts

@@ -1,4 +1,3 @@
 export * from './components';
 export type { OnNodeClick, TreeNodeId, TreeNodeProps } from './types';
 export { setNonce } from '@snack-uikit/list';
-export { setChildrenOfTreeNode, traverse, getSearchedTreeItems, getSearchedTreeNodeById } from './helpers';

package/dist/cjs/index.js

@@ -22,7 +22,7 @@ var __exportStar = void 0 && (void 0).__exportStar || function (m, exports) {
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.getSearchedTreeNodeById = exports.getSearchedTreeItems = exports.traverse = exports.setChildrenOfTreeNode = exports.setNonce = void 0;
+exports.setNonce = void 0;
 __exportStar(require("./components"), exports);
 var list_1 = require("@snack-uikit/list");
 Object.defineProperty(exports, "setNonce", {
@@ -30,29 +30,4 @@ Object.defineProperty(exports, "setNonce", {
   get: function () {
     return list_1.setNonce;
   }
-});
-var helpers_1 = require("./helpers");
-Object.defineProperty(exports, "setChildrenOfTreeNode", {
-  enumerable: true,
-  get: function () {
-    return helpers_1.setChildrenOfTreeNode;
-  }
-});
-Object.defineProperty(exports, "traverse", {
-  enumerable: true,
-  get: function () {
-    return helpers_1.traverse;
-  }
-});
-Object.defineProperty(exports, "getSearchedTreeItems", {
-  enumerable: true,
-  get: function () {
-    return helpers_1.getSearchedTreeItems;
-  }
-});
-Object.defineProperty(exports, "getSearchedTreeNodeById", {
-  enumerable: true,
-  get: function () {
-    return helpers_1.getSearchedTreeNodeById;
-  }
 });

package/dist/cjs/types.d.ts

@@ -103,15 +103,3 @@ export type TreeBaseProps = TreeView | TreeMultiSelect | TreeSingleSelect;
 export type ExtendedTreeNodeProps = TreeNodeProps & {
     getTitle?(): void;
 };
-export type PreloadNodeHandler<TTreeNode extends TreeNodeProps> = (node: TreeNodeProps) => Promise<{
-    preloadedChildren: TTreeNode[];
-    updatedTree: TTreeNode[];
-}>;
-export type SelectHandler = (props: {
-    selectedKeys: string[];
-    node: TreeNodeProps;
-    isSelected: boolean;
-}) => {
-    added: string[];
-    removed: string[];
-};

package/dist/esm/helpers/index.d.ts

@@ -6,5 +6,3 @@ export * from './getSearchedTreeNodeById';
 export * from './lookupTreeForSelectedNodes';
 export * from './sortTreeItemsByTitle';
 export * from './traverse';
-export * from './setChildrenOfTreeNode';
-export * from './collectEmptyNestedNodesInExpanded';

package/dist/esm/helpers/index.js

@@ -6,5 +6,3 @@ export * from './getSearchedTreeNodeById';
 export * from './lookupTreeForSelectedNodes';
 export * from './sortTreeItemsByTitle';
 export * from './traverse';
-export * from './setChildrenOfTreeNode';
-export * from './collectEmptyNestedNodesInExpanded';

package/dist/esm/helpers/sortTreeItemsByTitle.js

@@ -1,6 +1,6 @@
 import { extractTreeNodeTitle } from './extractTreeNodeTitle';
 export const sortTreeItemsByTitle = (items) => items === null || items === void 0 ? void 0 : items.toSorted((itemA, itemB) => {
-    const valueA = extractTreeNodeTitle(itemA).toLowerCase();
-    const valueB = extractTreeNodeTitle(itemB).toLowerCase();
+    const valueA = extractTreeNodeTitle(itemA);
+    const valueB = extractTreeNodeTitle(itemB);
     return valueA.localeCompare(valueB);
 });

package/dist/esm/helpers/traverse.d.ts

@@ -1,8 +1,2 @@
-import { TreeNodeProps } from '../types';
+import { TreeNodeProps } from '../';
 export declare const traverse: <T extends TreeNodeProps>(nodes: T[], callback: (node: T, depth: number) => void) => void;
-/**
- * BFS с указанием целевого списка для каждого узла.
- * Очередь хранит (node, depth, targetList). Callback добавляет узел в targetList
- * и возвращает массив для детей (или undefined, чтобы не обходить детей).
- */
-export declare const traverseWithTarget: <T extends TreeNodeProps>(nodes: T[], rootTargetList: T[], callback: (node: T, depth: number, targetList: T[]) => T[] | undefined) => void;

package/dist/esm/helpers/traverse.js

@@ -17,27 +17,3 @@ export const traverse = (nodes, callback) => {
         }
     }
 };
-/**
- * BFS с указанием целевого списка для каждого узла.
- * Очередь хранит (node, depth, targetList). Callback добавляет узел в targetList
- * и возвращает массив для детей (или undefined, чтобы не обходить детей).
- */
-export const traverseWithTarget = (nodes, rootTargetList, callback) => {
-    var _a;
-    const queue = new Queue();
-    for (const node of nodes) {
-        queue.enqueue({ node, depth: 0, targetList: rootTargetList });
-    }
-    while (!queue.isEmpty()) {
-        const item = queue.dequeue();
-        if (!item)
-            continue;
-        const { node, depth, targetList } = item;
-        const childTargetList = callback(node, depth, targetList);
-        if (childTargetList !== undefined && ((_a = node.nested) === null || _a === void 0 ? void 0 : _a.length)) {
-            for (const child of node.nested) {
-                queue.enqueue({ node: child, depth: depth + 1, targetList: childTargetList });
-            }
-        }
-    }
-};

package/dist/esm/index.d.ts

@@ -1,4 +1,3 @@
 export * from './components';
 export type { OnNodeClick, TreeNodeId, TreeNodeProps } from './types';
 export { setNonce } from '@snack-uikit/list';
-export { setChildrenOfTreeNode, traverse, getSearchedTreeItems, getSearchedTreeNodeById } from './helpers';

package/dist/esm/index.js

@@ -1,3 +1,2 @@
 export * from './components';
 export { setNonce } from '@snack-uikit/list';
-export { setChildrenOfTreeNode, traverse, getSearchedTreeItems, getSearchedTreeNodeById } from './helpers';

package/dist/esm/types.d.ts

@@ -103,15 +103,3 @@ export type TreeBaseProps = TreeView | TreeMultiSelect | TreeSingleSelect;
 export type ExtendedTreeNodeProps = TreeNodeProps & {
     getTitle?(): void;
 };
-export type PreloadNodeHandler<TTreeNode extends TreeNodeProps> = (node: TreeNodeProps) => Promise<{
-    preloadedChildren: TTreeNode[];
-    updatedTree: TTreeNode[];
-}>;
-export type SelectHandler = (props: {
-    selectedKeys: string[];
-    node: TreeNodeProps;
-    isSelected: boolean;
-}) => {
-    added: string[];
-    removed: string[];
-};

package/package.json

@@ -4,7 +4,7 @@
     "access": "public"
   },
   "title": "Tree",
-  "version": "0.10.2-preview-013112d8.0",
+  "version": "0.10.2",
   "sideEffects": [
     "*.css",
     "*.woff",
@@ -12,25 +12,9 @@
   ],
   "description": "",
   "types": "./dist/esm/index.d.ts",
-  "typesVersions": {
-    "*": {
-      ".": [
-        "./dist/esm/index.d.ts"
-      ],
-      "hooks": [
-        "./dist/esm/hooks/index.d.ts"
-      ]
-    }
-  },
   "exports": {
-    ".": {
-      "import": "./dist/esm/index.js",
-      "require": "./dist/cjs/index.js"
-    },
-    "./hooks": {
-      "import": "./dist/esm/hooks/index.js",
-      "require": "./dist/cjs/hooks/index.js"
-    }
+    "import": "./dist/esm/index.js",
+    "require": "./dist/cjs/index.js"
   },
   "homepage": "https://github.com/cloud-ru-tech/snack-uikit/tree/master/packages/tree",
   "repository": {
@@ -52,19 +36,17 @@
   "license": "Apache-2.0",
   "scripts": {},
   "dependencies": {
-    "@siberiacancode/reactuse": "0.3.14",
     "@snack-uikit/button": "0.19.17",
     "@snack-uikit/icons": "0.27.7",
-    "@snack-uikit/list": "0.32.15",
+    "@snack-uikit/list": "0.32.16",
     "@snack-uikit/toggles": "0.13.26",
-    "@snack-uikit/truncate-string": "0.7.9",
+    "@snack-uikit/truncate-string": "0.7.10",
     "@snack-uikit/typography": "0.8.12",
     "@snack-uikit/utils": "4.0.1",
-    "cancelable-promise": "4.3.1",
     "classnames": "2.5.1",
     "queue-fifo": "0.2.6",
     "react-transition-state": "2.1.1",
     "uncontrollable": "8.0.4"
   },
-  "gitHead": "80386ae25b9f12778d134b6b82fa4a71a0f922d6"
+  "gitHead": "d1bb005216777d5730f95394b5f1b823feb694df"
 }

package/src/helpers/index.ts

@@ -6,5 +6,3 @@ export * from './getSearchedTreeNodeById';
 export * from './lookupTreeForSelectedNodes';
 export * from './sortTreeItemsByTitle';
 export * from './traverse';
-export * from './setChildrenOfTreeNode';
-export * from './collectEmptyNestedNodesInExpanded';

package/src/helpers/sortTreeItemsByTitle.ts

@@ -3,8 +3,8 @@ import { extractTreeNodeTitle } from './extractTreeNodeTitle';
 
 export const sortTreeItemsByTitle = (items: ExtendedTreeNodeProps[]) =>
   items?.toSorted((itemA, itemB) => {
-    const valueA = extractTreeNodeTitle(itemA).toLowerCase();
-    const valueB = extractTreeNodeTitle(itemB).toLowerCase();
+    const valueA = extractTreeNodeTitle(itemA);
+    const valueB = extractTreeNodeTitle(itemB);
 
     return valueA.localeCompare(valueB);
   });

package/src/helpers/traverse.ts

@@ -1,15 +1,9 @@
 import Queue from 'queue-fifo';
 
-import { TreeNodeProps } from '../types';
+import { TreeNodeProps } from '../';
 
 type NodeWithDepth<T extends TreeNodeProps> = { node: T; depth: number };
 
-type NodeWithDepthAndTarget<T extends TreeNodeProps> = {
-  node: T;
-  depth: number;
-  targetList: T[];
-};
-
 export const traverse = <T extends TreeNodeProps>(nodes: T[], callback: (node: T, depth: number) => void) => {
   const queue = new Queue<NodeWithDepth<T>>();
 
@@ -31,34 +25,3 @@ export const traverse = <T extends TreeNodeProps>(nodes: T[], callback: (node: T
     }
   }
 };
-
-/**
- * BFS с указанием целевого списка для каждого узла.
- * Очередь хранит (node, depth, targetList). Callback добавляет узел в targetList
- * и возвращает массив для детей (или undefined, чтобы не обходить детей).
- */
-export const traverseWithTarget = <T extends TreeNodeProps>(
-  nodes: T[],
-  rootTargetList: T[],
-  callback: (node: T, depth: number, targetList: T[]) => T[] | undefined,
-) => {
-  const queue = new Queue<NodeWithDepthAndTarget<T>>();
-
-  for (const node of nodes) {
-    queue.enqueue({ node, depth: 0, targetList: rootTargetList });
-  }
-
-  while (!queue.isEmpty()) {
-    const item = queue.dequeue();
-    if (!item) continue;
-
-    const { node, depth, targetList } = item;
-    const childTargetList = callback(node, depth, targetList);
-
-    if (childTargetList !== undefined && node.nested?.length) {
-      for (const child of node.nested) {
-        queue.enqueue({ node: child as T, depth: depth + 1, targetList: childTargetList });
-      }
-    }
-  }
-};

package/src/index.ts

@@ -1,4 +1,3 @@
 export * from './components';
 export type { OnNodeClick, TreeNodeId, TreeNodeProps } from './types';
 export { setNonce } from '@snack-uikit/list';
-export { setChildrenOfTreeNode, traverse, getSearchedTreeItems, getSearchedTreeNodeById } from './helpers';

package/src/types.ts

@@ -118,12 +118,3 @@ export type TreeBaseProps = TreeView | TreeMultiSelect | TreeSingleSelect;
 export type ExtendedTreeNodeProps = TreeNodeProps & {
   getTitle?(): void;
 };
-
-export type PreloadNodeHandler<TTreeNode extends TreeNodeProps> = (
-  node: TreeNodeProps,
-) => Promise<{ preloadedChildren: TTreeNode[]; updatedTree: TTreeNode[] }>;
-
-export type SelectHandler = (props: { selectedKeys: string[]; node: TreeNodeProps; isSelected: boolean }) => {
-  added: string[];
-  removed: string[];
-};

package/dist/cjs/helpers/__tests__/collectEmptyNestedNodesInExpanded.spec.d.ts

@@ -1 +0,0 @@
-export {};

package/dist/cjs/helpers/__tests__/collectEmptyNestedNodesInExpanded.spec.js

@@ -1,80 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-const vitest_1 = require("vitest");
-const collectEmptyNestedNodesInExpanded_1 = require("../collectEmptyNestedNodesInExpanded");
-const node = (id, nested) => Object.assign({
-  id,
-  title: id
-}, nested !== undefined && {
-  nested
-});
-(0, vitest_1.describe)('collectEmptyNestedNodesInExpanded', () => {
-  (0, vitest_1.it)('returns nodes with empty nested array that are in expandedIds', () => {
-    const tree = [node('a', []), node('b', [node('b1')])];
-    const expandedIds = new Set(['a']);
-    const result = (0, collectEmptyNestedNodesInExpanded_1.collectEmptyNestedNodesInExpanded)(tree, expandedIds);
-    (0, vitest_1.expect)(result).toHaveLength(1);
-    (0, vitest_1.expect)(result[0]).toMatchObject({
-      id: 'a',
-      nested: []
-    });
-  });
-  (0, vitest_1.it)('does not return nodes with empty nested if not in expandedIds', () => {
-    const tree = [node('a', []), node('b', [])];
-    const expandedIds = new Set(['b']);
-    const result = (0, collectEmptyNestedNodesInExpanded_1.collectEmptyNestedNodesInExpanded)(tree, expandedIds);
-    (0, vitest_1.expect)(result).toHaveLength(1);
-    (0, vitest_1.expect)(result[0].id).toBe('b');
-  });
-  (0, vitest_1.it)('does not return nodes that have non-empty nested', () => {
-    const tree = [node('a', [node('a1')]), node('b', [])];
-    const expandedIds = new Set(['a', 'b']);
-    const result = (0, collectEmptyNestedNodesInExpanded_1.collectEmptyNestedNodesInExpanded)(tree, expandedIds);
-    (0, vitest_1.expect)(result).toHaveLength(1);
-    (0, vitest_1.expect)(result[0].id).toBe('b');
-  });
-  (0, vitest_1.it)('does not return nodes without nested property (leaf)', () => {
-    const tree = [node('leaf'), node('empty', [])];
-    const expandedIds = new Set(['leaf', 'empty']);
-    const result = (0, collectEmptyNestedNodesInExpanded_1.collectEmptyNestedNodesInExpanded)(tree, expandedIds);
-    (0, vitest_1.expect)(result).toHaveLength(1);
-    (0, vitest_1.expect)(result[0].id).toBe('empty');
-  });
-  (0, vitest_1.it)('returns empty array for empty tree', () => {
-    const result = (0, collectEmptyNestedNodesInExpanded_1.collectEmptyNestedNodesInExpanded)([], new Set(['any']));
-    (0, vitest_1.expect)(result).toEqual([]);
-  });
-  (0, vitest_1.it)('returns empty array when expandedIds is empty', () => {
-    const tree = [node('a', []), node('b', [])];
-    const result = (0, collectEmptyNestedNodesInExpanded_1.collectEmptyNestedNodesInExpanded)(tree, new Set());
-    (0, vitest_1.expect)(result).toEqual([]);
-  });
-  (0, vitest_1.it)('collects from deeply nested nodes', () => {
-    const child = node('child', []);
-    const tree = [node('root', [node('mid', [child])])];
-    const expandedIds = new Set(['root', 'mid', 'child']);
-    const result = (0, collectEmptyNestedNodesInExpanded_1.collectEmptyNestedNodesInExpanded)(tree, expandedIds);
-    (0, vitest_1.expect)(result).toHaveLength(1);
-    (0, vitest_1.expect)(result[0]).toMatchObject({
-      id: 'child',
-      nested: []
-    });
-  });
-  (0, vitest_1.it)('returns all matching nodes from different levels', () => {
-    const tree = [node('a', []), node('b', [node('b1', []), node('b2', [])])];
-    const expandedIds = new Set(['a', 'b', 'b1', 'b2']);
-    const result = (0, collectEmptyNestedNodesInExpanded_1.collectEmptyNestedNodesInExpanded)(tree, expandedIds);
-    (0, vitest_1.expect)(result).toHaveLength(3);
-    (0, vitest_1.expect)(result.map(n => n.id).sort()).toEqual(['a', 'b1', 'b2']);
-  });
-  (0, vitest_1.it)('only includes node if both empty nested and expanded', () => {
-    const tree = [node('expanded', []), node('collapsed', [])];
-    const expandedIds = new Set(['expanded']);
-    const result = (0, collectEmptyNestedNodesInExpanded_1.collectEmptyNestedNodesInExpanded)(tree, expandedIds);
-    (0, vitest_1.expect)(result).toHaveLength(1);
-    (0, vitest_1.expect)(result[0].id).toBe('expanded');
-  });
-});

package/dist/cjs/helpers/__tests__/setChildrenOfTreeNode.spec.d.ts

@@ -1 +0,0 @@
-export {};

package/dist/cjs/helpers/__tests__/setChildrenOfTreeNode.spec.js

@@ -1,102 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-const vitest_1 = require("vitest");
-const setChildrenOfTreeNode_1 = require("../setChildrenOfTreeNode");
-const node = (id, nested) => Object.assign({
-  id,
-  title: id
-}, nested !== undefined && {
-  nested: nested.map(n => Object.assign(Object.assign({}, n), {
-    title: n.id
-  }))
-});
-(0, vitest_1.describe)('setChildrenOfTreeNode', () => {
-  (0, vitest_1.it)('replaces nested for root-level node', () => {
-    const tree = [node('a', [{
-      id: 'a1',
-      title: 'a1'
-    }]), node('b', [{
-      id: 'b1',
-      title: 'b1'
-    }])];
-    const children = [node('new1'), node('new2')];
-    const result = (0, setChildrenOfTreeNode_1.setChildrenOfTreeNode)(tree, 'b', children);
-    (0, vitest_1.expect)(result).toHaveLength(2);
-    (0, vitest_1.expect)(result[0]).toMatchObject({
-      id: 'a',
-      nested: [{
-        id: 'a1'
-      }]
-    });
-    (0, vitest_1.expect)(result[1]).toMatchObject({
-      id: 'b',
-      nested: [{
-        id: 'new1'
-      }, {
-        id: 'new2'
-      }]
-    });
-  });
-  (0, vitest_1.it)('replaces nested for deeply nested node', () => {
-    const childWithNested = node('child');
-    childWithNested.nested = [{
-      id: 'grand',
-      title: 'grand'
-    }];
-    const tree = [node('root', [childWithNested])];
-    const children = [node('replacement')];
-    const result = (0, setChildrenOfTreeNode_1.setChildrenOfTreeNode)(tree, 'child', children);
-    const root = result[0];
-    (0, vitest_1.expect)(root.nested).toHaveLength(1);
-    (0, vitest_1.expect)(root.nested[0]).toMatchObject({
-      id: 'child',
-      nested: [{
-        id: 'replacement'
-      }]
-    });
-  });
-  (0, vitest_1.it)('returns cloned tree when node is not found', () => {
-    const tree = [node('a'), node('b')];
-    const result = (0, setChildrenOfTreeNode_1.setChildrenOfTreeNode)(tree, 'missing', [node('x')]);
-    (0, vitest_1.expect)(result).toHaveLength(2);
-    (0, vitest_1.expect)(result[0]).toMatchObject({
-      id: 'a'
-    });
-    (0, vitest_1.expect)(result[1]).toMatchObject({
-      id: 'b'
-    });
-    (0, vitest_1.expect)(result).not.toBe(tree);
-  });
-  (0, vitest_1.it)('returns empty array for empty tree', () => {
-    const result = (0, setChildrenOfTreeNode_1.setChildrenOfTreeNode)([], 'any', [node('x')]);
-    (0, vitest_1.expect)(result).toEqual([]);
-  });
-  (0, vitest_1.it)('sets children for target node that had no nested (leaf)', () => {
-    const tree = [node('leaf'), node('other')];
-    const children = [node('new1')];
-    const result = (0, setChildrenOfTreeNode_1.setChildrenOfTreeNode)(tree, 'leaf', children);
-    (0, vitest_1.expect)(result[0]).toMatchObject({
-      id: 'leaf',
-      nested: [{
-        id: 'new1'
-      }]
-    });
-    (0, vitest_1.expect)(result[1]).toMatchObject({
-      id: 'other'
-    });
-  });
-  (0, vitest_1.it)('preserves order of root nodes when target is second', () => {
-    const tree = [node('first'), node('second', [{
-      id: 's1',
-      title: 's1'
-    }]), node('third')];
-    const children = [node('new1'), node('new2')];
-    const result = (0, setChildrenOfTreeNode_1.setChildrenOfTreeNode)(tree, 'second', children);
-    (0, vitest_1.expect)(result.map(n => n.id)).toEqual(['first', 'second', 'third']);
-    (0, vitest_1.expect)(result[1].nested).toHaveLength(2);
-    (0, vitest_1.expect)(result[1].nested.map(n => n.id)).toEqual(['new1', 'new2']);
-  });
-});

package/dist/cjs/helpers/collectEmptyNestedNodesInExpanded.d.ts

@@ -1,2 +0,0 @@
-import { TreeNodeProps } from '../types';
-export declare function collectEmptyNestedNodesInExpanded<TTreeNode extends TreeNodeProps>(nodes: TTreeNode[], expandedIds: Set<string>): TTreeNode[];

package/dist/cjs/helpers/collectEmptyNestedNodesInExpanded.js

@@ -1,17 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.collectEmptyNestedNodesInExpanded = collectEmptyNestedNodesInExpanded;
-const traverse_1 = require("./traverse");
-function collectEmptyNestedNodesInExpanded(nodes, expandedIds) {
-  const result = [];
-  (0, traverse_1.traverse)(nodes, node => {
-    const hasEmptyNested = Array.isArray(node.nested) && node.nested.length === 0;
-    if (hasEmptyNested && expandedIds.has(node.id)) {
-      result.push(node);
-    }
-  });
-  return result;
-}

package/dist/cjs/helpers/setChildrenOfTreeNode.d.ts

@@ -1,2 +0,0 @@
-import { TreeNodeProps } from '../types';
-export declare const setChildrenOfTreeNode: <TTreeNode extends TreeNodeProps>(tree: TTreeNode[], nodeId: string, children: TTreeNode[]) => TTreeNode[];