@fluentui/react-tree 9.16.8 → 9.16.10

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.
Files changed (181) hide show
  1. package/CHANGELOG.md +30 -2
  2. package/lib/components/FlatTree/FlatTree.js.map +1 -1
  3. package/lib/components/FlatTree/FlatTree.types.js.map +1 -1
  4. package/lib/components/FlatTree/index.js.map +1 -1
  5. package/lib/components/FlatTree/renderFlatTree.js.map +1 -1
  6. package/lib/components/FlatTree/useFlatControllableCheckedItems.js.map +1 -1
  7. package/lib/components/FlatTree/useFlatTree.js.map +1 -1
  8. package/lib/components/FlatTree/useFlatTreeContextValues.js.map +1 -1
  9. package/lib/components/FlatTree/useFlatTreeStyles.styles.raw.js.map +1 -1
  10. package/lib/components/FlatTree/useHeadlessFlatTree.js.map +1 -1
  11. package/lib/components/FlatTreeItem/FlatTreeItem.js.map +1 -1
  12. package/lib/components/FlatTreeItem/FlatTreeItem.types.js.map +1 -1
  13. package/lib/components/FlatTreeItem/index.js.map +1 -1
  14. package/lib/components/Tree/Tree.js.map +1 -1
  15. package/lib/components/Tree/Tree.types.js.map +1 -1
  16. package/lib/components/Tree/index.js.map +1 -1
  17. package/lib/components/Tree/renderTree.js +2 -2
  18. package/lib/components/Tree/renderTree.js.map +1 -1
  19. package/lib/components/Tree/useNestedControllableCheckedItems.js.map +1 -1
  20. package/lib/components/Tree/useTree.js.map +1 -1
  21. package/lib/components/Tree/useTreeContextValues.js.map +1 -1
  22. package/lib/components/Tree/useTreeStyles.styles.raw.js.map +1 -1
  23. package/lib/components/TreeItem/TreeItem.js.map +1 -1
  24. package/lib/components/TreeItem/TreeItem.types.js.map +1 -1
  25. package/lib/components/TreeItem/index.js.map +1 -1
  26. package/lib/components/TreeItem/renderTreeItem.js +2 -2
  27. package/lib/components/TreeItem/renderTreeItem.js.map +1 -1
  28. package/lib/components/TreeItem/useTreeItem.js +1 -1
  29. package/lib/components/TreeItem/useTreeItem.js.map +1 -1
  30. package/lib/components/TreeItem/useTreeItemContextValues.js.map +1 -1
  31. package/lib/components/TreeItem/useTreeItemStyles.styles.raw.js.map +1 -1
  32. package/lib/components/TreeItemChevron.js.map +1 -1
  33. package/lib/components/TreeItemLayout/TreeItemLayout.js.map +1 -1
  34. package/lib/components/TreeItemLayout/TreeItemLayout.types.js.map +1 -1
  35. package/lib/components/TreeItemLayout/index.js.map +1 -1
  36. package/lib/components/TreeItemLayout/renderTreeItemLayout.js +2 -2
  37. package/lib/components/TreeItemLayout/renderTreeItemLayout.js.map +1 -1
  38. package/lib/components/TreeItemLayout/useTreeItemLayout.js.map +1 -1
  39. package/lib/components/TreeItemLayout/useTreeItemLayoutStyles.styles.raw.js.map +1 -1
  40. package/lib/components/TreeItemPersonaLayout/TreeItemPersonaLayout.js.map +1 -1
  41. package/lib/components/TreeItemPersonaLayout/TreeItemPersonaLayout.types.js.map +1 -1
  42. package/lib/components/TreeItemPersonaLayout/index.js.map +1 -1
  43. package/lib/components/TreeItemPersonaLayout/renderTreeItemPersonaLayout.js +2 -2
  44. package/lib/components/TreeItemPersonaLayout/renderTreeItemPersonaLayout.js.map +1 -1
  45. package/lib/components/TreeItemPersonaLayout/useTreeItemPersonaLayout.js.map +1 -1
  46. package/lib/components/TreeItemPersonaLayout/useTreeItemPersonaLayoutContextValues.js.map +1 -1
  47. package/lib/components/TreeItemPersonaLayout/useTreeItemPersonaLayoutStyles.styles.raw.js.map +1 -1
  48. package/lib/components/TreeProvider.js.map +1 -1
  49. package/lib/contexts/index.js.map +1 -1
  50. package/lib/contexts/subtreeContext.js.map +1 -1
  51. package/lib/contexts/treeContext.js.map +1 -1
  52. package/lib/contexts/treeItemContext.js.map +1 -1
  53. package/lib/hooks/useControllableOpenItems.js.map +1 -1
  54. package/lib/hooks/useFlatTreeNavigation.js.map +1 -1
  55. package/lib/hooks/useHTMLElementWalkerRef.js.map +1 -1
  56. package/lib/hooks/useRootTree.js +1 -1
  57. package/lib/hooks/useRootTree.js.map +1 -1
  58. package/lib/hooks/useRovingTabIndexes.js.map +1 -1
  59. package/lib/hooks/useSubtree.js.map +1 -1
  60. package/lib/hooks/useTreeNavigation.js.map +1 -1
  61. package/lib/utils/ImmutableMap.js.map +1 -1
  62. package/lib/utils/ImmutableSet.js.map +1 -1
  63. package/lib/utils/assert.js.map +1 -1
  64. package/lib/utils/createCheckedItems.js.map +1 -1
  65. package/lib/utils/createHTMLElementWalker.js +2 -2
  66. package/lib/utils/createHTMLElementWalker.js.map +1 -1
  67. package/lib/utils/createHeadlessTree.js +4 -4
  68. package/lib/utils/createHeadlessTree.js.map +1 -1
  69. package/lib/utils/flattenTree.js.map +1 -1
  70. package/lib/utils/getTreeItemValueFromElement.js.map +1 -1
  71. package/lib/utils/nextTypeAheadElement.js.map +1 -1
  72. package/lib/utils/normalizeOpenItems.js.map +1 -1
  73. package/lib/utils/tokens.js.map +1 -1
  74. package/lib/utils/treeItemFilter.js.map +1 -1
  75. package/lib-commonjs/FlatTree.cjs +8 -8
  76. package/lib-commonjs/Tree.cjs +7 -7
  77. package/lib-commonjs/TreeItem.cjs +7 -7
  78. package/lib-commonjs/TreeItemLayout.cjs +6 -6
  79. package/lib-commonjs/TreeItemPersonaLayout.cjs +6 -6
  80. package/lib-commonjs/components/FlatTree/FlatTree.cjs.map +1 -1
  81. package/lib-commonjs/components/FlatTree/FlatTree.types.cjs.map +1 -1
  82. package/lib-commonjs/components/FlatTree/index.cjs +8 -8
  83. package/lib-commonjs/components/FlatTree/index.cjs.map +1 -1
  84. package/lib-commonjs/components/FlatTree/renderFlatTree.cjs.map +1 -1
  85. package/lib-commonjs/components/FlatTree/useFlatControllableCheckedItems.cjs +3 -3
  86. package/lib-commonjs/components/FlatTree/useFlatControllableCheckedItems.cjs.map +1 -1
  87. package/lib-commonjs/components/FlatTree/useFlatTree.cjs.map +1 -1
  88. package/lib-commonjs/components/FlatTree/useFlatTreeContextValues.cjs.map +1 -1
  89. package/lib-commonjs/components/FlatTree/useFlatTreeStyles.styles.cjs +3 -3
  90. package/lib-commonjs/components/FlatTree/useFlatTreeStyles.styles.cjs.map +1 -1
  91. package/lib-commonjs/components/FlatTree/useFlatTreeStyles.styles.raw.cjs +3 -3
  92. package/lib-commonjs/components/FlatTree/useFlatTreeStyles.styles.raw.cjs.map +1 -1
  93. package/lib-commonjs/components/FlatTree/useHeadlessFlatTree.cjs.map +1 -1
  94. package/lib-commonjs/components/FlatTreeItem/FlatTreeItem.cjs.map +1 -1
  95. package/lib-commonjs/components/FlatTreeItem/FlatTreeItem.types.cjs.map +1 -1
  96. package/lib-commonjs/components/FlatTreeItem/index.cjs.map +1 -1
  97. package/lib-commonjs/components/Tree/Tree.cjs.map +1 -1
  98. package/lib-commonjs/components/Tree/Tree.types.cjs.map +1 -1
  99. package/lib-commonjs/components/Tree/index.cjs +7 -7
  100. package/lib-commonjs/components/Tree/index.cjs.map +1 -1
  101. package/lib-commonjs/components/Tree/renderTree.cjs.map +1 -1
  102. package/lib-commonjs/components/Tree/useNestedControllableCheckedItems.cjs +3 -3
  103. package/lib-commonjs/components/Tree/useNestedControllableCheckedItems.cjs.map +1 -1
  104. package/lib-commonjs/components/Tree/useTree.cjs.map +1 -1
  105. package/lib-commonjs/components/Tree/useTreeContextValues.cjs.map +1 -1
  106. package/lib-commonjs/components/Tree/useTreeStyles.styles.cjs +3 -3
  107. package/lib-commonjs/components/Tree/useTreeStyles.styles.cjs.map +1 -1
  108. package/lib-commonjs/components/Tree/useTreeStyles.styles.raw.cjs +3 -3
  109. package/lib-commonjs/components/Tree/useTreeStyles.styles.raw.cjs.map +1 -1
  110. package/lib-commonjs/components/TreeItem/TreeItem.cjs.map +1 -1
  111. package/lib-commonjs/components/TreeItem/TreeItem.types.cjs.map +1 -1
  112. package/lib-commonjs/components/TreeItem/index.cjs +7 -7
  113. package/lib-commonjs/components/TreeItem/index.cjs.map +1 -1
  114. package/lib-commonjs/components/TreeItem/renderTreeItem.cjs.map +1 -1
  115. package/lib-commonjs/components/TreeItem/useTreeItem.cjs +1 -1
  116. package/lib-commonjs/components/TreeItem/useTreeItem.cjs.map +1 -1
  117. package/lib-commonjs/components/TreeItem/useTreeItemContextValues.cjs.map +1 -1
  118. package/lib-commonjs/components/TreeItem/useTreeItemStyles.styles.cjs +3 -3
  119. package/lib-commonjs/components/TreeItem/useTreeItemStyles.styles.cjs.map +1 -1
  120. package/lib-commonjs/components/TreeItem/useTreeItemStyles.styles.raw.cjs +3 -3
  121. package/lib-commonjs/components/TreeItem/useTreeItemStyles.styles.raw.cjs.map +1 -1
  122. package/lib-commonjs/components/TreeItemChevron.cjs.map +1 -1
  123. package/lib-commonjs/components/TreeItemLayout/TreeItemLayout.cjs.map +1 -1
  124. package/lib-commonjs/components/TreeItemLayout/TreeItemLayout.types.cjs.map +1 -1
  125. package/lib-commonjs/components/TreeItemLayout/index.cjs +6 -6
  126. package/lib-commonjs/components/TreeItemLayout/index.cjs.map +1 -1
  127. package/lib-commonjs/components/TreeItemLayout/renderTreeItemLayout.cjs.map +1 -1
  128. package/lib-commonjs/components/TreeItemLayout/useTreeItemLayout.cjs.map +1 -1
  129. package/lib-commonjs/components/TreeItemLayout/useTreeItemLayoutStyles.styles.cjs +3 -3
  130. package/lib-commonjs/components/TreeItemLayout/useTreeItemLayoutStyles.styles.cjs.map +1 -1
  131. package/lib-commonjs/components/TreeItemLayout/useTreeItemLayoutStyles.styles.raw.cjs +3 -3
  132. package/lib-commonjs/components/TreeItemLayout/useTreeItemLayoutStyles.styles.raw.cjs.map +1 -1
  133. package/lib-commonjs/components/TreeItemPersonaLayout/TreeItemPersonaLayout.cjs.map +1 -1
  134. package/lib-commonjs/components/TreeItemPersonaLayout/TreeItemPersonaLayout.types.cjs.map +1 -1
  135. package/lib-commonjs/components/TreeItemPersonaLayout/index.cjs +6 -6
  136. package/lib-commonjs/components/TreeItemPersonaLayout/index.cjs.map +1 -1
  137. package/lib-commonjs/components/TreeItemPersonaLayout/renderTreeItemPersonaLayout.cjs.map +1 -1
  138. package/lib-commonjs/components/TreeItemPersonaLayout/useTreeItemPersonaLayout.cjs.map +1 -1
  139. package/lib-commonjs/components/TreeItemPersonaLayout/useTreeItemPersonaLayoutContextValues.cjs.map +1 -1
  140. package/lib-commonjs/components/TreeItemPersonaLayout/useTreeItemPersonaLayoutStyles.styles.cjs +3 -3
  141. package/lib-commonjs/components/TreeItemPersonaLayout/useTreeItemPersonaLayoutStyles.styles.cjs.map +1 -1
  142. package/lib-commonjs/components/TreeItemPersonaLayout/useTreeItemPersonaLayoutStyles.styles.raw.cjs +3 -3
  143. package/lib-commonjs/components/TreeItemPersonaLayout/useTreeItemPersonaLayoutStyles.styles.raw.cjs.map +1 -1
  144. package/lib-commonjs/components/TreeProvider.cjs +3 -3
  145. package/lib-commonjs/components/TreeProvider.cjs.map +1 -1
  146. package/lib-commonjs/contexts/index.cjs +7 -7
  147. package/lib-commonjs/contexts/index.cjs.map +1 -1
  148. package/lib-commonjs/contexts/subtreeContext.cjs +3 -3
  149. package/lib-commonjs/contexts/subtreeContext.cjs.map +1 -1
  150. package/lib-commonjs/contexts/treeContext.cjs +3 -3
  151. package/lib-commonjs/contexts/treeContext.cjs.map +1 -1
  152. package/lib-commonjs/contexts/treeItemContext.cjs +3 -3
  153. package/lib-commonjs/contexts/treeItemContext.cjs.map +1 -1
  154. package/lib-commonjs/hooks/useControllableOpenItems.cjs +3 -3
  155. package/lib-commonjs/hooks/useControllableOpenItems.cjs.map +1 -1
  156. package/lib-commonjs/hooks/useFlatTreeNavigation.cjs.map +1 -1
  157. package/lib-commonjs/hooks/useHTMLElementWalkerRef.cjs.map +1 -1
  158. package/lib-commonjs/hooks/useRootTree.cjs +1 -1
  159. package/lib-commonjs/hooks/useRootTree.cjs.map +1 -1
  160. package/lib-commonjs/hooks/useRovingTabIndexes.cjs.map +1 -1
  161. package/lib-commonjs/hooks/useSubtree.cjs.map +1 -1
  162. package/lib-commonjs/hooks/useTreeNavigation.cjs.map +1 -1
  163. package/lib-commonjs/index.cjs +40 -40
  164. package/lib-commonjs/index.cjs.map +1 -1
  165. package/lib-commonjs/utils/ImmutableMap.cjs.map +1 -1
  166. package/lib-commonjs/utils/ImmutableSet.cjs.map +1 -1
  167. package/lib-commonjs/utils/assert.cjs.map +1 -1
  168. package/lib-commonjs/utils/createCheckedItems.cjs.map +1 -1
  169. package/lib-commonjs/utils/createHTMLElementWalker.cjs +2 -2
  170. package/lib-commonjs/utils/createHTMLElementWalker.cjs.map +1 -1
  171. package/lib-commonjs/utils/createHeadlessTree.cjs +7 -7
  172. package/lib-commonjs/utils/createHeadlessTree.cjs.map +1 -1
  173. package/lib-commonjs/utils/flattenTree.cjs.map +1 -1
  174. package/lib-commonjs/utils/getTreeItemValueFromElement.cjs +3 -3
  175. package/lib-commonjs/utils/getTreeItemValueFromElement.cjs.map +1 -1
  176. package/lib-commonjs/utils/nextTypeAheadElement.cjs.map +1 -1
  177. package/lib-commonjs/utils/normalizeOpenItems.cjs.map +1 -1
  178. package/lib-commonjs/utils/tokens.cjs +4 -4
  179. package/lib-commonjs/utils/tokens.cjs.map +1 -1
  180. package/lib-commonjs/utils/treeItemFilter.cjs.map +1 -1
  181. package/package.json +12 -12
