@snack-uikit/tree 0.10.2-preview-013112d8.0 → 0.10.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +10 -0
- package/README.md +0 -12
- package/dist/cjs/helpers/index.d.ts +0 -2
- package/dist/cjs/helpers/index.js +1 -3
- package/dist/cjs/helpers/sortTreeItemsByTitle.js +2 -2
- package/dist/cjs/helpers/traverse.d.ts +1 -7
- package/dist/cjs/helpers/traverse.js +2 -38
- package/dist/cjs/index.d.ts +0 -1
- package/dist/cjs/index.js +1 -26
- package/dist/cjs/types.d.ts +0 -12
- package/dist/esm/helpers/index.d.ts +0 -2
- package/dist/esm/helpers/index.js +0 -2
- package/dist/esm/helpers/sortTreeItemsByTitle.js +2 -2
- package/dist/esm/helpers/traverse.d.ts +1 -7
- package/dist/esm/helpers/traverse.js +0 -24
- package/dist/esm/index.d.ts +0 -1
- package/dist/esm/index.js +0 -1
- package/dist/esm/types.d.ts +0 -12
- package/package.json +6 -24
- package/src/helpers/index.ts +0 -2
- package/src/helpers/sortTreeItemsByTitle.ts +2 -2
- package/src/helpers/traverse.ts +1 -38
- package/src/index.ts +0 -1
- package/src/types.ts +0 -9
- package/dist/cjs/helpers/__tests__/collectEmptyNestedNodesInExpanded.spec.d.ts +0 -1
- package/dist/cjs/helpers/__tests__/collectEmptyNestedNodesInExpanded.spec.js +0 -80
- package/dist/cjs/helpers/__tests__/setChildrenOfTreeNode.spec.d.ts +0 -1
- package/dist/cjs/helpers/__tests__/setChildrenOfTreeNode.spec.js +0 -102
- package/dist/cjs/helpers/collectEmptyNestedNodesInExpanded.d.ts +0 -2
- package/dist/cjs/helpers/collectEmptyNestedNodesInExpanded.js +0 -17
- package/dist/cjs/helpers/setChildrenOfTreeNode.d.ts +0 -2
- package/dist/cjs/helpers/setChildrenOfTreeNode.js +0 -28
- package/dist/cjs/hooks/index.d.ts +0 -2
- package/dist/cjs/hooks/index.js +0 -26
- package/dist/cjs/hooks/useSearchableTree.d.ts +0 -33
- package/dist/cjs/hooks/useSearchableTree.js +0 -138
- package/dist/cjs/hooks/useTreeMultiSelection.d.ts +0 -12
- package/dist/cjs/hooks/useTreeMultiSelection.js +0 -82
- package/dist/esm/helpers/__tests__/collectEmptyNestedNodesInExpanded.spec.d.ts +0 -1
- package/dist/esm/helpers/__tests__/collectEmptyNestedNodesInExpanded.spec.js +0 -64
- package/dist/esm/helpers/__tests__/setChildrenOfTreeNode.spec.d.ts +0 -1
- package/dist/esm/helpers/__tests__/setChildrenOfTreeNode.spec.js +0 -50
- package/dist/esm/helpers/collectEmptyNestedNodesInExpanded.d.ts +0 -2
- package/dist/esm/helpers/collectEmptyNestedNodesInExpanded.js +0 -11
- package/dist/esm/helpers/setChildrenOfTreeNode.d.ts +0 -2
- package/dist/esm/helpers/setChildrenOfTreeNode.js +0 -20
- package/dist/esm/hooks/index.d.ts +0 -2
- package/dist/esm/hooks/index.js +0 -2
- package/dist/esm/hooks/useSearchableTree.d.ts +0 -33
- package/dist/esm/hooks/useSearchableTree.js +0 -98
- package/dist/esm/hooks/useTreeMultiSelection.d.ts +0 -12
- package/dist/esm/hooks/useTreeMultiSelection.js +0 -43
- package/src/helpers/__tests__/collectEmptyNestedNodesInExpanded.spec.ts +0 -88
- package/src/helpers/__tests__/setChildrenOfTreeNode.spec.ts +0 -68
- package/src/helpers/collectEmptyNestedNodesInExpanded.ts +0 -16
- package/src/helpers/setChildrenOfTreeNode.ts +0 -30
- package/src/hooks/index.ts +0 -2
- package/src/hooks/useSearchableTree.ts +0 -150
- package/src/hooks/useTreeMultiSelection.ts +0 -61
|
@@ -1,43 +0,0 @@
|
|
|
1
|
-
var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
|
|
2
|
-
function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
|
|
3
|
-
return new (P || (P = Promise))(function (resolve, reject) {
|
|
4
|
-
function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
|
|
5
|
-
function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
|
|
6
|
-
function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
|
|
7
|
-
step((generator = generator.apply(thisArg, _arguments || [])).next());
|
|
8
|
-
});
|
|
9
|
-
};
|
|
10
|
-
import { useCallback } from 'react';
|
|
11
|
-
import { useValueControl } from '@snack-uikit/utils';
|
|
12
|
-
const getNewSelectedIds = (selectedIds, added, removed) => {
|
|
13
|
-
const result = new Set(selectedIds);
|
|
14
|
-
added.forEach(id => {
|
|
15
|
-
result.add(id);
|
|
16
|
-
});
|
|
17
|
-
removed.forEach(id => {
|
|
18
|
-
result.delete(id);
|
|
19
|
-
});
|
|
20
|
-
return Array.from(result);
|
|
21
|
-
};
|
|
22
|
-
export function useTreeMultiSelection({ onDataLoad, onSelect: onSelectProp, selected, onChangeSelected, }) {
|
|
23
|
-
const [selectedIds = [], setSelectedIds] = useValueControl({
|
|
24
|
-
value: selected,
|
|
25
|
-
defaultValue: [],
|
|
26
|
-
onChange: onChangeSelected,
|
|
27
|
-
});
|
|
28
|
-
const onSelect = useCallback((selectedKeys, node) => __awaiter(this, void 0, void 0, function* () {
|
|
29
|
-
const isSelected = selectedKeys.includes(node.id);
|
|
30
|
-
const clonedNode = structuredClone(node);
|
|
31
|
-
if (node.nested && !node.nested.length) {
|
|
32
|
-
const { preloadedChildren } = yield onDataLoad(node);
|
|
33
|
-
clonedNode.nested = preloadedChildren;
|
|
34
|
-
}
|
|
35
|
-
const { added, removed } = onSelectProp({ selectedKeys, node: clonedNode, isSelected });
|
|
36
|
-
const updatedSelectedIds = getNewSelectedIds(selectedIds, added, removed);
|
|
37
|
-
setSelectedIds(updatedSelectedIds);
|
|
38
|
-
}), [onDataLoad, onSelectProp, selectedIds, setSelectedIds]);
|
|
39
|
-
return {
|
|
40
|
-
selected: selectedIds,
|
|
41
|
-
onSelect,
|
|
42
|
-
};
|
|
43
|
-
}
|
|
@@ -1,88 +0,0 @@
|
|
|
1
|
-
import { describe, expect, it } from 'vitest';
|
|
2
|
-
|
|
3
|
-
import type { TreeNodeProps } from '../../types';
|
|
4
|
-
import { collectEmptyNestedNodesInExpanded } from '../collectEmptyNestedNodesInExpanded';
|
|
5
|
-
|
|
6
|
-
const node = (id: string, nested?: TreeNodeProps[]) => ({
|
|
7
|
-
id,
|
|
8
|
-
title: id,
|
|
9
|
-
...(nested !== undefined && { nested }),
|
|
10
|
-
});
|
|
11
|
-
|
|
12
|
-
describe('collectEmptyNestedNodesInExpanded', () => {
|
|
13
|
-
it('returns nodes with empty nested array that are in expandedIds', () => {
|
|
14
|
-
const tree = [node('a', []), node('b', [node('b1')])];
|
|
15
|
-
const expandedIds = new Set(['a']);
|
|
16
|
-
const result = collectEmptyNestedNodesInExpanded(tree, expandedIds);
|
|
17
|
-
|
|
18
|
-
expect(result).toHaveLength(1);
|
|
19
|
-
expect(result[0]).toMatchObject({ id: 'a', nested: [] });
|
|
20
|
-
});
|
|
21
|
-
|
|
22
|
-
it('does not return nodes with empty nested if not in expandedIds', () => {
|
|
23
|
-
const tree = [node('a', []), node('b', [])];
|
|
24
|
-
const expandedIds = new Set(['b']);
|
|
25
|
-
const result = collectEmptyNestedNodesInExpanded(tree, expandedIds);
|
|
26
|
-
|
|
27
|
-
expect(result).toHaveLength(1);
|
|
28
|
-
expect(result[0].id).toBe('b');
|
|
29
|
-
});
|
|
30
|
-
|
|
31
|
-
it('does not return nodes that have non-empty nested', () => {
|
|
32
|
-
const tree = [node('a', [node('a1')]), node('b', [])];
|
|
33
|
-
const expandedIds = new Set(['a', 'b']);
|
|
34
|
-
const result = collectEmptyNestedNodesInExpanded(tree, expandedIds);
|
|
35
|
-
|
|
36
|
-
expect(result).toHaveLength(1);
|
|
37
|
-
expect(result[0].id).toBe('b');
|
|
38
|
-
});
|
|
39
|
-
|
|
40
|
-
it('does not return nodes without nested property (leaf)', () => {
|
|
41
|
-
const tree = [node('leaf'), node('empty', [])];
|
|
42
|
-
const expandedIds = new Set(['leaf', 'empty']);
|
|
43
|
-
const result = collectEmptyNestedNodesInExpanded(tree, expandedIds);
|
|
44
|
-
|
|
45
|
-
expect(result).toHaveLength(1);
|
|
46
|
-
expect(result[0].id).toBe('empty');
|
|
47
|
-
});
|
|
48
|
-
|
|
49
|
-
it('returns empty array for empty tree', () => {
|
|
50
|
-
const result = collectEmptyNestedNodesInExpanded([], new Set(['any']));
|
|
51
|
-
expect(result).toEqual([]);
|
|
52
|
-
});
|
|
53
|
-
|
|
54
|
-
it('returns empty array when expandedIds is empty', () => {
|
|
55
|
-
const tree = [node('a', []), node('b', [])];
|
|
56
|
-
const result = collectEmptyNestedNodesInExpanded(tree, new Set());
|
|
57
|
-
|
|
58
|
-
expect(result).toEqual([]);
|
|
59
|
-
});
|
|
60
|
-
|
|
61
|
-
it('collects from deeply nested nodes', () => {
|
|
62
|
-
const child = node('child', []);
|
|
63
|
-
const tree = [node('root', [node('mid', [child])])];
|
|
64
|
-
const expandedIds = new Set(['root', 'mid', 'child']);
|
|
65
|
-
const result = collectEmptyNestedNodesInExpanded(tree, expandedIds);
|
|
66
|
-
|
|
67
|
-
expect(result).toHaveLength(1);
|
|
68
|
-
expect(result[0]).toMatchObject({ id: 'child', nested: [] });
|
|
69
|
-
});
|
|
70
|
-
|
|
71
|
-
it('returns all matching nodes from different levels', () => {
|
|
72
|
-
const tree = [node('a', []), node('b', [node('b1', []), node('b2', [])])];
|
|
73
|
-
const expandedIds = new Set(['a', 'b', 'b1', 'b2']);
|
|
74
|
-
const result = collectEmptyNestedNodesInExpanded(tree, expandedIds);
|
|
75
|
-
|
|
76
|
-
expect(result).toHaveLength(3);
|
|
77
|
-
expect(result.map(n => n.id).sort()).toEqual(['a', 'b1', 'b2']);
|
|
78
|
-
});
|
|
79
|
-
|
|
80
|
-
it('only includes node if both empty nested and expanded', () => {
|
|
81
|
-
const tree = [node('expanded', []), node('collapsed', [])];
|
|
82
|
-
const expandedIds = new Set(['expanded']);
|
|
83
|
-
const result = collectEmptyNestedNodesInExpanded(tree, expandedIds);
|
|
84
|
-
|
|
85
|
-
expect(result).toHaveLength(1);
|
|
86
|
-
expect(result[0].id).toBe('expanded');
|
|
87
|
-
});
|
|
88
|
-
});
|
|
@@ -1,68 +0,0 @@
|
|
|
1
|
-
import { describe, expect, it } from 'vitest';
|
|
2
|
-
|
|
3
|
-
import type { TreeNodeProps } from '../../types';
|
|
4
|
-
import { setChildrenOfTreeNode } from '../setChildrenOfTreeNode';
|
|
5
|
-
|
|
6
|
-
const node = (id: string, nested?: { id: string; title: string }[]) => ({
|
|
7
|
-
id,
|
|
8
|
-
title: id,
|
|
9
|
-
...(nested !== undefined && { nested: nested.map(n => ({ ...n, title: n.id })) }),
|
|
10
|
-
});
|
|
11
|
-
|
|
12
|
-
describe('setChildrenOfTreeNode', () => {
|
|
13
|
-
it('replaces nested for root-level node', () => {
|
|
14
|
-
const tree = [node('a', [{ id: 'a1', title: 'a1' }]), node('b', [{ id: 'b1', title: 'b1' }])];
|
|
15
|
-
const children = [node('new1'), node('new2')];
|
|
16
|
-
const result = setChildrenOfTreeNode(tree, 'b', children);
|
|
17
|
-
|
|
18
|
-
expect(result).toHaveLength(2);
|
|
19
|
-
expect(result[0]).toMatchObject({ id: 'a', nested: [{ id: 'a1' }] });
|
|
20
|
-
expect(result[1]).toMatchObject({ id: 'b', nested: [{ id: 'new1' }, { id: 'new2' }] });
|
|
21
|
-
});
|
|
22
|
-
|
|
23
|
-
it('replaces nested for deeply nested node', () => {
|
|
24
|
-
const childWithNested = node('child');
|
|
25
|
-
(childWithNested as { nested: { id: string; title: string }[] }).nested = [{ id: 'grand', title: 'grand' }];
|
|
26
|
-
const tree = [node('root', [childWithNested])];
|
|
27
|
-
const children = [node('replacement')];
|
|
28
|
-
const result = setChildrenOfTreeNode(tree, 'child', children);
|
|
29
|
-
|
|
30
|
-
const root = result[0] as TreeNodeProps & { nested: (TreeNodeProps & { nested: TreeNodeProps[] })[] };
|
|
31
|
-
expect(root.nested).toHaveLength(1);
|
|
32
|
-
expect(root.nested[0]).toMatchObject({ id: 'child', nested: [{ id: 'replacement' }] });
|
|
33
|
-
});
|
|
34
|
-
|
|
35
|
-
it('returns cloned tree when node is not found', () => {
|
|
36
|
-
const tree = [node('a'), node('b')];
|
|
37
|
-
const result = setChildrenOfTreeNode(tree, 'missing', [node('x')]);
|
|
38
|
-
|
|
39
|
-
expect(result).toHaveLength(2);
|
|
40
|
-
expect(result[0]).toMatchObject({ id: 'a' });
|
|
41
|
-
expect(result[1]).toMatchObject({ id: 'b' });
|
|
42
|
-
expect(result).not.toBe(tree);
|
|
43
|
-
});
|
|
44
|
-
|
|
45
|
-
it('returns empty array for empty tree', () => {
|
|
46
|
-
const result = setChildrenOfTreeNode([], 'any', [node('x')]);
|
|
47
|
-
expect(result).toEqual([]);
|
|
48
|
-
});
|
|
49
|
-
|
|
50
|
-
it('sets children for target node that had no nested (leaf)', () => {
|
|
51
|
-
const tree = [node('leaf'), node('other')];
|
|
52
|
-
const children = [node('new1')];
|
|
53
|
-
const result = setChildrenOfTreeNode(tree, 'leaf', children);
|
|
54
|
-
|
|
55
|
-
expect(result[0]).toMatchObject({ id: 'leaf', nested: [{ id: 'new1' }] });
|
|
56
|
-
expect(result[1]).toMatchObject({ id: 'other' });
|
|
57
|
-
});
|
|
58
|
-
|
|
59
|
-
it('preserves order of root nodes when target is second', () => {
|
|
60
|
-
const tree = [node('first'), node('second', [{ id: 's1', title: 's1' }]), node('third')];
|
|
61
|
-
const children = [node('new1'), node('new2')];
|
|
62
|
-
const result = setChildrenOfTreeNode(tree, 'second', children);
|
|
63
|
-
|
|
64
|
-
expect(result.map(n => n.id)).toEqual(['first', 'second', 'third']);
|
|
65
|
-
expect((result[1] as TreeNodeProps & { nested: TreeNodeProps[] }).nested).toHaveLength(2);
|
|
66
|
-
expect((result[1] as { nested: { id: string }[] }).nested.map(n => n.id)).toEqual(['new1', 'new2']);
|
|
67
|
-
});
|
|
68
|
-
});
|
|
@@ -1,16 +0,0 @@
|
|
|
1
|
-
import { TreeNodeProps } from '../types';
|
|
2
|
-
import { traverse } from './traverse';
|
|
3
|
-
|
|
4
|
-
export function collectEmptyNestedNodesInExpanded<TTreeNode extends TreeNodeProps>(
|
|
5
|
-
nodes: TTreeNode[],
|
|
6
|
-
expandedIds: Set<string>,
|
|
7
|
-
): TTreeNode[] {
|
|
8
|
-
const result: TTreeNode[] = [];
|
|
9
|
-
traverse(nodes, node => {
|
|
10
|
-
const hasEmptyNested = Array.isArray(node.nested) && node.nested.length === 0;
|
|
11
|
-
if (hasEmptyNested && expandedIds.has(node.id)) {
|
|
12
|
-
result.push(node);
|
|
13
|
-
}
|
|
14
|
-
});
|
|
15
|
-
return result;
|
|
16
|
-
}
|
|
@@ -1,30 +0,0 @@
|
|
|
1
|
-
import { TreeNodeProps } from '../types';
|
|
2
|
-
import { traverseWithTarget } from './traverse';
|
|
3
|
-
|
|
4
|
-
export const setChildrenOfTreeNode = <TTreeNode extends TreeNodeProps>(
|
|
5
|
-
tree: TTreeNode[],
|
|
6
|
-
nodeId: string,
|
|
7
|
-
children: TTreeNode[],
|
|
8
|
-
): TTreeNode[] => {
|
|
9
|
-
const result: TTreeNode[] = [];
|
|
10
|
-
|
|
11
|
-
traverseWithTarget(tree, result, (source, _depth, targetList) => {
|
|
12
|
-
const isTarget = source.id === nodeId;
|
|
13
|
-
const hasNested = Array.isArray(source.nested);
|
|
14
|
-
|
|
15
|
-
let newNested: TTreeNode[] | undefined;
|
|
16
|
-
if (isTarget) {
|
|
17
|
-
newNested = children;
|
|
18
|
-
} else if (hasNested) {
|
|
19
|
-
newNested = [];
|
|
20
|
-
}
|
|
21
|
-
|
|
22
|
-
const newNode = (newNested !== undefined ? { ...source, nested: newNested } : { ...source }) as TTreeNode;
|
|
23
|
-
|
|
24
|
-
targetList.push(newNode);
|
|
25
|
-
|
|
26
|
-
return !isTarget && hasNested && source.nested?.length ? newNested : undefined;
|
|
27
|
-
});
|
|
28
|
-
|
|
29
|
-
return result;
|
|
30
|
-
};
|
package/src/hooks/index.ts
DELETED
|
@@ -1,150 +0,0 @@
|
|
|
1
|
-
import { useDebounceValue, useDidUpdate, useRefState } from '@siberiacancode/reactuse';
|
|
2
|
-
import { cancelable, CancelablePromise } from 'cancelable-promise';
|
|
3
|
-
import { useCallback, useEffect, useRef, useState } from 'react';
|
|
4
|
-
|
|
5
|
-
import { collectEmptyNestedNodesInExpanded, setChildrenOfTreeNode, traverse } from '../helpers';
|
|
6
|
-
import { TreeNodeProps } from '../types';
|
|
7
|
-
|
|
8
|
-
export type SearchResult<TTreeNode extends TreeNodeProps> = {
|
|
9
|
-
tree: TTreeNode[];
|
|
10
|
-
needPreloadNodes: string[];
|
|
11
|
-
};
|
|
12
|
-
|
|
13
|
-
export type SearchParams = {
|
|
14
|
-
search: string;
|
|
15
|
-
expandedNodes: string[];
|
|
16
|
-
};
|
|
17
|
-
|
|
18
|
-
type UseSearchableTreeParams<TRecordValue, TTreeNode extends TreeNodeProps> = {
|
|
19
|
-
initTree: TTreeNode[];
|
|
20
|
-
onPreloadNode: (node: TreeNodeProps) => Promise<TTreeNode[]>;
|
|
21
|
-
onPreloadNodes: (nodes: string[]) => Promise<Record<string, TTreeNode[]>>;
|
|
22
|
-
onSearch: (params: SearchParams) => Promise<SearchResult<TTreeNode>>;
|
|
23
|
-
mapNodeToRecordItem: (node: TTreeNode) => TRecordValue;
|
|
24
|
-
};
|
|
25
|
-
|
|
26
|
-
export function useSearchableTree<TRecordValue, TTreeNode extends TreeNodeProps>({
|
|
27
|
-
initTree,
|
|
28
|
-
onPreloadNode,
|
|
29
|
-
onPreloadNodes,
|
|
30
|
-
onSearch,
|
|
31
|
-
mapNodeToRecordItem,
|
|
32
|
-
}: UseSearchableTreeParams<TRecordValue, TTreeNode>) {
|
|
33
|
-
const tree = useRefState<TTreeNode[]>(initTree);
|
|
34
|
-
const treeItemsRecord = useRefState<Record<string, TRecordValue>>({});
|
|
35
|
-
|
|
36
|
-
const expandedNodes = useRefState<string[]>([]);
|
|
37
|
-
|
|
38
|
-
const [search, setSearch] = useState<string>('');
|
|
39
|
-
const debouncedSearch = useDebounceValue(search, 500);
|
|
40
|
-
|
|
41
|
-
const [loading, setLoading] = useState(false);
|
|
42
|
-
const searchPromiseRef = useRef<CancelablePromise<SearchResult<TTreeNode>> | null>(null);
|
|
43
|
-
|
|
44
|
-
const buildTreeItemsRecord = useCallback(
|
|
45
|
-
(nodes: TTreeNode[]): Record<string, TRecordValue> => {
|
|
46
|
-
const record: Record<string, TRecordValue> = {};
|
|
47
|
-
|
|
48
|
-
traverse<TTreeNode>(nodes, node => {
|
|
49
|
-
record[node.id] = mapNodeToRecordItem(node);
|
|
50
|
-
});
|
|
51
|
-
|
|
52
|
-
return record;
|
|
53
|
-
},
|
|
54
|
-
[mapNodeToRecordItem],
|
|
55
|
-
);
|
|
56
|
-
|
|
57
|
-
const onExpand = useCallback(
|
|
58
|
-
(nodes: string[]) => {
|
|
59
|
-
expandedNodes.current = nodes;
|
|
60
|
-
},
|
|
61
|
-
[expandedNodes],
|
|
62
|
-
);
|
|
63
|
-
|
|
64
|
-
const onDataLoad = useCallback(
|
|
65
|
-
async (node: TreeNodeProps) => {
|
|
66
|
-
const preloadedChildren = await onPreloadNode(node);
|
|
67
|
-
const updatedTree = setChildrenOfTreeNode(tree.current, node.id, preloadedChildren);
|
|
68
|
-
tree.current = updatedTree;
|
|
69
|
-
|
|
70
|
-
const newTreeItemsRecord: Record<string, TRecordValue> = { ...treeItemsRecord.current };
|
|
71
|
-
traverse<TTreeNode>(preloadedChildren, child => {
|
|
72
|
-
newTreeItemsRecord[child.id] = mapNodeToRecordItem(child);
|
|
73
|
-
});
|
|
74
|
-
treeItemsRecord.current = newTreeItemsRecord;
|
|
75
|
-
|
|
76
|
-
return { preloadedChildren, updatedTree, newTreeItemsRecord };
|
|
77
|
-
},
|
|
78
|
-
[mapNodeToRecordItem, onPreloadNode, tree, treeItemsRecord],
|
|
79
|
-
);
|
|
80
|
-
|
|
81
|
-
const handleSearch = useCallback(
|
|
82
|
-
async (searchQuery: string) => {
|
|
83
|
-
searchPromiseRef.current?.cancel();
|
|
84
|
-
|
|
85
|
-
setLoading(true);
|
|
86
|
-
const searchPromise = cancelable(onSearch({ search: searchQuery, expandedNodes: expandedNodes.current }));
|
|
87
|
-
searchPromiseRef.current = searchPromise;
|
|
88
|
-
|
|
89
|
-
try {
|
|
90
|
-
const { tree: searchedTree, needPreloadNodes } = await searchPromise;
|
|
91
|
-
if (!searchPromise.isCanceled()) {
|
|
92
|
-
tree.current = searchedTree;
|
|
93
|
-
treeItemsRecord.current = buildTreeItemsRecord(searchedTree);
|
|
94
|
-
|
|
95
|
-
const expandedSet = new Set(expandedNodes.current);
|
|
96
|
-
const toPreloadExpandableNodes = collectEmptyNestedNodesInExpanded(searchedTree, expandedSet);
|
|
97
|
-
const collectedNodesForPreload = Array.from(
|
|
98
|
-
new Set([...toPreloadExpandableNodes.map(node => node.id), ...needPreloadNodes]),
|
|
99
|
-
);
|
|
100
|
-
|
|
101
|
-
if (!collectedNodesForPreload.length) {
|
|
102
|
-
return;
|
|
103
|
-
}
|
|
104
|
-
|
|
105
|
-
const preloadedNodes = await onPreloadNodes(collectedNodesForPreload);
|
|
106
|
-
|
|
107
|
-
if (searchPromiseRef.current !== searchPromise) {
|
|
108
|
-
return;
|
|
109
|
-
}
|
|
110
|
-
|
|
111
|
-
let tmpTree = [...searchedTree];
|
|
112
|
-
for (const [nodeId, children] of Object.entries(preloadedNodes)) {
|
|
113
|
-
tmpTree = setChildrenOfTreeNode(tmpTree, nodeId, children);
|
|
114
|
-
}
|
|
115
|
-
|
|
116
|
-
tree.current = tmpTree;
|
|
117
|
-
treeItemsRecord.current = buildTreeItemsRecord(tmpTree);
|
|
118
|
-
}
|
|
119
|
-
} finally {
|
|
120
|
-
if (searchPromiseRef.current === searchPromise) {
|
|
121
|
-
setLoading(false);
|
|
122
|
-
searchPromiseRef.current = null;
|
|
123
|
-
}
|
|
124
|
-
}
|
|
125
|
-
},
|
|
126
|
-
[buildTreeItemsRecord, expandedNodes, onPreloadNodes, onSearch, tree, treeItemsRecord],
|
|
127
|
-
);
|
|
128
|
-
|
|
129
|
-
useDidUpdate(() => {
|
|
130
|
-
handleSearch(debouncedSearch);
|
|
131
|
-
}, [debouncedSearch, handleSearch]);
|
|
132
|
-
|
|
133
|
-
useEffect(() => {
|
|
134
|
-
tree.current = initTree;
|
|
135
|
-
treeItemsRecord.current = buildTreeItemsRecord(initTree);
|
|
136
|
-
}, [buildTreeItemsRecord, initTree, tree, treeItemsRecord]);
|
|
137
|
-
|
|
138
|
-
return {
|
|
139
|
-
tree,
|
|
140
|
-
expandedNodes,
|
|
141
|
-
loading,
|
|
142
|
-
treeItemsRecord,
|
|
143
|
-
search: {
|
|
144
|
-
value: search,
|
|
145
|
-
onChange: setSearch,
|
|
146
|
-
},
|
|
147
|
-
onExpand,
|
|
148
|
-
onDataLoad,
|
|
149
|
-
};
|
|
150
|
-
}
|
|
@@ -1,61 +0,0 @@
|
|
|
1
|
-
import { useCallback } from 'react';
|
|
2
|
-
|
|
3
|
-
import { useValueControl } from '@snack-uikit/utils';
|
|
4
|
-
|
|
5
|
-
import { PreloadNodeHandler, SelectHandler, TreeNodeProps } from '../types';
|
|
6
|
-
|
|
7
|
-
type UseTreeMultiSelectionParams<TTreeNode extends TreeNodeProps> = {
|
|
8
|
-
onDataLoad: PreloadNodeHandler<TTreeNode>;
|
|
9
|
-
onSelect: SelectHandler;
|
|
10
|
-
selected?: string[];
|
|
11
|
-
onChangeSelected?: (newSelected: string[]) => void;
|
|
12
|
-
};
|
|
13
|
-
|
|
14
|
-
const getNewSelectedIds = (selectedIds: string[], added: string[], removed: string[]): string[] => {
|
|
15
|
-
const result = new Set(selectedIds);
|
|
16
|
-
|
|
17
|
-
added.forEach(id => {
|
|
18
|
-
result.add(id);
|
|
19
|
-
});
|
|
20
|
-
|
|
21
|
-
removed.forEach(id => {
|
|
22
|
-
result.delete(id);
|
|
23
|
-
});
|
|
24
|
-
|
|
25
|
-
return Array.from(result);
|
|
26
|
-
};
|
|
27
|
-
|
|
28
|
-
export function useTreeMultiSelection<TTreeNode extends TreeNodeProps>({
|
|
29
|
-
onDataLoad,
|
|
30
|
-
onSelect: onSelectProp,
|
|
31
|
-
selected,
|
|
32
|
-
onChangeSelected,
|
|
33
|
-
}: UseTreeMultiSelectionParams<TTreeNode>) {
|
|
34
|
-
const [selectedIds = [], setSelectedIds] = useValueControl<string[]>({
|
|
35
|
-
value: selected,
|
|
36
|
-
defaultValue: [],
|
|
37
|
-
onChange: onChangeSelected,
|
|
38
|
-
});
|
|
39
|
-
|
|
40
|
-
const onSelect = useCallback(
|
|
41
|
-
async (selectedKeys: string[], node: TreeNodeProps) => {
|
|
42
|
-
const isSelected = selectedKeys.includes(node.id);
|
|
43
|
-
const clonedNode = structuredClone(node);
|
|
44
|
-
|
|
45
|
-
if (node.nested && !node.nested.length) {
|
|
46
|
-
const { preloadedChildren } = await onDataLoad(node as TTreeNode);
|
|
47
|
-
clonedNode.nested = preloadedChildren;
|
|
48
|
-
}
|
|
49
|
-
|
|
50
|
-
const { added, removed } = onSelectProp({ selectedKeys, node: clonedNode, isSelected });
|
|
51
|
-
const updatedSelectedIds = getNewSelectedIds(selectedIds, added, removed);
|
|
52
|
-
setSelectedIds(updatedSelectedIds);
|
|
53
|
-
},
|
|
54
|
-
[onDataLoad, onSelectProp, selectedIds, setSelectedIds],
|
|
55
|
-
);
|
|
56
|
-
|
|
57
|
-
return {
|
|
58
|
-
selected: selectedIds,
|
|
59
|
-
onSelect,
|
|
60
|
-
};
|
|
61
|
-
}
|