@fluentui/react-tree 9.7.7 → 9.7.8
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +11 -2
- package/dist/index.d.ts +54 -84
- package/lib/components/FlatTree/useFlatControllableCheckedItems.js +15 -13
- package/lib/components/FlatTree/useFlatControllableCheckedItems.js.map +1 -1
- package/lib/components/FlatTree/useHeadlessFlatTree.js +4 -2
- package/lib/components/FlatTree/useHeadlessFlatTree.js.map +1 -1
- package/lib/components/Tree/useNestedControllableCheckedItems.js +1 -1
- package/lib/components/Tree/useNestedControllableCheckedItems.js.map +1 -1
- package/lib/components/Tree/useTree.js +4 -2
- package/lib/components/Tree/useTree.js.map +1 -1
- package/lib/hooks/useControllableOpenItems.js +3 -12
- package/lib/hooks/useControllableOpenItems.js.map +1 -1
- package/lib/hooks/useRootTree.js +5 -4
- package/lib/hooks/useRootTree.js.map +1 -1
- package/lib/utils/ImmutableMap.js +71 -40
- package/lib/utils/ImmutableMap.js.map +1 -1
- package/lib/utils/ImmutableSet.js +65 -44
- package/lib/utils/ImmutableSet.js.map +1 -1
- package/lib/utils/createCheckedItems.js +5 -17
- package/lib/utils/createCheckedItems.js.map +1 -1
- package/lib-commonjs/components/FlatTree/useFlatControllableCheckedItems.js +15 -13
- package/lib-commonjs/components/FlatTree/useFlatControllableCheckedItems.js.map +1 -1
- package/lib-commonjs/components/FlatTree/useHeadlessFlatTree.js +4 -2
- package/lib-commonjs/components/FlatTree/useHeadlessFlatTree.js.map +1 -1
- package/lib-commonjs/components/Tree/useNestedControllableCheckedItems.js +1 -1
- package/lib-commonjs/components/Tree/useNestedControllableCheckedItems.js.map +1 -1
- package/lib-commonjs/components/Tree/useTree.js +4 -2
- package/lib-commonjs/components/Tree/useTree.js.map +1 -1
- package/lib-commonjs/hooks/useControllableOpenItems.js +3 -12
- package/lib-commonjs/hooks/useControllableOpenItems.js.map +1 -1
- package/lib-commonjs/hooks/useRootTree.js +5 -4
- package/lib-commonjs/hooks/useRootTree.js.map +1 -1
- package/lib-commonjs/utils/ImmutableMap.js +71 -40
- package/lib-commonjs/utils/ImmutableMap.js.map +1 -1
- package/lib-commonjs/utils/ImmutableSet.js +61 -45
- package/lib-commonjs/utils/ImmutableSet.js.map +1 -1
- package/lib-commonjs/utils/createCheckedItems.js +5 -17
- package/lib-commonjs/utils/createCheckedItems.js.map +1 -1
- package/package.json +1 -1
- package/lib/utils/createOpenItems.js +0 -10
- package/lib/utils/createOpenItems.js.map +0 -1
- package/lib-commonjs/utils/createOpenItems.js +0 -20
- package/lib-commonjs/utils/createOpenItems.js.map +0 -1
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["useNestedControllableCheckedItems.ts"],"sourcesContent":["import * as React from 'react';\nimport type { TreeCheckedChangeData, TreeProps } from './Tree.types';\nimport { ImmutableMap } from '../../utils/ImmutableMap';\nimport { createCheckedItems } from '../../utils/createCheckedItems';\nimport { TreeItemValue } from '../TreeItem/TreeItem.types';\n\nexport function useNestedCheckedItems(props: Pick<TreeProps, 'checkedItems'>) {\n return React.useMemo(() => createCheckedItems(props.checkedItems), [props.checkedItems]);\n}\n\nexport function createNextNestedCheckedItems(\n data: Pick<TreeCheckedChangeData, 'selectionMode' | 'value' | 'checked'>,\n previousCheckedItems: ImmutableMap<TreeItemValue, 'mixed' | boolean>,\n): ImmutableMap<TreeItemValue, 'mixed' | boolean> {\n if (data.selectionMode === 'single') {\n return ImmutableMap.
|
|
1
|
+
{"version":3,"sources":["useNestedControllableCheckedItems.ts"],"sourcesContent":["import * as React from 'react';\nimport type { TreeCheckedChangeData, TreeProps } from './Tree.types';\nimport { ImmutableMap } from '../../utils/ImmutableMap';\nimport { createCheckedItems } from '../../utils/createCheckedItems';\nimport { TreeItemValue } from '../TreeItem/TreeItem.types';\n\nexport function useNestedCheckedItems(props: Pick<TreeProps, 'checkedItems'>) {\n return React.useMemo(() => createCheckedItems(props.checkedItems), [props.checkedItems]);\n}\n\nexport function createNextNestedCheckedItems(\n data: Pick<TreeCheckedChangeData, 'selectionMode' | 'value' | 'checked'>,\n previousCheckedItems: ImmutableMap<TreeItemValue, 'mixed' | boolean>,\n): ImmutableMap<TreeItemValue, 'mixed' | boolean> {\n if (data.selectionMode === 'single') {\n return ImmutableMap.from([[data.value, data.checked]]);\n }\n if (data.selectionMode === 'multiselect') {\n return previousCheckedItems.set(data.value, data.checked);\n }\n return previousCheckedItems;\n}\n"],"names":["createNextNestedCheckedItems","useNestedCheckedItems","props","React","useMemo","createCheckedItems","checkedItems","data","previousCheckedItems","selectionMode","ImmutableMap","from","value","checked","set"],"rangeMappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;","mappings":";;;;;;;;;;;IAUgBA,4BAAAA;eAAAA;;IAJAC,qBAAAA;eAAAA;;;;iEANO;8BAEM;oCACM;AAG5B,SAASA,sBAAsBC,KAAsC;IAC1E,OAAOC,OAAMC,OAAO,CAAC,IAAMC,IAAAA,sCAAAA,EAAmBH,MAAMI,YAAY,GAAG;QAACJ,MAAMI,YAAY;KAAC;AACzF;AAEO,SAASN,6BACdO,IAAwE,EACxEC,oBAAoE;IAEpE,IAAID,KAAKE,aAAa,KAAK,UAAU;QACnC,OAAOC,0BAAAA,CAAaC,IAAI,CAAC;YAAC;gBAACJ,KAAKK,KAAK;gBAAEL,KAAKM,OAAO;aAAC;SAAC;IACvD;IACA,IAAIN,KAAKE,aAAa,KAAK,eAAe;QACxC,OAAOD,qBAAqBM,GAAG,CAACP,KAAKK,KAAK,EAAEL,KAAKM,OAAO;IAC1D;IACA,OAAOL;AACT"}
|
|
@@ -18,6 +18,8 @@ const _useRootTree = require("../../hooks/useRootTree");
|
|
|
18
18
|
const _useSubtree = require("../../hooks/useSubtree");
|
|
19
19
|
const _useTreeNavigation = require("../../hooks/useTreeNavigation");
|
|
20
20
|
const _treeContext = require("../../contexts/treeContext");
|
|
21
|
+
const _ImmutableSet = require("../../utils/ImmutableSet");
|
|
22
|
+
const _ImmutableMap = require("../../utils/ImmutableMap");
|
|
21
23
|
const useTree_unstable = (props, ref)=>{
|
|
22
24
|
'use no memo';
|
|
23
25
|
const isRoot = _react.useContext(_subtreeContext.SubtreeContext) === undefined;
|
|
@@ -40,7 +42,7 @@ function useNestedRootTree(props, ref) {
|
|
|
40
42
|
const nextOpenItems = (0, _useControllableOpenItems.createNextOpenItems)(data, openItems);
|
|
41
43
|
(_props_onOpenChange = props.onOpenChange) === null || _props_onOpenChange === void 0 ? void 0 : _props_onOpenChange.call(props, event, {
|
|
42
44
|
...data,
|
|
43
|
-
openItems:
|
|
45
|
+
openItems: _ImmutableSet.ImmutableSet.dangerouslyGetInternalSet(nextOpenItems)
|
|
44
46
|
});
|
|
45
47
|
setOpenItems(nextOpenItems);
|
|
46
48
|
}),
|
|
@@ -58,7 +60,7 @@ function useNestedRootTree(props, ref) {
|
|
|
58
60
|
const nextCheckedItems = (0, _useNestedControllableCheckedItems.createNextNestedCheckedItems)(data, checkedItems);
|
|
59
61
|
(_props_onCheckedChange = props.onCheckedChange) === null || _props_onCheckedChange === void 0 ? void 0 : _props_onCheckedChange.call(props, event, {
|
|
60
62
|
...data,
|
|
61
|
-
checkedItems:
|
|
63
|
+
checkedItems: _ImmutableMap.ImmutableMap.dangerouslyGetInternalMap(nextCheckedItems)
|
|
62
64
|
});
|
|
63
65
|
})
|
|
64
66
|
}, (0, _reactutilities.useMergedRefs)(ref, navigation.treeRef)), {
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["useTree.ts"],"sourcesContent":["import * as React from 'react';\nimport { useEventCallback, useMergedRefs } from '@fluentui/react-utilities';\nimport type { TreeProps, TreeState } from './Tree.types';\nimport { createNextOpenItems, useControllableOpenItems } from '../../hooks/useControllableOpenItems';\nimport { createNextNestedCheckedItems, useNestedCheckedItems } from './useNestedControllableCheckedItems';\nimport { SubtreeContext } from '../../contexts/subtreeContext';\nimport { useRootTree } from '../../hooks/useRootTree';\nimport { useSubtree } from '../../hooks/useSubtree';\nimport { useTreeNavigation } from '../../hooks/useTreeNavigation';\nimport { useTreeContext_unstable } from '../../contexts/treeContext';\n\nexport const useTree_unstable = (props: TreeProps, ref: React.Ref<HTMLElement>): TreeState => {\n 'use no memo';\n\n const isRoot = React.useContext(SubtreeContext) === undefined;\n // as level is static, this doesn't break rule of hooks\n // and if this becomes an issue later on, this can be easily converted\n // eslint-disable-next-line react-hooks/rules-of-hooks\n return isRoot ? useNestedRootTree(props, ref) : useNestedSubtree(props, ref);\n};\n\nfunction useNestedRootTree(props: TreeProps, ref: React.Ref<HTMLElement>): TreeState {\n 'use no memo';\n\n const [openItems, setOpenItems] = useControllableOpenItems(props);\n const checkedItems = useNestedCheckedItems(props);\n const navigation = useTreeNavigation();\n\n return Object.assign(\n useRootTree(\n {\n ...props,\n openItems,\n checkedItems,\n onOpenChange: useEventCallback((event, data) => {\n const nextOpenItems = createNextOpenItems(data, openItems);\n props.onOpenChange?.(event, {\n ...data,\n openItems:
|
|
1
|
+
{"version":3,"sources":["useTree.ts"],"sourcesContent":["import * as React from 'react';\nimport { useEventCallback, useMergedRefs } from '@fluentui/react-utilities';\nimport type { TreeProps, TreeState } from './Tree.types';\nimport { createNextOpenItems, useControllableOpenItems } from '../../hooks/useControllableOpenItems';\nimport { createNextNestedCheckedItems, useNestedCheckedItems } from './useNestedControllableCheckedItems';\nimport { SubtreeContext } from '../../contexts/subtreeContext';\nimport { useRootTree } from '../../hooks/useRootTree';\nimport { useSubtree } from '../../hooks/useSubtree';\nimport { useTreeNavigation } from '../../hooks/useTreeNavigation';\nimport { useTreeContext_unstable } from '../../contexts/treeContext';\nimport { ImmutableSet } from '../../utils/ImmutableSet';\nimport { ImmutableMap } from '../../utils/ImmutableMap';\n\nexport const useTree_unstable = (props: TreeProps, ref: React.Ref<HTMLElement>): TreeState => {\n 'use no memo';\n\n const isRoot = React.useContext(SubtreeContext) === undefined;\n // as level is static, this doesn't break rule of hooks\n // and if this becomes an issue later on, this can be easily converted\n // eslint-disable-next-line react-hooks/rules-of-hooks\n return isRoot ? useNestedRootTree(props, ref) : useNestedSubtree(props, ref);\n};\n\nfunction useNestedRootTree(props: TreeProps, ref: React.Ref<HTMLElement>): TreeState {\n 'use no memo';\n\n const [openItems, setOpenItems] = useControllableOpenItems(props);\n const checkedItems = useNestedCheckedItems(props);\n const navigation = useTreeNavigation();\n\n return Object.assign(\n useRootTree(\n {\n ...props,\n openItems,\n checkedItems,\n onOpenChange: useEventCallback((event, data) => {\n const nextOpenItems = createNextOpenItems(data, openItems);\n props.onOpenChange?.(event, {\n ...data,\n openItems: ImmutableSet.dangerouslyGetInternalSet(nextOpenItems),\n });\n setOpenItems(nextOpenItems);\n }),\n onNavigation: useEventCallback((event, data) => {\n props.onNavigation?.(event, data);\n if (!event.isDefaultPrevented()) {\n navigation.navigate(data, {\n preventScroll: data.isScrollPrevented(),\n });\n }\n }),\n onCheckedChange: useEventCallback((event, data) => {\n const nextCheckedItems = createNextNestedCheckedItems(data, checkedItems);\n props.onCheckedChange?.(event, {\n ...data,\n checkedItems: ImmutableMap.dangerouslyGetInternalMap(nextCheckedItems),\n });\n }),\n },\n useMergedRefs(ref, navigation.treeRef),\n ),\n { treeType: 'nested' } as const,\n );\n}\n\nfunction useNestedSubtree(props: TreeProps, ref: React.Ref<HTMLElement>): TreeState {\n 'use no memo';\n\n if (process.env.NODE_ENV === 'development') {\n // this doesn't break rule of hooks, as environment is a static value\n // eslint-disable-next-line react-hooks/rules-of-hooks\n const treeType = useTreeContext_unstable(ctx => ctx.treeType);\n if (treeType === 'flat') {\n throw new Error(/* #__DE-INDENT__ */ `\n @fluentui/react-tree [useTree]:\n Subtrees are not allowed in a FlatTree!\n You cannot use a <Tree> component inside of a <FlatTree> component!\n `);\n }\n }\n return useSubtree(props, ref);\n}\n"],"names":["useTree_unstable","props","ref","isRoot","React","useContext","SubtreeContext","undefined","useNestedRootTree","useNestedSubtree","openItems","setOpenItems","useControllableOpenItems","checkedItems","useNestedCheckedItems","navigation","useTreeNavigation","Object","assign","useRootTree","onOpenChange","useEventCallback","event","data","nextOpenItems","createNextOpenItems","ImmutableSet","dangerouslyGetInternalSet","onNavigation","isDefaultPrevented","navigate","preventScroll","isScrollPrevented","onCheckedChange","nextCheckedItems","createNextNestedCheckedItems","ImmutableMap","dangerouslyGetInternalMap","useMergedRefs","treeRef","treeType","process","env","NODE_ENV","useTreeContext_unstable","ctx","Error","useSubtree"],"rangeMappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;","mappings":";;;;+BAaaA;;;eAAAA;;;;iEAbU;gCACyB;0CAEc;mDACM;gCACrC;6BACH;4BACD;mCACO;6BACM;8BACX;8BACA;AAEtB,MAAMA,mBAAmB,CAACC,OAAkBC;IACjD;IAEA,MAAMC,SAASC,OAAMC,UAAU,CAACC,8BAAAA,MAAoBC;IACpD,uDAAuD;IACvD,sEAAsE;IACtE,sDAAsD;IACtD,OAAOJ,SAASK,kBAAkBP,OAAOC,OAAOO,iBAAiBR,OAAOC;AAC1E;AAEA,SAASM,kBAAkBP,KAAgB,EAAEC,GAA2B;IACtE;IAEA,MAAM,CAACQ,WAAWC,aAAa,GAAGC,IAAAA,kDAAAA,EAAyBX;IAC3D,MAAMY,eAAeC,IAAAA,wDAAAA,EAAsBb;IAC3C,MAAMc,aAAaC,IAAAA,oCAAAA;IAEnB,OAAOC,OAAOC,MAAM,CAClBC,IAAAA,wBAAAA,EACE;QACE,GAAGlB,KAAK;QACRS;QACAG;QACAO,cAAcC,IAAAA,gCAAAA,EAAiB,CAACC,OAAOC;gBAErCtB;YADA,MAAMuB,gBAAgBC,IAAAA,6CAAAA,EAAoBF,MAAMb;YAChDT,CAAAA,sBAAAA,MAAMmB,YAAY,AAAZA,MAAY,QAAlBnB,wBAAAA,KAAAA,IAAAA,KAAAA,IAAAA,oBAAAA,IAAAA,CAAAA,OAAqBqB,OAAO;gBAC1B,GAAGC,IAAI;gBACPb,WAAWgB,0BAAAA,CAAaC,yBAAyB,CAACH;YACpD;YACAb,aAAaa;QACf;QACAI,cAAcP,IAAAA,gCAAAA,EAAiB,CAACC,OAAOC;gBACrCtB;YAAAA,CAAAA,sBAAAA,MAAM2B,YAAY,AAAZA,MAAY,QAAlB3B,wBAAAA,KAAAA,IAAAA,KAAAA,IAAAA,oBAAAA,IAAAA,CAAAA,OAAqBqB,OAAOC;YAC5B,IAAI,CAACD,MAAMO,kBAAkB,IAAI;gBAC/Bd,WAAWe,QAAQ,CAACP,MAAM;oBACxBQ,eAAeR,KAAKS,iBAAiB;gBACvC;YACF;QACF;QACAC,iBAAiBZ,IAAAA,gCAAAA,EAAiB,CAACC,OAAOC;gBAExCtB;YADA,MAAMiC,mBAAmBC,IAAAA,+DAAAA,EAA6BZ,MAAMV;YAC5DZ,CAAAA,yBAAAA,MAAMgC,eAAe,AAAfA,MAAe,QAArBhC,2BAAAA,KAAAA,IAAAA,KAAAA,IAAAA,uBAAAA,IAAAA,CAAAA,OAAwBqB,OAAO;gBAC7B,GAAGC,IAAI;gBACPV,cAAcuB,0BAAAA,CAAaC,yBAAyB,CAACH;YACvD;QACF;IACF,GACAI,IAAAA,6BAAAA,EAAcpC,KAAKa,WAAWwB,OAAO,IAEvC;QAAEC,UAAU;IAAS;AAEzB;AAEA,SAAS/B,iBAAiBR,KAAgB,EAAEC,GAA2B;IACrE;IAEA,IAAIuC,QAAQC,GAAG,CAACC,QAAQ,KAAK,eAAe;QAC1C,qEAAqE;QACrE,sDAAsD;QACtD,MAAMH,WAAWI,IAAAA,oCAAAA,EAAwBC,CAAAA,MAAOA,IAAIL,QAAQ;QAC5D,IAAIA,aAAa,QAAQ;YACvB,MAAM,IAAIM,MAA2B,CAAC;;mEAItC,CAAC;QACH;IACF;IACA,OAAOC,IAAAA,sBAAAA,EAAW9C,OAAOC;AAC3B"}
|
|
@@ -20,24 +20,15 @@ const _interop_require_wildcard = require("@swc/helpers/_/_interop_require_wildc
|
|
|
20
20
|
const _reactutilities = require("@fluentui/react-utilities");
|
|
21
21
|
const _react = /*#__PURE__*/ _interop_require_wildcard._(require("react"));
|
|
22
22
|
const _ImmutableSet = require("../utils/ImmutableSet");
|
|
23
|
-
const _createOpenItems = require("../utils/createOpenItems");
|
|
24
23
|
function useControllableOpenItems(props) {
|
|
25
24
|
return (0, _reactutilities.useControllableState)({
|
|
26
|
-
state: _react.useMemo(()=>props.openItems &&
|
|
25
|
+
state: _react.useMemo(()=>props.openItems && _ImmutableSet.ImmutableSet.from(props.openItems), [
|
|
27
26
|
props.openItems
|
|
28
27
|
]),
|
|
29
|
-
defaultState: props.defaultOpenItems && (()=>
|
|
28
|
+
defaultState: props.defaultOpenItems && (()=>_ImmutableSet.ImmutableSet.from(props.defaultOpenItems)),
|
|
30
29
|
initialState: _ImmutableSet.ImmutableSet.empty
|
|
31
30
|
});
|
|
32
31
|
}
|
|
33
32
|
function createNextOpenItems(data, previousOpenItems) {
|
|
34
|
-
|
|
35
|
-
return previousOpenItems;
|
|
36
|
-
}
|
|
37
|
-
const previousOpenItemsHasId = previousOpenItems.has(data.value);
|
|
38
|
-
if (data.open ? previousOpenItemsHasId : !previousOpenItemsHasId) {
|
|
39
|
-
return previousOpenItems;
|
|
40
|
-
}
|
|
41
|
-
const nextOpenItems = _ImmutableSet.ImmutableSet.create(previousOpenItems);
|
|
42
|
-
return data.open ? nextOpenItems.add(data.value) : nextOpenItems.delete(data.value);
|
|
33
|
+
return data.open ? previousOpenItems.add(data.value) : previousOpenItems.delete(data.value);
|
|
43
34
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["useControllableOpenItems.ts"],"sourcesContent":["import { useControllableState } from '@fluentui/react-utilities';\nimport * as React from 'react';\nimport { ImmutableSet } from '../utils/ImmutableSet';\nimport type { TreeItemValue } from '../components/TreeItem/TreeItem.types';\nimport {
|
|
1
|
+
{"version":3,"sources":["useControllableOpenItems.ts"],"sourcesContent":["import { useControllableState } from '@fluentui/react-utilities';\nimport * as React from 'react';\nimport { ImmutableSet } from '../utils/ImmutableSet';\nimport type { TreeItemValue } from '../components/TreeItem/TreeItem.types';\nimport { TreeOpenChangeData, TreeProps } from '../Tree';\n\n/**\n * @internal\n */\nexport function useControllableOpenItems(props: Pick<TreeProps, 'openItems' | 'defaultOpenItems'>) {\n return useControllableState({\n state: React.useMemo(() => props.openItems && ImmutableSet.from(props.openItems), [props.openItems]),\n defaultState: props.defaultOpenItems && (() => ImmutableSet.from(props.defaultOpenItems)),\n initialState: ImmutableSet.empty,\n });\n}\n\n/**\n * @internal\n */\nexport function createNextOpenItems(\n data: Pick<TreeOpenChangeData, 'value' | 'open'>,\n previousOpenItems: ImmutableSet<TreeItemValue>,\n): ImmutableSet<TreeItemValue> {\n return data.open ? previousOpenItems.add(data.value) : previousOpenItems.delete(data.value);\n}\n"],"names":["createNextOpenItems","useControllableOpenItems","props","useControllableState","state","React","useMemo","openItems","ImmutableSet","from","defaultState","defaultOpenItems","initialState","empty","data","previousOpenItems","open","add","value","delete"],"rangeMappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;","mappings":";;;;;;;;;;;IAoBgBA,mBAAAA;eAAAA;;IAXAC,wBAAAA;eAAAA;;;;gCATqB;iEACd;8BACM;AAOtB,SAASA,yBAAyBC,KAAwD;IAC/F,OAAOC,IAAAA,oCAAAA,EAAqB;QAC1BC,OAAOC,OAAMC,OAAO,CAAC,IAAMJ,MAAMK,SAAS,IAAIC,0BAAAA,CAAaC,IAAI,CAACP,MAAMK,SAAS,GAAG;YAACL,MAAMK,SAAS;SAAC;QACnGG,cAAcR,MAAMS,gBAAgB,IAAK,CAAA,IAAMH,0BAAAA,CAAaC,IAAI,CAACP,MAAMS,gBAAgB,CAAA;QACvFC,cAAcJ,0BAAAA,CAAaK,KAAK;IAClC;AACF;AAKO,SAASb,oBACdc,IAAgD,EAChDC,iBAA8C;IAE9C,OAAOD,KAAKE,IAAI,GAAGD,kBAAkBE,GAAG,CAACH,KAAKI,KAAK,IAAIH,kBAAkBI,MAAM,CAACL,KAAKI,KAAK;AAC5F"}
|
|
@@ -12,14 +12,15 @@ const _interop_require_wildcard = require("@swc/helpers/_/_interop_require_wildc
|
|
|
12
12
|
const _reactutilities = require("@fluentui/react-utilities");
|
|
13
13
|
const _react = /*#__PURE__*/ _interop_require_wildcard._(require("react"));
|
|
14
14
|
const _reactmotioncomponentspreview = require("@fluentui/react-motion-components-preview");
|
|
15
|
-
const _createOpenItems = require("../utils/createOpenItems");
|
|
16
15
|
const _createCheckedItems = require("../utils/createCheckedItems");
|
|
17
16
|
const _tokens = require("../utils/tokens");
|
|
18
17
|
const _useControllableOpenItems = require("./useControllableOpenItems");
|
|
18
|
+
const _ImmutableSet = require("../utils/ImmutableSet");
|
|
19
|
+
const _ImmutableMap = require("../utils/ImmutableMap");
|
|
19
20
|
function useRootTree(props, ref) {
|
|
20
21
|
warnIfNoProperPropsRootTree(props);
|
|
21
22
|
const { appearance = 'subtle', size = 'medium', selectionMode = 'none' } = props;
|
|
22
|
-
const openItems = _react.useMemo(()=>
|
|
23
|
+
const openItems = _react.useMemo(()=>_ImmutableSet.ImmutableSet.from(props.openItems), [
|
|
23
24
|
props.openItems
|
|
24
25
|
]);
|
|
25
26
|
const checkedItems = _react.useMemo(()=>(0, _createCheckedItems.createCheckedItems)(props.checkedItems), [
|
|
@@ -29,7 +30,7 @@ function useRootTree(props, ref) {
|
|
|
29
30
|
var _props_onOpenChange;
|
|
30
31
|
(_props_onOpenChange = props.onOpenChange) === null || _props_onOpenChange === void 0 ? void 0 : _props_onOpenChange.call(props, request.event, {
|
|
31
32
|
...request,
|
|
32
|
-
openItems: (0, _useControllableOpenItems.createNextOpenItems)(request, openItems)
|
|
33
|
+
openItems: _ImmutableSet.ImmutableSet.dangerouslyGetInternalSet((0, _useControllableOpenItems.createNextOpenItems)(request, openItems))
|
|
33
34
|
});
|
|
34
35
|
};
|
|
35
36
|
const requestCheckedChange = (request)=>{
|
|
@@ -40,7 +41,7 @@ function useRootTree(props, ref) {
|
|
|
40
41
|
(_props_onCheckedChange = props.onCheckedChange) === null || _props_onCheckedChange === void 0 ? void 0 : _props_onCheckedChange.call(props, request.event, {
|
|
41
42
|
...request,
|
|
42
43
|
selectionMode,
|
|
43
|
-
checkedItems:
|
|
44
|
+
checkedItems: _ImmutableMap.ImmutableMap.dangerouslyGetInternalMap(checkedItems)
|
|
44
45
|
});
|
|
45
46
|
};
|
|
46
47
|
const requestNavigation = (request)=>{
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["useRootTree.ts"],"sourcesContent":["import { getIntrinsicElementProps, useEventCallback, slot } from '@fluentui/react-utilities';\nimport type { TreeCheckedChangeData, TreeProps, TreeState } from '../Tree';\nimport * as React from 'react';\nimport { Collapse } from '@fluentui/react-motion-components-preview';\nimport { PresenceMotionSlotProps } from '@fluentui/react-motion';\nimport { TreeContextValue, TreeItemRequest } from '../contexts/treeContext';\nimport {
|
|
1
|
+
{"version":3,"sources":["useRootTree.ts"],"sourcesContent":["import { getIntrinsicElementProps, useEventCallback, slot } from '@fluentui/react-utilities';\nimport type { TreeCheckedChangeData, TreeProps, TreeState } from '../Tree';\nimport * as React from 'react';\nimport { Collapse } from '@fluentui/react-motion-components-preview';\nimport { PresenceMotionSlotProps } from '@fluentui/react-motion';\nimport { TreeContextValue, TreeItemRequest } from '../contexts/treeContext';\nimport { createCheckedItems } from '../utils/createCheckedItems';\nimport { treeDataTypes } from '../utils/tokens';\nimport { createNextOpenItems } from './useControllableOpenItems';\nimport { ImmutableSet } from '../utils/ImmutableSet';\nimport { ImmutableMap } from '../utils/ImmutableMap';\n\n/**\n * Create the state required to render the root level tree.\n *\n * @param props - props from this instance of tree\n * @param ref - reference to root HTMLElement of tree\n */\nexport function useRootTree(\n props: TreeProps,\n ref: React.Ref<HTMLElement>,\n): Omit<TreeState & TreeContextValue, 'treeType'> {\n warnIfNoProperPropsRootTree(props);\n\n const { appearance = 'subtle', size = 'medium', selectionMode = 'none' } = props;\n\n const openItems = React.useMemo(() => ImmutableSet.from(props.openItems), [props.openItems]);\n const checkedItems = React.useMemo(() => createCheckedItems(props.checkedItems), [props.checkedItems]);\n\n const requestOpenChange = (request: Extract<TreeItemRequest, { requestType: 'open' }>) => {\n props.onOpenChange?.(request.event, {\n ...request,\n openItems: ImmutableSet.dangerouslyGetInternalSet(createNextOpenItems(request, openItems)),\n });\n };\n\n const requestCheckedChange = (request: Extract<TreeItemRequest, { requestType: 'selection' }>) => {\n if (selectionMode === 'none') {\n return;\n }\n props.onCheckedChange?.(request.event, {\n ...request,\n selectionMode,\n checkedItems: ImmutableMap.dangerouslyGetInternalMap(checkedItems),\n // Casting is required here due to selection | multiselection spreading the union problem\n } as TreeCheckedChangeData);\n };\n\n const requestNavigation = (request: Extract<TreeItemRequest, { requestType: 'navigate' }>) => {\n let isScrollPrevented = false;\n props.onNavigation?.(request.event, {\n ...request,\n preventScroll: () => {\n isScrollPrevented = true;\n },\n isScrollPrevented: () => isScrollPrevented,\n });\n switch (request.type) {\n case treeDataTypes.ArrowDown:\n case treeDataTypes.ArrowUp:\n case treeDataTypes.Home:\n case treeDataTypes.End:\n // stop the default behavior of the event\n // which is to scroll the page\n request.event.preventDefault();\n }\n };\n\n const requestTreeResponse = useEventCallback((request: TreeItemRequest) => {\n switch (request.requestType) {\n case 'navigate':\n return requestNavigation(request);\n case 'open':\n return requestOpenChange(request);\n case 'selection':\n return requestCheckedChange(request);\n }\n });\n\n return {\n components: {\n root: 'div',\n // TODO: remove once React v18 slot API is modified\n // This is a problem at the moment due to UnknownSlotProps assumption\n // that `children` property is `ReactNode`, which in this case is not valid\n // as PresenceComponentProps['children'] is `ReactElement`\n collapseMotion: Collapse as React.FC<PresenceMotionSlotProps>,\n },\n contextType: 'root',\n selectionMode,\n open: true,\n appearance,\n size,\n level: 1,\n openItems,\n checkedItems,\n requestTreeResponse,\n root: slot.always(\n getIntrinsicElementProps('div', {\n // FIXME:\n // `ref` is wrongly assigned to be `HTMLElement` instead of `HTMLDivElement`\n // but since it would be a breaking change to fix it, we are casting ref to it's proper type\n ref: ref as React.Ref<HTMLDivElement>,\n role: 'tree',\n 'aria-multiselectable': selectionMode === 'multiselect' ? true : undefined,\n ...props,\n }),\n { elementType: 'div' },\n ),\n collapseMotion: undefined,\n };\n}\n\nfunction warnIfNoProperPropsRootTree(props: Pick<TreeProps, 'aria-label' | 'aria-labelledby'>) {\n if (process.env.NODE_ENV === 'development') {\n if (!props['aria-label'] && !props['aria-labelledby']) {\n // eslint-disable-next-line no-console\n console.warn(/* #__DE-INDENT__ */ `\n @fluentui/react-tree [useRootTree]:\n Tree must have either a \\`aria-label\\` or \\`aria-labelledby\\` property defined\n `);\n }\n }\n}\n"],"names":["useRootTree","props","ref","warnIfNoProperPropsRootTree","appearance","size","selectionMode","openItems","React","useMemo","ImmutableSet","from","checkedItems","createCheckedItems","requestOpenChange","request","onOpenChange","event","dangerouslyGetInternalSet","createNextOpenItems","requestCheckedChange","onCheckedChange","ImmutableMap","dangerouslyGetInternalMap","requestNavigation","isScrollPrevented","onNavigation","preventScroll","type","treeDataTypes","ArrowDown","ArrowUp","Home","End","preventDefault","requestTreeResponse","useEventCallback","requestType","components","root","collapseMotion","Collapse","contextType","open","level","slot","always","getIntrinsicElementProps","role","undefined","elementType","process","env","NODE_ENV","console","warn"],"rangeMappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;","mappings":";;;;+BAkBgBA;;;eAAAA;;;;gCAlBiD;iEAE1C;8CACE;oCAGU;wBACL;0CACM;8BACP;8BACA;AAQtB,SAASA,YACdC,KAAgB,EAChBC,GAA2B;IAE3BC,4BAA4BF;IAE5B,MAAM,EAAEG,aAAa,QAAQ,EAAEC,OAAO,QAAQ,EAAEC,gBAAgB,MAAM,EAAE,GAAGL;IAE3E,MAAMM,YAAYC,OAAMC,OAAO,CAAC,IAAMC,0BAAAA,CAAaC,IAAI,CAACV,MAAMM,SAAS,GAAG;QAACN,MAAMM,SAAS;KAAC;IAC3F,MAAMK,eAAeJ,OAAMC,OAAO,CAAC,IAAMI,IAAAA,sCAAAA,EAAmBZ,MAAMW,YAAY,GAAG;QAACX,MAAMW,YAAY;KAAC;IAErG,MAAME,oBAAoB,CAACC;YACzBd;QAAAA,CAAAA,sBAAAA,MAAMe,YAAY,AAAZA,MAAY,QAAlBf,wBAAAA,KAAAA,IAAAA,KAAAA,IAAAA,oBAAAA,IAAAA,CAAAA,OAAqBc,QAAQE,KAAK,EAAE;YAClC,GAAGF,OAAO;YACVR,WAAWG,0BAAAA,CAAaQ,yBAAyB,CAACC,IAAAA,6CAAAA,EAAoBJ,SAASR;QACjF;IACF;IAEA,MAAMa,uBAAuB,CAACL;YAI5Bd;QAHA,IAAIK,kBAAkB,QAAQ;YAC5B;QACF;QACAL,CAAAA,yBAAAA,MAAMoB,eAAe,AAAfA,MAAe,QAArBpB,2BAAAA,KAAAA,IAAAA,KAAAA,IAAAA,uBAAAA,IAAAA,CAAAA,OAAwBc,QAAQE,KAAK,EAAE;YACrC,GAAGF,OAAO;YACVT;YACAM,cAAcU,0BAAAA,CAAaC,yBAAyB,CAACX;QAEvD;IACF;IAEA,MAAMY,oBAAoB,CAACT;YAEzBd;QADA,IAAIwB,oBAAoB;QACxBxB,CAAAA,sBAAAA,MAAMyB,YAAY,AAAZA,MAAY,QAAlBzB,wBAAAA,KAAAA,IAAAA,KAAAA,IAAAA,oBAAAA,IAAAA,CAAAA,OAAqBc,QAAQE,KAAK,EAAE;YAClC,GAAGF,OAAO;YACVY,eAAe;gBACbF,oBAAoB;YACtB;YACAA,mBAAmB,IAAMA;QAC3B;QACA,OAAQV,QAAQa,IAAI;YAClB,KAAKC,qBAAAA,CAAcC,SAAS;YAC5B,KAAKD,qBAAAA,CAAcE,OAAO;YAC1B,KAAKF,qBAAAA,CAAcG,IAAI;YACvB,KAAKH,qBAAAA,CAAcI,GAAG;gBACpB,yCAAyC;gBACzC,8BAA8B;gBAC9BlB,QAAQE,KAAK,CAACiB,cAAc;QAChC;IACF;IAEA,MAAMC,sBAAsBC,IAAAA,gCAAAA,EAAiB,CAACrB;QAC5C,OAAQA,QAAQsB,WAAW;YACzB,KAAK;gBACH,OAAOb,kBAAkBT;YAC3B,KAAK;gBACH,OAAOD,kBAAkBC;YAC3B,KAAK;gBACH,OAAOK,qBAAqBL;QAChC;IACF;IAEA,OAAO;QACLuB,YAAY;YACVC,MAAM;YACN,mDAAmD;YACnD,qEAAqE;YACrE,2EAA2E;YAC3E,0DAA0D;YAC1DC,gBAAgBC,sCAAAA;QAClB;QACAC,aAAa;QACbpC;QACAqC,MAAM;QACNvC;QACAC;QACAuC,OAAO;QACPrC;QACAK;QACAuB;QACAI,MAAMM,oBAAAA,CAAKC,MAAM,CACfC,IAAAA,wCAAAA,EAAyB,OAAO;YAC9B,SAAS;YACT,4EAA4E;YAC5E,4FAA4F;YAC5F7C,KAAKA;YACL8C,MAAM;YACN,wBAAwB1C,kBAAkB,gBAAgB,OAAO2C;YACjE,GAAGhD,KAAK;QACV,IACA;YAAEiD,aAAa;QAAM;QAEvBV,gBAAgBS;IAClB;AACF;AAEA,SAAS9C,4BAA4BF,KAAwD;IAC3F,IAAIkD,QAAQC,GAAG,CAACC,QAAQ,KAAK,eAAe;QAC1C,IAAI,CAACpD,KAAK,CAAC,aAAa,IAAI,CAACA,KAAK,CAAC,kBAAkB,EAAE;YACrD,sCAAsC;YACtCqD,QAAQC,IAAI,CAAsB,CAAC;8EAGnC,CAAC;QACH;IACF;AACF"}
|
|
@@ -8,44 +8,75 @@ Object.defineProperty(exports, "ImmutableMap", {
|
|
|
8
8
|
return ImmutableMap;
|
|
9
9
|
}
|
|
10
10
|
});
|
|
11
|
-
const
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
}
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
const
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
}
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
|
|
11
|
+
const _define_property = require("@swc/helpers/_/_define_property");
|
|
12
|
+
const internalMapSymbol = Symbol('#internalMap');
|
|
13
|
+
let _internalMapSymbol = internalMapSymbol, _Symbol_hasInstance = Symbol.hasInstance, _Symbol_iterator = Symbol.iterator;
|
|
14
|
+
class ImmutableMap {
|
|
15
|
+
static dangerouslyGetInternalMap(immutableMap) {
|
|
16
|
+
return immutableMap[internalMapSymbol];
|
|
17
|
+
}
|
|
18
|
+
static copy(immutableMap) {
|
|
19
|
+
return this.from(immutableMap[internalMapSymbol]);
|
|
20
|
+
}
|
|
21
|
+
static from(iterable, mapFn) {
|
|
22
|
+
if (iterable === undefined) {
|
|
23
|
+
return this.empty;
|
|
24
|
+
}
|
|
25
|
+
if (!mapFn) {
|
|
26
|
+
if (iterable instanceof this) {
|
|
27
|
+
return iterable;
|
|
28
|
+
}
|
|
29
|
+
// casting here is ok, as the function overload ensures that the iterable is
|
|
30
|
+
// Iterable<[unknown, unknown]>
|
|
31
|
+
// if mapFn is not provided
|
|
32
|
+
const iterableAsTuple = iterable;
|
|
33
|
+
return new this(new Map(iterableAsTuple));
|
|
34
|
+
}
|
|
35
|
+
const map = new Map();
|
|
36
|
+
for (const value of iterable){
|
|
37
|
+
map.set(...mapFn(value));
|
|
38
|
+
}
|
|
39
|
+
return new this(map);
|
|
40
|
+
}
|
|
41
|
+
static [_Symbol_hasInstance](instance) {
|
|
42
|
+
return Boolean(typeof instance === 'object' && instance && internalMapSymbol in instance);
|
|
43
|
+
}
|
|
44
|
+
delete(key) {
|
|
45
|
+
if (!this.has(key)) {
|
|
46
|
+
return this;
|
|
47
|
+
}
|
|
48
|
+
const copy = ImmutableMap.copy(this);
|
|
49
|
+
copy[internalMapSymbol].delete(key);
|
|
50
|
+
return copy;
|
|
51
|
+
}
|
|
52
|
+
get(key) {
|
|
53
|
+
return this[internalMapSymbol].get(key);
|
|
54
|
+
}
|
|
55
|
+
has(key) {
|
|
56
|
+
return this[internalMapSymbol].has(key);
|
|
57
|
+
}
|
|
58
|
+
set(key, value) {
|
|
59
|
+
if (this.get(key) === value) {
|
|
60
|
+
return this;
|
|
61
|
+
}
|
|
62
|
+
const copy = ImmutableMap.copy(this);
|
|
63
|
+
copy[internalMapSymbol].set(key, value);
|
|
64
|
+
return copy;
|
|
65
|
+
}
|
|
66
|
+
[_Symbol_iterator]() {
|
|
67
|
+
return this[internalMapSymbol].entries();
|
|
68
|
+
}
|
|
69
|
+
/**
|
|
70
|
+
* Do not use this constructor directly, use {@link ImmutableMap.from} instead.
|
|
71
|
+
* {@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}),
|
|
72
|
+
* avoid unnecessary copies, supports iterables and ensures that the internal map is never exposed.
|
|
73
|
+
*
|
|
74
|
+
*⚠️⚠️ _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._ ⚠️⚠️
|
|
75
|
+
*/ constructor(internalMap){
|
|
76
|
+
(0, _define_property._)(this, "size", void 0);
|
|
77
|
+
(0, _define_property._)(this, _internalMapSymbol, void 0);
|
|
78
|
+
this[internalMapSymbol] = internalMap;
|
|
79
|
+
this.size = this[internalMapSymbol].size;
|
|
80
|
+
}
|
|
44
81
|
}
|
|
45
|
-
|
|
46
|
-
empty: emptyImmutableMap,
|
|
47
|
-
create: createImmutableMap,
|
|
48
|
-
isImmutableMap,
|
|
49
|
-
// eslint-disable-next-line @typescript-eslint/naming-convention
|
|
50
|
-
dangerouslyCreate_unstable: dangerouslyCreateImmutableMap
|
|
51
|
-
};
|
|
82
|
+
(0, _define_property._)(ImmutableMap, "empty", new ImmutableMap(new Map()));
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["ImmutableMap.ts"],"sourcesContent":["
|
|
1
|
+
{"version":3,"sources":["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":["ImmutableMap","internalMapSymbol","Symbol","hasInstance","iterator","dangerouslyGetInternalMap","immutableMap","copy","from","iterable","mapFn","undefined","empty","iterableAsTuple","Map","map","value","set","instance","Boolean","delete","key","has","get","entries","constructor","internalMap","_define_property","size"],"rangeMappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;","mappings":";;;;+BAEaA;;;eAAAA;;;;AAFb,MAAMC,oBAAoBC,OAAO;IAMtBD,qBAAAA,mBAkDMC,sBAAAA,OAAOC,WAAW,EAsCzBD,mBAAAA,OAAOE,QAAQ;AA5FlB,MAAMJ;IAMX,OAAcK,0BAAsCC,YAAsC,EAAmB;QAC3G,OAAOA,YAAY,CAACL,kBAAkB;IACxC;IAEA,OAAcM,KAAiBD,YAAsC,EAA4B;QAC/F,OAAO,IAAI,CAACE,IAAI,CAACF,YAAY,CAACL,kBAAkB;IAClD;IAkBA,OAAcO,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,CAACb,oBAAmB,CAACgB,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,MAAMd,OAAOP,aAAaO,IAAI,CAAC,IAAI;QACnCA,IAAI,CAACN,kBAAkB,CAACmB,MAAM,CAACC;QAC/B,OAAOd;IACT;IACOgB,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;IACOJ,IAAII,GAAQ,EAAEL,KAAY,EAA4B;QAC3D,IAAI,IAAI,CAACO,GAAG,CAACF,SAASL,OAAO;YAC3B,OAAO,IAAI;QACb;QACA,MAAMT,OAAOP,aAAaO,IAAI,CAAC,IAAI;QACnCA,IAAI,CAACN,kBAAkB,CAACgB,GAAG,CAACI,KAAKL;QACjC,OAAOT;IACT;IACO,CAACL,iBAAgB,GAA2B;QACjD,OAAO,IAAI,CAACD,kBAAkB,CAACuB,OAAO;IACxC;IApCA;;;;;;GAMC,GACDC,YAAYC,WAA4B,CAAE;QA/D1CC,IAAAA,kBAAA,EAAA,IAAA,EAAgBC,QAAhB,KAAA;QAEAD,IAAAA,kBAAA,EAAA,IAAA,EAAS1B,oBAAT,KAAA;QA8DE,IAAI,CAACA,kBAAkB,GAAGyB;QAC1B,IAAI,CAACE,IAAI,GAAG,IAAI,CAAC3B,kBAAkB,CAAC2B,IAAI;IAC1C;AA2BF;AA9FED,IAAAA,kBAAA,EADW3B,cACGY,SAAoC,IAAIZ,aAAa,IAAIc"}
|
|
@@ -8,49 +8,65 @@ Object.defineProperty(exports, "ImmutableSet", {
|
|
|
8
8
|
return ImmutableSet;
|
|
9
9
|
}
|
|
10
10
|
});
|
|
11
|
-
const
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
}
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
|
|
47
|
-
|
|
48
|
-
|
|
11
|
+
const _define_property = require("@swc/helpers/_/_define_property");
|
|
12
|
+
const internalSetSymbol = Symbol('#internalSet');
|
|
13
|
+
let _internalSetSymbol = internalSetSymbol, _Symbol_hasInstance = Symbol.hasInstance, _Symbol_iterator = Symbol.iterator;
|
|
14
|
+
class ImmutableSet {
|
|
15
|
+
static dangerouslyGetInternalSet(set) {
|
|
16
|
+
return set[internalSetSymbol];
|
|
17
|
+
}
|
|
18
|
+
static copy(immutableSet) {
|
|
19
|
+
return new ImmutableSet(new Set(immutableSet[internalSetSymbol]));
|
|
20
|
+
}
|
|
21
|
+
/**
|
|
22
|
+
* Creates a new {@link ImmutableSet} from an iterable.
|
|
23
|
+
* If the iterable is undefined, {@link ImmutableSet.empty} will be returned.
|
|
24
|
+
* If the iterable is already an {@link ImmutableSet}, it will be returned as is no copy will be made.
|
|
25
|
+
*/ static from(iterable) {
|
|
26
|
+
if (iterable === undefined) {
|
|
27
|
+
return this.empty;
|
|
28
|
+
}
|
|
29
|
+
if (iterable instanceof this) {
|
|
30
|
+
return iterable;
|
|
31
|
+
}
|
|
32
|
+
return new this(new Set(iterable));
|
|
33
|
+
}
|
|
34
|
+
static [_Symbol_hasInstance](instance) {
|
|
35
|
+
return Boolean(typeof instance === 'object' && instance && internalSetSymbol in instance);
|
|
36
|
+
}
|
|
37
|
+
add(value) {
|
|
38
|
+
if (this.has(value)) {
|
|
39
|
+
return this;
|
|
40
|
+
}
|
|
41
|
+
const copy = ImmutableSet.copy(this);
|
|
42
|
+
copy[internalSetSymbol].add(value);
|
|
43
|
+
return copy;
|
|
44
|
+
}
|
|
45
|
+
delete(value) {
|
|
46
|
+
if (!this.has(value)) {
|
|
47
|
+
return this;
|
|
48
|
+
}
|
|
49
|
+
const copy = ImmutableSet.copy(this);
|
|
50
|
+
copy[internalSetSymbol].delete(value);
|
|
51
|
+
return copy;
|
|
52
|
+
}
|
|
53
|
+
has(value) {
|
|
54
|
+
return this[internalSetSymbol].has(value);
|
|
55
|
+
}
|
|
56
|
+
[_Symbol_iterator]() {
|
|
57
|
+
return this[internalSetSymbol].values();
|
|
58
|
+
}
|
|
59
|
+
/**
|
|
60
|
+
* Do not use this constructor directly, use {@link ImmutableSet.from} instead.
|
|
61
|
+
* {@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}),
|
|
62
|
+
* avoid unnecessary copies, supports iterables and ensures that the internal set is never exposed.
|
|
63
|
+
*
|
|
64
|
+
*⚠️⚠️ _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._ ⚠️⚠️
|
|
65
|
+
*/ constructor(internalSet){
|
|
66
|
+
(0, _define_property._)(this, "size", void 0);
|
|
67
|
+
(0, _define_property._)(this, _internalSetSymbol, void 0);
|
|
68
|
+
this[internalSetSymbol] = internalSet;
|
|
69
|
+
this.size = this[internalSetSymbol].size;
|
|
70
|
+
}
|
|
49
71
|
}
|
|
50
|
-
|
|
51
|
-
empty: emptyImmutableSet,
|
|
52
|
-
create: createImmutableSet,
|
|
53
|
-
isImmutableSet,
|
|
54
|
-
// eslint-disable-next-line @typescript-eslint/naming-convention
|
|
55
|
-
dangerouslyCreate_unstable: dangerouslyCreateImmutableSet
|
|
56
|
-
};
|
|
72
|
+
(0, _define_property._)(ImmutableSet, "empty", new ImmutableSet(new Set()));
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["ImmutableSet.ts"],"sourcesContent":["
|
|
1
|
+
{"version":3,"sources":["ImmutableSet.ts"],"sourcesContent":["const internalSetSymbol = Symbol('#internalSet');\n\n/**\n * @public\n *\n * Small immutable wrapper around the native Set implementation.\n * Every operation that would modify the set returns a new copy instance.\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":["ImmutableSet","internalSetSymbol","Symbol","hasInstance","iterator","dangerouslyGetInternalSet","set","copy","immutableSet","Set","from","iterable","undefined","empty","instance","Boolean","add","value","has","delete","values","constructor","internalSet","_define_property","size"],"rangeMappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;","mappings":";;;;+BAQaA;;;eAAAA;;;;AARb,MAAMC,oBAAoBC,OAAO;IAYtBD,qBAAAA,mBAyBMC,sBAAAA,OAAOC,WAAW,EAsCzBD,mBAAAA,OAAOE,QAAQ;AAnElB,MAAMJ;IAMX,OAAcK,0BAAiCC,GAAwB,EAAc;QACnF,OAAOA,GAAG,CAACL,kBAAkB;IAC/B;IAEA,OAAcM,KAAQC,YAA6B,EAAmB;QACpE,OAAO,IAAIR,aAAa,IAAIS,IAAID,YAAY,CAACP,kBAAkB;IACjE;IAEA;;;;GAIC,GACD,OAAcS,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,CAACT,oBAAmB,CAACY,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,MAAMV,OAAOP,aAAaO,IAAI,CAAC,IAAI;QACnCA,IAAI,CAACN,kBAAkB,CAACe,GAAG,CAACC;QAC5B,OAAOV;IACT;IAEOY,OAAOF,KAAQ,EAAmB;QACvC,IAAI,CAAC,IAAI,CAACC,GAAG,CAACD,QAAQ;YACpB,OAAO,IAAI;QACb;QACA,MAAMV,OAAOP,aAAaO,IAAI,CAAC,IAAI;QACnCA,IAAI,CAACN,kBAAkB,CAACkB,MAAM,CAACF;QAC/B,OAAOV;IACT;IAEOW,IAAID,KAAQ,EAAW;QAC5B,OAAO,IAAI,CAAChB,kBAAkB,CAACiB,GAAG,CAACD;IACrC;IAEO,CAACf,iBAAgB,GAAgB;QACtC,OAAO,IAAI,CAACD,kBAAkB,CAACmB,MAAM;IACvC;IApCA;;;;;;GAMC,GACDC,YAAYC,WAAmB,CAAE;QAtCjCC,IAAAA,kBAAA,EAAA,IAAA,EAAgBC,QAAhB,KAAA;QAEAD,IAAAA,kBAAA,EAAA,IAAA,EAAStB,oBAAT,KAAA;QAqCE,IAAI,CAACA,kBAAkB,GAAGqB;QAC1B,IAAI,CAACE,IAAI,GAAG,IAAI,CAACvB,kBAAkB,CAACuB,IAAI;IAC1C;AA2BF;AArEED,IAAAA,kBAAA,EADWvB,cACGa,SAA6B,IAAIb,aAAa,IAAIS"}
|
|
@@ -9,20 +9,8 @@ Object.defineProperty(exports, "createCheckedItems", {
|
|
|
9
9
|
}
|
|
10
10
|
});
|
|
11
11
|
const _ImmutableMap = require("./ImmutableMap");
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
return iterable;
|
|
18
|
-
}
|
|
19
|
-
const internalMap = new Map();
|
|
20
|
-
for (const item of iterable){
|
|
21
|
-
if (Array.isArray(item)) {
|
|
22
|
-
internalMap.set(item[0], item[1]);
|
|
23
|
-
} else {
|
|
24
|
-
internalMap.set(item, true);
|
|
25
|
-
}
|
|
26
|
-
}
|
|
27
|
-
return _ImmutableMap.ImmutableMap.dangerouslyCreate_unstable(internalMap);
|
|
28
|
-
}
|
|
12
|
+
const tuplifyCheckedItem = (value)=>Array.isArray(value) ? value : [
|
|
13
|
+
value,
|
|
14
|
+
true
|
|
15
|
+
];
|
|
16
|
+
const createCheckedItems = (iterable)=>_ImmutableMap.ImmutableMap.from(iterable, tuplifyCheckedItem);
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["createCheckedItems.ts"],"sourcesContent":["import {
|
|
1
|
+
{"version":3,"sources":["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":["createCheckedItems","tuplifyCheckedItem","value","Array","isArray","iterable","ImmutableMap","from"],"rangeMappings":";;;;;;;;;;;;;;;","mappings":";;;;+BAQaA;;;eAAAA;;;8BANgB;AAE7B,MAAMC,qBAAqB,CACzBC,QACyCC,MAAMC,OAAO,CAACF,SAASA,QAAQ;QAACA;QAAO;KAAK;AAEhF,MAAMF,qBAAqB,CAChCK,WACoDC,0BAAAA,CAAaC,IAAI,CAACF,UAAUJ"}
|
package/package.json
CHANGED
|
@@ -1,10 +0,0 @@
|
|
|
1
|
-
import { ImmutableSet } from './ImmutableSet';
|
|
2
|
-
export function createOpenItems(iterable) {
|
|
3
|
-
if (iterable === undefined) {
|
|
4
|
-
return ImmutableSet.empty;
|
|
5
|
-
}
|
|
6
|
-
if (ImmutableSet.isImmutableSet(iterable)) {
|
|
7
|
-
return iterable;
|
|
8
|
-
}
|
|
9
|
-
return ImmutableSet.create(iterable);
|
|
10
|
-
}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"sources":["createOpenItems.ts"],"sourcesContent":["import { ImmutableSet } from './ImmutableSet';\nimport type { TreeItemValue } from '../TreeItem';\n\nexport function createOpenItems(iterable?: Iterable<TreeItemValue>) {\n if (iterable === undefined) {\n return ImmutableSet.empty;\n }\n if (ImmutableSet.isImmutableSet<TreeItemValue>(iterable)) {\n return iterable;\n }\n return ImmutableSet.create(iterable);\n}\n"],"names":["ImmutableSet","createOpenItems","iterable","undefined","empty","isImmutableSet","create"],"rangeMappings":";;;;;;;;;","mappings":"AAAA,SAASA,YAAY,QAAQ,iBAAiB;AAG9C,OAAO,SAASC,gBAAgBC,QAAkC;IAChE,IAAIA,aAAaC,WAAW;QAC1B,OAAOH,aAAaI,KAAK;IAC3B;IACA,IAAIJ,aAAaK,cAAc,CAAgBH,WAAW;QACxD,OAAOA;IACT;IACA,OAAOF,aAAaM,MAAM,CAACJ;AAC7B"}
|