@@ -5,125 +5,125 @@ Object.defineProperty(exports, "__esModule", {
5
5
  function _export(target, all) {
6
6
  for(var name in all)Object.defineProperty(target, name, {
7
7
  enumerable: true,
8
- get: all[name]
8
+ get: Object.getOwnPropertyDescriptor(all, name).get
9
9
  });
10
10
  }
11
11
  _export(exports, {
12
- FlatTree: function() {
12
+ get FlatTree () {
13
13
  return _FlatTree.FlatTree;
14
14
  },
15
- FlatTreeItem: function() {
15
+ get FlatTreeItem () {
16
16
  return _FlatTreeItem.FlatTreeItem;
17
17
  },
18
- Tree: function() {
18
+ get Tree () {
19
19
  return _Tree.Tree;
20
20
  },
21
- TreeItem: function() {
21
+ get TreeItem () {
22
22
  return _TreeItem.TreeItem;
23
23
  },
24
- TreeItemLayout: function() {
24
+ get TreeItemLayout () {
25
25
  return _TreeItemLayout.TreeItemLayout;
26
26
  },
27
- TreeItemPersonaLayout: function() {
27
+ get TreeItemPersonaLayout () {
28
28
  return _TreeItemPersonaLayout.TreeItemPersonaLayout;
29
29
  },
30
- TreeItemProvider: function() {
30
+ get TreeItemProvider () {
31
31
  return _index.TreeItemProvider;
32
32
  },
33
- TreeProvider: function() {
33
+ get TreeProvider () {
34
34
  return _TreeProvider.TreeProvider;
35
35
  },
36
- TreeRootReset: function() {
36
+ get TreeRootReset () {
37
37
  return _TreeProvider.TreeRootReset;
38
38
  },
39
- flatTreeClassNames: function() {
39
+ get flatTreeClassNames () {
40
40
  return _FlatTree.flatTreeClassNames;
41
41
  },
42
- flattenTree_unstable: function() {
42
+ get flattenTree_unstable () {
43
43
  return _flattenTree.flattenTree_unstable;
44
44
  },
45
- renderFlatTree_unstable: function() {
45
+ get renderFlatTree_unstable () {
46
46
  return _FlatTree.renderFlatTree_unstable;
47
47
  },
48
- renderTreeItemLayout_unstable: function() {
48
+ get renderTreeItemLayout_unstable () {
49
49
  return _TreeItemLayout.renderTreeItemLayout_unstable;
50
50
  },
51
- renderTreeItemPersonaLayout_unstable: function() {
51
+ get renderTreeItemPersonaLayout_unstable () {
52
52
  return _TreeItemPersonaLayout.renderTreeItemPersonaLayout_unstable;
53
53
  },
54
- renderTreeItem_unstable: function() {
54
+ get renderTreeItem_unstable () {
55
55
  return _TreeItem.renderTreeItem_unstable;
56
56
  },
57
- renderTree_unstable: function() {
57
+ get renderTree_unstable () {
58
58
  return _Tree.renderTree_unstable;
59
59
  },
60
- treeClassNames: function() {
60
+ get treeClassNames () {
61
61
  return _Tree.treeClassNames;
62
62
  },
63
- treeItemClassNames: function() {
63
+ get treeItemClassNames () {
64
64
  return _TreeItem.treeItemClassNames;
65
65
  },
66
- treeItemLayoutClassNames: function() {
66
+ get treeItemLayoutClassNames () {
67
67
  return _TreeItemLayout.treeItemLayoutClassNames;
68
68
  },
69
- treeItemLevelToken: function() {
69
+ get treeItemLevelToken () {
70
70
  return _tokens.treeItemLevelToken;
71
71
  },
72
- treeItemPersonaLayoutClassNames: function() {
72
+ get treeItemPersonaLayoutClassNames () {
73
73
  return _TreeItemPersonaLayout.treeItemPersonaLayoutClassNames;
74
74
  },
75
- useFlatTreeContextValues_unstable: function() {
75
+ get useFlatTreeContextValues_unstable () {
76
76
  return _FlatTree.useFlatTreeContextValues_unstable;
77
77
  },
78
- useFlatTreeStyles_unstable: function() {
78
+ get useFlatTreeStyles_unstable () {
79
79
  return _FlatTree.useFlatTreeStyles_unstable;
80
80
  },
81
- useFlatTree_unstable: function() {
81
+ get useFlatTree_unstable () {
82
82
  return _FlatTree.useFlatTree_unstable;
83
83
  },
84
- useHeadlessFlatTree_unstable: function() {
84
+ get useHeadlessFlatTree_unstable () {
85
85
  return _useHeadlessFlatTree.useHeadlessFlatTree_unstable;
86
86
  },
87
- useSubtreeContext_unstable: function() {
87
+ get useSubtreeContext_unstable () {
88
88
  return _index.useSubtreeContext_unstable;
89
89
  },
90
- useTreeContextValues_unstable: function() {
90
+ get useTreeContextValues_unstable () {
91
91
  return _Tree.useTreeContextValues_unstable;
92
92
  },
93
- useTreeContext_unstable: function() {
93
+ get useTreeContext_unstable () {
94
94
  return _index.useTreeContext_unstable;
95
95
  },
96
- useTreeItemContextValues_unstable: function() {
96
+ get useTreeItemContextValues_unstable () {
97
97
  return _TreeItem.useTreeItemContextValues_unstable;
98
98
  },
99
- useTreeItemContext_unstable: function() {
99
+ get useTreeItemContext_unstable () {
100
100
  return _index.useTreeItemContext_unstable;
101
101
  },
102
- useTreeItemLayoutStyles_unstable: function() {
102
+ get useTreeItemLayoutStyles_unstable () {
103
103
  return _TreeItemLayout.useTreeItemLayoutStyles_unstable;
104
104
  },
105
- useTreeItemLayout_unstable: function() {
105
+ get useTreeItemLayout_unstable () {
106
106
  return _TreeItemLayout.useTreeItemLayout_unstable;
107
107
  },
108
- useTreeItemPersonaLayoutStyles_unstable: function() {
108
+ get useTreeItemPersonaLayoutStyles_unstable () {
109
109
  return _TreeItemPersonaLayout.useTreeItemPersonaLayoutStyles_unstable;
110
110
  },
111
- useTreeItemPersonaLayout_unstable: function() {
111
+ get useTreeItemPersonaLayout_unstable () {
112
112
  return _TreeItemPersonaLayout.useTreeItemPersonaLayout_unstable;
113
113
  },
114
- useTreeItemStyles_unstable: function() {
114
+ get useTreeItemStyles_unstable () {
115
115
  return _TreeItem.useTreeItemStyles_unstable;
116
116
  },
117
- useTreeItem_unstable: function() {
117
+ get useTreeItem_unstable () {
118
118
  return _TreeItem.useTreeItem_unstable;
119
119
  },
120
- useTreeNavigation: function() {
120
+ get useTreeNavigation () {
121
121
  return _useTreeNavigation.useTreeNavigation;
122
122
  },
123
- useTreeStyles_unstable: function() {
123
+ get useTreeStyles_unstable () {
124
124
  return _Tree.useTreeStyles_unstable;
125
125
  },
126
- useTree_unstable: function() {
126
+ get useTree_unstable () {
127
127
  return _Tree.useTree_unstable;
128
128
  }
129
129
  });
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/index.ts"],"sourcesContent":["export {\n Tree,\n treeClassNames,\n useTree_unstable,\n useTreeStyles_unstable,\n useTreeContextValues_unstable,\n renderTree_unstable,\n} from './Tree';\n\nexport type {\n TreeSlots,\n TreeProps,\n TreeState,\n TreeContextValues,\n TreeOpenChangeData,\n TreeSelectionValue,\n TreeOpenChangeEvent,\n TreeCheckedChangeData,\n TreeCheckedChangeEvent,\n TreeNavigationData_unstable,\n TreeNavigationEvent_unstable,\n TreeNavigationMode,\n TreeNavigationDataParam,\n} from './Tree';\n\nexport {\n FlatTree,\n flatTreeClassNames,\n useFlatTree_unstable,\n useFlatTreeStyles_unstable,\n useFlatTreeContextValues_unstable,\n renderFlatTree_unstable,\n} from './FlatTree';\n\nexport type { FlatTreeSlots, FlatTreeProps, FlatTreeState } from './FlatTree';\n\nexport { TreeProvider, TreeRootReset } from './components/TreeProvider';\n\nexport {\n useTreeContext_unstable,\n useTreeItemContext_unstable,\n useSubtreeContext_unstable,\n TreeItemProvider,\n} from './contexts';\nexport type { TreeContextValue, SubtreeContextValue, TreeItemContextValue } from './contexts';\n\nexport { treeItemLevelToken } from './utils/tokens';\n\nexport { useHeadlessFlatTree_unstable } from './components/FlatTree/useHeadlessFlatTree';\nexport type {\n HeadlessFlatTree,\n HeadlessFlatTreeItem,\n HeadlessFlatTreeItemProps,\n HeadlessFlatTreeOptions,\n} from './components/FlatTree/useHeadlessFlatTree';\n\nexport {\n TreeItem,\n treeItemClassNames,\n renderTreeItem_unstable,\n useTreeItemStyles_unstable,\n useTreeItemContextValues_unstable,\n useTreeItem_unstable,\n} from './TreeItem';\nexport type {\n TreeItemProps,\n TreeItemState,\n TreeItemSlots,\n TreeItemType,\n TreeItemValue,\n TreeItemOpenChangeData,\n TreeItemOpenChangeEvent,\n TreeItemCSSProperties,\n} from './TreeItem';\n\nexport { FlatTreeItem } from './FlatTreeItem';\nexport type { FlatTreeItemProps } from './FlatTreeItem';\n\nexport {\n TreeItemLayout,\n treeItemLayoutClassNames,\n renderTreeItemLayout_unstable,\n useTreeItemLayoutStyles_unstable,\n useTreeItemLayout_unstable,\n} from './TreeItemLayout';\nexport type { TreeItemLayoutProps, TreeItemLayoutSlots, TreeItemLayoutState } from './TreeItemLayout';\n\nexport {\n TreeItemPersonaLayout,\n treeItemPersonaLayoutClassNames,\n renderTreeItemPersonaLayout_unstable,\n useTreeItemPersonaLayoutStyles_unstable,\n useTreeItemPersonaLayout_unstable,\n} from './TreeItemPersonaLayout';\nexport type {\n TreeItemPersonaLayoutProps,\n TreeItemPersonaLayoutSlots,\n TreeItemPersonaLayoutState,\n} from './TreeItemPersonaLayout';\n\nexport { flattenTree_unstable } from './utils/flattenTree';\nexport type { FlattenTreeItem } from './utils/flattenTree';\n\nexport { useTreeNavigation } from './hooks/useTreeNavigation';\n"],"names":["Tree","treeClassNames","useTree_unstable","useTreeStyles_unstable","useTreeContextValues_unstable","renderTree_unstable","FlatTree","flatTreeClassNames","useFlatTree_unstable","useFlatTreeStyles_unstable","useFlatTreeContextValues_unstable","renderFlatTree_unstable","TreeProvider","TreeRootReset","useTreeContext_unstable","useTreeItemContext_unstable","useSubtreeContext_unstable","TreeItemProvider","treeItemLevelToken","useHeadlessFlatTree_unstable","TreeItem","treeItemClassNames","renderTreeItem_unstable","useTreeItemStyles_unstable","useTreeItemContextValues_unstable","useTreeItem_unstable","FlatTreeItem","TreeItemLayout","treeItemLayoutClassNames","renderTreeItemLayout_unstable","useTreeItemLayoutStyles_unstable","useTreeItemLayout_unstable","TreeItemPersonaLayout","treeItemPersonaLayoutClassNames","renderTreeItemPersonaLayout_unstable","useTreeItemPersonaLayoutStyles_unstable","useTreeItemPersonaLayout_unstable","flattenTree_unstable","useTreeNavigation"],"mappings":";;;;;;;;;;;IA0BEM;iCAAQ;;gBAiDW;eAAZoB;;;eA1EP1B,UAAI;;YAwDI;eAARoB;;kBAsBc;eAAdO;;;eASAK,4CAAqB;;oBA9CL;eAAhBf;;;eANOL,0BAAY;;;eAAEC,2BAAa;;sBAThB;eAAlBN;;;eAyEO8B,iCAAoB;;IArE3B1B;gDAAuB;;IAkDvBkB;4DAA6B;;;eAS7BK,2DAAoC;;IA/BpCZ;gDAAuB;;;eArDvBjB,yBAAmB;;;eAJnBJ,oBAAc;;;eAwDdoB,4BAAkB;;;eAsBlBO,wCAAwB;;;eAlCjBV,0BAAkB;;;eA2CzBe,sDAA+B;;;eA3D/BvB,2CAAiC;;;eADjCD,oCAA0B;;;eAD1BD,8BAAoB;;;eAoBbW,iDAA4B;;;eAPnCH,iCAA0B;;;eApC1BZ,mCAA6B;;;eAkC7BU,8BAAuB;;;eAsBvBU,2CAAiC;;IArBjCT;iDAA2B;;;eA0C3Be,gDAAgC;;IAChCC,0BAA0B;;;;eAQ1BI,8DAAuC;;qCACN;eAAjCC;;;eAhCAb,oCAA0B;;;eAE1BE,8BAAoB;;;eAyCba,oCAAiB;;;eAnGxBnC,4BAAsB;;;eADtBD,sBAAgB;;;sBAIX,YAAS;0BAyBT,gBAAa;8BAIwB,+BAA4B;uBAOjE,sBAAa;wBAGe,oBAAiB;qCAEP,+CAA4C;0BAelF,gBAAa;8BAYS,oBAAiB;gCASvC,sBAAmB;uCASnB,6BAA0B;6BAOI,yBAAsB;mCAGzB,+BAA4B"}
1
+ {"version":3,"sources":["../src/index.ts"],"sourcesContent":["export {\n Tree,\n treeClassNames,\n useTree_unstable,\n useTreeStyles_unstable,\n useTreeContextValues_unstable,\n renderTree_unstable,\n} from './Tree';\n\nexport type {\n TreeSlots,\n TreeProps,\n TreeState,\n TreeContextValues,\n TreeOpenChangeData,\n TreeSelectionValue,\n TreeOpenChangeEvent,\n TreeCheckedChangeData,\n TreeCheckedChangeEvent,\n TreeNavigationData_unstable,\n TreeNavigationEvent_unstable,\n TreeNavigationMode,\n TreeNavigationDataParam,\n} from './Tree';\n\nexport {\n FlatTree,\n flatTreeClassNames,\n useFlatTree_unstable,\n useFlatTreeStyles_unstable,\n useFlatTreeContextValues_unstable,\n renderFlatTree_unstable,\n} from './FlatTree';\n\nexport type { FlatTreeSlots, FlatTreeProps, FlatTreeState } from './FlatTree';\n\nexport { TreeProvider, TreeRootReset } from './components/TreeProvider';\n\nexport {\n useTreeContext_unstable,\n useTreeItemContext_unstable,\n useSubtreeContext_unstable,\n TreeItemProvider,\n} from './contexts';\nexport type { TreeContextValue, SubtreeContextValue, TreeItemContextValue } from './contexts';\n\nexport { treeItemLevelToken } from './utils/tokens';\n\nexport { useHeadlessFlatTree_unstable } from './components/FlatTree/useHeadlessFlatTree';\nexport type {\n HeadlessFlatTree,\n HeadlessFlatTreeItem,\n HeadlessFlatTreeItemProps,\n HeadlessFlatTreeOptions,\n} from './components/FlatTree/useHeadlessFlatTree';\n\nexport {\n TreeItem,\n treeItemClassNames,\n renderTreeItem_unstable,\n useTreeItemStyles_unstable,\n useTreeItemContextValues_unstable,\n useTreeItem_unstable,\n} from './TreeItem';\nexport type {\n TreeItemProps,\n TreeItemState,\n TreeItemSlots,\n TreeItemType,\n TreeItemValue,\n TreeItemOpenChangeData,\n TreeItemOpenChangeEvent,\n TreeItemCSSProperties,\n} from './TreeItem';\n\nexport { FlatTreeItem } from './FlatTreeItem';\nexport type { FlatTreeItemProps } from './FlatTreeItem';\n\nexport {\n TreeItemLayout,\n treeItemLayoutClassNames,\n renderTreeItemLayout_unstable,\n useTreeItemLayoutStyles_unstable,\n useTreeItemLayout_unstable,\n} from './TreeItemLayout';\nexport type { TreeItemLayoutProps, TreeItemLayoutSlots, TreeItemLayoutState } from './TreeItemLayout';\n\nexport {\n TreeItemPersonaLayout,\n treeItemPersonaLayoutClassNames,\n renderTreeItemPersonaLayout_unstable,\n useTreeItemPersonaLayoutStyles_unstable,\n useTreeItemPersonaLayout_unstable,\n} from './TreeItemPersonaLayout';\nexport type {\n TreeItemPersonaLayoutProps,\n TreeItemPersonaLayoutSlots,\n TreeItemPersonaLayoutState,\n} from './TreeItemPersonaLayout';\n\nexport { flattenTree_unstable } from './utils/flattenTree';\nexport type { FlattenTreeItem } from './utils/flattenTree';\n\nexport { useTreeNavigation } from './hooks/useTreeNavigation';\n"],"names":["Tree","treeClassNames","useTree_unstable","useTreeStyles_unstable","useTreeContextValues_unstable","renderTree_unstable","FlatTree","flatTreeClassNames","useFlatTree_unstable","useFlatTreeStyles_unstable","useFlatTreeContextValues_unstable","renderFlatTree_unstable","TreeProvider","TreeRootReset","useTreeContext_unstable","useTreeItemContext_unstable","useSubtreeContext_unstable","TreeItemProvider","treeItemLevelToken","useHeadlessFlatTree_unstable","TreeItem","treeItemClassNames","renderTreeItem_unstable","useTreeItemStyles_unstable","useTreeItemContextValues_unstable","useTreeItem_unstable","FlatTreeItem","TreeItemLayout","treeItemLayoutClassNames","renderTreeItemLayout_unstable","useTreeItemLayoutStyles_unstable","useTreeItemLayout_unstable","TreeItemPersonaLayout","treeItemPersonaLayoutClassNames","renderTreeItemPersonaLayout_unstable","useTreeItemPersonaLayoutStyles_unstable","useTreeItemPersonaLayout_unstable","flattenTree_unstable","useTreeNavigation"],"mappings":";;;;;;;;;;;QA0BEM;iCAAQ;;;eAiDDoB,0BAAY;;;eA1EnB1B,UAAI;;;eAwDJoB,kBAAQ;;;eAsBRO,8BAAc;;;eASdK,4CAAqB;;;eA9CrBf,uBAAgB;;;eANTL,0BAAY;;;eAAEC,2BAAa;;;eATlCN,4BAAkB;;;eAyEX8B,iCAAoB;;QArE3B1B;gDAAuB;;;eAkDvBkB,6CAA6B;;;eAS7BK,2DAAoC;;;eA/BpCZ,iCAAuB;;;eArDvBjB,yBAAmB;;;eAJnBJ,oBAAc;;;eAwDdoB,4BAAkB;;;eAsBlBO,wCAAwB;;;eAlCjBV,0BAAkB;;;eA2CzBe,sDAA+B;;QA3D/BvB;0DAAiC;;;eADjCD,oCAA0B;;;eAD1BD,8BAAoB;;;eAoBbW,iDAA4B;;;eAPnCH,iCAA0B;;;eApC1BZ,mCAA6B;;;eAkC7BU,8BAAuB;;;eAsBvBU,2CAAiC;;;eArBjCT,kCAA2B;;;eA0C3Be,gDAAgC;;;eAChCC,0CAA0B;;;eAQ1BI,8DAAuC;;;eACvCC,wDAAiC;;;eAhCjCb,oCAA0B;;;eAE1BE,8BAAoB;;;eAyCba,oCAAiB;;;eAnGxBnC,4BAAsB;;;eADtBD,sBAAgB;;;sBAIX,YAAS;0BAyBT,gBAAa;8BAIwB,+BAA4B;uBAOjE,sBAAa;wBAGe,oBAAiB;qCAEP,+CAA4C;0BAelF,gBAAa;8BAYS,oBAAiB;gCASvC,sBAAmB;uCASnB,6BAA0B;6BAOI,yBAAsB;mCAGzB,+BAA4B"}
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/utils/ImmutableMap.ts"],"sourcesContent":["const internalMapSymbol = Symbol('#internalMap');\n\nexport class ImmutableMap<Key, Value> implements Iterable<[Key, Value]> {\n public static empty: ImmutableMap<never, never> = new ImmutableMap(new Map<never, never>());\n public readonly size: number;\n\n private [internalMapSymbol]: Map<Key, Value>;\n\n public static dangerouslyGetInternalMap<Key, Value>(immutableMap: ImmutableMap<Key, Value>): Map<Key, Value> {\n return immutableMap[internalMapSymbol];\n }\n\n public static copy<Key, Value>(immutableMap: ImmutableMap<Key, Value>): ImmutableMap<Key, Value> {\n return this.from(immutableMap[internalMapSymbol]);\n }\n\n /**\n * Creates a new {@link ImmutableMap} from an iterable.\n * If the iterable is undefined, {@link ImmutableMap.empty} will be returned.\n * If the iterable is already an {@link ImmutableMap}, it will be returned as is no copy will be made.\n */\n public static from<T extends [unknown, unknown]>(iterable?: Iterable<T>): ImmutableMap<T[0], T[1]>;\n /**\n * Creates a new {@link ImmutableMap} from an iterable with an auxiliary map function to modify the iterable.\n * If the iterable is undefined, {@link ImmutableMap.empty} will be returned.\n * If the iterable is already an {@link ImmutableMap}, it will be returned as is no copy will be made.\n * The map function will be called for each element in the iterable.\n */\n public static from<T, U extends [unknown, unknown]>(\n iterable: Iterable<T> | undefined,\n mapFn: (value: T) => U,\n ): ImmutableMap<U[0], U[1]>;\n public static from(\n iterable?: Iterable<unknown>,\n mapFn?: (value: unknown) => [unknown, unknown],\n ): ImmutableMap<unknown, unknown> {\n if (iterable === undefined) {\n return this.empty;\n }\n if (!mapFn) {\n if (iterable instanceof this) {\n return iterable;\n }\n // casting here is ok, as the function overload ensures that the iterable is\n // Iterable<[unknown, unknown]>\n // if mapFn is not provided\n const iterableAsTuple = iterable as Iterable<[unknown, unknown]>;\n return new this(new Map(iterableAsTuple));\n }\n const map = new Map<unknown, unknown>();\n for (const value of iterable) {\n map.set(...mapFn(value));\n }\n return new this(map);\n }\n\n public static [Symbol.hasInstance](instance: unknown): boolean {\n return Boolean(typeof instance === 'object' && instance && internalMapSymbol in instance);\n }\n\n /**\n * Do not use this constructor directly, use {@link ImmutableMap.from} instead.\n * {@link ImmutableMap.from} handles instance verification (which might be problematic on {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/instanceof#instanceof_and_multiple_realms | multiple realms}),\n * avoid unnecessary copies, supports iterables and ensures that the internal map is never exposed.\n *\n *⚠️⚠️ _By using this constructor directly, you might end up with a mutable map, as it is not guaranteed that the internal map is not exposed._ ⚠️⚠️\n */\n constructor(internalMap: Map<Key, Value>) {\n this[internalMapSymbol] = internalMap;\n this.size = this[internalMapSymbol].size;\n }\n\n public delete(key: Key): ImmutableMap<Key, Value> {\n if (!this.has(key)) {\n return this;\n }\n const copy = ImmutableMap.copy(this);\n copy[internalMapSymbol].delete(key);\n return copy;\n }\n public get(key: Key): Value | undefined {\n return this[internalMapSymbol].get(key);\n }\n public has(key: Key): boolean {\n return this[internalMapSymbol].has(key);\n }\n public set(key: Key, value: Value): ImmutableMap<Key, Value> {\n if (this.get(key) === value) {\n return this;\n }\n const copy = ImmutableMap.copy(this);\n copy[internalMapSymbol].set(key, value);\n return copy;\n }\n public [Symbol.iterator](): Iterator<[Key, Value]> {\n return this[internalMapSymbol].entries();\n }\n}\n"],"names":["internalMapSymbol","Symbol","ImmutableMap","dangerouslyGetInternalMap","immutableMap","copy","from","iterable","mapFn","undefined","empty","iterableAsTuple","Map","map","value","set","hasInstance","instance","Boolean","delete","key","has","get","iterator","entries","constructor","internalMap","size"],"mappings":";;;;+BAEaE;;;;;;;AAFb,MAAMF,oBAAoBC,OAAO;IAMtBD,qBAAAA;AAJJ;IAML,OAAcG,0BAAsCC,YAAsC,EAAmB;QAC3G,OAAOA,YAAY,CAACJ,kBAAkB;IACxC;IAEA,OAAcK,KAAiBD,YAAsC,EAA4B;QAC/F,OAAO,IAAI,CAACE,IAAI,CAACF,YAAY,CAACJ,kBAAkB;IAClD;IAkBA,OAAcM,KACZC,QAA4B,EAC5BC,KAA8C,EACd;QAChC,IAAID,aAAaE,WAAW;YAC1B,OAAO,IAAI,CAACC,KAAK;QACnB;QACA,IAAI,CAACF,OAAO;YACV,IAAID,oBAAoB,IAAI,EAAE;gBAC5B,OAAOA;YACT;YACA,4EAA4E;YAC5E,+BAA+B;YAC/B,2BAA2B;YAC3B,MAAMI,kBAAkBJ;YACxB,OAAO,IAAI,IAAI,CAAC,IAAIK,IAAID;QAC1B;QACA,MAAME,MAAM,IAAID;QAChB,KAAK,MAAME,SAASP,SAAU;YAC5BM,IAAIE,GAAG,IAAIP,MAAMM;QACnB;QACA,OAAO,IAAI,IAAI,CAACD;IAClB;IAEA,OAAc,CAACZ,OAAOe,WAAW,CAAC,CAACC,QAAiB,EAAW;QAC7D,OAAOC,QAAQ,OAAOD,aAAa,YAAYA,YAAYjB,qBAAqBiB;IAClF;IAcOE,OAAOC,GAAQ,EAA4B;QAChD,IAAI,CAAC,IAAI,CAACC,GAAG,CAACD,MAAM;YAClB,OAAO,IAAI;QACb;QACA,MAAMf,OAAOH,aAAaG,IAAI,CAAC,IAAI;QACnCA,IAAI,CAACL,kBAAkB,CAACmB,MAAM,CAACC;QAC/B,OAAOf;IACT;IACOiB,IAAIF,GAAQ,EAAqB;QACtC,OAAO,IAAI,CAACpB,kBAAkB,CAACsB,GAAG,CAACF;IACrC;IACOC,IAAID,GAAQ,EAAW;QAC5B,OAAO,IAAI,CAACpB,kBAAkB,CAACqB,GAAG,CAACD;IACrC;IACOL,IAAIK,GAAQ,EAAEN,KAAY,EAA4B;QAC3D,IAAI,IAAI,CAACQ,GAAG,CAACF,SAASN,OAAO;YAC3B,OAAO,IAAI;QACb;QACA,MAAMT,OAAOH,aAAaG,IAAI,CAAC,IAAI;QACnCA,IAAI,CAACL,kBAAkB,CAACe,GAAG,CAACK,KAAKN;QACjC,OAAOT;IACT;IACO,CAACJ,OAAOsB,QAAQ,CAAC,GAA2B;QACjD,OAAO,IAAI,CAACvB,kBAAkB,CAACwB,OAAO;IACxC;IApCA;;;;;;GAMC,GACDC,YAAYC,WAA4B,CAAE;YA/D1C,kBAAA,EAAA,IAAA,EAAgBC,QAAhB,KAAA;YAEA,kBAAA,EAAA,IAAA,EAAS3B,oBAAT,KAAA;QA8DE,IAAI,CAACA,kBAAkB,GAAG0B;QAC1B,IAAI,CAACC,IAAI,GAAG,IAAI,CAAC3B,kBAAkB,CAAC2B,IAAI;IAC1C;AA2BF;IA9FE,kBAAA,EADWzB,cACGQ,SAAoC,IAAIR,aAAa,IAAIU"}
1
+ {"version":3,"sources":["../../src/utils/ImmutableMap.ts"],"sourcesContent":["const internalMapSymbol = Symbol('#internalMap');\n\nexport class ImmutableMap<Key, Value> implements Iterable<[Key, Value]> {\n public static empty: ImmutableMap<never, never> = new ImmutableMap(new Map<never, never>());\n public readonly size: number;\n\n private [internalMapSymbol]: Map<Key, Value>;\n\n public static dangerouslyGetInternalMap<Key, Value>(immutableMap: ImmutableMap<Key, Value>): Map<Key, Value> {\n return immutableMap[internalMapSymbol];\n }\n\n public static copy<Key, Value>(immutableMap: ImmutableMap<Key, Value>): ImmutableMap<Key, Value> {\n return this.from(immutableMap[internalMapSymbol]);\n }\n\n /**\n * Creates a new {@link ImmutableMap} from an iterable.\n * If the iterable is undefined, {@link ImmutableMap.empty} will be returned.\n * If the iterable is already an {@link ImmutableMap}, it will be returned as is no copy will be made.\n */\n public static from<T extends [unknown, unknown]>(iterable?: Iterable<T>): ImmutableMap<T[0], T[1]>;\n /**\n * Creates a new {@link ImmutableMap} from an iterable with an auxiliary map function to modify the iterable.\n * If the iterable is undefined, {@link ImmutableMap.empty} will be returned.\n * If the iterable is already an {@link ImmutableMap}, it will be returned as is no copy will be made.\n * The map function will be called for each element in the iterable.\n */\n public static from<T, U extends [unknown, unknown]>(\n iterable: Iterable<T> | undefined,\n mapFn: (value: T) => U,\n ): ImmutableMap<U[0], U[1]>;\n public static from(\n iterable?: Iterable<unknown>,\n mapFn?: (value: unknown) => [unknown, unknown],\n ): ImmutableMap<unknown, unknown> {\n if (iterable === undefined) {\n return this.empty;\n }\n if (!mapFn) {\n if (iterable instanceof this) {\n return iterable;\n }\n // casting here is ok, as the function overload ensures that the iterable is\n // Iterable<[unknown, unknown]>\n // if mapFn is not provided\n const iterableAsTuple = iterable as Iterable<[unknown, unknown]>;\n return new this(new Map(iterableAsTuple));\n }\n const map = new Map<unknown, unknown>();\n for (const value of iterable) {\n map.set(...mapFn(value));\n }\n return new this(map);\n }\n\n public static [Symbol.hasInstance](instance: unknown): boolean {\n return Boolean(typeof instance === 'object' && instance && internalMapSymbol in instance);\n }\n\n /**\n * Do not use this constructor directly, use {@link ImmutableMap.from} instead.\n * {@link ImmutableMap.from} handles instance verification (which might be problematic on {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/instanceof#instanceof_and_multiple_realms | multiple realms}),\n * avoid unnecessary copies, supports iterables and ensures that the internal map is never exposed.\n *\n *⚠️⚠️ _By using this constructor directly, you might end up with a mutable map, as it is not guaranteed that the internal map is not exposed._ ⚠️⚠️\n */\n constructor(internalMap: Map<Key, Value>) {\n this[internalMapSymbol] = internalMap;\n this.size = this[internalMapSymbol].size;\n }\n\n public delete(key: Key): ImmutableMap<Key, Value> {\n if (!this.has(key)) {\n return this;\n }\n const copy = ImmutableMap.copy(this);\n copy[internalMapSymbol].delete(key);\n return copy;\n }\n public get(key: Key): Value | undefined {\n return this[internalMapSymbol].get(key);\n }\n public has(key: Key): boolean {\n return this[internalMapSymbol].has(key);\n }\n public set(key: Key, value: Value): ImmutableMap<Key, Value> {\n if (this.get(key) === value) {\n return this;\n }\n const copy = ImmutableMap.copy(this);\n copy[internalMapSymbol].set(key, value);\n return copy;\n }\n public [Symbol.iterator](): Iterator<[Key, Value]> {\n return this[internalMapSymbol].entries();\n }\n}\n"],"names":["internalMapSymbol","Symbol","ImmutableMap","dangerouslyGetInternalMap","immutableMap","copy","from","iterable","mapFn","undefined","empty","iterableAsTuple","Map","map","value","set","hasInstance","instance","Boolean","delete","key","has","get","iterator","entries","internalMap","size"],"mappings":";;;;+BAEaE;;;;;;;AAFb,MAAMF,oBAAoBC,OAAO;IAMtBD,qBAAAA;AAJJ;IAML,OAAcG,0BAAsCC,YAAsC,EAAmB;QAC3G,OAAOA,YAAY,CAACJ,kBAAkB;IACxC;IAEA,OAAcK,KAAiBD,YAAsC,EAA4B;QAC/F,OAAO,IAAI,CAACE,IAAI,CAACF,YAAY,CAACJ,kBAAkB;IAClD;IAkBA,OAAcM,KACZC,QAA4B,EAC5BC,KAA8C,EACd;QAChC,IAAID,aAAaE,WAAW;YAC1B,OAAO,IAAI,CAACC,KAAK;QACnB;QACA,IAAI,CAACF,OAAO;YACV,IAAID,oBAAoB,IAAI,EAAE;gBAC5B,OAAOA;YACT;YACA,4EAA4E;YAC5E,+BAA+B;YAC/B,2BAA2B;YAC3B,MAAMI,kBAAkBJ;YACxB,OAAO,IAAI,IAAI,CAAC,IAAIK,IAAID;QAC1B;QACA,MAAME,MAAM,IAAID;QAChB,KAAK,MAAME,SAASP,SAAU;YAC5BM,IAAIE,GAAG,IAAIP,MAAMM;QACnB;QACA,OAAO,IAAI,IAAI,CAACD;IAClB;IAEA,OAAc,CAACZ,OAAOe,WAAW,CAAC,CAACC,QAAiB,EAAW;QAC7D,OAAOC,QAAQ,OAAOD,aAAa,YAAYA,YAAYjB,qBAAqBiB;IAClF;IAcOE,OAAOC,GAAQ,EAA4B;QAChD,IAAI,CAAC,IAAI,CAACC,GAAG,CAACD,MAAM;YAClB,OAAO,IAAI;QACb;QACA,MAAMf,OAAOH,aAAaG,IAAI,CAAC,IAAI;QACnCA,IAAI,CAACL,kBAAkB,CAACmB,MAAM,CAACC;QAC/B,OAAOf;IACT;IACOiB,IAAIF,GAAQ,EAAqB;QACtC,OAAO,IAAI,CAACpB,kBAAkB,CAACsB,GAAG,CAACF;IACrC;IACOC,IAAID,GAAQ,EAAW;QAC5B,OAAO,IAAI,CAACpB,kBAAkB,CAACqB,GAAG,CAACD;IACrC;IACOL,IAAIK,GAAQ,EAAEN,KAAY,EAA4B;QAC3D,IAAI,IAAI,CAACQ,GAAG,CAACF,SAASN,OAAO;YAC3B,OAAO,IAAI;QACb;QACA,MAAMT,OAAOH,aAAaG,IAAI,CAAC,IAAI;QACnCA,IAAI,CAACL,kBAAkB,CAACe,GAAG,CAACK,KAAKN;QACjC,OAAOT;IACT;IACO,CAACJ,OAAOsB,QAAQ,CAAC,GAA2B;QACjD,OAAO,IAAI,CAACvB,kBAAkB,CAACwB,OAAO;IACxC;IApCA;;;;;;GAMC,GACD,YAAYC,WAA4B,CAAE;YA/D1C,kBAAA,EAAA,IAAA,EAAgBC,QAAhB,KAAA;YAEA,kBAAA,EAAA,IAAA,EAAS1B,oBAAT,KAAA;QA8DE,IAAI,CAACA,kBAAkB,GAAGyB;QAC1B,IAAI,CAACC,IAAI,GAAG,IAAI,CAAC1B,kBAAkB,CAAC0B,IAAI;IAC1C;AA2BF;IA9FE,kBAAA,EADWxB,cACGQ,SAAoC,IAAIR,aAAa,IAAIU"}
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/utils/ImmutableSet.ts"],"sourcesContent":["const internalSetSymbol = Symbol('#internalSet');\n\n/**\n * Small immutable wrapper around the native Set implementation.\n * Every operation that would modify the set returns a new copy instance.\n *\n * @public\n */\nexport class ImmutableSet<T> implements Iterable<T> {\n public static empty: ImmutableSet<never> = new ImmutableSet(new Set());\n public readonly size: number;\n\n private [internalSetSymbol]: Set<T>;\n\n public static dangerouslyGetInternalSet<Value>(set: ImmutableSet<Value>): Set<Value> {\n return set[internalSetSymbol];\n }\n\n public static copy<T>(immutableSet: ImmutableSet<T>): ImmutableSet<T> {\n return new ImmutableSet(new Set(immutableSet[internalSetSymbol]));\n }\n\n /**\n * Creates a new {@link ImmutableSet} from an iterable.\n * If the iterable is undefined, {@link ImmutableSet.empty} will be returned.\n * If the iterable is already an {@link ImmutableSet}, it will be returned as is no copy will be made.\n */\n public static from<Value>(iterable?: Iterable<Value>): ImmutableSet<Value> {\n if (iterable === undefined) {\n return this.empty;\n }\n if (iterable instanceof this) {\n return iterable;\n }\n return new this(new Set(iterable));\n }\n\n public static [Symbol.hasInstance](instance: unknown): boolean {\n return Boolean(typeof instance === 'object' && instance && internalSetSymbol in instance);\n }\n\n /**\n * Do not use this constructor directly, use {@link ImmutableSet.from} instead.\n * {@link ImmutableSet.from} handles instance verification (which might be problematic on {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/instanceof#instanceof_and_multiple_realms | multiple realms}),\n * avoid unnecessary copies, supports iterables and ensures that the internal set is never exposed.\n *\n *⚠️⚠️ _By using this constructor directly, you might end up with a mutable set, as it is not guaranteed that the internal set is not exposed._ ⚠️⚠️\n */\n constructor(internalSet: Set<T>) {\n this[internalSetSymbol] = internalSet;\n this.size = this[internalSetSymbol].size;\n }\n\n public add(value: T): ImmutableSet<T> {\n if (this.has(value)) {\n return this;\n }\n const copy = ImmutableSet.copy(this);\n copy[internalSetSymbol].add(value);\n return copy;\n }\n\n public delete(value: T): ImmutableSet<T> {\n if (!this.has(value)) {\n return this;\n }\n const copy = ImmutableSet.copy(this);\n copy[internalSetSymbol].delete(value);\n return copy;\n }\n\n public has(value: T): boolean {\n return this[internalSetSymbol].has(value);\n }\n\n public [Symbol.iterator](): Iterator<T> {\n return this[internalSetSymbol].values();\n }\n}\n"],"names":["internalSetSymbol","Symbol","ImmutableSet","dangerouslyGetInternalSet","set","copy","immutableSet","Set","from","iterable","undefined","empty","hasInstance","instance","Boolean","add","value","has","delete","iterator","values","constructor","internalSet","size"],"mappings":";;;;+BAQaE;;;;;;;AARb,MAAMF,oBAAoBC,OAAO;IAYtBD,qBAAAA;AAJJ;IAML,OAAcG,0BAAiCC,GAAwB,EAAc;QACnF,OAAOA,GAAG,CAACJ,kBAAkB;IAC/B;IAEA,OAAcK,KAAQC,YAA6B,EAAmB;QACpE,OAAO,IAAIJ,aAAa,IAAIK,IAAID,YAAY,CAACN,kBAAkB;IACjE;IAEA;;;;GAIC,GACD,OAAcQ,KAAYC,QAA0B,EAAuB;QACzE,IAAIA,aAAaC,WAAW;YAC1B,OAAO,IAAI,CAACC,KAAK;QACnB;QACA,IAAIF,oBAAoB,IAAI,EAAE;YAC5B,OAAOA;QACT;QACA,OAAO,IAAI,IAAI,CAAC,IAAIF,IAAIE;IAC1B;IAEA,OAAc,CAACR,OAAOW,WAAW,CAAC,CAACC,QAAiB,EAAW;QAC7D,OAAOC,QAAQ,OAAOD,aAAa,YAAYA,YAAYb,qBAAqBa;IAClF;IAcOE,IAAIC,KAAQ,EAAmB;QACpC,IAAI,IAAI,CAACC,GAAG,CAACD,QAAQ;YACnB,OAAO,IAAI;QACb;QACA,MAAMX,OAAOH,aAAaG,IAAI,CAAC,IAAI;QACnCA,IAAI,CAACL,kBAAkB,CAACe,GAAG,CAACC;QAC5B,OAAOX;IACT;IAEOa,OAAOF,KAAQ,EAAmB;QACvC,IAAI,CAAC,IAAI,CAACC,GAAG,CAACD,QAAQ;YACpB,OAAO,IAAI;QACb;QACA,MAAMX,OAAOH,aAAaG,IAAI,CAAC,IAAI;QACnCA,IAAI,CAACL,kBAAkB,CAACkB,MAAM,CAACF;QAC/B,OAAOX;IACT;IAEOY,IAAID,KAAQ,EAAW;QAC5B,OAAO,IAAI,CAAChB,kBAAkB,CAACiB,GAAG,CAACD;IACrC;IAEO,CAACf,OAAOkB,QAAQ,CAAC,GAAgB;QACtC,OAAO,IAAI,CAACnB,kBAAkB,CAACoB,MAAM;IACvC;IApCA;;;;;;GAMC,GACDC,YAAYC,WAAmB,CAAE;YAtCjC,kBAAA,EAAA,IAAA,EAAgBC,QAAhB,KAAA;YAEA,kBAAA,EAAA,IAAA,EAASvB,oBAAT,KAAA;QAqCE,IAAI,CAACA,kBAAkB,GAAGsB;QAC1B,IAAI,CAACC,IAAI,GAAG,IAAI,CAACvB,kBAAkB,CAACuB,IAAI;IAC1C;AA2BF;IArEE,kBAAA,EADWrB,cACGS,SAA6B,IAAIT,aAAa,IAAIK"}
1
+ {"version":3,"sources":["../../src/utils/ImmutableSet.ts"],"sourcesContent":["const internalSetSymbol = Symbol('#internalSet');\n\n/**\n * Small immutable wrapper around the native Set implementation.\n * Every operation that would modify the set returns a new copy instance.\n *\n * @public\n */\nexport class ImmutableSet<T> implements Iterable<T> {\n public static empty: ImmutableSet<never> = new ImmutableSet(new Set());\n public readonly size: number;\n\n private [internalSetSymbol]: Set<T>;\n\n public static dangerouslyGetInternalSet<Value>(set: ImmutableSet<Value>): Set<Value> {\n return set[internalSetSymbol];\n }\n\n public static copy<T>(immutableSet: ImmutableSet<T>): ImmutableSet<T> {\n return new ImmutableSet(new Set(immutableSet[internalSetSymbol]));\n }\n\n /**\n * Creates a new {@link ImmutableSet} from an iterable.\n * If the iterable is undefined, {@link ImmutableSet.empty} will be returned.\n * If the iterable is already an {@link ImmutableSet}, it will be returned as is no copy will be made.\n */\n public static from<Value>(iterable?: Iterable<Value>): ImmutableSet<Value> {\n if (iterable === undefined) {\n return this.empty;\n }\n if (iterable instanceof this) {\n return iterable;\n }\n return new this(new Set(iterable));\n }\n\n public static [Symbol.hasInstance](instance: unknown): boolean {\n return Boolean(typeof instance === 'object' && instance && internalSetSymbol in instance);\n }\n\n /**\n * Do not use this constructor directly, use {@link ImmutableSet.from} instead.\n * {@link ImmutableSet.from} handles instance verification (which might be problematic on {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/instanceof#instanceof_and_multiple_realms | multiple realms}),\n * avoid unnecessary copies, supports iterables and ensures that the internal set is never exposed.\n *\n *⚠️⚠️ _By using this constructor directly, you might end up with a mutable set, as it is not guaranteed that the internal set is not exposed._ ⚠️⚠️\n */\n constructor(internalSet: Set<T>) {\n this[internalSetSymbol] = internalSet;\n this.size = this[internalSetSymbol].size;\n }\n\n public add(value: T): ImmutableSet<T> {\n if (this.has(value)) {\n return this;\n }\n const copy = ImmutableSet.copy(this);\n copy[internalSetSymbol].add(value);\n return copy;\n }\n\n public delete(value: T): ImmutableSet<T> {\n if (!this.has(value)) {\n return this;\n }\n const copy = ImmutableSet.copy(this);\n copy[internalSetSymbol].delete(value);\n return copy;\n }\n\n public has(value: T): boolean {\n return this[internalSetSymbol].has(value);\n }\n\n public [Symbol.iterator](): Iterator<T> {\n return this[internalSetSymbol].values();\n }\n}\n"],"names":["internalSetSymbol","Symbol","ImmutableSet","dangerouslyGetInternalSet","set","copy","immutableSet","Set","from","iterable","undefined","empty","hasInstance","instance","Boolean","add","value","has","delete","iterator","values","internalSet","size"],"mappings":";;;;+BAQaE;;;;;;;AARb,MAAMF,oBAAoBC,OAAO;IAYtBD,qBAAAA;AAJJ;IAML,OAAcG,0BAAiCC,GAAwB,EAAc;QACnF,OAAOA,GAAG,CAACJ,kBAAkB;IAC/B;IAEA,OAAcK,KAAQC,YAA6B,EAAmB;QACpE,OAAO,IAAIJ,aAAa,IAAIK,IAAID,YAAY,CAACN,kBAAkB;IACjE;IAEA;;;;GAIC,GACD,OAAcQ,KAAYC,QAA0B,EAAuB;QACzE,IAAIA,aAAaC,WAAW;YAC1B,OAAO,IAAI,CAACC,KAAK;QACnB;QACA,IAAIF,oBAAoB,IAAI,EAAE;YAC5B,OAAOA;QACT;QACA,OAAO,IAAI,IAAI,CAAC,IAAIF,IAAIE;IAC1B;IAEA,OAAc,CAACR,OAAOW,WAAW,CAAC,CAACC,QAAiB,EAAW;QAC7D,OAAOC,QAAQ,OAAOD,aAAa,YAAYA,YAAYb,qBAAqBa;IAClF;IAcOE,IAAIC,KAAQ,EAAmB;QACpC,IAAI,IAAI,CAACC,GAAG,CAACD,QAAQ;YACnB,OAAO,IAAI;QACb;QACA,MAAMX,OAAOH,aAAaG,IAAI,CAAC,IAAI;QACnCA,IAAI,CAACL,kBAAkB,CAACe,GAAG,CAACC;QAC5B,OAAOX;IACT;IAEOa,OAAOF,KAAQ,EAAmB;QACvC,IAAI,CAAC,IAAI,CAACC,GAAG,CAACD,QAAQ;YACpB,OAAO,IAAI;QACb;QACA,MAAMX,OAAOH,aAAaG,IAAI,CAAC,IAAI;QACnCA,IAAI,CAACL,kBAAkB,CAACkB,MAAM,CAACF;QAC/B,OAAOX;IACT;IAEOY,IAAID,KAAQ,EAAW;QAC5B,OAAO,IAAI,CAAChB,kBAAkB,CAACiB,GAAG,CAACD;IACrC;IAEO,CAACf,OAAOkB,QAAQ,CAAC,GAAgB;QACtC,OAAO,IAAI,CAACnB,kBAAkB,CAACoB,MAAM;IACvC;IApCA;;;;;;GAMC,GACD,YAAYC,WAAmB,CAAE;YAtCjC,kBAAA,EAAA,IAAA,EAAgBC,QAAhB,KAAA;YAEA,kBAAA,EAAA,IAAA,EAAStB,oBAAT,KAAA;QAqCE,IAAI,CAACA,kBAAkB,GAAGqB;QAC1B,IAAI,CAACC,IAAI,GAAG,IAAI,CAACtB,kBAAkB,CAACsB,IAAI;IAC1C;AA2BF;IArEE,kBAAA,EADWpB,cACGS,SAA6B,IAAIT,aAAa,IAAIK"}
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/utils/assert.ts"],"sourcesContent":["import type * as React from 'react';\n\nexport function assertIsDefinedRef<V>(\n refObject: React.RefObject<V | null | undefined>,\n msg = `assertIsDefinedRef: reference not properly defined ${refObject}`,\n // eslint-disable-next-line @typescript-eslint/no-deprecated\n): asserts refObject is React.MutableRefObject<V> {\n // eslint-disable-next-line eqeqeq\n if (refObject.current == undefined && process.env.NODE_ENV === 'development') {\n throw new TypeError(msg);\n }\n}\n"],"names":["assertIsDefinedRef","refObject","msg","current","undefined","process","env","NODE_ENV","TypeError"],"mappings":";;;;;;;;;;AAEO,SAASA,mBACdC,SAAgD,EAChDC,MAAM,CAAC,mDAAmD,EAAED,WAAW;IAGvE,kCAAkC;IAClC,IAAIA,UAAUE,OAAO,IAAIC,aAAaC,QAAQC,GAAG,CAACC,QAAQ,KAAK,eAAe;QAC5E,MAAM,IAAIC,UAAUN;IACtB;AACF"}
1
+ {"version":3,"sources":["../../src/utils/assert.ts"],"sourcesContent":["import type * as React from 'react';\n\nexport function assertIsDefinedRef<V>(\n refObject: React.RefObject<V | null | undefined>,\n msg = `assertIsDefinedRef: reference not properly defined ${refObject}`,\n // eslint-disable-next-line @typescript-eslint/no-deprecated\n): asserts refObject is React.MutableRefObject<V> {\n // eslint-disable-next-line eqeqeq\n if (refObject.current == undefined && process.env.NODE_ENV === 'development') {\n throw new TypeError(msg);\n }\n}\n"],"names":["assertIsDefinedRef","refObject","msg","current","undefined","process","env","NODE_ENV","TypeError"],"mappings":";;;;;;;;;;AAEO,SAASA,mBACdC,SAAgD,EAChDC,MAAM,CAAC,mDAAmD,EAAED,WAAW;IAGvE,kCAAkC;IAClC,IAAIA,UAAUE,OAAO,IAAIC,aAAaC,QAAQC,GAAG,CAACC,QAAQ,KAAK,eAAe;QAC5E,MAAM,IAAIC,UAAUN;IACtB;AACF"}
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/utils/createCheckedItems.ts"],"sourcesContent":["import type { TreeSelectionValue } from '../Tree';\nimport type { TreeItemValue } from '../TreeItem';\nimport { ImmutableMap } from './ImmutableMap';\n\nconst tuplifyCheckedItem = (\n value: TreeItemValue | [TreeItemValue, TreeSelectionValue],\n): [TreeItemValue, TreeSelectionValue] => (Array.isArray(value) ? value : [value, true]);\n\nexport const createCheckedItems = (\n iterable?: Iterable<TreeItemValue | [TreeItemValue, TreeSelectionValue]>,\n): ImmutableMap<TreeItemValue, TreeSelectionValue> => ImmutableMap.from(iterable, tuplifyCheckedItem);\n"],"names":["ImmutableMap","tuplifyCheckedItem","value","Array","isArray","createCheckedItems","iterable","from"],"mappings":";;;;;;;;;;8BAE6B,oBAAiB;AAE9C,MAAMC,qBAAqB,CACzBC,QACyCC,MAAMC,OAAO,CAACF,SAASA,QAAQ;QAACA;QAAO;KAAK;AAEhF,MAAMG,qBAAqB,CAChCC,WACoDN,0BAAAA,CAAaO,IAAI,CAACD,UAAUL,oBAAoB"}
1
+ {"version":3,"sources":["../../src/utils/createCheckedItems.ts"],"sourcesContent":["import type { TreeSelectionValue } from '../Tree';\nimport type { TreeItemValue } from '../TreeItem';\nimport { ImmutableMap } from './ImmutableMap';\n\nconst tuplifyCheckedItem = (\n value: TreeItemValue | [TreeItemValue, TreeSelectionValue],\n): [TreeItemValue, TreeSelectionValue] => (Array.isArray(value) ? value : [value, true]);\n\nexport const createCheckedItems = (\n iterable?: Iterable<TreeItemValue | [TreeItemValue, TreeSelectionValue]>,\n): ImmutableMap<TreeItemValue, TreeSelectionValue> => ImmutableMap.from(iterable, tuplifyCheckedItem);\n"],"names":["ImmutableMap","tuplifyCheckedItem","value","Array","isArray","createCheckedItems","iterable","from"],"mappings":";;;;;;;;;;8BAE6B,oBAAiB;AAE9C,MAAMC,qBAAqB,CACzBC,QACyCC,MAAMC,OAAO,CAACF,SAASA,QAAQ;QAACA;QAAO;KAAK;AAEhF,MAAMG,qBAAqB,CAChCC,WACoDN,0BAAAA,CAAaO,IAAI,CAACD,UAAUL,oBAAoB"}
@@ -13,12 +13,12 @@ function createHTMLElementWalker(root, targetDocument, filter = ()=>NodeFilter.F
13
13
  let temporaryFilter;
14
14
  const treeWalker = targetDocument.createTreeWalker(root, NodeFilter.SHOW_ELEMENT, {
15
15
  acceptNode (node) {
16
+ var _ref;
16
17
  if (!(0, _reactutilities.isHTMLElement)(node)) {
17
18
  return NodeFilter.FILTER_REJECT;
18
19
  }
19
20
  const filterResult = filter(node);
20
- var _temporaryFilter;
21
- return filterResult === NodeFilter.FILTER_ACCEPT ? (_temporaryFilter = temporaryFilter === null || temporaryFilter === void 0 ? void 0 : temporaryFilter(node)) !== null && _temporaryFilter !== void 0 ? _temporaryFilter : filterResult : filterResult;
21
+ return filterResult === NodeFilter.FILTER_ACCEPT ? (_ref = temporaryFilter === null || temporaryFilter === void 0 ? void 0 : temporaryFilter(node)) !== null && _ref !== void 0 ? _ref : filterResult : filterResult;
22
22
  }
23
23
  });
24
24
  return {
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/utils/createHTMLElementWalker.ts"],"sourcesContent":["import { isHTMLElement } from '@fluentui/react-utilities';\n\nexport interface HTMLElementWalker {\n readonly root: HTMLElement;\n currentElement: HTMLElement;\n firstChild(filter?: HTMLElementFilter): HTMLElement | null;\n lastChild(filter?: HTMLElementFilter): HTMLElement | null;\n nextElement(filter?: HTMLElementFilter): HTMLElement | null;\n nextSibling(filter?: HTMLElementFilter): HTMLElement | null;\n parentElement(filter?: HTMLElementFilter): HTMLElement | null;\n previousElement(filter?: HTMLElementFilter): HTMLElement | null;\n previousSibling(filter?: HTMLElementFilter): HTMLElement | null;\n}\n\nexport type HTMLElementFilter = (element: HTMLElement) => number;\n\nexport function createHTMLElementWalker(\n root: HTMLElement,\n targetDocument: Document,\n filter: HTMLElementFilter = () => NodeFilter.FILTER_ACCEPT,\n): HTMLElementWalker {\n let temporaryFilter: HTMLElementFilter | undefined;\n const treeWalker = targetDocument.createTreeWalker(root, NodeFilter.SHOW_ELEMENT, {\n acceptNode(node: Node) {\n if (!isHTMLElement(node)) {\n return NodeFilter.FILTER_REJECT;\n }\n const filterResult = filter(node);\n return filterResult === NodeFilter.FILTER_ACCEPT ? temporaryFilter?.(node) ?? filterResult : filterResult;\n },\n });\n return {\n get root() {\n return treeWalker.root as HTMLElement;\n },\n get currentElement() {\n return treeWalker.currentNode as HTMLElement;\n },\n set currentElement(element) {\n treeWalker.currentNode = element;\n },\n firstChild: localFilter => {\n temporaryFilter = localFilter;\n const result = treeWalker.firstChild() as HTMLElement | null;\n temporaryFilter = undefined;\n return result;\n },\n lastChild: localFilter => {\n temporaryFilter = localFilter;\n const result = treeWalker.lastChild() as HTMLElement | null;\n temporaryFilter = undefined;\n return result;\n },\n nextElement: localFilter => {\n temporaryFilter = localFilter;\n const result = treeWalker.nextNode() as HTMLElement | null;\n temporaryFilter = undefined;\n return result;\n },\n nextSibling: localFilter => {\n temporaryFilter = localFilter;\n const result = treeWalker.nextSibling() as HTMLElement | null;\n temporaryFilter = undefined;\n return result;\n },\n parentElement: localFilter => {\n temporaryFilter = localFilter;\n const result = treeWalker.parentNode() as HTMLElement | null;\n temporaryFilter = undefined;\n return result;\n },\n previousElement: localFilter => {\n temporaryFilter = localFilter;\n const result = treeWalker.previousNode() as HTMLElement | null;\n temporaryFilter = undefined;\n return result;\n },\n previousSibling: localFilter => {\n temporaryFilter = localFilter;\n const result = treeWalker.previousSibling() as HTMLElement | null;\n temporaryFilter = undefined;\n return result;\n },\n };\n}\n"],"names":["isHTMLElement","createHTMLElementWalker","root","targetDocument","filter","NodeFilter","FILTER_ACCEPT","temporaryFilter","treeWalker","createTreeWalker","SHOW_ELEMENT","acceptNode","node","FILTER_REJECT","filterResult","currentElement","currentNode","element","firstChild","localFilter","result","undefined","lastChild","nextElement","nextNode","nextSibling","parentElement","parentNode","previousElement","previousNode","previousSibling"],"mappings":";;;;+BAgBgBC;;;;;;gCAhBc,4BAA4B;AAgBnD,iCACLC,IAAiB,EACjBC,cAAwB,EACxBC,SAA4B,IAAMC,WAAWC,aAAa;IAE1D,IAAIC;IACJ,MAAMC,aAAaL,eAAeM,gBAAgB,CAACP,MAAMG,WAAWK,YAAY,EAAE;QAChFC,YAAWC,IAAU;YACnB,IAAI,KAACZ,6BAAAA,EAAcY,OAAO;gBACxB,OAAOP,WAAWQ,aAAa;YACjC;YACA,MAAMC,eAAeV,OAAOQ;gBACuBL;YAAnD,OAAOO,iBAAiBT,WAAWC,aAAa,GAAGC,CAAAA,mBAAAA,oBAAAA,QAAAA,oBAAAA,KAAAA,IAAAA,KAAAA,IAAAA,gBAAkBK,KAAAA,MAAAA,QAAlBL,qBAAAA,KAAAA,IAAAA,mBAA2BO,eAAeA;QAC/F;IACF;IACA,OAAO;QACL,IAAIZ,QAAO;YACT,OAAOM,WAAWN,IAAI;QACxB;QACA,IAAIa,kBAAiB;YACnB,OAAOP,WAAWQ,WAAW;QAC/B;QACA,IAAID,gBAAeE,QAAS;YAC1BT,WAAWQ,WAAW,GAAGC;QAC3B;QACAC,YAAYC,CAAAA;YACVZ,kBAAkBY;YAClB,MAAMC,SAASZ,WAAWU,UAAU;YACpCX,kBAAkBc;YAClB,OAAOD;QACT;QACAE,WAAWH,CAAAA;YACTZ,kBAAkBY;YAClB,MAAMC,SAASZ,WAAWc,SAAS;YACnCf,kBAAkBc;YAClB,OAAOD;QACT;QACAG,aAAaJ,CAAAA;YACXZ,kBAAkBY;YAClB,MAAMC,SAASZ,WAAWgB,QAAQ;YAClCjB,kBAAkBc;YAClB,OAAOD;QACT;QACAK,aAAaN,CAAAA;YACXZ,kBAAkBY;YAClB,MAAMC,SAASZ,WAAWiB,WAAW;YACrClB,kBAAkBc;YAClB,OAAOD;QACT;QACAM,eAAeP,CAAAA;YACbZ,kBAAkBY;YAClB,MAAMC,SAASZ,WAAWmB,UAAU;YACpCpB,kBAAkBc;YAClB,OAAOD;QACT;QACAQ,iBAAiBT,CAAAA;YACfZ,kBAAkBY;YAClB,MAAMC,SAASZ,WAAWqB,YAAY;YACtCtB,kBAAkBc;YAClB,OAAOD;QACT;QACAU,iBAAiBX,CAAAA;YACfZ,kBAAkBY;YAClB,MAAMC,SAASZ,WAAWsB,eAAe;YACzCvB,kBAAkBc;YAClB,OAAOD;QACT;IACF;AACF"}
1
+ {"version":3,"sources":["../../src/utils/createHTMLElementWalker.ts"],"sourcesContent":["import { isHTMLElement } from '@fluentui/react-utilities';\n\nexport interface HTMLElementWalker {\n readonly root: HTMLElement;\n currentElement: HTMLElement;\n firstChild(filter?: HTMLElementFilter): HTMLElement | null;\n lastChild(filter?: HTMLElementFilter): HTMLElement | null;\n nextElement(filter?: HTMLElementFilter): HTMLElement | null;\n nextSibling(filter?: HTMLElementFilter): HTMLElement | null;\n parentElement(filter?: HTMLElementFilter): HTMLElement | null;\n previousElement(filter?: HTMLElementFilter): HTMLElement | null;\n previousSibling(filter?: HTMLElementFilter): HTMLElement | null;\n}\n\nexport type HTMLElementFilter = (element: HTMLElement) => number;\n\nexport function createHTMLElementWalker(\n root: HTMLElement,\n targetDocument: Document,\n filter: HTMLElementFilter = () => NodeFilter.FILTER_ACCEPT,\n): HTMLElementWalker {\n let temporaryFilter: HTMLElementFilter | undefined;\n const treeWalker = targetDocument.createTreeWalker(root, NodeFilter.SHOW_ELEMENT, {\n acceptNode(node: Node) {\n if (!isHTMLElement(node)) {\n return NodeFilter.FILTER_REJECT;\n }\n const filterResult = filter(node);\n return filterResult === NodeFilter.FILTER_ACCEPT ? temporaryFilter?.(node) ?? filterResult : filterResult;\n },\n });\n return {\n get root() {\n return treeWalker.root as HTMLElement;\n },\n get currentElement() {\n return treeWalker.currentNode as HTMLElement;\n },\n set currentElement(element) {\n treeWalker.currentNode = element;\n },\n firstChild: localFilter => {\n temporaryFilter = localFilter;\n const result = treeWalker.firstChild() as HTMLElement | null;\n temporaryFilter = undefined;\n return result;\n },\n lastChild: localFilter => {\n temporaryFilter = localFilter;\n const result = treeWalker.lastChild() as HTMLElement | null;\n temporaryFilter = undefined;\n return result;\n },\n nextElement: localFilter => {\n temporaryFilter = localFilter;\n const result = treeWalker.nextNode() as HTMLElement | null;\n temporaryFilter = undefined;\n return result;\n },\n nextSibling: localFilter => {\n temporaryFilter = localFilter;\n const result = treeWalker.nextSibling() as HTMLElement | null;\n temporaryFilter = undefined;\n return result;\n },\n parentElement: localFilter => {\n temporaryFilter = localFilter;\n const result = treeWalker.parentNode() as HTMLElement | null;\n temporaryFilter = undefined;\n return result;\n },\n previousElement: localFilter => {\n temporaryFilter = localFilter;\n const result = treeWalker.previousNode() as HTMLElement | null;\n temporaryFilter = undefined;\n return result;\n },\n previousSibling: localFilter => {\n temporaryFilter = localFilter;\n const result = treeWalker.previousSibling() as HTMLElement | null;\n temporaryFilter = undefined;\n return result;\n },\n };\n}\n"],"names":["isHTMLElement","createHTMLElementWalker","root","targetDocument","filter","NodeFilter","FILTER_ACCEPT","temporaryFilter","treeWalker","createTreeWalker","SHOW_ELEMENT","acceptNode","node","FILTER_REJECT","filterResult","currentElement","currentNode","element","firstChild","localFilter","result","undefined","lastChild","nextElement","nextNode","nextSibling","parentElement","parentNode","previousElement","previousNode","previousSibling"],"mappings":";;;;+BAgBgBC;;;;;;gCAhBc,4BAA4B;AAgBnD,iCACLC,IAAiB,EACjBC,cAAwB,EACxBC,SAA4B,IAAMC,WAAWC,aAAa;IAE1D,IAAIC;IACJ,MAAMC,aAAaL,eAAeM,gBAAgB,CAACP,MAAMG,WAAWK,YAAY,EAAE;QAChFC,YAAWC,IAAU;;YACnB,IAAI,KAACZ,6BAAAA,EAAcY,OAAO;gBACxB,OAAOP,WAAWQ,aAAa;YACjC;YACA,MAAMC,eAAeV,OAAOQ;YAC5B,OAAOE,iBAAiBT,WAAWC,aAAa,GAAA,CAAA,OAAGC,oBAAAA,QAAAA,oBAAAA,KAAAA,IAAAA,KAAAA,IAAAA,gBAAkBK,KAAAA,MAAAA,QAAAA,SAAAA,KAAAA,IAAAA,OAASE,eAAeA;QAC/F;IACF;IACA,OAAO;QACL,IAAIZ,QAAO;YACT,OAAOM,WAAWN,IAAI;QACxB;QACA,IAAIa,kBAAiB;YACnB,OAAOP,WAAWQ,WAAW;QAC/B;QACA,IAAID,gBAAeE,QAAS;YAC1BT,WAAWQ,WAAW,GAAGC;QAC3B;QACAC,YAAYC,CAAAA;YACVZ,kBAAkBY;YAClB,MAAMC,SAASZ,WAAWU,UAAU;YACpCX,kBAAkBc;YAClB,OAAOD;QACT;QACAE,WAAWH,CAAAA;YACTZ,kBAAkBY;YAClB,MAAMC,SAASZ,WAAWc,SAAS;YACnCf,kBAAkBc;YAClB,OAAOD;QACT;QACAG,aAAaJ,CAAAA;YACXZ,kBAAkBY;YAClB,MAAMC,SAASZ,WAAWgB,QAAQ;YAClCjB,kBAAkBc;YAClB,OAAOD;QACT;QACAK,aAAaN,CAAAA;YACXZ,kBAAkBY;YAClB,MAAMC,SAASZ,WAAWiB,WAAW;YACrClB,kBAAkBc;YAClB,OAAOD;QACT;QACAM,eAAeP,CAAAA;YACbZ,kBAAkBY;YAClB,MAAMC,SAASZ,WAAWmB,UAAU;YACpCpB,kBAAkBc;YAClB,OAAOD;QACT;QACAQ,iBAAiBT,CAAAA;YACfZ,kBAAkBY;YAClB,MAAMC,SAASZ,WAAWqB,YAAY;YACtCtB,kBAAkBc;YAClB,OAAOD;QACT;QACAU,iBAAiBX,CAAAA;YACfZ,kBAAkBY;YAClB,MAAMC,SAASZ,WAAWsB,eAAe;YACzCvB,kBAAkBc;YAClB,OAAOD;QACT;IACF;AACF"}
@@ -8,14 +8,14 @@ Object.defineProperty(exports, "__esModule", {
8
8
  function _export(target, all) {
9
9
  for(var name in all)Object.defineProperty(target, name, {
10
10
  enumerable: true,
11
- get: all[name]
11
+ get: Object.getOwnPropertyDescriptor(all, name).get
12
12
  });
13
13
  }
14
14
  _export(exports, {
15
- createHeadlessTree: function() {
15
+ get createHeadlessTree () {
16
16
  return createHeadlessTree;
17
17
  },
18
- headlessTreeRootId: function() {
18
+ get headlessTreeRootId () {
19
19
  return headlessTreeRootId;
20
20
  }
21
21
  });
@@ -33,13 +33,14 @@ function createHeadlessTree(initialProps = []) {
33
33
  return itemsPerValue.size;
34
34
  },
35
35
  getParent: (key)=>{
36
- var _itemsPerValue_get;
37
- var _itemsPerValue_get_parentValue, _itemsPerValue_get1;
38
- return (_itemsPerValue_get1 = itemsPerValue.get((_itemsPerValue_get_parentValue = (_itemsPerValue_get = itemsPerValue.get(key)) === null || _itemsPerValue_get === void 0 ? void 0 : _itemsPerValue_get.parentValue) !== null && _itemsPerValue_get_parentValue !== void 0 ? _itemsPerValue_get_parentValue : root.value)) !== null && _itemsPerValue_get1 !== void 0 ? _itemsPerValue_get1 : root;
36
+ var _itemsPerValue_get, _ref;
37
+ var _itemsPerValue_get1;
38
+ return (_itemsPerValue_get = itemsPerValue.get((_ref = (_itemsPerValue_get1 = itemsPerValue.get(key)) === null || _itemsPerValue_get1 === void 0 ? void 0 : _itemsPerValue_get1.parentValue) !== null && _ref !== void 0 ? _ref : root.value)) !== null && _itemsPerValue_get !== void 0 ? _itemsPerValue_get : root;
39
39
  },
40
40
  get: (key)=>itemsPerValue.get(key),
41
41
  has: (key)=>itemsPerValue.has(key),
42
42
  add (props) {
43
+ var _propsWithoutParentValue_itemType;
43
44
  const { parentValue = headlessTreeRootId, ...propsWithoutParentValue } = props;
44
45
  const parentItem = itemsPerValue.get(parentValue);
45
46
  if (!parentItem) {
@@ -51,7 +52,6 @@ TreeItem "${props.value}" is wrongly positioned, did you properly ordered provid
51
52
  return;
52
53
  }
53
54
  parentItem.itemType = 'branch';
54
- var _propsWithoutParentValue_itemType;
55
55
  const item = {
56
56
  value: props.value,
57
57
  getTreeItemProps: ()=>({
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/utils/createHeadlessTree.ts"],"sourcesContent":["import type { TreeItemProps, TreeItemType, TreeItemValue } from '../TreeItem';\nimport type { ImmutableSet } from './ImmutableSet';\n\nexport type HeadlessTreeItemProps = Omit<TreeItemProps, 'itemType' | 'value'> & {\n value: TreeItemValue;\n itemType?: TreeItemType;\n parentValue?: TreeItemValue;\n};\n\n/**\n * The item that is returned by `createHeadlessTree`, it represents a wrapper around the properties provided to\n * `createHeadlessTree` but with extra information that might be useful on virtual tree scenarios\n */\nexport type HeadlessTreeItem<Props extends HeadlessTreeItemProps> = {\n level: number;\n index: number;\n position: number;\n childrenValues: TreeItemValue[];\n value: TreeItemValue;\n parentValue: TreeItemValue | undefined;\n itemType: TreeItemType;\n getTreeItemProps(): Required<Pick<Props, 'value' | 'aria-setsize' | 'aria-level' | 'aria-posinset' | 'itemType'>> &\n Props;\n};\n\n/**\n * @internal\n */\nexport type HeadlessTree<Props extends HeadlessTreeItemProps> = {\n /**\n * the number of items in the virtual tree\n */\n readonly size: number;\n /**\n * the root item of the virtual tree\n */\n root: HeadlessTreeItem<HeadlessTreeItemProps>;\n /**\n * method to get a virtual tree item by its value\n * @param key - the key of the item to get\n */\n get(value: TreeItemValue): HeadlessTreeItem<Props> | undefined;\n /**\n * method to check if a virtual tree item exists by its value\n * @param value - the value of the item to check if exists\n */\n has(value: TreeItemValue): boolean;\n /**\n * method to add a new virtual tree item to the virtual tree\n * @param props - the props of the item to add\n */\n add(props: Props): void;\n /**\n * method to remove a virtual tree item from the virtual tree.\n * When an item is removed:\n * 1. all its children are also removed\n * 2. all its siblings are repositioned\n * @param value - the value of the item to remove\n */\n // remove(value: TreeItemValue): void;\n /**\n * method to get the parent of a virtual tree item by its value\n * @param value - the value of the item to get the parent from\n */\n getParent(value: TreeItemValue): HeadlessTreeItem<Props>;\n /**\n * method to get the subtree of a virtual tree item by its value\n * @param value - the value of the item to get the subtree from\n */\n subtree(value: TreeItemValue): IterableIterator<HeadlessTreeItem<Props>>;\n /**\n * method to get the children of a virtual tree item by its value\n * @param value - the value of the item to get the children from\n */\n children(value: TreeItemValue): IterableIterator<HeadlessTreeItem<Props>>;\n /**\n * method to get the visible items of a virtual tree\n * @param openItems - the open items of the tree\n */\n visibleItems(openItems: ImmutableSet<TreeItemValue>): IterableIterator<HeadlessTreeItem<Props>>;\n /**\n * method to get the ancestors of a virtual tree item by its value\n * @param value - the value of the item to get the ancestors from\n */\n ancestors(value: TreeItemValue): IterableIterator<HeadlessTreeItem<Props>>;\n};\n\n/**\n * creates a list of virtual tree items\n * and provides a map to access each item by id\n */\nexport function createHeadlessTree<Props extends HeadlessTreeItemProps>(\n initialProps: Props[] = [],\n): HeadlessTree<Props> {\n const root = createHeadlessTreeRootItem();\n const itemsPerValue = new Map<TreeItemValue, HeadlessTreeItem<HeadlessTreeItemProps>>([[root.value, root]]);\n\n const headlessTree: HeadlessTree<HeadlessTreeItemProps> = {\n root,\n get size() {\n return itemsPerValue.size;\n },\n getParent: key => itemsPerValue.get(itemsPerValue.get(key)?.parentValue ?? root.value) ?? root,\n get: key => itemsPerValue.get(key),\n has: key => itemsPerValue.has(key),\n add(props) {\n const { parentValue = headlessTreeRootId, ...propsWithoutParentValue } = props;\n const parentItem = itemsPerValue.get(parentValue);\n if (!parentItem) {\n if (process.env.NODE_ENV === 'development') {\n // eslint-disable-next-line no-console\n console.error(/* #__DE-INDENT__ */ `\n @fluentui/react-tree [createHeadlessTree]:\n TreeItem \"${props.value}\" is wrongly positioned, did you properly ordered provided item props? make sure provided items are organized, parents should come before children\n `);\n }\n return;\n }\n parentItem.itemType = 'branch';\n\n const item: HeadlessTreeItem<HeadlessTreeItemProps> = {\n value: props.value,\n getTreeItemProps: () => ({\n ...propsWithoutParentValue,\n parentValue,\n 'aria-level': item.level,\n 'aria-posinset': item.position,\n 'aria-setsize': parentItem.childrenValues.length,\n itemType: item.itemType,\n }),\n itemType: propsWithoutParentValue.itemType ?? 'leaf',\n level: parentItem.level + 1,\n parentValue,\n childrenValues: [],\n index: -1,\n position: parentItem.childrenValues.push(props.value),\n };\n itemsPerValue.set(item.value, item);\n },\n subtree: key => HeadlessTreeSubtreeGenerator(key, headlessTree),\n children: key => HeadlessTreeChildrenGenerator(key, headlessTree),\n ancestors: key => HeadlessTreeAncestorsGenerator(key, headlessTree),\n visibleItems: openItems => HeadlessTreeVisibleItemsGenerator(openItems, headlessTree),\n };\n\n initialProps.forEach(headlessTree.add);\n\n return headlessTree as HeadlessTree<Props>;\n}\n\nexport const headlessTreeRootId = '__fuiHeadlessTreeRoot';\n\nfunction createHeadlessTreeRootItem(): HeadlessTreeItem<HeadlessTreeItemProps> {\n return {\n parentValue: undefined,\n value: headlessTreeRootId,\n itemType: 'branch',\n getTreeItemProps: () => {\n if (process.env.NODE_ENV !== 'production') {\n // eslint-disable-next-line no-console\n console.error(/* #__DE-INDENT__ */ `\n @fluentui/react-tree [createHeadlessTree]:\n Internal error, trying to access treeitem props from invalid root element\n `);\n }\n return {\n id: headlessTreeRootId,\n parentValue: undefined,\n value: headlessTreeRootId,\n 'aria-setsize': -1,\n 'aria-level': -1,\n 'aria-posinset': -1,\n itemType: 'branch',\n };\n },\n childrenValues: [],\n get index() {\n if (process.env.NODE_ENV !== 'production') {\n // eslint-disable-next-line no-console\n console.error(/* #__DE-INDENT__ */ `\n @fluentui/react-tree [createHeadlessTree]:\n Internal error, trying to access treeitem props from invalid root element\n `);\n }\n return -1;\n },\n get position() {\n if (process.env.NODE_ENV !== 'production') {\n // eslint-disable-next-line no-console\n console.error(/* #__DE-INDENT__ */ `\n @fluentui/react-tree [createHeadlessTree]:\n Internal error, trying to access treeitem props from invalid root element\n `);\n }\n return -1;\n },\n level: 0,\n };\n}\n\n/**\n * Generator that returns all subtree of a given virtual tree item\n * @param key - the key of the item to get the subtree from\n */\n// eslint-disable-next-line @typescript-eslint/naming-convention\nfunction* HeadlessTreeSubtreeGenerator<Props extends HeadlessTreeItemProps>(\n key: TreeItemValue,\n virtualTreeItems: HeadlessTree<Props>,\n): Generator<HeadlessTreeItem<Props>, void, void> {\n const item = virtualTreeItems.get(key);\n if (!item || item.childrenValues.length === 0) {\n return;\n }\n for (const childValue of item.childrenValues) {\n yield virtualTreeItems.get(childValue)!;\n yield* HeadlessTreeSubtreeGenerator(childValue, virtualTreeItems);\n }\n}\n\n/**\n * Generator that returns all children of a given virtual tree item\n * @param key - the key of the item to get the children from\n */\n// eslint-disable-next-line @typescript-eslint/naming-convention\nfunction* HeadlessTreeChildrenGenerator<Props extends HeadlessTreeItemProps>(\n key: TreeItemValue,\n virtualTreeItems: HeadlessTree<Props>,\n): Generator<HeadlessTreeItem<Props>, void, void> {\n const item = virtualTreeItems.get(key);\n if (!item || item.childrenValues.length === 0) {\n return;\n }\n for (const childValue of item.childrenValues) {\n yield virtualTreeItems.get(childValue)!;\n }\n}\n\n/**\n * Generator that returns all ancestors of a given virtual tree item\n * @param key - the key of the item to get the children from\n */\n// eslint-disable-next-line @typescript-eslint/naming-convention\nfunction* HeadlessTreeAncestorsGenerator<Props extends HeadlessTreeItemProps>(\n key: TreeItemValue,\n virtualTreeItems: HeadlessTree<Props>,\n): Generator<HeadlessTreeItem<Props>, void, void> {\n let parent = virtualTreeItems.getParent(key);\n while (parent !== virtualTreeItems.root) {\n yield parent;\n parent = virtualTreeItems.getParent(parent.value);\n }\n}\n\n/**\n * Generator that returns all visible items of a given virtual tree\n * @param openItems - the open items of the tree\n */\n// eslint-disable-next-line @typescript-eslint/naming-convention\nfunction* HeadlessTreeVisibleItemsGenerator<Props extends HeadlessTreeItemProps>(\n openItems: ImmutableSet<TreeItemValue>,\n virtualTreeItems: HeadlessTree<Props>,\n): Generator<HeadlessTreeItem<Props>, void, void> {\n let index = 0;\n for (const item of recursiveVisibleItems(virtualTreeItems.root.value, openItems, virtualTreeItems)) {\n item.index = index++;\n yield item;\n }\n}\n\nfunction* recursiveVisibleItems<Props extends HeadlessTreeItemProps>(\n parentValue: TreeItemValue,\n openItems: ImmutableSet<TreeItemValue>,\n virtualTreeItems: HeadlessTree<Props>,\n): Generator<HeadlessTreeItem<Props>, void, void> {\n const parent = virtualTreeItems.get(parentValue);\n if (!parent || parent.childrenValues.length === 0) {\n return;\n }\n\n for (const childValue of parent.childrenValues) {\n const child = virtualTreeItems.get(childValue);\n if (!child) {\n continue;\n }\n\n if (isItemVisible(child, openItems, virtualTreeItems)) {\n yield child;\n\n // Process children only as long as their parents are open.\n // This makes it possible to have large trees with good performance as\n // long as most branches are not expanded.\n if (openItems.has(childValue)) {\n yield* recursiveVisibleItems(childValue, openItems, virtualTreeItems);\n }\n }\n }\n}\n\nfunction isItemVisible(\n item: HeadlessTreeItem<HeadlessTreeItemProps>,\n openItems: ImmutableSet<TreeItemValue>,\n virtualTreeItems: HeadlessTree<HeadlessTreeItemProps>,\n) {\n if (item.level === 1) {\n return true;\n }\n while (item.parentValue && item.parentValue !== virtualTreeItems.root.value) {\n if (!openItems.has(item.parentValue)) {\n return false;\n }\n const parent = virtualTreeItems.get(item.parentValue);\n if (!parent) {\n return false;\n }\n item = parent;\n }\n return true;\n}\n"],"names":["createHeadlessTree","initialProps","root","createHeadlessTreeRootItem","itemsPerValue","Map","value","headlessTree","size","getParent","key","get","parentValue","has","add","props","headlessTreeRootId","propsWithoutParentValue","parentItem","process","env","NODE_ENV","console","error","itemType","item","getTreeItemProps","level","position","childrenValues","length","index","push","set","subtree","HeadlessTreeSubtreeGenerator","children","HeadlessTreeChildrenGenerator","ancestors","HeadlessTreeAncestorsGenerator","visibleItems","openItems","HeadlessTreeVisibleItemsGenerator","forEach","undefined","id","virtualTreeItems","childValue","parent","recursiveVisibleItems","child","isItemVisible"],"mappings":"AAuFA;;;CAGC,GACD;;;;;;;;;;;IAAgBA,kBAAAA;;;sBA2DHgB;eAAAA;;;AA3DN,4BACLf,eAAwB,EAAE;IAE1B,MAAMC,OAAOC;IACb,MAAMC,gBAAgB,IAAIC,IAA4D;QAAC;YAACH,KAAKI,KAAK;YAAEJ;SAAK;KAAC;IAE1G,MAAMK,eAAoD;QACxDL;QACA,IAAIM,QAAO;YACT,OAAOJ,cAAcI,IAAI;QAC3B;QACAC,WAAWC,CAAAA;gBAAyBN;gBAAAA,gCAAlBA;mBAAAA,CAAAA,sBAAAA,cAAcO,GAAG,CAACP,CAAAA,iCAAAA,CAAAA,qBAAAA,cAAcO,GAAG,CAACD,IAAAA,MAAAA,QAAlBN,uBAAAA,KAAAA,IAAAA,KAAAA,IAAAA,mBAAwBQ,WAAAA,AAAW,MAAA,QAAnCR,mCAAAA,KAAAA,IAAAA,iCAAuCF,KAAKI,MAAK,MAAA,QAAnEF,wBAAAA,KAAAA,IAAAA,sBAAwEF;;QAC1FS,KAAKD,CAAAA,MAAON,cAAcO,GAAG,CAACD;QAC9BG,KAAKH,CAAAA,MAAON,cAAcS,GAAG,CAACH;QAC9BI,KAAIC,KAAK;YACP,MAAM,EAAEH,cAAcI,kBAAkB,EAAE,GAAGC,yBAAyB,GAAGF;YACzE,MAAMG,aAAad,cAAcO,GAAG,CAACC;YACrC,IAAI,CAACM,YAAY;gBACf,IAAIC,QAAQC,GAAG,CAACC,QAAQ,KAAK,eAAe;oBAC1C,sCAAsC;oBACtCC,QAAQC,KAAK,CAAsB,CAAC;UAExB,EAAER,MAAMT,KAAK,CAAC,kJAC1B,CAAC;gBACH;gBACA;YACF;YACAY,WAAWM,QAAQ,GAAG;gBAYVP;YAVZ,MAAMQ,OAAgD;gBACpDnB,OAAOS,MAAMT,KAAK;gBAClBoB,kBAAkB,IAAO,CAAA;wBACvB,GAAGT,uBAAuB;wBAC1BL;wBACA,cAAca,KAAKE,KAAK;wBACxB,iBAAiBF,KAAKG,QAAQ;wBAC9B,gBAAgBV,WAAWW,cAAc,CAACC,MAAM;wBAChDN,UAAUC,KAAKD,QAAQ;qBACzB,CAAA;gBACAA,UAAUP,CAAAA,oCAAAA,wBAAwBO,QAAAA,AAAQ,MAAA,QAAhCP,sCAAAA,KAAAA,IAAAA,oCAAoC;gBAC9CU,OAAOT,WAAWS,KAAK,GAAG;gBAC1Bf;gBACAiB,gBAAgB,EAAE;gBAClBE,OAAO,CAAC;gBACRH,UAAUV,WAAWW,cAAc,CAACG,IAAI,CAACjB,MAAMT,KAAK;YACtD;YACAF,cAAc6B,GAAG,CAACR,KAAKnB,KAAK,EAAEmB;QAChC;QACAS,SAASxB,CAAAA,MAAOyB,6BAA6BzB,KAAKH;QAClD6B,UAAU1B,CAAAA,MAAO2B,8BAA8B3B,KAAKH;QACpD+B,WAAW5B,CAAAA,MAAO6B,+BAA+B7B,KAAKH;QACtDiC,cAAcC,CAAAA,YAAaC,kCAAkCD,WAAWlC;IAC1E;IAEAN,aAAa0C,OAAO,CAACpC,aAAaO,GAAG;IAErC,OAAOP;AACT;AAEO,2BAA2B,wBAAwB;AAE1D,SAASJ;IACP,OAAO;QACLS,aAAagC;QACbtC,OAAOU;QACPQ,UAAU;QACVE,kBAAkB;YAChB,IAAIP,QAAQC,GAAG,CAACC,QAAQ,KAAK,cAAc;gBACzC,sCAAsC;gBACtCC,QAAQC,KAAK,CAAsB,CAAC;yEAGpC,CAAC;YACH;YACA,OAAO;gBACLsB,IAAI7B;gBACJJ,aAAagC;gBACbtC,OAAOU;gBACP,gBAAgB,CAAC;gBACjB,cAAc,CAAC;gBACf,iBAAiB,CAAC;gBAClBQ,UAAU;YACZ;QACF;QACAK,gBAAgB,EAAE;QAClB,IAAIE,SAAQ;YACV,IAAIZ,QAAQC,GAAG,CAACC,QAAQ,KAAK,cAAc;gBACzC,sCAAsC;gBACtCC,QAAQC,KAAK,CAAsB,CAAC;yEAGpC,CAAC;YACH;YACA,OAAO,CAAC;QACV;QACA,IAAIK,YAAW;YACb,IAAIT,QAAQC,GAAG,CAACC,QAAQ,KAAK,cAAc;gBACzC,sCAAsC;gBACtCC,QAAQC,KAAK,CAAsB,CAAC;yEAGpC,CAAC;YACH;YACA,OAAO,CAAC;QACV;QACAI,OAAO;IACT;AACF;AAEA;;;CAGC,GACD,gEAAgE;AAChE,UAAUQ,6BACRzB,GAAkB,EAClBoC,gBAAqC;IAErC,MAAMrB,OAAOqB,iBAAiBnC,GAAG,CAACD;IAClC,IAAI,CAACe,QAAQA,KAAKI,cAAc,CAACC,MAAM,KAAK,GAAG;QAC7C;IACF;IACA,KAAK,MAAMiB,cAActB,KAAKI,cAAc,CAAE;QAC5C,MAAMiB,iBAAiBnC,GAAG,CAACoC;QAC3B,OAAOZ,6BAA6BY,YAAYD;IAClD;AACF;AAEA;;;CAGC,GACD,gEAAgE;AAChE,UAAUT,8BACR3B,GAAkB,EAClBoC,gBAAqC;IAErC,MAAMrB,OAAOqB,iBAAiBnC,GAAG,CAACD;IAClC,IAAI,CAACe,QAAQA,KAAKI,cAAc,CAACC,MAAM,KAAK,GAAG;QAC7C;IACF;IACA,KAAK,MAAMiB,cAActB,KAAKI,cAAc,CAAE;QAC5C,MAAMiB,iBAAiBnC,GAAG,CAACoC;IAC7B;AACF;AAEA;;;CAGC,GACD,gEAAgE;AAChE,UAAUR,+BACR7B,GAAkB,EAClBoC,gBAAqC;IAErC,IAAIE,SAASF,iBAAiBrC,SAAS,CAACC;IACxC,MAAOsC,WAAWF,iBAAiB5C,IAAI,CAAE;QACvC,MAAM8C;QACNA,SAASF,iBAAiBrC,SAAS,CAACuC,OAAO1C,KAAK;IAClD;AACF;AAEA;;;CAGC,GACD,gEAAgE;AAChE,UAAUoC,kCACRD,SAAsC,EACtCK,gBAAqC;IAErC,IAAIf,QAAQ;IACZ,KAAK,MAAMN,QAAQwB,sBAAsBH,iBAAiB5C,IAAI,CAACI,KAAK,EAAEmC,WAAWK,kBAAmB;QAClGrB,KAAKM,KAAK,GAAGA;QACb,MAAMN;IACR;AACF;AAEA,UAAUwB,sBACRrC,WAA0B,EAC1B6B,SAAsC,EACtCK,gBAAqC;IAErC,MAAME,SAASF,iBAAiBnC,GAAG,CAACC;IACpC,IAAI,CAACoC,UAAUA,OAAOnB,cAAc,CAACC,MAAM,KAAK,GAAG;QACjD;IACF;IAEA,KAAK,MAAMiB,cAAcC,OAAOnB,cAAc,CAAE;QAC9C,MAAMqB,QAAQJ,iBAAiBnC,GAAG,CAACoC;QACnC,IAAI,CAACG,OAAO;YACV;QACF;QAEA,IAAIC,cAAcD,OAAOT,WAAWK,mBAAmB;YACrD,MAAMI;YAEN,2DAA2D;YAC3D,sEAAsE;YACtE,0CAA0C;YAC1C,IAAIT,UAAU5B,GAAG,CAACkC,aAAa;gBAC7B,OAAOE,sBAAsBF,YAAYN,WAAWK;YACtD;QACF;IACF;AACF;AAEA,SAASK,cACP1B,IAA6C,EAC7CgB,SAAsC,EACtCK,gBAAqD;IAErD,IAAIrB,KAAKE,KAAK,KAAK,GAAG;QACpB,OAAO;IACT;IACA,MAAOF,KAAKb,WAAW,IAAIa,KAAKb,WAAW,KAAKkC,iBAAiB5C,IAAI,CAACI,KAAK,CAAE;QAC3E,IAAI,CAACmC,UAAU5B,GAAG,CAACY,KAAKb,WAAW,GAAG;YACpC,OAAO;QACT;QACA,MAAMoC,SAASF,iBAAiBnC,GAAG,CAACc,KAAKb,WAAW;QACpD,IAAI,CAACoC,QAAQ;YACX,OAAO;QACT;QACAvB,OAAOuB;IACT;IACA,OAAO;AACT"}
1
+ {"version":3,"sources":["../../src/utils/createHeadlessTree.ts"],"sourcesContent":["import type { TreeItemProps, TreeItemType, TreeItemValue } from '../TreeItem';\nimport type { ImmutableSet } from './ImmutableSet';\n\nexport type HeadlessTreeItemProps = Omit<TreeItemProps, 'itemType' | 'value'> & {\n value: TreeItemValue;\n itemType?: TreeItemType;\n parentValue?: TreeItemValue;\n};\n\n/**\n * The item that is returned by `createHeadlessTree`, it represents a wrapper around the properties provided to\n * `createHeadlessTree` but with extra information that might be useful on virtual tree scenarios\n */\nexport type HeadlessTreeItem<Props extends HeadlessTreeItemProps> = {\n level: number;\n index: number;\n position: number;\n childrenValues: TreeItemValue[];\n value: TreeItemValue;\n parentValue: TreeItemValue | undefined;\n itemType: TreeItemType;\n getTreeItemProps(): Required<Pick<Props, 'value' | 'aria-setsize' | 'aria-level' | 'aria-posinset' | 'itemType'>> &\n Props;\n};\n\n/**\n * @internal\n */\nexport type HeadlessTree<Props extends HeadlessTreeItemProps> = {\n /**\n * the number of items in the virtual tree\n */\n readonly size: number;\n /**\n * the root item of the virtual tree\n */\n root: HeadlessTreeItem<HeadlessTreeItemProps>;\n /**\n * method to get a virtual tree item by its value\n * @param key - the key of the item to get\n */\n get(value: TreeItemValue): HeadlessTreeItem<Props> | undefined;\n /**\n * method to check if a virtual tree item exists by its value\n * @param value - the value of the item to check if exists\n */\n has(value: TreeItemValue): boolean;\n /**\n * method to add a new virtual tree item to the virtual tree\n * @param props - the props of the item to add\n */\n add(props: Props): void;\n /**\n * method to remove a virtual tree item from the virtual tree.\n * When an item is removed:\n * 1. all its children are also removed\n * 2. all its siblings are repositioned\n * @param value - the value of the item to remove\n */\n // remove(value: TreeItemValue): void;\n /**\n * method to get the parent of a virtual tree item by its value\n * @param value - the value of the item to get the parent from\n */\n getParent(value: TreeItemValue): HeadlessTreeItem<Props>;\n /**\n * method to get the subtree of a virtual tree item by its value\n * @param value - the value of the item to get the subtree from\n */\n subtree(value: TreeItemValue): IterableIterator<HeadlessTreeItem<Props>>;\n /**\n * method to get the children of a virtual tree item by its value\n * @param value - the value of the item to get the children from\n */\n children(value: TreeItemValue): IterableIterator<HeadlessTreeItem<Props>>;\n /**\n * method to get the visible items of a virtual tree\n * @param openItems - the open items of the tree\n */\n visibleItems(openItems: ImmutableSet<TreeItemValue>): IterableIterator<HeadlessTreeItem<Props>>;\n /**\n * method to get the ancestors of a virtual tree item by its value\n * @param value - the value of the item to get the ancestors from\n */\n ancestors(value: TreeItemValue): IterableIterator<HeadlessTreeItem<Props>>;\n};\n\n/**\n * creates a list of virtual tree items\n * and provides a map to access each item by id\n */\nexport function createHeadlessTree<Props extends HeadlessTreeItemProps>(\n initialProps: Props[] = [],\n): HeadlessTree<Props> {\n const root = createHeadlessTreeRootItem();\n const itemsPerValue = new Map<TreeItemValue, HeadlessTreeItem<HeadlessTreeItemProps>>([[root.value, root]]);\n\n const headlessTree: HeadlessTree<HeadlessTreeItemProps> = {\n root,\n get size() {\n return itemsPerValue.size;\n },\n getParent: key => itemsPerValue.get(itemsPerValue.get(key)?.parentValue ?? root.value) ?? root,\n get: key => itemsPerValue.get(key),\n has: key => itemsPerValue.has(key),\n add(props) {\n const { parentValue = headlessTreeRootId, ...propsWithoutParentValue } = props;\n const parentItem = itemsPerValue.get(parentValue);\n if (!parentItem) {\n if (process.env.NODE_ENV === 'development') {\n // eslint-disable-next-line no-console\n console.error(/* #__DE-INDENT__ */ `\n @fluentui/react-tree [createHeadlessTree]:\n TreeItem \"${props.value}\" is wrongly positioned, did you properly ordered provided item props? make sure provided items are organized, parents should come before children\n `);\n }\n return;\n }\n parentItem.itemType = 'branch';\n\n const item: HeadlessTreeItem<HeadlessTreeItemProps> = {\n value: props.value,\n getTreeItemProps: () => ({\n ...propsWithoutParentValue,\n parentValue,\n 'aria-level': item.level,\n 'aria-posinset': item.position,\n 'aria-setsize': parentItem.childrenValues.length,\n itemType: item.itemType,\n }),\n itemType: propsWithoutParentValue.itemType ?? 'leaf',\n level: parentItem.level + 1,\n parentValue,\n childrenValues: [],\n index: -1,\n position: parentItem.childrenValues.push(props.value),\n };\n itemsPerValue.set(item.value, item);\n },\n subtree: key => HeadlessTreeSubtreeGenerator(key, headlessTree),\n children: key => HeadlessTreeChildrenGenerator(key, headlessTree),\n ancestors: key => HeadlessTreeAncestorsGenerator(key, headlessTree),\n visibleItems: openItems => HeadlessTreeVisibleItemsGenerator(openItems, headlessTree),\n };\n\n initialProps.forEach(headlessTree.add);\n\n return headlessTree as HeadlessTree<Props>;\n}\n\nexport const headlessTreeRootId = '__fuiHeadlessTreeRoot';\n\nfunction createHeadlessTreeRootItem(): HeadlessTreeItem<HeadlessTreeItemProps> {\n return {\n parentValue: undefined,\n value: headlessTreeRootId,\n itemType: 'branch',\n getTreeItemProps: () => {\n if (process.env.NODE_ENV !== 'production') {\n // eslint-disable-next-line no-console\n console.error(/* #__DE-INDENT__ */ `\n @fluentui/react-tree [createHeadlessTree]:\n Internal error, trying to access treeitem props from invalid root element\n `);\n }\n return {\n id: headlessTreeRootId,\n parentValue: undefined,\n value: headlessTreeRootId,\n 'aria-setsize': -1,\n 'aria-level': -1,\n 'aria-posinset': -1,\n itemType: 'branch',\n };\n },\n childrenValues: [],\n get index() {\n if (process.env.NODE_ENV !== 'production') {\n // eslint-disable-next-line no-console\n console.error(/* #__DE-INDENT__ */ `\n @fluentui/react-tree [createHeadlessTree]:\n Internal error, trying to access treeitem props from invalid root element\n `);\n }\n return -1;\n },\n get position() {\n if (process.env.NODE_ENV !== 'production') {\n // eslint-disable-next-line no-console\n console.error(/* #__DE-INDENT__ */ `\n @fluentui/react-tree [createHeadlessTree]:\n Internal error, trying to access treeitem props from invalid root element\n `);\n }\n return -1;\n },\n level: 0,\n };\n}\n\n/**\n * Generator that returns all subtree of a given virtual tree item\n * @param key - the key of the item to get the subtree from\n */\n// eslint-disable-next-line @typescript-eslint/naming-convention\nfunction* HeadlessTreeSubtreeGenerator<Props extends HeadlessTreeItemProps>(\n key: TreeItemValue,\n virtualTreeItems: HeadlessTree<Props>,\n): Generator<HeadlessTreeItem<Props>, void, void> {\n const item = virtualTreeItems.get(key);\n if (!item || item.childrenValues.length === 0) {\n return;\n }\n for (const childValue of item.childrenValues) {\n yield virtualTreeItems.get(childValue)!;\n yield* HeadlessTreeSubtreeGenerator(childValue, virtualTreeItems);\n }\n}\n\n/**\n * Generator that returns all children of a given virtual tree item\n * @param key - the key of the item to get the children from\n */\n// eslint-disable-next-line @typescript-eslint/naming-convention\nfunction* HeadlessTreeChildrenGenerator<Props extends HeadlessTreeItemProps>(\n key: TreeItemValue,\n virtualTreeItems: HeadlessTree<Props>,\n): Generator<HeadlessTreeItem<Props>, void, void> {\n const item = virtualTreeItems.get(key);\n if (!item || item.childrenValues.length === 0) {\n return;\n }\n for (const childValue of item.childrenValues) {\n yield virtualTreeItems.get(childValue)!;\n }\n}\n\n/**\n * Generator that returns all ancestors of a given virtual tree item\n * @param key - the key of the item to get the children from\n */\n// eslint-disable-next-line @typescript-eslint/naming-convention\nfunction* HeadlessTreeAncestorsGenerator<Props extends HeadlessTreeItemProps>(\n key: TreeItemValue,\n virtualTreeItems: HeadlessTree<Props>,\n): Generator<HeadlessTreeItem<Props>, void, void> {\n let parent = virtualTreeItems.getParent(key);\n while (parent !== virtualTreeItems.root) {\n yield parent;\n parent = virtualTreeItems.getParent(parent.value);\n }\n}\n\n/**\n * Generator that returns all visible items of a given virtual tree\n * @param openItems - the open items of the tree\n */\n// eslint-disable-next-line @typescript-eslint/naming-convention\nfunction* HeadlessTreeVisibleItemsGenerator<Props extends HeadlessTreeItemProps>(\n openItems: ImmutableSet<TreeItemValue>,\n virtualTreeItems: HeadlessTree<Props>,\n): Generator<HeadlessTreeItem<Props>, void, void> {\n let index = 0;\n for (const item of recursiveVisibleItems(virtualTreeItems.root.value, openItems, virtualTreeItems)) {\n item.index = index++;\n yield item;\n }\n}\n\nfunction* recursiveVisibleItems<Props extends HeadlessTreeItemProps>(\n parentValue: TreeItemValue,\n openItems: ImmutableSet<TreeItemValue>,\n virtualTreeItems: HeadlessTree<Props>,\n): Generator<HeadlessTreeItem<Props>, void, void> {\n const parent = virtualTreeItems.get(parentValue);\n if (!parent || parent.childrenValues.length === 0) {\n return;\n }\n\n for (const childValue of parent.childrenValues) {\n const child = virtualTreeItems.get(childValue);\n if (!child) {\n continue;\n }\n\n if (isItemVisible(child, openItems, virtualTreeItems)) {\n yield child;\n\n // Process children only as long as their parents are open.\n // This makes it possible to have large trees with good performance as\n // long as most branches are not expanded.\n if (openItems.has(childValue)) {\n yield* recursiveVisibleItems(childValue, openItems, virtualTreeItems);\n }\n }\n }\n}\n\nfunction isItemVisible(\n item: HeadlessTreeItem<HeadlessTreeItemProps>,\n openItems: ImmutableSet<TreeItemValue>,\n virtualTreeItems: HeadlessTree<HeadlessTreeItemProps>,\n) {\n if (item.level === 1) {\n return true;\n }\n while (item.parentValue && item.parentValue !== virtualTreeItems.root.value) {\n if (!openItems.has(item.parentValue)) {\n return false;\n }\n const parent = virtualTreeItems.get(item.parentValue);\n if (!parent) {\n return false;\n }\n item = parent;\n }\n return true;\n}\n"],"names":["createHeadlessTree","initialProps","root","createHeadlessTreeRootItem","itemsPerValue","Map","value","headlessTree","size","getParent","key","get","parentValue","has","add","props","propsWithoutParentValue","headlessTreeRootId","parentItem","process","env","NODE_ENV","console","error","itemType","item","getTreeItemProps","level","position","childrenValues","length","index","push","set","subtree","HeadlessTreeSubtreeGenerator","children","HeadlessTreeChildrenGenerator","ancestors","HeadlessTreeAncestorsGenerator","visibleItems","openItems","HeadlessTreeVisibleItemsGenerator","forEach","undefined","id","virtualTreeItems","childValue","parent","recursiveVisibleItems","child","isItemVisible"],"mappings":"AAuFA;;;CAGC,GACD;;;;;;;;;;;QAAgBA;;;QA2DHiB;;;;AA3DN,4BACLhB,eAAwB,EAAE;IAE1B,MAAMC,OAAOC;IACb,MAAMC,gBAAgB,IAAIC,IAA4D;QAAC;YAACH,KAAKI,KAAK;YAAEJ;SAAK;KAAC;IAE1G,MAAMK,eAAoD;QACxDL;QACA,IAAIM,QAAO;YACT,OAAOJ,cAAcI,IAAI;QAC3B;QACAC,WAAWC,CAAAA;gBAAON,oBAAAA;gBAAkBA;oBAAlBA,qBAAAA,cAAcO,GAAG,CAAA,CAAA,OAAA,CAACP,sBAAAA,cAAcO,GAAG,CAACD,IAAAA,MAAAA,QAAlBN,wBAAAA,KAAAA,IAAAA,KAAAA,IAAAA,oBAAwBQ,WAAAA,AAAW,MAAA,QAAA,SAAA,KAAA,IAAA,OAAIV,KAAKI,MAAK,MAAA,QAAnEF,uBAAAA,KAAAA,IAAAA,qBAAwEF;;QAC1FS,KAAKD,CAAAA,MAAON,cAAcO,GAAG,CAACD;QAC9BG,KAAKH,CAAAA,MAAON,cAAcS,GAAG,CAACH;QAC9BI,KAAIC,KAAK;gBAyBKC;YAxBZ,MAAM,EAAEJ,cAAcK,kBAAkB,EAAE,GAAGD,yBAAyB,GAAGD;YACzE,MAAMG,aAAad,cAAcO,GAAG,CAACC;YACrC,IAAI,CAACM,YAAY;gBACf,IAAIC,QAAQC,GAAG,CAACC,QAAQ,KAAK,eAAe;oBAC1C,sCAAsC;oBACtCC,QAAQC,KAAK,CAAsB,CAAC;UAExB,EAAER,MAAMT,KAAK,CAAC,kJAC1B,CAAC;gBACH;gBACA;YACF;YACAY,WAAWM,QAAQ,GAAG;YAEtB,MAAMC,OAAgD;gBACpDnB,OAAOS,MAAMT,KAAK;gBAClBoB,kBAAkB,IAAO;wBACvB,GAAGV,uBAAuB;wBAC1BJ;wBACA,cAAca,KAAKE,KAAK;wBACxB,iBAAiBF,KAAKG,QAAQ;wBAC9B,gBAAgBV,WAAWW,cAAc,CAACC,MAAM;wBAChDN,UAAUC,KAAKD,QAAQ;qBACzB,CAAA;gBACAA,QAAQ,EAAA,CAAER,oCAAAA,wBAAwBQ,QAAAA,AAAQ,MAAA,QAAhCR,sCAAAA,KAAAA,IAAAA,oCAAoC;gBAC9CW,OAAOT,WAAWS,KAAK,GAAG;gBAC1Bf;gBACAiB,gBAAgB,EAAE;gBAClBE,OAAO,CAAC;gBACRH,UAAUV,WAAWW,cAAc,CAACG,IAAI,CAACjB,MAAMT,KAAK;YACtD;YACAF,cAAc6B,GAAG,CAACR,KAAKnB,KAAK,EAAEmB;QAChC;QACAS,SAASxB,CAAAA,MAAOyB,6BAA6BzB,KAAKH;QAClD6B,UAAU1B,CAAAA,MAAO2B,8BAA8B3B,KAAKH;QACpD+B,WAAW5B,CAAAA,MAAO6B,+BAA+B7B,KAAKH;QACtDiC,cAAcC,CAAAA,YAAaC,kCAAkCD,WAAWlC;IAC1E;IAEAN,aAAa0C,OAAO,CAACpC,aAAaO,GAAG;IAErC,OAAOP;AACT;AAEO,2BAA2B,wBAAwB;AAE1D,SAASJ;IACP,OAAO;QACLS,aAAagC;QACbtC,OAAOW;QACPO,UAAU;QACVE,kBAAkB;YAChB,IAAIP,QAAQC,GAAG,CAACC,QAAQ,KAAK,cAAc;gBACzC,sCAAsC;gBACtCC,QAAQC,KAAK,CAAsB,CAAC;yEAGpC,CAAC;YACH;YACA,OAAO;gBACLsB,IAAI5B;gBACJL,aAAagC;gBACbtC,OAAOW;gBACP,gBAAgB,CAAC;gBACjB,cAAc,CAAC;gBACf,iBAAiB,CAAC;gBAClBO,UAAU;YACZ;QACF;QACAK,gBAAgB,EAAE;QAClB,IAAIE,SAAQ;YACV,IAAIZ,QAAQC,GAAG,CAACC,QAAQ,KAAK,cAAc;gBACzC,sCAAsC;gBACtCC,QAAQC,KAAK,CAAsB,CAAC;yEAGpC,CAAC;YACH;YACA,OAAO,CAAC;QACV;QACA,IAAIK,YAAW;YACb,IAAIT,QAAQC,GAAG,CAACC,QAAQ,KAAK,cAAc;gBACzC,sCAAsC;gBACtCC,QAAQC,KAAK,CAAsB,CAAC;yEAGpC,CAAC;YACH;YACA,OAAO,CAAC;QACV;QACAI,OAAO;IACT;AACF;AAEA;;;CAGC,GACD,gEAAgE;AAChE,UAAUQ,6BACRzB,GAAkB,EAClBoC,gBAAqC;IAErC,MAAMrB,OAAOqB,iBAAiBnC,GAAG,CAACD;IAClC,IAAI,CAACe,QAAQA,KAAKI,cAAc,CAACC,MAAM,KAAK,GAAG;QAC7C;IACF;IACA,KAAK,MAAMiB,cAActB,KAAKI,cAAc,CAAE;QAC5C,MAAMiB,iBAAiBnC,GAAG,CAACoC;QAC3B,OAAOZ,6BAA6BY,YAAYD;IAClD;AACF;AAEA;;;CAGC,GACD,gEAAgE;AAChE,UAAUT,8BACR3B,GAAkB,EAClBoC,gBAAqC;IAErC,MAAMrB,OAAOqB,iBAAiBnC,GAAG,CAACD;IAClC,IAAI,CAACe,QAAQA,KAAKI,cAAc,CAACC,MAAM,KAAK,GAAG;QAC7C;IACF;IACA,KAAK,MAAMiB,cAActB,KAAKI,cAAc,CAAE;QAC5C,MAAMiB,iBAAiBnC,GAAG,CAACoC;IAC7B;AACF;AAEA;;;CAGC,GACD,gEAAgE;AAChE,UAAUR,+BACR7B,GAAkB,EAClBoC,gBAAqC;IAErC,IAAIE,SAASF,iBAAiBrC,SAAS,CAACC;IACxC,MAAOsC,WAAWF,iBAAiB5C,IAAI,CAAE;QACvC,MAAM8C;QACNA,SAASF,iBAAiBrC,SAAS,CAACuC,OAAO1C,KAAK;IAClD;AACF;AAEA;;;CAGC,GACD,gEAAgE;AAChE,UAAUoC,kCACRD,SAAsC,EACtCK,gBAAqC;IAErC,IAAIf,QAAQ;IACZ,KAAK,MAAMN,QAAQwB,sBAAsBH,iBAAiB5C,IAAI,CAACI,KAAK,EAAEmC,WAAWK,kBAAmB;QAClGrB,KAAKM,KAAK,GAAGA;QACb,MAAMN;IACR;AACF;AAEA,UAAUwB,sBACRrC,WAA0B,EAC1B6B,SAAsC,EACtCK,gBAAqC;IAErC,MAAME,SAASF,iBAAiBnC,GAAG,CAACC;IACpC,IAAI,CAACoC,UAAUA,OAAOnB,cAAc,CAACC,MAAM,KAAK,GAAG;QACjD;IACF;IAEA,KAAK,MAAMiB,cAAcC,OAAOnB,cAAc,CAAE;QAC9C,MAAMqB,QAAQJ,iBAAiBnC,GAAG,CAACoC;QACnC,IAAI,CAACG,OAAO;YACV;QACF;QAEA,IAAIC,cAAcD,OAAOT,WAAWK,mBAAmB;YACrD,MAAMI;YAEN,2DAA2D;YAC3D,sEAAsE;YACtE,0CAA0C;YAC1C,IAAIT,UAAU5B,GAAG,CAACkC,aAAa;gBAC7B,OAAOE,sBAAsBF,YAAYN,WAAWK;YACtD;QACF;IACF;AACF;AAEA,SAASK,cACP1B,IAA6C,EAC7CgB,SAAsC,EACtCK,gBAAqD;IAErD,IAAIrB,KAAKE,KAAK,KAAK,GAAG;QACpB,OAAO;IACT;IACA,MAAOF,KAAKb,WAAW,IAAIa,KAAKb,WAAW,KAAKkC,iBAAiB5C,IAAI,CAACI,KAAK,CAAE;QAC3E,IAAI,CAACmC,UAAU5B,GAAG,CAACY,KAAKb,WAAW,GAAG;YACpC,OAAO;QACT;QACA,MAAMoC,SAASF,iBAAiBnC,GAAG,CAACc,KAAKb,WAAW;QACpD,IAAI,CAACoC,QAAQ;YACX,OAAO;QACT;QACAvB,OAAOuB;IACT;IACA,OAAO;AACT"}
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/utils/flattenTree.ts"],"sourcesContent":["import type { HeadlessFlatTreeItemProps } from '../FlatTree';\nimport type { TreeItemProps, TreeItemValue } from '../TreeItem';\n\nexport type FlattenTreeItem<Props extends TreeItemProps> = Omit<Props, 'subtree' | 'itemType'> & {\n value: TreeItemValue;\n subtree?: FlattenTreeItem<Props>[];\n};\n\nexport type FlattenedTreeItem<Props extends TreeItemProps> = HeadlessFlatTreeItemProps & Props;\n\nfunction flattenTreeRecursive<Props extends TreeItemProps>(\n items: FlattenTreeItem<Props>[],\n parent?: HeadlessFlatTreeItemProps & Props,\n level = 1,\n): FlattenedTreeItem<Props>[] {\n return items.reduce<FlattenedTreeItem<Props>[]>((acc, { subtree, ...item }, index) => {\n const flatTreeItem = {\n 'aria-level': level,\n 'aria-posinset': index + 1,\n 'aria-setsize': items.length,\n parentValue: parent?.value,\n ...item,\n } as FlattenedTreeItem<Props>;\n acc.push(flatTreeItem);\n if (subtree !== undefined) {\n acc.push(...flattenTreeRecursive<Props>(subtree, flatTreeItem, level + 1));\n }\n return acc;\n }, []);\n}\n\n/**\n * Converts a nested structure to a flat one which can be consumed by `useFlatTreeItems`\n * @example\n * ```tsx\n * const defaultItems = flattenTree_unstable([\n * {\n * children: <TreeItemLayout>level 1, item 1</TreeItemLayout>,\n * subtree: [\n * {\n * children: <TreeItemLayout>level 2, item 1</TreeItemLayout>,\n * },\n * {\n * children: <TreeItemLayout>level 2, item 2</TreeItemLayout>,\n * },\n * {\n * children: <TreeItemLayout>level 2, item 3</TreeItemLayout>,\n * },\n * ],\n * },\n * {\n * children: <TreeItemLayout>level 1, item 2</TreeItemLayout>,\n * subtree: [\n * {\n * children: <TreeItemLayout>level 2, item 1</TreeItemLayout>,\n * subtree: [\n * {\n * children: <TreeItemLayout>level 3, item 1</TreeItemLayout>,\n * subtree: [\n * {\n * children: <TreeItemLayout>level 4, item 1</TreeItemLayout>,\n * },\n * ],\n * },\n * ],\n * },\n * ],\n * },\n * ]);\n * ```\n */\n// eslint-disable-next-line @typescript-eslint/naming-convention\nexport const flattenTree_unstable = <Props extends TreeItemProps>(\n items: FlattenTreeItem<Props>[],\n): FlattenedTreeItem<Props>[] => flattenTreeRecursive(items);\n"],"names":["flattenTreeRecursive","items","parent","level","reduce","acc","subtree","item","index","flatTreeItem","length","parentValue","value","push","undefined","flattenTree_unstable"],"mappings":";;;;;;;;;;AAUA,SAASA,qBACPC,KAA+B,EAC/BC,MAA0C,EAC1CC,QAAQ,CAAC;IAET,OAAOF,MAAMG,MAAM,CAA6B,CAACC,KAAK,EAAEC,OAAO,EAAE,GAAGC,MAAM,EAAEC;QAC1E,MAAMC,eAAe;YACnB,cAAcN;YACd,iBAAiBK,QAAQ;YACzB,gBAAgBP,MAAMS,MAAM;YAC5BC,WAAW,EAAET,WAAAA,QAAAA,WAAAA,KAAAA,IAAAA,KAAAA,IAAAA,OAAQU,KAAK;YAC1B,GAAGL,IAAI;QACT;QACAF,IAAIQ,IAAI,CAACJ;QACT,IAAIH,YAAYQ,WAAW;YACzBT,IAAIQ,IAAI,IAAIb,qBAA4BM,SAASG,cAAcN,QAAQ;QACzE;QACA,OAAOE;IACT,GAAG,EAAE;AACP;AA2CO,MAAMU,uBAAuB,CAClCd,QAC+BD,qBAAqBC,OAAO"}
1
+ {"version":3,"sources":["../../src/utils/flattenTree.ts"],"sourcesContent":["import type { HeadlessFlatTreeItemProps } from '../FlatTree';\nimport type { TreeItemProps, TreeItemValue } from '../TreeItem';\n\nexport type FlattenTreeItem<Props extends TreeItemProps> = Omit<Props, 'subtree' | 'itemType'> & {\n value: TreeItemValue;\n subtree?: FlattenTreeItem<Props>[];\n};\n\nexport type FlattenedTreeItem<Props extends TreeItemProps> = HeadlessFlatTreeItemProps & Props;\n\nfunction flattenTreeRecursive<Props extends TreeItemProps>(\n items: FlattenTreeItem<Props>[],\n parent?: HeadlessFlatTreeItemProps & Props,\n level = 1,\n): FlattenedTreeItem<Props>[] {\n return items.reduce<FlattenedTreeItem<Props>[]>((acc, { subtree, ...item }, index) => {\n const flatTreeItem = {\n 'aria-level': level,\n 'aria-posinset': index + 1,\n 'aria-setsize': items.length,\n parentValue: parent?.value,\n ...item,\n } as FlattenedTreeItem<Props>;\n acc.push(flatTreeItem);\n if (subtree !== undefined) {\n acc.push(...flattenTreeRecursive<Props>(subtree, flatTreeItem, level + 1));\n }\n return acc;\n }, []);\n}\n\n/**\n * Converts a nested structure to a flat one which can be consumed by `useFlatTreeItems`\n * @example\n * ```tsx\n * const defaultItems = flattenTree_unstable([\n * {\n * children: <TreeItemLayout>level 1, item 1</TreeItemLayout>,\n * subtree: [\n * {\n * children: <TreeItemLayout>level 2, item 1</TreeItemLayout>,\n * },\n * {\n * children: <TreeItemLayout>level 2, item 2</TreeItemLayout>,\n * },\n * {\n * children: <TreeItemLayout>level 2, item 3</TreeItemLayout>,\n * },\n * ],\n * },\n * {\n * children: <TreeItemLayout>level 1, item 2</TreeItemLayout>,\n * subtree: [\n * {\n * children: <TreeItemLayout>level 2, item 1</TreeItemLayout>,\n * subtree: [\n * {\n * children: <TreeItemLayout>level 3, item 1</TreeItemLayout>,\n * subtree: [\n * {\n * children: <TreeItemLayout>level 4, item 1</TreeItemLayout>,\n * },\n * ],\n * },\n * ],\n * },\n * ],\n * },\n * ]);\n * ```\n */\n// eslint-disable-next-line @typescript-eslint/naming-convention\nexport const flattenTree_unstable = <Props extends TreeItemProps>(\n items: FlattenTreeItem<Props>[],\n): FlattenedTreeItem<Props>[] => flattenTreeRecursive(items);\n"],"names":["flattenTreeRecursive","items","parent","level","reduce","acc","subtree","item","index","flatTreeItem","length","parentValue","value","push","undefined","flattenTree_unstable"],"mappings":";;;;;;;;;;AAUA,SAASA,qBACPC,KAA+B,EAC/BC,MAA0C,EAC1CC,QAAQ,CAAC;IAET,OAAOF,MAAMG,MAAM,CAA6B,CAACC,KAAK,EAAEC,OAAO,EAAE,GAAGC,MAAM,EAAEC;QAC1E,MAAMC,eAAe;YACnB,cAAcN;YACd,iBAAiBK,QAAQ;YACzB,gBAAgBP,MAAMS,MAAM;YAC5BC,WAAW,EAAET,WAAAA,QAAAA,WAAAA,KAAAA,IAAAA,KAAAA,IAAAA,OAAQU,KAAK;YAC1B,GAAGL,IAAI;QACT;QACAF,IAAIQ,IAAI,CAACJ;QACT,IAAIH,YAAYQ,WAAW;YACzBT,IAAIQ,IAAI,IAAIb,qBAA4BM,SAASG,cAAcN,QAAQ;QACzE;QACA,OAAOE;IACT,GAAG,EAAE;AACP;AA2CO,MAAMU,uBAAuB,CAClCd,QAC+BD,qBAAqBC,OAAO"}
@@ -5,14 +5,14 @@ Object.defineProperty(exports, "__esModule", {
5
5
  function _export(target, all) {
6
6
  for(var name in all)Object.defineProperty(target, name, {
7
7
  enumerable: true,
8
- get: all[name]
8
+ get: Object.getOwnPropertyDescriptor(all, name).get
9
9
  });
10
10
  }
11
11
  _export(exports, {
12
- dataTreeItemValueAttrName: function() {
12
+ get dataTreeItemValueAttrName () {
13
13
  return dataTreeItemValueAttrName;
14
14
  },
15
- getTreeItemValueFromElement: function() {
15
+ get getTreeItemValueFromElement () {
16
16
  return getTreeItemValueFromElement;
17
17
  }
18
18
  });
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/utils/getTreeItemValueFromElement.ts"],"sourcesContent":["import type { TreeItemValue } from '../TreeItem';\n\nexport const dataTreeItemValueAttrName = 'data-fui-tree-item-value';\n\nexport const getTreeItemValueFromElement = (element: HTMLElement): TreeItemValue | null => {\n return element.getAttribute(dataTreeItemValueAttrName) as TreeItemValue | null;\n};\n"],"names":["dataTreeItemValueAttrName","getTreeItemValueFromElement","element","getAttribute"],"mappings":";;;;;;;;;;;6BAEaA;;;+BAEAC;;;;AAFN,MAAMD,4BAA4B,2BAA2B;AAE7D,MAAMC,8BAA8B,CAACC;IAC1C,OAAOA,QAAQC,YAAY,CAACH;AAC9B,EAAE"}
1
+ {"version":3,"sources":["../../src/utils/getTreeItemValueFromElement.ts"],"sourcesContent":["import type { TreeItemValue } from '../TreeItem';\n\nexport const dataTreeItemValueAttrName = 'data-fui-tree-item-value';\n\nexport const getTreeItemValueFromElement = (element: HTMLElement): TreeItemValue | null => {\n return element.getAttribute(dataTreeItemValueAttrName) as TreeItemValue | null;\n};\n"],"names":["dataTreeItemValueAttrName","getTreeItemValueFromElement","element","getAttribute"],"mappings":";;;;;;;;;;;;;;;;;;AAEO,MAAMA,4BAA4B,2BAA2B;AAE7D,MAAMC,8BAA8B,CAACC;IAC1C,OAAOA,QAAQC,YAAY,CAACH;AAC9B,EAAE"}
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/utils/nextTypeAheadElement.ts"],"sourcesContent":["import type { HTMLElementWalker } from './createHTMLElementWalker';\n\nexport function nextTypeAheadElement(treeWalker: HTMLElementWalker, key: string): HTMLElement | null {\n const keyToLowerCase = key.toLowerCase();\n const typeAheadFilter = (element: HTMLElement) => {\n return element.textContent?.trim().charAt(0).toLowerCase() === keyToLowerCase\n ? NodeFilter.FILTER_ACCEPT\n : NodeFilter.FILTER_SKIP;\n };\n let nextElement = treeWalker.nextElement(typeAheadFilter);\n if (!nextElement) {\n treeWalker.currentElement = treeWalker.root;\n nextElement = treeWalker.nextElement(typeAheadFilter);\n }\n return nextElement;\n}\n"],"names":["nextTypeAheadElement","treeWalker","key","keyToLowerCase","toLowerCase","typeAheadFilter","element","textContent","trim","charAt","NodeFilter","FILTER_ACCEPT","FILTER_SKIP","nextElement","currentElement","root"],"mappings":";;;;+BAEgBA;;;;;;AAAT,8BAA8BC,UAA6B,EAAEC,GAAW;IAC7E,MAAMC,iBAAiBD,IAAIE,WAAW;IACtC,MAAMC,kBAAkB,CAACC;YAChBA;QAAP,OAAOA,CAAAA,CAAAA,uBAAAA,QAAQC,WAAAA,AAAW,MAAA,QAAnBD,yBAAAA,KAAAA,IAAAA,KAAAA,IAAAA,qBAAqBE,IAAI,GAAGC,MAAM,CAAC,GAAGL,WAAW,EAAA,MAAOD,iBAC3DO,WAAWC,aAAa,GACxBD,WAAWE,WAAW;IAC5B;IACA,IAAIC,cAAcZ,WAAWY,WAAW,CAACR;IACzC,IAAI,CAACQ,aAAa;QAChBZ,WAAWa,cAAc,GAAGb,WAAWc,IAAI;QAC3CF,cAAcZ,WAAWY,WAAW,CAACR;IACvC;IACA,OAAOQ;AACT"}
1
+ {"version":3,"sources":["../../src/utils/nextTypeAheadElement.ts"],"sourcesContent":["import type { HTMLElementWalker } from './createHTMLElementWalker';\n\nexport function nextTypeAheadElement(treeWalker: HTMLElementWalker, key: string): HTMLElement | null {\n const keyToLowerCase = key.toLowerCase();\n const typeAheadFilter = (element: HTMLElement) => {\n return element.textContent?.trim().charAt(0).toLowerCase() === keyToLowerCase\n ? NodeFilter.FILTER_ACCEPT\n : NodeFilter.FILTER_SKIP;\n };\n let nextElement = treeWalker.nextElement(typeAheadFilter);\n if (!nextElement) {\n treeWalker.currentElement = treeWalker.root;\n nextElement = treeWalker.nextElement(typeAheadFilter);\n }\n return nextElement;\n}\n"],"names":["nextTypeAheadElement","treeWalker","key","keyToLowerCase","toLowerCase","typeAheadFilter","element","textContent","trim","charAt","NodeFilter","FILTER_ACCEPT","FILTER_SKIP","nextElement","currentElement","root"],"mappings":";;;;+BAEgBA;;;;;;AAAT,8BAA8BC,UAA6B,EAAEC,GAAW;IAC7E,MAAMC,iBAAiBD,IAAIE,WAAW;IACtC,MAAMC,kBAAkB,CAACC;YAChBA;QAAP,OAAOA,CAAAA,CAAAA,uBAAAA,QAAQC,WAAAA,AAAW,MAAA,QAAnBD,yBAAAA,KAAAA,IAAAA,KAAAA,IAAAA,qBAAqBE,IAAI,GAAGC,MAAM,CAAC,GAAGL,WAAW,EAAA,MAAOD,iBAC3DO,WAAWC,aAAa,GACxBD,WAAWE,WAAW;IAC5B;IACA,IAAIC,cAAcZ,WAAWY,WAAW,CAACR;IACzC,IAAI,CAACQ,aAAa;QAChBZ,WAAWa,cAAc,GAAGb,WAAWc,IAAI;QAC3CF,cAAcZ,WAAWY,WAAW,CAACR;IACvC;IACA,OAAOQ;AACT"}
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/utils/normalizeOpenItems.ts"],"sourcesContent":["export function normalizeOpenItems(\n openSubtrees?: string | string[],\n options?: {\n keepUndefined?: false;\n },\n): string[];\n\nexport function normalizeOpenItems(\n openSubtrees?: string | string[],\n options?: {\n keepUndefined: true;\n },\n): string[] | undefined;\n\nexport function normalizeOpenItems(\n openSubtrees?: string | string[],\n options?: {\n keepUndefined?: boolean;\n },\n): string[] | undefined {\n if (!openSubtrees) {\n return options?.keepUndefined ? undefined : [];\n }\n return Array.isArray(openSubtrees) ? openSubtrees : [openSubtrees];\n}\n"],"names":["normalizeOpenItems","openSubtrees","options","keepUndefined","undefined","Array","isArray"],"mappings":";;;;+BAcgBA;;;;;;AAAT,4BACLC,YAAgC,EAChCC,OAEC;IAED,IAAI,CAACD,cAAc;QACjB,OAAOC,CAAAA,YAAAA,QAAAA,YAAAA,KAAAA,IAAAA,KAAAA,IAAAA,QAASC,aAAAA,AAAa,IAAGC,YAAY,EAAE;IAChD;IACA,OAAOC,MAAMC,OAAO,CAACL,gBAAgBA,eAAe;QAACA;KAAa;AACpE"}
1
+ {"version":3,"sources":["../../src/utils/normalizeOpenItems.ts"],"sourcesContent":["export function normalizeOpenItems(\n openSubtrees?: string | string[],\n options?: {\n keepUndefined?: false;\n },\n): string[];\n\nexport function normalizeOpenItems(\n openSubtrees?: string | string[],\n options?: {\n keepUndefined: true;\n },\n): string[] | undefined;\n\nexport function normalizeOpenItems(\n openSubtrees?: string | string[],\n options?: {\n keepUndefined?: boolean;\n },\n): string[] | undefined {\n if (!openSubtrees) {\n return options?.keepUndefined ? undefined : [];\n }\n return Array.isArray(openSubtrees) ? openSubtrees : [openSubtrees];\n}\n"],"names":["normalizeOpenItems","openSubtrees","options","keepUndefined","undefined","Array","isArray"],"mappings":";;;;+BAcgBA;;;;;;AAAT,4BACLC,YAAgC,EAChCC,OAEC;IAED,IAAI,CAACD,cAAc;QACjB,OAAOC,CAAAA,YAAAA,QAAAA,YAAAA,KAAAA,IAAAA,KAAAA,IAAAA,QAASC,aAAAA,AAAa,IAAGC,YAAY,EAAE;IAChD;IACA,OAAOC,MAAMC,OAAO,CAACL,gBAAgBA,eAAe;QAACA;KAAa;AACpE"}
@@ -5,17 +5,17 @@ Object.defineProperty(exports, "__esModule", {
5
5
  function _export(target, all) {
6
6
  for(var name in all)Object.defineProperty(target, name, {
7
7
  enumerable: true,
8
- get: all[name]
8
+ get: Object.getOwnPropertyDescriptor(all, name).get
9
9
  });
10
10
  }
11
11
  _export(exports, {
12
- treeAvatarSize: function() {
12
+ get treeAvatarSize () {
13
13
  return treeAvatarSize;
14
14
  },
15
- treeDataTypes: function() {
15
+ get treeDataTypes () {
16
16
  return treeDataTypes;
17
17
  },
18
- treeItemLevelToken: function() {
18
+ get treeItemLevelToken () {
19
19
  return treeItemLevelToken;
20
20
  }
21
21
  });
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/utils/tokens.ts"],"sourcesContent":["import { ArrowDown, ArrowLeft, ArrowRight, ArrowUp, End, Home, Enter } from '@fluentui/keyboard-keys';\nimport type { TreeCheckedChangeData, TreeNavigationData_unstable, TreeOpenChangeData } from '../Tree';\n\nexport const treeItemLevelToken = '--fluent-TreeItem--level' as const;\n\nexport const treeAvatarSize = {\n medium: 32,\n small: 24,\n} as const;\n\nexport const treeDataTypes: {\n readonly [K in TreeOpenChangeData['type'] | TreeNavigationData_unstable['type'] | TreeCheckedChangeData['type']]: K;\n} = {\n ArrowLeft,\n ArrowRight,\n Enter,\n Click: 'Click',\n ExpandIconClick: 'ExpandIconClick',\n End,\n Home,\n ArrowUp,\n ArrowDown,\n TypeAhead: 'TypeAhead',\n Change: 'Change',\n};\n"],"names":["ArrowDown","ArrowLeft","ArrowRight","ArrowUp","End","Home","Enter","treeItemLevelToken","treeAvatarSize","medium","small","treeDataTypes","Click","ExpandIconClick","TypeAhead","Change"],"mappings":";;;;;;;;;;;IAKaQ,cAAAA;;;iBAKAG;;;sBAPAJ;;;;8BAH+D,0BAA0B;AAG/F,MAAMA,qBAAqB,2BAAoC;AAE/D,uBAAuB;IAC5BE,QAAQ;IACRC,OAAO;AACT,EAAW;AAEJ,MAAMC,gBAET;eACFV,uBAAAA;gBACAC,wBAAAA;WACAI,mBAAAA;IACAM,OAAO;IACPC,iBAAiB;SACjBT,iBAAAA;UACAC,kBAAAA;aACAF,qBAAAA;eACAH,uBAAAA;IACAc,WAAW;IACXC,QAAQ;AACV,EAAE"}
1
+ {"version":3,"sources":["../../src/utils/tokens.ts"],"sourcesContent":["import { ArrowDown, ArrowLeft, ArrowRight, ArrowUp, End, Home, Enter } from '@fluentui/keyboard-keys';\nimport type { TreeCheckedChangeData, TreeNavigationData_unstable, TreeOpenChangeData } from '../Tree';\n\nexport const treeItemLevelToken = '--fluent-TreeItem--level' as const;\n\nexport const treeAvatarSize = {\n medium: 32,\n small: 24,\n} as const;\n\nexport const treeDataTypes: {\n readonly [K in TreeOpenChangeData['type'] | TreeNavigationData_unstable['type'] | TreeCheckedChangeData['type']]: K;\n} = {\n ArrowLeft,\n ArrowRight,\n Enter,\n Click: 'Click',\n ExpandIconClick: 'ExpandIconClick',\n End,\n Home,\n ArrowUp,\n ArrowDown,\n TypeAhead: 'TypeAhead',\n Change: 'Change',\n};\n"],"names":["ArrowDown","ArrowLeft","ArrowRight","ArrowUp","End","Home","Enter","treeItemLevelToken","treeAvatarSize","medium","small","treeDataTypes","Click","ExpandIconClick","TypeAhead","Change"],"mappings":";;;;;;;;;;;QAKaQ;;;;;;;;;;8BAL+D,0BAA0B;AAG/F,MAAMD,qBAAqB,2BAAoC;AAE/D,uBAAuB;IAC5BE,QAAQ;IACRC,OAAO;AACT,EAAW;AAEJ,MAAMC,gBAET;eACFV,uBAAAA;gBACAC,wBAAAA;WACAI,mBAAAA;IACAM,OAAO;IACPC,iBAAiB;SACjBT,iBAAAA;UACAC,kBAAAA;aACAF,qBAAAA;eACAH,uBAAAA;IACAc,WAAW;IACXC,QAAQ;AACV,EAAE"}
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/utils/treeItemFilter.ts"],"sourcesContent":["export const treeItemFilter = (element: HTMLElement): number => {\n return element.getAttribute('role') === 'treeitem' ? NodeFilter.FILTER_ACCEPT : NodeFilter.FILTER_SKIP;\n};\n"],"names":["treeItemFilter","element","getAttribute","NodeFilter","FILTER_ACCEPT","FILTER_SKIP"],"mappings":";;;;;;;;;;AAAO,MAAMA,iBAAiB,CAACC;IAC7B,OAAOA,QAAQC,YAAY,CAAC,YAAY,aAAaC,WAAWC,aAAa,GAAGD,WAAWE,WAAW;AACxG,EAAE"}
1
+ {"version":3,"sources":["../../src/utils/treeItemFilter.ts"],"sourcesContent":["export const treeItemFilter = (element: HTMLElement): number => {\n return element.getAttribute('role') === 'treeitem' ? NodeFilter.FILTER_ACCEPT : NodeFilter.FILTER_SKIP;\n};\n"],"names":["treeItemFilter","element","getAttribute","NodeFilter","FILTER_ACCEPT","FILTER_SKIP"],"mappings":";;;;;;;;;;AAAO,MAAMA,iBAAiB,CAACC;IAC7B,OAAOA,QAAQC,YAAY,CAAC,YAAY,aAAaC,WAAWC,aAAa,GAAGD,WAAWE,WAAW;AACxG,EAAE"}
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@fluentui/react-tree",
3
- "version": "9.16.8",
3
+ "version": "9.16.10",
4
4
  "description": "Tree component for Fluent UI React",
5
5
  "main": "lib-commonjs/index.cjs",
6
6
  "module": "lib/index.js",
@@ -13,20 +13,20 @@
13
13
  "license": "MIT",
14
14
  "dependencies": {
15
15
  "@fluentui/keyboard-keys": "^9.0.9",
16
- "@fluentui/react-aria": "^9.17.15",
17
- "@fluentui/react-avatar": "^9.11.8",
18
- "@fluentui/react-button": "^9.11.1",
19
- "@fluentui/react-checkbox": "^9.6.5",
20
- "@fluentui/react-context-selector": "^9.2.20",
16
+ "@fluentui/react-aria": "^9.17.16",
17
+ "@fluentui/react-avatar": "^9.11.9",
18
+ "@fluentui/react-button": "^9.11.3",
19
+ "@fluentui/react-checkbox": "^9.6.6",
20
+ "@fluentui/react-context-selector": "^9.2.21",
21
21
  "@fluentui/react-icons": "^2.0.245",
22
- "@fluentui/react-jsx-runtime": "^9.4.6",
23
- "@fluentui/react-motion": "^9.16.4",
24
- "@fluentui/react-motion-components-preview": "^0.15.9",
25
- "@fluentui/react-radio": "^9.6.6",
22
+ "@fluentui/react-jsx-runtime": "^9.4.7",
23
+ "@fluentui/react-motion": "^9.16.5",
24
+ "@fluentui/react-motion-components-preview": "^0.15.10",
25
+ "@fluentui/react-radio": "^9.6.7",
26
26
  "@fluentui/react-shared-contexts": "^9.26.4",
27
- "@fluentui/react-tabster": "^9.26.18",
27
+ "@fluentui/react-tabster": "^9.26.19",
28
28
  "@fluentui/react-theme": "^9.2.2",
29
- "@fluentui/react-utilities": "^9.26.7",
29
+ "@fluentui/react-utilities": "^9.27.0",
30
30
  "@griffel/react": "^1.5.32",
31
31
  "@swc/helpers": "^0.5.1"
32
32
  },