@snack-uikit/tree 0.11.1-preview-c3fee040.0 → 0.11.1-preview-210b4b95.0

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 |
@@ -120,115 +108,116 @@ function TreeAsyncLoadExample() {
 | selected | `string \| string[]` | - | Состояние для выбраных элементов: <br> - При <strong>selectionMode</strong>=`Multi` - принимает массив строк <br> - При <strong>selectionMode</strong>=`Single` - принимает строку |
 | onSelect | `((selectedKeys: string[], node: TreeNodeProps) => void) \| ((selectedKey: string, node: TreeNodeProps) => void)` | - | Колбэк при изменении выбраных элементов: <br> - При <strong>selectionMode</strong>=`Multi` - возвращает массив строк <br> - При <strong>selectionMode</strong>=`Single` - возвращает строку |
 | showToggle | `boolean` | - |  |
+## checkNestedNodesSelection
+Проверяет состояние выбора дочерних узлов:
+выбраны ли все, выбраны ли некоторые.
+### Props
+| name | type | default value | description |
+|------|------|---------------|-------------|
+## collectEmptyNestedNodesInExpanded
+Возвращает раскрытые узлы, у которых `nested` уже существует, но пока пустой.
+Используется для определения узлов, требующих дополнительной подгрузки детей.
+### Props
+| name | type | default value | description |
+|------|------|---------------|-------------|
 ## collectIds
+`collectIds` 
+
+Собирает id всех узлов дерева.
+## extractTreeNodeTitle
+Возвращает строковый заголовок узла дерева.
+Если title задан функцией, использует getTitle (если он доступен).
+### Props
+| name | type | default value | description |
+|------|------|---------------|-------------|
+| title* | `((value: Pick<BaseTreeNode, "id" \| "disabled">) => ReactNode) \| ((string \| ((value: Pick<BaseTreeNode, "id" \| "disabled">) => ReactNode)) & (string \| ((value: Pick<...>) => ReactNode)))` | - | Имя элемента |
+| id* | `string` | - | Идентификатор элемента |
+| disabled | `boolean` | - | Является ли элемент деактивированным |
+| onClick | `MouseEventHandler` | - | Обработчик клика по элементу |
+| className | `string` | - | CSS-класс |
+| href | `string` | - | Ссылка на элемент |
+| icon | `ReactNode` | - | Иконка дочернего элемента |
+| nested | `(ChildTreeNode \| ParentTreeNode)[]` | - | Вложенные элементы дерева |
+| expandedIcon | `ReactNode` | - | Иконка элемента-родителя в открытом состоянии |
+| collapsedIcon | `ReactNode` | - | Иконка элемента-родителя в закрытом состоянии |
+| getTitle | `() => void` | - |  |
+## findAllChildNodeIds
+`findAllChildNodeIds` 
+
+Собирает id всех недеактивированных узлов в поддереве.
+## findAllExpandedChildNodeIds
+Возвращает id узлов в поддереве, проходя только по раскрытым веткам.
 ### Props
 | name | type | default value | description |
 |------|------|---------------|-------------|
-| __@unscopables@986* | `{ [x: number]: boolean; length?: boolean; toString?: boolean; toLocaleString?: boolean; pop?: boolean; push?: boolean; concat?: boolean; join?: boolean; reverse?: boolean; shift?: boolean; slice?: boolean; sort?: boolean; ... 29 more ...; readonly [Symbol.unscopables]?: boolean; }` | - | Is an object whose properties have the value 'true' when they will be absent when used in a 'with' statement. |
-| __@iterator@984* | `() => ArrayIterator<TreeNodeProps>` | - | Iterator |
-| with* | `(index: number, value: TreeNodeProps) => TreeNodeProps[]` | - | Copies an array, then overwrites the value at the provided index with the given value. If the index is negative, then it replaces from the end of the array. @param index The index of the value to overwrite. If the index is negative, then it replaces from the end of the array. @param value The value to write into the copied array. @returns The copied array with the updated value. |
-| toSpliced* | `{ (start: number, deleteCount: number, ...items: TreeNodeProps[]): TreeNodeProps[]; (start: number, deleteCount?: number): TreeNodeProps[]; }` | - | Copies an array and removes elements and, if necessary, inserts new elements in their place. Returns the copied array. Copies an array and removes elements while returning the remaining elements. @param start The zero-based location in the array from which to start removing elements. @param deleteCount The number of elements to remove. @param items Elements to insert into the copied array in place of the deleted elements. @returns The copied array. @param start The zero-based location in the array from which to start removing elements. @param deleteCount The number of elements to remove. @returns A copy of the original array with the remaining elements. |
-| toSorted* | `(compareFn?: (a: TreeNodeProps, b: TreeNodeProps) => number) => TreeNodeProps[]` | - | Returns a copy of an array with its elements sorted. @param compareFn Function used to determine the order of the elements. It is expected to return a negative value if the first argument is less than the second argument, zero if they're equal, and a positive value otherwise. If omitted, the elements are sorted in ascending, UTF-16 code unit order. ```ts [11, 2, 22, 1].toSorted((a, b) => a - b) // [1, 2, 11, 22] ``` |
-| toReversed* | `() => TreeNodeProps[]` | - | Returns a copy of an array with its elements reversed. |
-| findLastIndex* | `(predicate: (value: TreeNodeProps, index: number, array: TreeNodeProps[]) => unknown, thisArg?: any) => number` | - | Returns the index of the last element in the array where predicate is true, and -1 otherwise. @param predicate findLastIndex calls predicate once for each element of the array, in descending order, until it finds one where predicate returns true. If such an element is found, findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1. @param thisArg If provided, it will be used as the this value for each invocation of predicate. If it is not provided, undefined is used instead. |
-| findLast* | `{ <S extends TreeNodeProps>(predicate: (value: TreeNodeProps, index: number, array: TreeNodeProps[]) => value is S, thisArg?: any): S; (predicate: (value: TreeNodeProps, index: number, array: TreeNodeProps[]) => unknown, thisArg?: any): TreeNodeProps; }` | - | Returns the value of the last element in the array where predicate is true, and undefined otherwise. @param predicate findLast calls predicate once for each element of the array, in descending order, until it finds one where predicate returns true. If such an element is found, findLast immediately returns that element value. Otherwise, findLast returns undefined. @param thisArg If provided, it will be used as the this value for each invocation of predicate. If it is not provided, undefined is used instead. |
-| at* | `(index: number) => TreeNodeProps` | - | Returns the item located at the specified index. @param index The zero-based index of the desired code unit. A negative index will count back from the last item. |
-| flat* | `<A, D extends number = 1>(this: A, depth?: D) => FlatArray<A, D>[]` | - | Returns a new array with all sub-array elements concatenated into it recursively up to the specified depth. @param depth The maximum recursion depth |
-| flatMap* | `<U, This = undefined>(callback: (this: This, value: TreeNodeProps, index: number, array: TreeNodeProps[]) => U \| readonly U[], thisArg?: This) => U[]` | - | Calls a defined callback function on each element of an array. Then, flattens the result into a new array. This is identical to a map followed by flat with depth 1. @param callback A function that accepts up to three arguments. The flatMap method calls the callback function one time for each element in the array. @param thisArg An object to which the this keyword can refer in the callback function. If thisArg is omitted, undefined is used as the this value. |
-| includes* | `(searchElement: TreeNodeProps, fromIndex?: number) => boolean` | - | Determines whether an array includes a certain element, returning true or false as appropriate. @param searchElement The element to search for. @param fromIndex The position in this array at which to begin searching for searchElement. |
-| values* | `() => ArrayIterator<TreeNodeProps>` | - | Returns an iterable of values in the array |
-| keys* | `() => ArrayIterator<number>` | - | Returns an iterable of keys in the array |
-| entries* | `() => ArrayIterator<[number, TreeNodeProps]>` | - | Returns an iterable of key, value pairs for every entry in the array |
-| copyWithin* | `(target: number, start: number, end?: number) => TreeNodeProps[]` | - | Returns the this object after copying a section of the array identified by start and end to the same array starting at position target @param target If target is negative, it is treated as length+target where length is the length of the array. @param start If start is negative, it is treated as length+start. If end is negative, it is treated as length+end. @param end If not specified, length of the this object is used as its default value. |
-| fill* | `(value: TreeNodeProps, start?: number, end?: number) => TreeNodeProps[]` | - | Changes all array elements from `start` to `end` index to a static `value` and returns the modified array @param value value to fill array section with @param start index to start filling the array at. If start is negative, it is treated as length+start where length is the length of the array. @param end index to stop filling the array at. If end is negative, it is treated as length+end. |
-| findIndex* | `(predicate: (value: TreeNodeProps, index: number, obj: TreeNodeProps[]) => unknown, thisArg?: any) => number` | - | Returns the index of the first element in the array where predicate is true, and -1 otherwise. @param predicate find calls predicate once for each element of the array, in ascending order, until it finds one where predicate returns true. If such an element is found, findIndex immediately returns that element index. Otherwise, findIndex returns -1. @param thisArg If provided, it will be used as the this value for each invocation of predicate. If it is not provided, undefined is used instead. |
-| find* | `{ <S extends TreeNodeProps>(predicate: (value: TreeNodeProps, index: number, obj: TreeNodeProps[]) => value is S, thisArg?: any): S; (predicate: (value: TreeNodeProps, index: number, obj: TreeNodeProps[]) => unknown, thisArg?: any): TreeNodeProps; }` | - | Returns the value of the first element in the array where predicate is true, and undefined otherwise. @param predicate find calls predicate once for each element of the array, in ascending order, until it finds one where predicate returns true. If such an element is found, find immediately returns that element value. Otherwise, find returns undefined. @param thisArg If provided, it will be used as the this value for each invocation of predicate. If it is not provided, undefined is used instead. |
-| reduceRight* | `{ (callbackfn: (previousValue: TreeNodeProps, currentValue: TreeNodeProps, currentIndex: number, array: TreeNodeProps[]) => TreeNodeProps): TreeNodeProps; (callbackfn: (previousValue: TreeNodeProps, currentValue: TreeNodeProps, currentIndex: number, array: TreeNodeProps[]) => TreeNodeProps, initialValue: TreeNodePro...` | - | Calls the specified callback function for all the elements in an array, in descending order. The return value of the callback function is the accumulated result, and is provided as an argument in the next call to the callback function. @param callbackfn A function that accepts up to four arguments. The reduceRight method calls the callbackfn function one time for each element in the array. @param initialValue If initialValue is specified, it is used as the initial value to start the accumulation. The first call to the callbackfn function provides this value as an argument instead of an array value. @param callbackfn A function that accepts up to four arguments. The reduceRight method calls the callbackfn function one time for each element in the array. @param initialValue If initialValue is specified, it is used as the initial value to start the accumulation. The first call to the callbackfn function provides this value as an argument instead of an array value. |
-| reduce* | `{ (callbackfn: (previousValue: TreeNodeProps, currentValue: TreeNodeProps, currentIndex: number, array: TreeNodeProps[]) => TreeNodeProps): TreeNodeProps; (callbackfn: (previousValue: TreeNodeProps, currentValue: TreeNodeProps, currentIndex: number, array: TreeNodeProps[]) => TreeNodeProps, initialValue: TreeNodePro...` | - | Calls the specified callback function for all the elements in an array. The return value of the callback function is the accumulated result, and is provided as an argument in the next call to the callback function. @param callbackfn A function that accepts up to four arguments. The reduce method calls the callbackfn function one time for each element in the array. @param initialValue If initialValue is specified, it is used as the initial value to start the accumulation. The first call to the callbackfn function provides this value as an argument instead of an array value. @param callbackfn A function that accepts up to four arguments. The reduce method calls the callbackfn function one time for each element in the array. @param initialValue If initialValue is specified, it is used as the initial value to start the accumulation. The first call to the callbackfn function provides this value as an argument instead of an array value. |
-| filter* | `{ <S extends TreeNodeProps>(predicate: (value: TreeNodeProps, index: number, array: TreeNodeProps[]) => value is S, thisArg?: any): S[]; (predicate: (value: TreeNodeProps, index: number, array: TreeNodeProps[]) => unknown, thisArg?: any): TreeNodeProps[]; }` | - | Returns the elements of an array that meet the condition specified in a callback function. @param predicate A function that accepts up to three arguments. The filter method calls the predicate function one time for each element in the array. @param thisArg An object to which the this keyword can refer in the predicate function. If thisArg is omitted, undefined is used as the this value. @param predicate A function that accepts up to three arguments. The filter method calls the predicate function one time for each element in the array. @param thisArg An object to which the this keyword can refer in the predicate function. If thisArg is omitted, undefined is used as the this value. |
-| map* | `<U>(callbackfn: (value: TreeNodeProps, index: number, array: TreeNodeProps[]) => U, thisArg?: any) => U[]` | - | Calls a defined callback function on each element of an array, and returns an array that contains the results. @param callbackfn A function that accepts up to three arguments. The map method calls the callbackfn function one time for each element in the array. @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value. |
-| forEach* | `(callbackfn: (value: TreeNodeProps, index: number, array: TreeNodeProps[]) => void, thisArg?: any) => void` | - | Performs the specified action for each element in an array. @param callbackfn A function that accepts up to three arguments. forEach calls the callbackfn function one time for each element in the array. @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value. |
-| some* | `(predicate: (value: TreeNodeProps, index: number, array: TreeNodeProps[]) => unknown, thisArg?: any) => boolean` | - | Determines whether the specified callback function returns true for any element of an array. @param predicate A function that accepts up to three arguments. The some method calls the predicate function for each element in the array until the predicate returns a value which is coercible to the Boolean value true, or until the end of the array. @param thisArg An object to which the this keyword can refer in the predicate function. If thisArg is omitted, undefined is used as the this value. |
-| every* | `{ <S extends TreeNodeProps>(predicate: (value: TreeNodeProps, index: number, array: TreeNodeProps[]) => value is S, thisArg?: any): this is S[]; (predicate: (value: TreeNodeProps, index: number, array: TreeNodeProps[]) => unknown, thisArg?: any): boolean; }` | - | Determines whether all the members of an array satisfy the specified test. @param predicate A function that accepts up to three arguments. The every method calls the predicate function for each element in the array until the predicate returns a value which is coercible to the Boolean value false, or until the end of the array. @param thisArg An object to which the this keyword can refer in the predicate function. If thisArg is omitted, undefined is used as the this value. @param predicate A function that accepts up to three arguments. The every method calls the predicate function for each element in the array until the predicate returns a value which is coercible to the Boolean value false, or until the end of the array. @param thisArg An object to which the this keyword can refer in the predicate function. If thisArg is omitted, undefined is used as the this value. |
-| lastIndexOf* | `(searchElement: TreeNodeProps, fromIndex?: number) => number` | - | Returns the index of the last occurrence of a specified value in an array, or -1 if it is not present. @param searchElement The value to locate in the array. @param fromIndex The array index at which to begin searching backward. If fromIndex is omitted, the search starts at the last index in the array. |
-| indexOf* | `(searchElement: TreeNodeProps, fromIndex?: number) => number` | - | Returns the index of the first occurrence of a value in an array, or -1 if it is not present. @param searchElement The value to locate in the array. @param fromIndex The array index at which to begin the search. If fromIndex is omitted, the search starts at index 0. |
-| unshift* | `(...items: TreeNodeProps[]) => number` | - | Inserts new elements at the start of an array, and returns the new length of the array. @param items Elements to insert at the start of the array. |
-| splice* | `{ (start: number, deleteCount?: number): TreeNodeProps[]; (start: number, deleteCount: number, ...items: TreeNodeProps[]): TreeNodeProps[]; }` | - | Removes elements from an array and, if necessary, inserts new elements in their place, returning the deleted elements. @param start The zero-based location in the array from which to start removing elements. @param deleteCount The number of elements to remove. Omitting this argument will remove all elements from the start paramater location to end of the array. If value of this argument is either a negative number, zero, undefined, or a type that cannot be converted to an integer, the function will evaluate the argument as zero and not remove any elements. @returns An array containing the elements that were deleted. @param start The zero-based location in the array from which to start removing elements. @param deleteCount The number of elements to remove. If value of this argument is either a negative number, zero, undefined, or a type that cannot be converted to an integer, the function will evaluate the argument as zero and not remove any elements. @param items Elements to insert into the array in place of the deleted elements. @returns An array containing the elements that were deleted. |
-| sort* | `(compareFn?: (a: TreeNodeProps, b: TreeNodeProps) => number) => TreeNodeProps[]` | - | Sorts an array in place. This method mutates the array and returns a reference to the same array. @param compareFn Function used to determine the order of the elements. It is expected to return a negative value if the first argument is less than the second argument, zero if they're equal, and a positive value otherwise. If omitted, the elements are sorted in ascending, UTF-16 code unit order. ```ts [11,2,22,1].sort((a, b) => a - b) ``` |
-| slice* | `(start?: number, end?: number) => TreeNodeProps[]` | - | Returns a copy of a section of an array. For both start and end, a negative index can be used to indicate an offset from the end of the array. For example, -2 refers to the second to last element of the array. @param start The beginning index of the specified portion of the array. If start is undefined, then the slice begins at index 0. @param end The end index of the specified portion of the array. This is exclusive of the element at the index 'end'. If end is undefined, then the slice extends to the end of the array. |
-| shift* | `() => TreeNodeProps` | - | Removes the first element from an array and returns it. If the array is empty, undefined is returned and the array is not modified. |
-| reverse* | `() => TreeNodeProps[]` | - | Reverses the elements in an array in place. This method mutates the array and returns a reference to the same array. |
-| join* | `(separator?: string) => string` | - | Adds all the elements of an array into a string, separated by the specified separator string. @param separator A string used to separate one element of the array from the next in the resulting string. If omitted, the array elements are separated with a comma. |
-| concat* | `{ (...items: ConcatArray<TreeNodeProps>[]): TreeNodeProps[]; (...items: (TreeNodeProps \| ConcatArray<TreeNodeProps>)[]): TreeNodeProps[]; }` | - | Combines two or more arrays. This method returns a new array without modifying any existing arrays. @param items Additional arrays and/or items to add to the end of the array. @param items Additional arrays and/or items to add to the end of the array. |
-| push* | `(...items: TreeNodeProps[]) => number` | - | Appends new elements to the end of an array, and returns the new length of the array. @param items New elements to add to the array. |
-| pop* | `() => TreeNodeProps` | - | Removes the last element from an array and returns it. If the array is empty, undefined is returned and the array is not modified. |
-| length* | `number` | - | Gets or sets the length of the array. This is a number one higher than the highest index in the array. |
-| toString | `() => string` | function toString() { [native code] } | Returns a string representation of an array. |
-| toLocaleString | `{ (): string; (locales: string \| string[], options?: NumberFormatOptions & DateTimeFormatOptions): string; }` | function toLocaleString() { [native code] } | Returns a string representation of an array. The elements are converted to string using their toLocaleString methods. |
 ## getSearchedTreeItems
+Фильтрует дерево по поисковой строке с сохранением иерархии подходящих узлов.
 ### Props
 | name | type | default value | description |
 |------|------|---------------|-------------|
 | tree* | `ExtendedTreeNodeProps[]` | - |  |
 | searchOptions | `Partial<{ query: string; includeChildrenMatchedParent: boolean; }>` | - |  |
 ## getSearchedTreeNodeById
+Ищет узлы дерева по одному id или по массиву id.
 ### Props
 | name | type | default value | description |
 |------|------|---------------|-------------|
 | searchOptions* | `{ id: I; includeNested?: boolean; }` | - |  |
 | tree* | `T[]` | - |  |
 ## lookupTreeForSelectedNodes
+Пересчитывает выбранные узлы для режима мультивыбора в дереве.
+Учитывает потомков текущего узла и корректирует состояние предков.
 ### Props
 | name | type | default value | description |
 |------|------|---------------|-------------|
 | selectedNodes* | `string[]` | - |  |
 | node* | `Pick<TreeNodeProps, "id" \| "disabled" \| "nested">` | - |  |
 | parentNode | `ParentNode` | - |  |
-## sortTreeItemsByTitle
+## traverse
+Обходит дерево в ширину (BFS) и вызывает callback для каждого узла.
+### Props
+| name | type | default value | description |
+|------|------|---------------|-------------|
+## traverseWithTarget
+Обходит дерево в ширину (BFS), передавая каждому узлу список,
+в который должен быть добавлен его трансформированный результат.
+### Props
+| name | type | default value | description |
+|------|------|---------------|-------------|
+## updateTreeNode
+Возвращает копию дерева, где у узла с указанным id обновляются переданные поля.
+### Props
+| name | type | default value | description |
+|------|------|---------------|-------------|
+## useSearchableTree
+Хук для работы с деревом, поддерживающим поиск и асинхронную подгрузку узлов.
+
+Возможности:
+- хранение актуального дерева и записи элементов (`treeItemsRecord`);
+- управление раскрытыми узлами;
+- дебаунс-поиск с отменой предыдущего запроса;
+- дозагрузка дочерних узлов после поиска или раскрытия.
+### Props
+| name | type | default value | description |
+|------|------|---------------|-------------|
+| mapNodeToRecordItem* | `(node: TTreeNode) => TRecordValue` | - | Сопоставление узла с элементом записи `treeItemsRecord` (по `node.id`). |
+| onSearch* | `(params: SearchParams, signal?: AbortSignal) => Promise<SearchResult<TTreeNode>>` | - | Поиск по дереву. |
+| onPreloadNodes* | `(nodes: string[], signal?: AbortSignal) => Promise<Record<string, TTreeNode[]>>` | - | Пакетная подгрузка детей по id родителей. |
+| onPreloadNode* | `(node: TreeNodeProps) => Promise<TTreeNode[]>` | - | Подгрузка дочерних узлов для одного узла. |
+| initTree* | `TTreeNode[]` | - | Начальное дерево узлов. |
+## useTreeMultiSelection
+Хук мультивыбора для дерева.
+
+Выполняет пересчет выбранных id после клика по узлу, поддерживает
+controlled/uncontrolled режим (`selected` + `onChangeSelected`) и при необходимости
+подгружает детей узла перед вычислением итогового выбора.
 ### Props
 | name | type | default value | description |
 |------|------|---------------|-------------|
-| __@unscopables@986* | `{ [x: number]: boolean; length?: boolean; toString?: boolean; toLocaleString?: boolean; pop?: boolean; push?: boolean; concat?: boolean; join?: boolean; reverse?: boolean; shift?: boolean; slice?: boolean; sort?: boolean; ... 29 more ...; readonly [Symbol.unscopables]?: boolean; }` | - | Is an object whose properties have the value 'true' when they will be absent when used in a 'with' statement. |
-| __@iterator@984* | `() => ArrayIterator<ExtendedTreeNodeProps>` | - | Iterator |
-| with* | `(index: number, value: ExtendedTreeNodeProps) => ExtendedTreeNodeProps[]` | - | Copies an array, then overwrites the value at the provided index with the given value. If the index is negative, then it replaces from the end of the array. @param index The index of the value to overwrite. If the index is negative, then it replaces from the end of the array. @param value The value to write into the copied array. @returns The copied array with the updated value. |
-| toSpliced* | `{ (start: number, deleteCount: number, ...items: ExtendedTreeNodeProps[]): ExtendedTreeNodeProps[]; (start: number, deleteCount?: number): ExtendedTreeNodeProps[]; }` | - | Copies an array and removes elements and, if necessary, inserts new elements in their place. Returns the copied array. Copies an array and removes elements while returning the remaining elements. @param start The zero-based location in the array from which to start removing elements. @param deleteCount The number of elements to remove. @param items Elements to insert into the copied array in place of the deleted elements. @returns The copied array. @param start The zero-based location in the array from which to start removing elements. @param deleteCount The number of elements to remove. @returns A copy of the original array with the remaining elements. |
-| toSorted* | `(compareFn?: (a: ExtendedTreeNodeProps, b: ExtendedTreeNodeProps) => number) => ExtendedTreeNodeProps[]` | - | Returns a copy of an array with its elements sorted. @param compareFn Function used to determine the order of the elements. It is expected to return a negative value if the first argument is less than the second argument, zero if they're equal, and a positive value otherwise. If omitted, the elements are sorted in ascending, UTF-16 code unit order. ```ts [11, 2, 22, 1].toSorted((a, b) => a - b) // [1, 2, 11, 22] ``` |
-| toReversed* | `() => ExtendedTreeNodeProps[]` | - | Returns a copy of an array with its elements reversed. |
-| findLastIndex* | `(predicate: (value: ExtendedTreeNodeProps, index: number, array: ExtendedTreeNodeProps[]) => unknown, thisArg?: any) => number` | - | Returns the index of the last element in the array where predicate is true, and -1 otherwise. @param predicate findLastIndex calls predicate once for each element of the array, in descending order, until it finds one where predicate returns true. If such an element is found, findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1. @param thisArg If provided, it will be used as the this value for each invocation of predicate. If it is not provided, undefined is used instead. |
-| findLast* | `{ <S extends ExtendedTreeNodeProps>(predicate: (value: ExtendedTreeNodeProps, index: number, array: ExtendedTreeNodeProps[]) => value is S, thisArg?: any): S; (predicate: (value: ExtendedTreeNodeProps, index: number, array: ExtendedTreeNodeProps[]) => unknown, thisArg?: any): ExtendedTreeNodeProps; }` | - | Returns the value of the last element in the array where predicate is true, and undefined otherwise. @param predicate findLast calls predicate once for each element of the array, in descending order, until it finds one where predicate returns true. If such an element is found, findLast immediately returns that element value. Otherwise, findLast returns undefined. @param thisArg If provided, it will be used as the this value for each invocation of predicate. If it is not provided, undefined is used instead. |
-| at* | `(index: number) => ExtendedTreeNodeProps` | - | Returns the item located at the specified index. @param index The zero-based index of the desired code unit. A negative index will count back from the last item. |
-| flat* | `<A, D extends number = 1>(this: A, depth?: D) => FlatArray<A, D>[]` | - | Returns a new array with all sub-array elements concatenated into it recursively up to the specified depth. @param depth The maximum recursion depth |
-| flatMap* | `<U, This = undefined>(callback: (this: This, value: ExtendedTreeNodeProps, index: number, array: ExtendedTreeNodeProps[]) => U \| readonly U[], thisArg?: This) => U[]` | - | Calls a defined callback function on each element of an array. Then, flattens the result into a new array. This is identical to a map followed by flat with depth 1. @param callback A function that accepts up to three arguments. The flatMap method calls the callback function one time for each element in the array. @param thisArg An object to which the this keyword can refer in the callback function. If thisArg is omitted, undefined is used as the this value. |
-| includes* | `(searchElement: ExtendedTreeNodeProps, fromIndex?: number) => boolean` | - | Determines whether an array includes a certain element, returning true or false as appropriate. @param searchElement The element to search for. @param fromIndex The position in this array at which to begin searching for searchElement. |
-| values* | `() => ArrayIterator<ExtendedTreeNodeProps>` | - | Returns an iterable of values in the array |
-| keys* | `() => ArrayIterator<number>` | - | Returns an iterable of keys in the array |
-| entries* | `() => ArrayIterator<[number, ExtendedTreeNodeProps]>` | - | Returns an iterable of key, value pairs for every entry in the array |
-| copyWithin* | `(target: number, start: number, end?: number) => ExtendedTreeNodeProps[]` | - | Returns the this object after copying a section of the array identified by start and end to the same array starting at position target @param target If target is negative, it is treated as length+target where length is the length of the array. @param start If start is negative, it is treated as length+start. If end is negative, it is treated as length+end. @param end If not specified, length of the this object is used as its default value. |
-| fill* | `(value: ExtendedTreeNodeProps, start?: number, end?: number) => ExtendedTreeNodeProps[]` | - | Changes all array elements from `start` to `end` index to a static `value` and returns the modified array @param value value to fill array section with @param start index to start filling the array at. If start is negative, it is treated as length+start where length is the length of the array. @param end index to stop filling the array at. If end is negative, it is treated as length+end. |
-| findIndex* | `(predicate: (value: ExtendedTreeNodeProps, index: number, obj: ExtendedTreeNodeProps[]) => unknown, thisArg?: any) => number` | - | Returns the index of the first element in the array where predicate is true, and -1 otherwise. @param predicate find calls predicate once for each element of the array, in ascending order, until it finds one where predicate returns true. If such an element is found, findIndex immediately returns that element index. Otherwise, findIndex returns -1. @param thisArg If provided, it will be used as the this value for each invocation of predicate. If it is not provided, undefined is used instead. |
-| find* | `{ <S extends ExtendedTreeNodeProps>(predicate: (value: ExtendedTreeNodeProps, index: number, obj: ExtendedTreeNodeProps[]) => value is S, thisArg?: any): S; (predicate: (value: ExtendedTreeNodeProps, index: number, obj: ExtendedTreeNodeProps[]) => unknown, thisArg?: any): ExtendedTreeNodeProps; }` | - | Returns the value of the first element in the array where predicate is true, and undefined otherwise. @param predicate find calls predicate once for each element of the array, in ascending order, until it finds one where predicate returns true. If such an element is found, find immediately returns that element value. Otherwise, find returns undefined. @param thisArg If provided, it will be used as the this value for each invocation of predicate. If it is not provided, undefined is used instead. |
-| reduceRight* | `{ (callbackfn: (previousValue: ExtendedTreeNodeProps, currentValue: ExtendedTreeNodeProps, currentIndex: number, array: ExtendedTreeNodeProps[]) => ExtendedTreeNodeProps): ExtendedTreeNodeProps; (callbackfn: (previousValue: ExtendedTreeNodeProps, currentValue: ExtendedTreeNodeProps, currentIndex: number, array: Exte...` | - | Calls the specified callback function for all the elements in an array, in descending order. The return value of the callback function is the accumulated result, and is provided as an argument in the next call to the callback function. @param callbackfn A function that accepts up to four arguments. The reduceRight method calls the callbackfn function one time for each element in the array. @param initialValue If initialValue is specified, it is used as the initial value to start the accumulation. The first call to the callbackfn function provides this value as an argument instead of an array value. @param callbackfn A function that accepts up to four arguments. The reduceRight method calls the callbackfn function one time for each element in the array. @param initialValue If initialValue is specified, it is used as the initial value to start the accumulation. The first call to the callbackfn function provides this value as an argument instead of an array value. |
-| reduce* | `{ (callbackfn: (previousValue: ExtendedTreeNodeProps, currentValue: ExtendedTreeNodeProps, currentIndex: number, array: ExtendedTreeNodeProps[]) => ExtendedTreeNodeProps): ExtendedTreeNodeProps; (callbackfn: (previousValue: ExtendedTreeNodeProps, currentValue: ExtendedTreeNodeProps, currentIndex: number, array: Exte...` | - | Calls the specified callback function for all the elements in an array. The return value of the callback function is the accumulated result, and is provided as an argument in the next call to the callback function. @param callbackfn A function that accepts up to four arguments. The reduce method calls the callbackfn function one time for each element in the array. @param initialValue If initialValue is specified, it is used as the initial value to start the accumulation. The first call to the callbackfn function provides this value as an argument instead of an array value. @param callbackfn A function that accepts up to four arguments. The reduce method calls the callbackfn function one time for each element in the array. @param initialValue If initialValue is specified, it is used as the initial value to start the accumulation. The first call to the callbackfn function provides this value as an argument instead of an array value. |
-| filter* | `{ <S extends ExtendedTreeNodeProps>(predicate: (value: ExtendedTreeNodeProps, index: number, array: ExtendedTreeNodeProps[]) => value is S, thisArg?: any): S[]; (predicate: (value: ExtendedTreeNodeProps, index: number, array: ExtendedTreeNodeProps[]) => unknown, thisArg?: any): ExtendedTreeNodeProps[]; }` | - | Returns the elements of an array that meet the condition specified in a callback function. @param predicate A function that accepts up to three arguments. The filter method calls the predicate function one time for each element in the array. @param thisArg An object to which the this keyword can refer in the predicate function. If thisArg is omitted, undefined is used as the this value. @param predicate A function that accepts up to three arguments. The filter method calls the predicate function one time for each element in the array. @param thisArg An object to which the this keyword can refer in the predicate function. If thisArg is omitted, undefined is used as the this value. |
-| map* | `<U>(callbackfn: (value: ExtendedTreeNodeProps, index: number, array: ExtendedTreeNodeProps[]) => U, thisArg?: any) => U[]` | - | Calls a defined callback function on each element of an array, and returns an array that contains the results. @param callbackfn A function that accepts up to three arguments. The map method calls the callbackfn function one time for each element in the array. @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value. |
-| forEach* | `(callbackfn: (value: ExtendedTreeNodeProps, index: number, array: ExtendedTreeNodeProps[]) => void, thisArg?: any) => void` | - | Performs the specified action for each element in an array. @param callbackfn A function that accepts up to three arguments. forEach calls the callbackfn function one time for each element in the array. @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value. |
-| some* | `(predicate: (value: ExtendedTreeNodeProps, index: number, array: ExtendedTreeNodeProps[]) => unknown, thisArg?: any) => boolean` | - | Determines whether the specified callback function returns true for any element of an array. @param predicate A function that accepts up to three arguments. The some method calls the predicate function for each element in the array until the predicate returns a value which is coercible to the Boolean value true, or until the end of the array. @param thisArg An object to which the this keyword can refer in the predicate function. If thisArg is omitted, undefined is used as the this value. |
-| every* | `{ <S extends ExtendedTreeNodeProps>(predicate: (value: ExtendedTreeNodeProps, index: number, array: ExtendedTreeNodeProps[]) => value is S, thisArg?: any): this is S[]; (predicate: (value: ExtendedTreeNodeProps, index: number, array: ExtendedTreeNodeProps[]) => unknown, thisArg?: any): boolean; }` | - | Determines whether all the members of an array satisfy the specified test. @param predicate A function that accepts up to three arguments. The every method calls the predicate function for each element in the array until the predicate returns a value which is coercible to the Boolean value false, or until the end of the array. @param thisArg An object to which the this keyword can refer in the predicate function. If thisArg is omitted, undefined is used as the this value. @param predicate A function that accepts up to three arguments. The every method calls the predicate function for each element in the array until the predicate returns a value which is coercible to the Boolean value false, or until the end of the array. @param thisArg An object to which the this keyword can refer in the predicate function. If thisArg is omitted, undefined is used as the this value. |
-| lastIndexOf* | `(searchElement: ExtendedTreeNodeProps, fromIndex?: number) => number` | - | Returns the index of the last occurrence of a specified value in an array, or -1 if it is not present. @param searchElement The value to locate in the array. @param fromIndex The array index at which to begin searching backward. If fromIndex is omitted, the search starts at the last index in the array. |
-| indexOf* | `(searchElement: ExtendedTreeNodeProps, fromIndex?: number) => number` | - | Returns the index of the first occurrence of a value in an array, or -1 if it is not present. @param searchElement The value to locate in the array. @param fromIndex The array index at which to begin the search. If fromIndex is omitted, the search starts at index 0. |
-| unshift* | `(...items: ExtendedTreeNodeProps[]) => number` | - | Inserts new elements at the start of an array, and returns the new length of the array. @param items Elements to insert at the start of the array. |
-| splice* | `{ (start: number, deleteCount?: number): ExtendedTreeNodeProps[]; (start: number, deleteCount: number, ...items: ExtendedTreeNodeProps[]): ExtendedTreeNodeProps[]; }` | - | Removes elements from an array and, if necessary, inserts new elements in their place, returning the deleted elements. @param start The zero-based location in the array from which to start removing elements. @param deleteCount The number of elements to remove. Omitting this argument will remove all elements from the start paramater location to end of the array. If value of this argument is either a negative number, zero, undefined, or a type that cannot be converted to an integer, the function will evaluate the argument as zero and not remove any elements. @returns An array containing the elements that were deleted. @param start The zero-based location in the array from which to start removing elements. @param deleteCount The number of elements to remove. If value of this argument is either a negative number, zero, undefined, or a type that cannot be converted to an integer, the function will evaluate the argument as zero and not remove any elements. @param items Elements to insert into the array in place of the deleted elements. @returns An array containing the elements that were deleted. |
-| sort* | `(compareFn?: (a: ExtendedTreeNodeProps, b: ExtendedTreeNodeProps) => number) => ExtendedTreeNodeProps[]` | - | Sorts an array in place. This method mutates the array and returns a reference to the same array. @param compareFn Function used to determine the order of the elements. It is expected to return a negative value if the first argument is less than the second argument, zero if they're equal, and a positive value otherwise. If omitted, the elements are sorted in ascending, UTF-16 code unit order. ```ts [11,2,22,1].sort((a, b) => a - b) ``` |
-| slice* | `(start?: number, end?: number) => ExtendedTreeNodeProps[]` | - | Returns a copy of a section of an array. For both start and end, a negative index can be used to indicate an offset from the end of the array. For example, -2 refers to the second to last element of the array. @param start The beginning index of the specified portion of the array. If start is undefined, then the slice begins at index 0. @param end The end index of the specified portion of the array. This is exclusive of the element at the index 'end'. If end is undefined, then the slice extends to the end of the array. |
-| shift* | `() => ExtendedTreeNodeProps` | - | Removes the first element from an array and returns it. If the array is empty, undefined is returned and the array is not modified. |
-| reverse* | `() => ExtendedTreeNodeProps[]` | - | Reverses the elements in an array in place. This method mutates the array and returns a reference to the same array. |
-| join* | `(separator?: string) => string` | - | Adds all the elements of an array into a string, separated by the specified separator string. @param separator A string used to separate one element of the array from the next in the resulting string. If omitted, the array elements are separated with a comma. |
-| concat* | `{ (...items: ConcatArray<ExtendedTreeNodeProps>[]): ExtendedTreeNodeProps[]; (...items: (ExtendedTreeNodeProps \| ConcatArray<...>)[]): ExtendedTreeNodeProps[]; }` | - | Combines two or more arrays. This method returns a new array without modifying any existing arrays. @param items Additional arrays and/or items to add to the end of the array. @param items Additional arrays and/or items to add to the end of the array. |
-| push* | `(...items: ExtendedTreeNodeProps[]) => number` | - | Appends new elements to the end of an array, and returns the new length of the array. @param items New elements to add to the array. |
-| pop* | `() => ExtendedTreeNodeProps` | - | Removes the last element from an array and returns it. If the array is empty, undefined is returned and the array is not modified. |
-| length* | `number` | - | Gets or sets the length of the array. This is a number one higher than the highest index in the array. |
-| toString | `() => string` | function toString() { [native code] } | Returns a string representation of an array. |
-| toLocaleString | `{ (): string; (locales: string \| string[], options?: NumberFormatOptions & DateTimeFormatOptions): string; }` | function toLocaleString() { [native code] } | Returns a string representation of an array. The elements are converted to string using their toLocaleString methods. |
+| onSelect* | `SelectHandler` | - | Логика мультивыбора: по клику возвращает, какие id добавить и снять. |
+| onDataLoad* | `PreloadNodeHandler<TTreeNode>` | - | Подгрузка дочерних узлов, если у узла есть `nested`, но массив пуст (ленивая загрузка перед выбором). |
+| selected | `string[]` | - | Controlled: текущие выбранные id; без пропа — внутреннее состояние хука. |
+| onChangeSelected | `(newSelected: string[]) => void` | - | Вызывается при изменении набора выбранных id (controlled-сценарий). |
 
 
 [//]: DOCUMENTATION_SECTION_END

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

@@ -0,0 +1,200 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+const vitest_1 = require("vitest");
+const updateTreeNode_1 = require("../updateTreeNode");
+const node = (id, nested) => Object.assign({
+  id,
+  title: id
+}, nested !== undefined && {
+  nested
+});
+(0, vitest_1.describe)('updateTreeNode', () => {
+  (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, updateTreeNode_1.updateTreeNode)(tree, 'b', {
+      nested: children
+    });
+    (0, vitest_1.expect)(result).toHaveLength(2);
+    (0, vitest_1.expect)(result[0]).toMatchObject({
+      id: 'a',
+      title: 'a',
+      nested: [{
+        id: 'a1',
+        title: 'a1'
+      }]
+    });
+    (0, vitest_1.expect)(result[1]).toMatchObject({
+      id: 'b',
+      title: 'b',
+      nested: [{
+        id: 'new1',
+        title: 'new1'
+      }, {
+        id: 'new2',
+        title: 'new2'
+      }]
+    });
+  });
+  (0, vitest_1.it)('replaces nested for deeply nested node', () => {
+    const childWithNested = {
+      id: 'child',
+      title: 'child',
+      nested: [{
+        id: 'grand',
+        title: 'grand'
+      }]
+    };
+    const tree = [node('root', [childWithNested])];
+    const children = [node('replacement')];
+    const result = (0, updateTreeNode_1.updateTreeNode)(tree, 'child', {
+      nested: children
+    });
+    const root = result[0];
+    (0, vitest_1.expect)(root).toMatchObject({
+      id: 'root',
+      title: 'root'
+    });
+    (0, vitest_1.expect)(root.nested).toHaveLength(1);
+    (0, vitest_1.expect)(root.nested[0]).toMatchObject({
+      id: 'child',
+      title: 'child',
+      nested: [{
+        id: 'replacement',
+        title: 'replacement'
+      }]
+    });
+  });
+  (0, vitest_1.it)('returns cloned tree when node is not found', () => {
+    const tree = [node('a'), node('b')];
+    const result = (0, updateTreeNode_1.updateTreeNode)(tree, 'missing', {
+      nested: [node('x')]
+    });
+    (0, vitest_1.expect)(result).toHaveLength(2);
+    (0, vitest_1.expect)(result[0]).toMatchObject({
+      id: 'a',
+      title: 'a'
+    });
+    (0, vitest_1.expect)(result[1]).toMatchObject({
+      id: 'b',
+      title: 'b'
+    });
+    (0, vitest_1.expect)(result).not.toBe(tree);
+  });
+  (0, vitest_1.it)('returns empty array for empty tree', () => {
+    const result = (0, updateTreeNode_1.updateTreeNode)([], 'any', {
+      nested: [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, updateTreeNode_1.updateTreeNode)(tree, 'leaf', {
+      nested: children
+    });
+    (0, vitest_1.expect)(result[0]).toMatchObject({
+      id: 'leaf',
+      title: 'leaf',
+      nested: [{
+        id: 'new1',
+        title: 'new1'
+      }]
+    });
+    (0, vitest_1.expect)(result[1]).toMatchObject({
+      id: 'other',
+      title: '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, updateTreeNode_1.updateTreeNode)(tree, 'second', {
+      nested: children
+    });
+    (0, vitest_1.expect)(result.map(n => n.id)).toEqual(['first', 'second', 'third']);
+    (0, vitest_1.expect)(result.map(n => n.title)).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']);
+    (0, vitest_1.expect)(result[1].nested.map(n => n.title)).toEqual(['new1', 'new2']);
+  });
+  (0, vitest_1.it)('updates title without changing nested', () => {
+    const tree = [node('a', [{
+      id: 'c1',
+      title: 'c1'
+    }])];
+    const result = (0, updateTreeNode_1.updateTreeNode)(tree, 'a', {
+      title: 'Renamed root'
+    });
+    (0, vitest_1.expect)(result[0]).toMatchObject({
+      id: 'a',
+      title: 'Renamed root',
+      nested: [{
+        id: 'c1',
+        title: 'c1'
+      }]
+    });
+  });
+  (0, vitest_1.it)('updates disabled and className without nested in data', () => {
+    const tree = [Object.assign(Object.assign({}, node('x')), {
+      disabled: false
+    }), Object.assign(Object.assign({}, node('y', [{
+      id: 'y1',
+      title: 'y1'
+    }])), {
+      className: 'old'
+    })];
+    const result = (0, updateTreeNode_1.updateTreeNode)(tree, 'x', {
+      disabled: true,
+      className: 'leaf-updated'
+    });
+    (0, vitest_1.expect)(result[0]).toMatchObject({
+      id: 'x',
+      disabled: true,
+      className: 'leaf-updated'
+    });
+    (0, vitest_1.expect)(result[1]).toMatchObject({
+      id: 'y',
+      title: 'y',
+      className: 'old',
+      nested: [{
+        id: 'y1',
+        title: 'y1'
+      }]
+    });
+  });
+  (0, vitest_1.it)('applies title and nested together on target node', () => {
+    const tree = [node('root', [{
+      id: 'c1',
+      title: 'c1'
+    }])];
+    const newChildren = [node('n1'), node('n2')];
+    const result = (0, updateTreeNode_1.updateTreeNode)(tree, 'root', {
+      title: 'New title',
+      nested: newChildren
+    });
+    (0, vitest_1.expect)(result[0]).toMatchObject({
+      id: 'root',
+      title: 'New title',
+      nested: [{
+        id: 'n1',
+        title: 'n1'
+      }, {
+        id: 'n2',
+        title: 'n2'
+      }]
+    });
+  });
+});

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

@@ -1,4 +1,11 @@
 import { TreeNodeId, TreeNodeProps } from '../types';
+/**
+ * Проверяет состояние выбора дочерних узлов:
+ * выбраны ли все, выбраны ли некоторые.
+ *
+ * @param nodes Дочерние узлы для проверки.
+ * @param selectedKeys Текущий список выбранных id.
+ */
 export declare function checkNestedNodesSelection(nodes: TreeNodeProps[], selectedKeys: TreeNodeId[]): {
     someSelected: boolean;
     allSelected: boolean;

package/dist/cjs/helpers/checkNestedNodesSelection.js

@@ -5,6 +5,13 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.checkNestedNodesSelection = checkNestedNodesSelection;
 const findAllChildNodeIds_1 = require("./findAllChildNodeIds");
+/**
+ * Проверяет состояние выбора дочерних узлов:
+ * выбраны ли все, выбраны ли некоторые.
+ *
+ * @param nodes Дочерние узлы для проверки.
+ * @param selectedKeys Текущий список выбранных id.
+ */
 function checkNestedNodesSelection(nodes, selectedKeys) {
   const allIds = (0, findAllChildNodeIds_1.findAllChildNodeIds)(nodes);
   const selected = allIds.filter(id => selectedKeys.includes(id));

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

@@ -1,2 +1,9 @@
 import { TreeNodeProps } from '../types';
+/**
+ * Возвращает раскрытые узлы, у которых `nested` уже существует, но пока пустой.
+ * Используется для определения узлов, требующих дополнительной подгрузки детей.
+ *
+ * @param nodes Узлы дерева для проверки.
+ * @param expandedIds Множество id раскрытых узлов.
+ */
 export declare function collectEmptyNestedNodesInExpanded<TTreeNode extends TreeNodeProps>(nodes: TTreeNode[], expandedIds: Set<string>): TTreeNode[];

package/dist/cjs/helpers/collectEmptyNestedNodesInExpanded.js

@@ -5,6 +5,13 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.collectEmptyNestedNodesInExpanded = collectEmptyNestedNodesInExpanded;
 const traverse_1 = require("./traverse");
+/**
+ * Возвращает раскрытые узлы, у которых `nested` уже существует, но пока пустой.
+ * Используется для определения узлов, требующих дополнительной подгрузки детей.
+ *
+ * @param nodes Узлы дерева для проверки.
+ * @param expandedIds Множество id раскрытых узлов.
+ */
 function collectEmptyNestedNodesInExpanded(nodes, expandedIds) {
   const result = [];
   (0, traverse_1.traverse)(nodes, node => {

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

@@ -1,2 +1,9 @@
 import { TreeNodeProps } from '../types';
-export declare const collectIds: (treeNodes: TreeNodeProps[]) => string[];
+/**
+ * Собирает id всех узлов дерева.
+ *
+ * @param treeNodes Узлы дерева для обхода.
+ * @returns Массив id узлов в порядке обхода BFS.
+ * @function collectIds
+ */
+export declare function collectIds(treeNodes: TreeNodeProps[]): string[];

package/dist/cjs/helpers/collectIds.js

@@ -3,11 +3,17 @@
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.collectIds = void 0;
+exports.collectIds = collectIds;
 const traverse_1 = require("./traverse");
-const collectIds = treeNodes => {
+/**
+ * Собирает id всех узлов дерева.
+ *
+ * @param treeNodes Узлы дерева для обхода.
+ * @returns Массив id узлов в порядке обхода BFS.
+ * @function collectIds
+ */
+function collectIds(treeNodes) {
   const ids = [];
   (0, traverse_1.traverse)(treeNodes, node => ids.push(node.id));
   return ids;
-};
-exports.collectIds = collectIds;
+}

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

@@ -1,2 +1,6 @@
 import { ExtendedTreeNodeProps } from '../types';
+/**
+ * Возвращает строковый заголовок узла дерева.
+ * Если title задан функцией, использует getTitle (если он доступен).
+ */
 export declare const extractTreeNodeTitle: ({ title, getTitle }: ExtendedTreeNodeProps) => string;

package/dist/cjs/helpers/extractTreeNodeTitle.js

@@ -4,6 +4,10 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.extractTreeNodeTitle = void 0;
+/**
+ * Возвращает строковый заголовок узла дерева.
+ * Если title задан функцией, использует getTitle (если он доступен).
+ */
 const extractTreeNodeTitle = _ref => {
   let {
     title,

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

@@ -1,2 +1,9 @@
 import { TreeNodeId, TreeNodeProps } from '../types';
+/**
+ * Собирает id всех недеактивированных узлов в поддереве.
+ *
+ * @param nodes Стартовые узлы обхода.
+ * @returns Массив id всех доступных узлов.
+ * @function findAllChildNodeIds
+ */
 export declare function findAllChildNodeIds(nodes: TreeNodeProps[]): TreeNodeId[];

package/dist/cjs/helpers/findAllChildNodeIds.js

@@ -4,6 +4,13 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.findAllChildNodeIds = findAllChildNodeIds;
+/**
+ * Собирает id всех недеактивированных узлов в поддереве.
+ *
+ * @param nodes Стартовые узлы обхода.
+ * @returns Массив id всех доступных узлов.
+ * @function findAllChildNodeIds
+ */
 function findAllChildNodeIds(nodes) {
   var _a;
   const stack = [...nodes];

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

@@ -1,2 +1,8 @@
 import { TreeNodeId, TreeNodeProps } from '../types';
+/**
+ * Возвращает id узлов в поддереве, проходя только по раскрытым веткам.
+ *
+ * @param nodes Стартовые узлы обхода.
+ * @param expandedNodes Список id раскрытых узлов.
+ */
 export declare function findAllExpandedChildNodeIds(nodes: TreeNodeProps[], expandedNodes: TreeNodeId[]): string[];

package/dist/cjs/helpers/findAllExpandedChildNodeIds.js

@@ -4,6 +4,12 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.findAllExpandedChildNodeIds = findAllExpandedChildNodeIds;
+/**
+ * Возвращает id узлов в поддереве, проходя только по раскрытым веткам.
+ *
+ * @param nodes Стартовые узлы обхода.
+ * @param expandedNodes Список id раскрытых узлов.
+ */
 function findAllExpandedChildNodeIds(nodes, expandedNodes) {
   var _a;
   const stack = [...nodes];