@fluentui/react-tree 9.0.0-beta.4 → 9.0.0-beta.6

package/lib-commonjs/utils/ImmutableSet.js.map

@@ -1 +1 @@
-{"version":3,"names":["exports","emptyImmutableSet","createImmutableSet","iterable","internalSet","Set","dangerouslyCreateImmutableSet","size","add","value","nextSet","clear","delete","has","Symbol","iterator"],"sources":["../src/packages/react-components/react-tree/src/utils/ImmutableSet.ts"],"sourcesContent":["export interface ImmutableSet<Value> {\n  /**\n   * The number of (unique) elements in a ImmutableSet.\n   */\n  readonly size: number;\n  /**\n   * Creates a new ImmutableSet containing all previous element plus the one provided as argument\n   * @param value - new value to be included in the new ImmutableSet instance\n   */\n  add(value: Value): ImmutableSet<Value>;\n  /**\n   * Returns a reference to ImmutableSet.emptySet\n   */\n  clear(): ImmutableSet<Value>;\n  /**\n   * Creates a new ImmutableSet with the original items and removes a specified value from the new ImmutableSet.\n   */\n  delete(value: Value): ImmutableSet<Value>;\n  /**\n   * @returns a boolean indicating whether an element with the specified value exists in the ImmutableSet or not.\n   */\n  has(value: Value): boolean;\n  /** Iterates over values in the ImmutableSet. */\n  [Symbol.iterator](): IterableIterator<Value>;\n}\n\nexport const emptyImmutableSet = createImmutableSet<never>();\n\n/**\n * properly creates an ImmutableSet instance from an iterable\n */\nexport function createImmutableSet<Value>(iterable?: Iterable<Value>): ImmutableSet<Value> {\n  const internalSet = new Set(iterable);\n  return dangerouslyCreateImmutableSet(internalSet);\n}\n/**\n * Avoid using *dangerouslyCreateImmutableSet*, since this method will expose internally used set, use  createImmutableSet instead,\n * @param internalSet - a set that is used internally to store values.\n */\nexport function dangerouslyCreateImmutableSet<Value>(internalSet: Set<Value>): ImmutableSet<Value> {\n  return {\n    size: internalSet.size,\n    add(value) {\n      const nextSet = new Set(internalSet);\n      nextSet.add(value);\n      return dangerouslyCreateImmutableSet(nextSet);\n    },\n    clear() {\n      return emptyImmutableSet;\n    },\n    delete(value) {\n      const nextSet = new Set(internalSet);\n      nextSet.delete(value);\n      return dangerouslyCreateImmutableSet(nextSet);\n    },\n    has(value) {\n      return internalSet.has(value);\n    },\n    [Symbol.iterator]() {\n      return internalSet[Symbol.iterator]();\n    },\n  };\n}\n"],"mappings":";;;;;;AA0BaA,OAAA,CAAAC,iBAAiB,gBAAGC,kBAAkB,EAAS;AAE5D;;;AAGA,SAAgBA,kBAAkBA,CAAQC,QAA0B;EAClE,MAAMC,WAAW,GAAG,IAAIC,GAAG,CAACF,QAAQ,CAAC;EACrC,OAAOG,6BAA6B,CAACF,WAAW,CAAC;AACnD;AAHAJ,OAAA,CAAAE,kBAAA,GAAAA,kBAAA;AAIA;;;;AAIA,SAAgBI,6BAA6BA,CAAQF,WAAuB;EAC1E,OAAO;IACLG,IAAI,EAAEH,WAAW,CAACG,IAAI;IACtBC,GAAGA,CAACC,KAAK;MACP,MAAMC,OAAO,GAAG,IAAIL,GAAG,CAACD,WAAW,CAAC;MACpCM,OAAO,CAACF,GAAG,CAACC,KAAK,CAAC;MAClB,OAAOH,6BAA6B,CAACI,OAAO,CAAC;IAC/C,CAAC;IACDC,KAAKA,CAAA;MACH,OAAOX,OAAA,CAAAC,iBAAiB;IAC1B,CAAC;IACDW,MAAMA,CAACH,KAAK;MACV,MAAMC,OAAO,GAAG,IAAIL,GAAG,CAACD,WAAW,CAAC;MACpCM,OAAO,CAACE,MAAM,CAACH,KAAK,CAAC;MACrB,OAAOH,6BAA6B,CAACI,OAAO,CAAC;IAC/C,CAAC;IACDG,GAAGA,CAACJ,KAAK;MACP,OAAOL,WAAW,CAACS,GAAG,CAACJ,KAAK,CAAC;IAC/B,CAAC;IACD,CAACK,MAAM,CAACC,QAAQ,IAAC;MACf,OAAOX,WAAW,CAACU,MAAM,CAACC,QAAQ,CAAC,EAAE;IACvC;GACD;AACH;AAvBAf,OAAA,CAAAM,6BAAA,GAAAA,6BAAA"}
+{"version":3,"sources":["../../lib/utils/ImmutableSet.js"],"sourcesContent":["export const emptyImmutableSet = /*#__PURE__*/createImmutableSet();\n/**\n * properly creates an ImmutableSet instance from an iterable\n */\nexport function createImmutableSet(iterable) {\n  const internalSet = new Set(iterable);\n  return dangerouslyCreateImmutableSet(internalSet);\n}\n/**\n * Avoid using *dangerouslyCreateImmutableSet*, since this method will expose internally used set, use  createImmutableSet instead,\n * @param internalSet - a set that is used internally to store values.\n */\nexport function dangerouslyCreateImmutableSet(internalSet) {\n  return {\n    size: internalSet.size,\n    add(value) {\n      const nextSet = new Set(internalSet);\n      nextSet.add(value);\n      return dangerouslyCreateImmutableSet(nextSet);\n    },\n    clear() {\n      return emptyImmutableSet;\n    },\n    delete(value) {\n      const nextSet = new Set(internalSet);\n      nextSet.delete(value);\n      return dangerouslyCreateImmutableSet(nextSet);\n    },\n    has(value) {\n      return internalSet.has(value);\n    },\n    [Symbol.iterator]() {\n      return internalSet[Symbol.iterator]();\n    }\n  };\n}\n//# sourceMappingURL=ImmutableSet.js.map"],"names":["emptyImmutableSet","createImmutableSet","dangerouslyCreateImmutableSet","iterable","internalSet","Set","size","add","value","nextSet","clear","delete","has","Symbol","iterator"],"mappings":";;;;;;;;;;;IAAaA,iBAAiB,MAAjBA;IAIGC,kBAAkB,MAAlBA;IAQAC,6BAA6B,MAA7BA;;AAZT,MAAMF,oBAAoB,WAAW,GAAEC;AAIvC,SAASA,mBAAmBE,QAAQ,EAAE;IAC3C,MAAMC,cAAc,IAAIC,IAAIF;IAC5B,OAAOD,8BAA8BE;AACvC;AAKO,SAASF,8BAA8BE,WAAW,EAAE;IACzD,OAAO;QACLE,MAAMF,YAAYE,IAAI;QACtBC,KAAIC,KAAK,EAAE;YACT,MAAMC,UAAU,IAAIJ,IAAID;YACxBK,QAAQF,GAAG,CAACC;YACZ,OAAON,8BAA8BO;QACvC;QACAC,SAAQ;YACN,OAAOV;QACT;QACAW,QAAOH,KAAK,EAAE;YACZ,MAAMC,UAAU,IAAIJ,IAAID;YACxBK,QAAQE,MAAM,CAACH;YACf,OAAON,8BAA8BO;QACvC;QACAG,KAAIJ,KAAK,EAAE;YACT,OAAOJ,YAAYQ,GAAG,CAACJ;QACzB;QACA,CAACK,OAAOC,QAAQ,CAAC,IAAG;YAClB,OAAOV,WAAW,CAACS,OAAOC,QAAQ,CAAC;QACrC;IACF;AACF,EACA,wCAAwC"}

package/lib-commonjs/utils/assert.js

@@ -1,14 +1,18 @@
 "use strict";
-
 Object.defineProperty(exports, "__esModule", {
-  value: true
+    value: true
+});
+Object.defineProperty(exports, "assertIsDefinedRef", {
+    enumerable: true,
+    get: ()=>assertIsDefinedRef
 });
-exports.assertIsDefinedRef = void 0;
+const _interopRequireWildcard = require("@swc/helpers/lib/_interop_require_wildcard.js").default;
+const _react = /*#__PURE__*/ _interopRequireWildcard(require("react"));
 function assertIsDefinedRef(refObject, msg = `assertIsDefinedRef: reference not properly defined ${refObject}`) {
-  // eslint-disable-next-line eqeqeq
-  if (refObject.current == undefined && process.env.NODE_ENV === 'development') {
-    throw new TypeError(msg);
-  }
-}
-exports.assertIsDefinedRef = assertIsDefinedRef;
+    // eslint-disable-next-line eqeqeq
+    if (refObject.current == undefined && process.env.NODE_ENV === 'development') {
+        throw new TypeError(msg);
+    }
+} //# sourceMappingURL=assert.js.map
+
 //# sourceMappingURL=assert.js.map

package/lib-commonjs/utils/assert.js.map

@@ -1 +1 @@
-{"version":3,"names":["assertIsDefinedRef","refObject","msg","current","undefined","process","env","NODE_ENV","TypeError","exports"],"sources":["../src/packages/react-components/react-tree/src/utils/assert.ts"],"sourcesContent":["import * 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): 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"],"mappings":";;;;;;AAEA,SAAgBA,kBAAkBA,CAChCC,SAAgD,EAChDC,GAAG,GAAG,sDAAsDD,SAAS,EAAE;EAEvE;EACA,IAAIA,SAAS,CAACE,OAAO,IAAIC,SAAS,IAAIC,OAAO,CAACC,GAAG,CAACC,QAAQ,KAAK,aAAa,EAAE;IAC5E,MAAM,IAAIC,SAAS,CAACN,GAAG,CAAC;;AAE5B;AARAO,OAAA,CAAAT,kBAAA,GAAAA,kBAAA"}
+{"version":3,"sources":["../../lib/utils/assert.js"],"sourcesContent":["import * as React from 'react';\nexport function assertIsDefinedRef(refObject, msg = `assertIsDefinedRef: reference not properly defined ${refObject}`) {\n  // eslint-disable-next-line eqeqeq\n  if (refObject.current == undefined && process.env.NODE_ENV === 'development') {\n    throw new TypeError(msg);\n  }\n}\n//# sourceMappingURL=assert.js.map"],"names":["assertIsDefinedRef","refObject","msg","current","undefined","process","env","NODE_ENV","TypeError"],"mappings":";;;;+BACgBA;;aAAAA;;;6DADO;AAChB,SAASA,mBAAmBC,SAAS,EAAEC,MAAM,CAAC,mDAAmD,EAAED,UAAU,CAAC,EAAE;IACrH,kCAAkC;IAClC,IAAIA,UAAUE,OAAO,IAAIC,aAAaC,QAAQC,GAAG,CAACC,QAAQ,KAAK,eAAe;QAC5E,MAAM,IAAIC,UAAUN,KAAK;IAC3B,CAAC;AACH,EACA,kCAAkC"}

package/lib-commonjs/utils/createUnfilteredFlatTree.js

@@ -1,84 +1,93 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.flatTreeRootParentId = exports.createUnfilteredFlatTree = void 0;
 /**
  * creates a list of flat tree items
  * and provides a map to access each item by id
- */
+ */ "use strict";
+Object.defineProperty(exports, "__esModule", {
+    value: true
+});
+function _export(target, all) {
+    for(var name in all)Object.defineProperty(target, name, {
+        enumerable: true,
+        get: all[name]
+    });
+}
+_export(exports, {
+    createUnfilteredFlatTree: ()=>createUnfilteredFlatTree,
+    flatTreeRootParentId: ()=>flatTreeRootParentId
+});
 function createUnfilteredFlatTree(flatTreeItemProps) {
-  var _a;
-  const root = createRootFlatTreeItem();
-  const itemsPerId = new Map([[root.id, root]]);
-  const items = [];
-  for (let index = 0; index < flatTreeItemProps.length; index++) {
-    const {
-      parentId = exports.flatTreeRootParentId,
-      ...treeItemProps
-    } = flatTreeItemProps[index];
-    const nextItemProps = flatTreeItemProps[index + 1];
-    const currentParent = itemsPerId.get(parentId);
-    if (!currentParent) {
-      if (process.env.NODE_ENV === 'development') {
-        // eslint-disable-next-line no-console
-        console.error(`useFlatTree: item ${flatTreeItemProps[index].id} not properly initialized, make sure provided items are organized`);
-      }
-      break;
+    const root = createRootFlatTreeItem();
+    const itemsPerId = new Map([
+        [
+            root.id,
+            root
+        ]
+    ]);
+    const items = [];
+    for(let index = 0; index < flatTreeItemProps.length; index++){
+        const { parentId =flatTreeRootParentId , ...treeItemProps } = flatTreeItemProps[index];
+        const nextItemProps = flatTreeItemProps[index + 1];
+        const currentParent = itemsPerId.get(parentId);
+        if (!currentParent) {
+            if (process.env.NODE_ENV === 'development') {
+                // eslint-disable-next-line no-console
+                console.error(`useFlatTree: item ${flatTreeItemProps[index].id} not properly initialized, make sure provided items are organized`);
+            }
+            break;
+        }
+        const isLeaf = (nextItemProps === null || nextItemProps === void 0 ? void 0 : nextItemProps.parentId) !== treeItemProps.id;
+        var _currentParent_level;
+        const currentLevel = ((_currentParent_level = currentParent.level) !== null && _currentParent_level !== void 0 ? _currentParent_level : 0) + 1;
+        const currentChildrenSize = ++currentParent.childrenSize;
+        const flatTreeItem = {
+            id: treeItemProps.id,
+            getTreeItemProps: ()=>({
+                    ...treeItemProps,
+                    'aria-level': currentLevel,
+                    'aria-posinset': currentChildrenSize,
+                    'aria-setsize': currentParent.childrenSize,
+                    leaf: isLeaf
+                }),
+            level: currentLevel,
+            parentId,
+            childrenSize: 0,
+            index: -1
+        };
+        itemsPerId.set(flatTreeItem.id, flatTreeItem);
+        items.push(flatTreeItem);
     }
-    const isLeaf = (nextItemProps === null || nextItemProps === void 0 ? void 0 : nextItemProps.parentId) !== treeItemProps.id;
-    const currentLevel = ((_a = currentParent.level) !== null && _a !== void 0 ? _a : 0) + 1;
-    const currentChildrenSize = ++currentParent.childrenSize;
-    const flatTreeItem = {
-      id: treeItemProps.id,
-      getTreeItemProps: () => ({
-        ...treeItemProps,
-        'aria-level': currentLevel,
-        'aria-posinset': currentChildrenSize,
-        'aria-setsize': currentParent.childrenSize,
-        leaf: isLeaf
-      }),
-      level: currentLevel,
-      parentId,
-      childrenSize: 0,
-      index: -1
+    return {
+        items,
+        itemsPerId
     };
-    itemsPerId.set(flatTreeItem.id, flatTreeItem);
-    items.push(flatTreeItem);
-  }
-  return {
-    items,
-    itemsPerId
-  };
 }
-exports.createUnfilteredFlatTree = createUnfilteredFlatTree;
-exports.flatTreeRootParentId = '__fuiFlatTreeRoot';
+const flatTreeRootParentId = '__fuiFlatTreeRoot';
 function createRootFlatTreeItem() {
-  return {
-    id: exports.flatTreeRootParentId,
-    getTreeItemProps: () => {
-      if (process.env.NODE_ENV === 'development') {
-        // eslint-disable-next-line no-console
-        console.error('useFlatTree: internal error, trying to access treeitem props from invalid root element');
-      }
-      return {
-        id: exports.flatTreeRootParentId,
-        'aria-setsize': -1,
-        'aria-level': -1,
-        'aria-posinset': -1,
-        leaf: true
-      };
-    },
-    childrenSize: 0,
-    get index() {
-      if (process.env.NODE_ENV === 'development') {
-        // eslint-disable-next-line no-console
-        console.error('useFlatTree: internal error, trying to access treeitem props from invalid root element');
-      }
-      return -1;
-    },
-    level: 0
-  };
-}
+    return {
+        id: flatTreeRootParentId,
+        getTreeItemProps: ()=>{
+            if (process.env.NODE_ENV === 'development') {
+                // eslint-disable-next-line no-console
+                console.error('useFlatTree: internal error, trying to access treeitem props from invalid root element');
+            }
+            return {
+                id: flatTreeRootParentId,
+                'aria-setsize': -1,
+                'aria-level': -1,
+                'aria-posinset': -1,
+                leaf: true
+            };
+        },
+        childrenSize: 0,
+        get index () {
+            if (process.env.NODE_ENV === 'development') {
+                // eslint-disable-next-line no-console
+                console.error('useFlatTree: internal error, trying to access treeitem props from invalid root element');
+            }
+            return -1;
+        },
+        level: 0
+    };
+} //# sourceMappingURL=createUnfilteredFlatTree.js.map
+
 //# sourceMappingURL=createUnfilteredFlatTree.js.map

package/lib-commonjs/utils/createUnfilteredFlatTree.js.map

@@ -1 +1 @@
-{"version":3,"names":["createUnfilteredFlatTree","flatTreeItemProps","root","createRootFlatTreeItem","itemsPerId","Map","id","items","index","length","parentId","exports","flatTreeRootParentId","treeItemProps","nextItemProps","currentParent","get","process","env","NODE_ENV","console","error","isLeaf","currentLevel","_a","level","currentChildrenSize","childrenSize","flatTreeItem","getTreeItemProps","leaf","set","push"],"sources":["../src/packages/react-components/react-tree/src/utils/createUnfilteredFlatTree.ts"],"sourcesContent":["import { FlatTreeItem, FlatTreeItemProps } from '../hooks/useFlatTree';\n\n/**\n * @internal\n */\nexport type UnfilteredFlatTree = {\n  items: FlatTreeItem[];\n  itemsPerId: Map<string, FlatTreeItem>;\n};\n\n/**\n * creates a list of flat tree items\n * and provides a map to access each item by id\n */\nexport function createUnfilteredFlatTree(flatTreeItemProps: FlatTreeItemProps[]): UnfilteredFlatTree {\n  const root = createRootFlatTreeItem();\n  const itemsPerId = new Map<string, FlatTreeItem>([[root.id, root]]);\n  const items: FlatTreeItem[] = [];\n\n  for (let index = 0; index < flatTreeItemProps.length; index++) {\n    const { parentId = flatTreeRootParentId, ...treeItemProps } = flatTreeItemProps[index];\n\n    const nextItemProps = flatTreeItemProps[index + 1] as FlatTreeItemProps | undefined;\n    const currentParent = itemsPerId.get(parentId);\n    if (!currentParent) {\n      if (process.env.NODE_ENV === 'development') {\n        // eslint-disable-next-line no-console\n        console.error(\n          `useFlatTree: item ${flatTreeItemProps[index].id} not properly initialized, make sure provided items are organized`,\n        );\n      }\n      break;\n    }\n    const isLeaf = nextItemProps?.parentId !== treeItemProps.id;\n    const currentLevel = (currentParent.level ?? 0) + 1;\n    const currentChildrenSize = ++currentParent.childrenSize;\n\n    const flatTreeItem: FlatTreeItem = {\n      id: treeItemProps.id,\n      getTreeItemProps: () => ({\n        ...treeItemProps,\n        'aria-level': currentLevel,\n        'aria-posinset': currentChildrenSize,\n        'aria-setsize': currentParent.childrenSize,\n        leaf: isLeaf,\n      }),\n      level: currentLevel,\n      parentId,\n      childrenSize: 0,\n      index: -1,\n    };\n    itemsPerId.set(flatTreeItem.id, flatTreeItem);\n    items.push(flatTreeItem);\n  }\n\n  return { items, itemsPerId };\n}\n\nexport const flatTreeRootParentId = '__fuiFlatTreeRoot';\n\nfunction createRootFlatTreeItem(): FlatTreeItem {\n  return {\n    id: flatTreeRootParentId,\n    getTreeItemProps: () => {\n      if (process.env.NODE_ENV === 'development') {\n        // eslint-disable-next-line no-console\n        console.error('useFlatTree: internal error, trying to access treeitem props from invalid root element');\n      }\n      return { id: flatTreeRootParentId, 'aria-setsize': -1, 'aria-level': -1, 'aria-posinset': -1, leaf: true };\n    },\n    childrenSize: 0,\n    get index() {\n      if (process.env.NODE_ENV === 'development') {\n        // eslint-disable-next-line no-console\n        console.error('useFlatTree: internal error, trying to access treeitem props from invalid root element');\n      }\n      return -1;\n    },\n    level: 0,\n  };\n}\n"],"mappings":";;;;;;AAUA;;;;AAIA,SAAgBA,wBAAwBA,CAACC,iBAAsC;;EAC7E,MAAMC,IAAI,GAAGC,sBAAsB,EAAE;EACrC,MAAMC,UAAU,GAAG,IAAIC,GAAG,CAAuB,CAAC,CAACH,IAAI,CAACI,EAAE,EAAEJ,IAAI,CAAC,CAAC,CAAC;EACnE,MAAMK,KAAK,GAAmB,EAAE;EAEhC,KAAK,IAAIC,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAGP,iBAAiB,CAACQ,MAAM,EAAED,KAAK,EAAE,EAAE;IAC7D,MAAM;MAAEE,QAAQ,GAAGC,OAAA,CAAAC,oBAAoB;MAAE,GAAGC;IAAa,CAAE,GAAGZ,iBAAiB,CAACO,KAAK,CAAC;IAEtF,MAAMM,aAAa,GAAGb,iBAAiB,CAACO,KAAK,GAAG,CAAC,CAAkC;IACnF,MAAMO,aAAa,GAAGX,UAAU,CAACY,GAAG,CAACN,QAAQ,CAAC;IAC9C,IAAI,CAACK,aAAa,EAAE;MAClB,IAAIE,OAAO,CAACC,GAAG,CAACC,QAAQ,KAAK,aAAa,EAAE;QAC1C;QACAC,OAAO,CAACC,KAAK,CACX,qBAAqBpB,iBAAiB,CAACO,KAAK,CAAC,CAACF,EAAE,mEAAmE,CACpH;;MAEH;;IAEF,MAAMgB,MAAM,GAAG,CAAAR,aAAa,aAAbA,aAAa,uBAAbA,aAAa,CAAEJ,QAAQ,MAAKG,aAAa,CAACP,EAAE;IAC3D,MAAMiB,YAAY,GAAG,CAAC,CAAAC,EAAA,GAAAT,aAAa,CAACU,KAAK,cAAAD,EAAA,cAAAA,EAAA,GAAI,CAAC,IAAI,CAAC;IACnD,MAAME,mBAAmB,GAAG,EAAEX,aAAa,CAACY,YAAY;IAExD,MAAMC,YAAY,GAAiB;MACjCtB,EAAE,EAAEO,aAAa,CAACP,EAAE;MACpBuB,gBAAgB,EAAEA,CAAA,MAAO;QACvB,GAAGhB,aAAa;QAChB,YAAY,EAAEU,YAAY;QAC1B,eAAe,EAAEG,mBAAmB;QACpC,cAAc,EAAEX,aAAa,CAACY,YAAY;QAC1CG,IAAI,EAAER;OACP,CAAC;MACFG,KAAK,EAAEF,YAAY;MACnBb,QAAQ;MACRiB,YAAY,EAAE,CAAC;MACfnB,KAAK,EAAE,CAAC;KACT;IACDJ,UAAU,CAAC2B,GAAG,CAACH,YAAY,CAACtB,EAAE,EAAEsB,YAAY,CAAC;IAC7CrB,KAAK,CAACyB,IAAI,CAACJ,YAAY,CAAC;;EAG1B,OAAO;IAAErB,KAAK;IAAEH;EAAU,CAAE;AAC9B;AA1CAO,OAAA,CAAAX,wBAAA,GAAAA,wBAAA;AA4CaW,OAAA,CAAAC,oBAAoB,GAAG,mBAAmB;AAEvD,SAAST,sBAAsBA,CAAA;EAC7B,OAAO;IACLG,EAAE,EAAEK,OAAA,CAAAC,oBAAoB;IACxBiB,gBAAgB,EAAEA,CAAA,KAAK;MACrB,IAAIZ,OAAO,CAACC,GAAG,CAACC,QAAQ,KAAK,aAAa,EAAE;QAC1C;QACAC,OAAO,CAACC,KAAK,CAAC,wFAAwF,CAAC;;MAEzG,OAAO;QAAEf,EAAE,EAAEK,OAAA,CAAAC,oBAAoB;QAAE,cAAc,EAAE,CAAC,CAAC;QAAE,YAAY,EAAE,CAAC,CAAC;QAAE,eAAe,EAAE,CAAC,CAAC;QAAEkB,IAAI,EAAE;MAAI,CAAE;IAC5G,CAAC;IACDH,YAAY,EAAE,CAAC;IACf,IAAInB,KAAKA,CAAA;MACP,IAAIS,OAAO,CAACC,GAAG,CAACC,QAAQ,KAAK,aAAa,EAAE;QAC1C;QACAC,OAAO,CAACC,KAAK,CAAC,wFAAwF,CAAC;;MAEzG,OAAO,CAAC,CAAC;IACX,CAAC;IACDI,KAAK,EAAE;GACR;AACH"}
+{"version":3,"sources":["../../lib/utils/createUnfilteredFlatTree.js"],"sourcesContent":["/**\n * creates a list of flat tree items\n * and provides a map to access each item by id\n */export function createUnfilteredFlatTree(flatTreeItemProps) {\n  const root = createRootFlatTreeItem();\n  const itemsPerId = new Map([[root.id, root]]);\n  const items = [];\n  for (let index = 0; index < flatTreeItemProps.length; index++) {\n    const {\n      parentId = flatTreeRootParentId,\n      ...treeItemProps\n    } = flatTreeItemProps[index];\n    const nextItemProps = flatTreeItemProps[index + 1];\n    const currentParent = itemsPerId.get(parentId);\n    if (!currentParent) {\n      if (process.env.NODE_ENV === 'development') {\n        // eslint-disable-next-line no-console\n        console.error(`useFlatTree: item ${flatTreeItemProps[index].id} not properly initialized, make sure provided items are organized`);\n      }\n      break;\n    }\n    const isLeaf = (nextItemProps === null || nextItemProps === void 0 ? void 0 : nextItemProps.parentId) !== treeItemProps.id;\n    var _currentParent_level;\n    const currentLevel = ((_currentParent_level = currentParent.level) !== null && _currentParent_level !== void 0 ? _currentParent_level : 0) + 1;\n    const currentChildrenSize = ++currentParent.childrenSize;\n    const flatTreeItem = {\n      id: treeItemProps.id,\n      getTreeItemProps: () => ({\n        ...treeItemProps,\n        'aria-level': currentLevel,\n        'aria-posinset': currentChildrenSize,\n        'aria-setsize': currentParent.childrenSize,\n        leaf: isLeaf\n      }),\n      level: currentLevel,\n      parentId,\n      childrenSize: 0,\n      index: -1\n    };\n    itemsPerId.set(flatTreeItem.id, flatTreeItem);\n    items.push(flatTreeItem);\n  }\n  return {\n    items,\n    itemsPerId\n  };\n}\nexport const flatTreeRootParentId = '__fuiFlatTreeRoot';\nfunction createRootFlatTreeItem() {\n  return {\n    id: flatTreeRootParentId,\n    getTreeItemProps: () => {\n      if (process.env.NODE_ENV === 'development') {\n        // eslint-disable-next-line no-console\n        console.error('useFlatTree: internal error, trying to access treeitem props from invalid root element');\n      }\n      return {\n        id: flatTreeRootParentId,\n        'aria-setsize': -1,\n        'aria-level': -1,\n        'aria-posinset': -1,\n        leaf: true\n      };\n    },\n    childrenSize: 0,\n    get index() {\n      if (process.env.NODE_ENV === 'development') {\n        // eslint-disable-next-line no-console\n        console.error('useFlatTree: internal error, trying to access treeitem props from invalid root element');\n      }\n      return -1;\n    },\n    level: 0\n  };\n}\n//# sourceMappingURL=createUnfilteredFlatTree.js.map"],"names":["createUnfilteredFlatTree","flatTreeRootParentId","flatTreeItemProps","root","createRootFlatTreeItem","itemsPerId","Map","id","items","index","length","parentId","treeItemProps","nextItemProps","currentParent","get","process","env","NODE_ENV","console","error","isLeaf","_currentParent_level","currentLevel","level","currentChildrenSize","childrenSize","flatTreeItem","getTreeItemProps","leaf","set","push"],"mappings":"AAAA;;;CAGC;;;;;;;;;;;IAAkBA,wBAAwB,MAAxBA;IA4CNC,oBAAoB,MAApBA;;AA5CH,SAASD,yBAAyBE,iBAAiB,EAAE;IAC7D,MAAMC,OAAOC;IACb,MAAMC,aAAa,IAAIC,IAAI;QAAC;YAACH,KAAKI,EAAE;YAAEJ;SAAK;KAAC;IAC5C,MAAMK,QAAQ,EAAE;IAChB,IAAK,IAAIC,QAAQ,GAAGA,QAAQP,kBAAkBQ,MAAM,EAAED,QAAS;QAC7D,MAAM,EACJE,UAAWV,qBAAoB,EAC/B,GAAGW,eACJ,GAAGV,iBAAiB,CAACO,MAAM;QAC5B,MAAMI,gBAAgBX,iBAAiB,CAACO,QAAQ,EAAE;QAClD,MAAMK,gBAAgBT,WAAWU,GAAG,CAACJ;QACrC,IAAI,CAACG,eAAe;YAClB,IAAIE,QAAQC,GAAG,CAACC,QAAQ,KAAK,eAAe;gBAC1C,sCAAsC;gBACtCC,QAAQC,KAAK,CAAC,CAAC,kBAAkB,EAAElB,iBAAiB,CAACO,MAAM,CAACF,EAAE,CAAC,iEAAiE,CAAC;YACnI,CAAC;YACD,KAAM;QACR,CAAC;QACD,MAAMc,SAAS,AAACR,CAAAA,kBAAkB,IAAI,IAAIA,kBAAkB,KAAK,IAAI,KAAK,IAAIA,cAAcF,QAAQ,AAAD,MAAOC,cAAcL,EAAE;QAC1H,IAAIe;QACJ,MAAMC,eAAe,AAAC,CAAA,AAACD,CAAAA,uBAAuBR,cAAcU,KAAK,AAAD,MAAO,IAAI,IAAIF,yBAAyB,KAAK,IAAIA,uBAAuB,CAAC,AAAD,IAAK;QAC7I,MAAMG,sBAAsB,EAAEX,cAAcY,YAAY;QACxD,MAAMC,eAAe;YACnBpB,IAAIK,cAAcL,EAAE;YACpBqB,kBAAkB,IAAO,CAAA;oBACvB,GAAGhB,aAAa;oBAChB,cAAcW;oBACd,iBAAiBE;oBACjB,gBAAgBX,cAAcY,YAAY;oBAC1CG,MAAMR;gBACR,CAAA;YACAG,OAAOD;YACPZ;YACAe,cAAc;YACdjB,OAAO,CAAC;QACV;QACAJ,WAAWyB,GAAG,CAACH,aAAapB,EAAE,EAAEoB;QAChCnB,MAAMuB,IAAI,CAACJ;IACb;IACA,OAAO;QACLnB;QACAH;IACF;AACF;AACO,MAAMJ,uBAAuB;AACpC,SAASG,yBAAyB;IAChC,OAAO;QACLG,IAAIN;QACJ2B,kBAAkB,IAAM;YACtB,IAAIZ,QAAQC,GAAG,CAACC,QAAQ,KAAK,eAAe;gBAC1C,sCAAsC;gBACtCC,QAAQC,KAAK,CAAC;YAChB,CAAC;YACD,OAAO;gBACLb,IAAIN;gBACJ,gBAAgB,CAAC;gBACjB,cAAc,CAAC;gBACf,iBAAiB,CAAC;gBAClB4B,MAAM,IAAI;YACZ;QACF;QACAH,cAAc;QACd,IAAIjB,SAAQ;YACV,IAAIO,QAAQC,GAAG,CAACC,QAAQ,KAAK,eAAe;gBAC1C,sCAAsC;gBACtCC,QAAQC,KAAK,CAAC;YAChB,CAAC;YACD,OAAO,CAAC;QACV;QACAI,OAAO;IACT;AACF,EACA,oDAAoD"}

package/lib-commonjs/utils/createVisibleFlatTree.js

@@ -1,87 +1,86 @@
 "use strict";
-
 Object.defineProperty(exports, "__esModule", {
-  value: true
+    value: true
+});
+Object.defineProperty(exports, "createVisibleFlatTree", {
+    enumerable: true,
+    get: ()=>createVisibleFlatTree
 });
-exports.createVisibleFlatTree = void 0;
-const createUnfilteredFlatTree_1 = /*#__PURE__*/require("./createUnfilteredFlatTree");
-const tokens_1 = /*#__PURE__*/require("./tokens");
-/**
- * creates methods that depend on the unfilteredFlatTree and the current available openItems
- */
+const _createUnfilteredFlatTree = require("./createUnfilteredFlatTree");
+const _tokens = require("./tokens");
 function createVisibleFlatTree(unfilteredFlatTree, openItems) {
-  let visibleItems = null;
-  const getNextNavigableItem = data => {
-    var _a, _b, _c, _d;
-    const item = unfilteredFlatTree.itemsPerId.get(data.target.id);
-    if (!item || !visibleItems) {
-      return null;
-    }
-    switch (data.type) {
-      case tokens_1.treeDataTypes.arrowLeft:
-        return item.parentId ? (_a = unfilteredFlatTree.itemsPerId.get(item.parentId)) !== null && _a !== void 0 ? _a : null : null;
-      case tokens_1.treeDataTypes.arrowRight:
-        return (_b = visibleItems[item.index + 1]) !== null && _b !== void 0 ? _b : null;
-      case tokens_1.treeDataTypes.end:
-        return visibleItems[visibleItems.length - 1];
-      case tokens_1.treeDataTypes.home:
-        return visibleItems[0];
-      case tokens_1.treeDataTypes.arrowDown:
-        return (_c = visibleItems[item.index + 1]) !== null && _c !== void 0 ? _c : null;
-      case tokens_1.treeDataTypes.arrowUp:
-        return (_d = visibleItems[item.index - 1]) !== null && _d !== void 0 ? _d : null;
-      default:
-        return null;
-    }
-  };
-  function* makeVisibleItemsGenerator() {
-    var _a;
-    visibleItems = [];
-    for (let index = 0, visibleIndex = 0; index < unfilteredFlatTree.items.length; index++) {
-      const item = unfilteredFlatTree.items[index];
-      const parent = unfilteredFlatTree.itemsPerId.get((_a = item.parentId) !== null && _a !== void 0 ? _a : createUnfilteredFlatTree_1.flatTreeRootParentId);
-      if (!parent) {
-        break;
-      }
-      if (isFlatTreeItemVisible(item, {
-        openItems,
-        unfilteredFlatTree
-      })) {
-        item.index = visibleIndex++;
-        visibleItems.push({
-          ...item
-        });
-        yield item;
-      } else {
-        index += parent.childrenSize - 1 + item.childrenSize;
-      }
-    }
-  }
-  return {
-    getNextNavigableItem,
-    items: () => {
-      return visibleItems || makeVisibleItemsGenerator();
+    let visibleItems = null;
+    const getNextNavigableItem = (data)=>{
+        const item = unfilteredFlatTree.itemsPerId.get(data.target.id);
+        if (!item || !visibleItems) {
+            return null;
+        }
+        switch(data.type){
+            case _tokens.treeDataTypes.arrowLeft:
+                var _unfilteredFlatTree_itemsPerId_get;
+                return item.parentId ? (_unfilteredFlatTree_itemsPerId_get = unfilteredFlatTree.itemsPerId.get(item.parentId)) !== null && _unfilteredFlatTree_itemsPerId_get !== void 0 ? _unfilteredFlatTree_itemsPerId_get : null : null;
+            case _tokens.treeDataTypes.arrowRight:
+                var _visibleItems_;
+                return (_visibleItems_ = visibleItems[item.index + 1]) !== null && _visibleItems_ !== void 0 ? _visibleItems_ : null;
+            case _tokens.treeDataTypes.end:
+                return visibleItems[visibleItems.length - 1];
+            case _tokens.treeDataTypes.home:
+                return visibleItems[0];
+            case _tokens.treeDataTypes.arrowDown:
+                var _visibleItems_1;
+                return (_visibleItems_1 = visibleItems[item.index + 1]) !== null && _visibleItems_1 !== void 0 ? _visibleItems_1 : null;
+            case _tokens.treeDataTypes.arrowUp:
+                var _visibleItems_2;
+                return (_visibleItems_2 = visibleItems[item.index - 1]) !== null && _visibleItems_2 !== void 0 ? _visibleItems_2 : null;
+            default:
+                return null;
+        }
+    };
+    function* makeVisibleItemsGenerator() {
+        visibleItems = [];
+        for(let index = 0, visibleIndex = 0; index < unfilteredFlatTree.items.length; index++){
+            const item = unfilteredFlatTree.items[index];
+            var _item_parentId;
+            const parent = unfilteredFlatTree.itemsPerId.get((_item_parentId = item.parentId) !== null && _item_parentId !== void 0 ? _item_parentId : _createUnfilteredFlatTree.flatTreeRootParentId);
+            if (!parent) {
+                break;
+            }
+            if (isFlatTreeItemVisible(item, {
+                openItems,
+                unfilteredFlatTree
+            })) {
+                item.index = visibleIndex++;
+                visibleItems.push({
+                    ...item
+                });
+                yield item;
+            } else {
+                index += parent.childrenSize - 1 + item.childrenSize;
+            }
+        }
     }
-  };
+    return {
+        getNextNavigableItem,
+        items: ()=>{
+            return visibleItems || makeVisibleItemsGenerator();
+        }
+    };
 }
-exports.createVisibleFlatTree = createVisibleFlatTree;
-function isFlatTreeItemVisible(item, {
-  openItems,
-  unfilteredFlatTree: flatTree
-}) {
-  if (item.level === 1) {
-    return true;
-  }
-  while (item.parentId && item.parentId !== createUnfilteredFlatTree_1.flatTreeRootParentId) {
-    if (!openItems.has(item.parentId)) {
-      return false;
+function isFlatTreeItemVisible(item, { openItems , unfilteredFlatTree: flatTree  }) {
+    if (item.level === 1) {
+        return true;
     }
-    const parent = flatTree.itemsPerId.get(item.parentId);
-    if (!parent) {
-      return false;
+    while(item.parentId && item.parentId !== _createUnfilteredFlatTree.flatTreeRootParentId){
+        if (!openItems.has(item.parentId)) {
+            return false;
+        }
+        const parent = flatTree.itemsPerId.get(item.parentId);
+        if (!parent) {
+            return false;
+        }
+        item = parent;
     }
-    item = parent;
-  }
-  return true;
-}
+    return true;
+} //# sourceMappingURL=createVisibleFlatTree.js.map
+
 //# sourceMappingURL=createVisibleFlatTree.js.map

package/lib-commonjs/utils/createVisibleFlatTree.js.map

@@ -1 +1 @@
-{"version":3,"names":["createUnfilteredFlatTree_1","require","tokens_1","createVisibleFlatTree","unfilteredFlatTree","openItems","visibleItems","getNextNavigableItem","data","item","itemsPerId","get","target","id","type","treeDataTypes","arrowLeft","parentId","_a","arrowRight","_b","index","end","length","home","arrowDown","_c","arrowUp","_d","makeVisibleItemsGenerator","visibleIndex","items","parent","flatTreeRootParentId","isFlatTreeItemVisible","push","childrenSize","exports","flatTree","level","has"],"sources":["../src/packages/react-components/react-tree/src/utils/createVisibleFlatTree.ts"],"sourcesContent":["import { FlatTree, FlatTreeItem } from '../hooks/useFlatTree';\nimport { TreeItemId, TreeNavigationData_unstable } from '../Tree';\nimport { flatTreeRootParentId, UnfilteredFlatTree } from './createUnfilteredFlatTree';\nimport { ImmutableSet } from './ImmutableSet';\nimport { treeDataTypes } from './tokens';\n\n/**\n * creates methods that depend on the unfilteredFlatTree and the current available openItems\n */\nexport function createVisibleFlatTree(\n  unfilteredFlatTree: UnfilteredFlatTree,\n  openItems: ImmutableSet<TreeItemId>,\n): Pick<FlatTree, 'items' | 'getNextNavigableItem'> {\n  let visibleItems: FlatTreeItem[] | null = null;\n\n  const getNextNavigableItem = (data: TreeNavigationData_unstable): FlatTreeItem | null => {\n    const item = unfilteredFlatTree.itemsPerId.get(data.target.id);\n    if (!item || !visibleItems) {\n      return null;\n    }\n    switch (data.type) {\n      case treeDataTypes.arrowLeft:\n        return item.parentId ? unfilteredFlatTree.itemsPerId.get(item.parentId) ?? null : null;\n      case treeDataTypes.arrowRight:\n        return visibleItems[item.index + 1] ?? null;\n      case treeDataTypes.end:\n        return visibleItems[visibleItems.length - 1];\n      case treeDataTypes.home:\n        return visibleItems[0];\n      case treeDataTypes.arrowDown:\n        return visibleItems[item.index + 1] ?? null;\n      case treeDataTypes.arrowUp:\n        return visibleItems[item.index - 1] ?? null;\n      default:\n        return null;\n    }\n  };\n\n  function* makeVisibleItemsGenerator() {\n    visibleItems = [];\n    for (let index = 0, visibleIndex = 0; index < unfilteredFlatTree.items.length; index++) {\n      const item = unfilteredFlatTree.items[index];\n      const parent = unfilteredFlatTree.itemsPerId.get(item.parentId ?? flatTreeRootParentId);\n      if (!parent) {\n        break;\n      }\n      if (isFlatTreeItemVisible(item, { openItems, unfilteredFlatTree })) {\n        item.index = visibleIndex++;\n        visibleItems.push({ ...item });\n        yield item;\n      } else {\n        index += parent.childrenSize - 1 + item.childrenSize;\n      }\n    }\n  }\n\n  return {\n    getNextNavigableItem,\n    items: () => {\n      return visibleItems || makeVisibleItemsGenerator();\n    },\n  };\n}\n\nfunction isFlatTreeItemVisible(\n  item: FlatTreeItem,\n  {\n    openItems,\n    unfilteredFlatTree: flatTree,\n  }: {\n    openItems: ImmutableSet<TreeItemId>;\n    unfilteredFlatTree: UnfilteredFlatTree;\n  },\n) {\n  if (item.level === 1) {\n    return true;\n  }\n  while (item.parentId && item.parentId !== flatTreeRootParentId) {\n    if (!openItems.has(item.parentId)) {\n      return false;\n    }\n    const parent = flatTree.itemsPerId.get(item.parentId);\n    if (!parent) {\n      return false;\n    }\n    item = parent;\n  }\n\n  return true;\n}\n"],"mappings":";;;;;;AAEA,MAAAA,0BAAA,gBAAAC,OAAA;AAEA,MAAAC,QAAA,gBAAAD,OAAA;AAEA;;;AAGA,SAAgBE,qBAAqBA,CACnCC,kBAAsC,EACtCC,SAAmC;EAEnC,IAAIC,YAAY,GAA0B,IAAI;EAE9C,MAAMC,oBAAoB,GAAIC,IAAiC,IAAyB;;IACtF,MAAMC,IAAI,GAAGL,kBAAkB,CAACM,UAAU,CAACC,GAAG,CAACH,IAAI,CAACI,MAAM,CAACC,EAAE,CAAC;IAC9D,IAAI,CAACJ,IAAI,IAAI,CAACH,YAAY,EAAE;MAC1B,OAAO,IAAI;;IAEb,QAAQE,IAAI,CAACM,IAAI;MACf,KAAKZ,QAAA,CAAAa,aAAa,CAACC,SAAS;QAC1B,OAAOP,IAAI,CAACQ,QAAQ,GAAG,CAAAC,EAAA,GAAAd,kBAAkB,CAACM,UAAU,CAACC,GAAG,CAACF,IAAI,CAACQ,QAAQ,CAAC,cAAAC,EAAA,cAAAA,EAAA,GAAI,IAAI,GAAG,IAAI;MACxF,KAAKhB,QAAA,CAAAa,aAAa,CAACI,UAAU;QAC3B,OAAO,CAAAC,EAAA,GAAAd,YAAY,CAACG,IAAI,CAACY,KAAK,GAAG,CAAC,CAAC,cAAAD,EAAA,cAAAA,EAAA,GAAI,IAAI;MAC7C,KAAKlB,QAAA,CAAAa,aAAa,CAACO,GAAG;QACpB,OAAOhB,YAAY,CAACA,YAAY,CAACiB,MAAM,GAAG,CAAC,CAAC;MAC9C,KAAKrB,QAAA,CAAAa,aAAa,CAACS,IAAI;QACrB,OAAOlB,YAAY,CAAC,CAAC,CAAC;MACxB,KAAKJ,QAAA,CAAAa,aAAa,CAACU,SAAS;QAC1B,OAAO,CAAAC,EAAA,GAAApB,YAAY,CAACG,IAAI,CAACY,KAAK,GAAG,CAAC,CAAC,cAAAK,EAAA,cAAAA,EAAA,GAAI,IAAI;MAC7C,KAAKxB,QAAA,CAAAa,aAAa,CAACY,OAAO;QACxB,OAAO,CAAAC,EAAA,GAAAtB,YAAY,CAACG,IAAI,CAACY,KAAK,GAAG,CAAC,CAAC,cAAAO,EAAA,cAAAA,EAAA,GAAI,IAAI;MAC7C;QACE,OAAO,IAAI;IAAC;EAElB,CAAC;EAED,UAAUC,yBAAyBA,CAAA;;IACjCvB,YAAY,GAAG,EAAE;IACjB,KAAK,IAAIe,KAAK,GAAG,CAAC,EAAES,YAAY,GAAG,CAAC,EAAET,KAAK,GAAGjB,kBAAkB,CAAC2B,KAAK,CAACR,MAAM,EAAEF,KAAK,EAAE,EAAE;MACtF,MAAMZ,IAAI,GAAGL,kBAAkB,CAAC2B,KAAK,CAACV,KAAK,CAAC;MAC5C,MAAMW,MAAM,GAAG5B,kBAAkB,CAACM,UAAU,CAACC,GAAG,CAAC,CAAAO,EAAA,GAAAT,IAAI,CAACQ,QAAQ,cAAAC,EAAA,cAAAA,EAAA,GAAIlB,0BAAA,CAAAiC,oBAAoB,CAAC;MACvF,IAAI,CAACD,MAAM,EAAE;QACX;;MAEF,IAAIE,qBAAqB,CAACzB,IAAI,EAAE;QAAEJ,SAAS;QAAED;MAAkB,CAAE,CAAC,EAAE;QAClEK,IAAI,CAACY,KAAK,GAAGS,YAAY,EAAE;QAC3BxB,YAAY,CAAC6B,IAAI,CAAC;UAAE,GAAG1B;QAAI,CAAE,CAAC;QAC9B,MAAMA,IAAI;OACX,MAAM;QACLY,KAAK,IAAIW,MAAM,CAACI,YAAY,GAAG,CAAC,GAAG3B,IAAI,CAAC2B,YAAY;;;EAG1D;EAEA,OAAO;IACL7B,oBAAoB;IACpBwB,KAAK,EAAEA,CAAA,KAAK;MACV,OAAOzB,YAAY,IAAIuB,yBAAyB,EAAE;IACpD;GACD;AACH;AArDAQ,OAAA,CAAAlC,qBAAA,GAAAA,qBAAA;AAuDA,SAAS+B,qBAAqBA,CAC5BzB,IAAkB,EAClB;EACEJ,SAAS;EACTD,kBAAkB,EAAEkC;AAAQ,CAI7B;EAED,IAAI7B,IAAI,CAAC8B,KAAK,KAAK,CAAC,EAAE;IACpB,OAAO,IAAI;;EAEb,OAAO9B,IAAI,CAACQ,QAAQ,IAAIR,IAAI,CAACQ,QAAQ,KAAKjB,0BAAA,CAAAiC,oBAAoB,EAAE;IAC9D,IAAI,CAAC5B,SAAS,CAACmC,GAAG,CAAC/B,IAAI,CAACQ,QAAQ,CAAC,EAAE;MACjC,OAAO,KAAK;;IAEd,MAAMe,MAAM,GAAGM,QAAQ,CAAC5B,UAAU,CAACC,GAAG,CAACF,IAAI,CAACQ,QAAQ,CAAC;IACrD,IAAI,CAACe,MAAM,EAAE;MACX,OAAO,KAAK;;IAEdvB,IAAI,GAAGuB,MAAM;;EAGf,OAAO,IAAI;AACb"}
+{"version":3,"sources":["../../lib/utils/createVisibleFlatTree.js"],"sourcesContent":["import { flatTreeRootParentId } from './createUnfilteredFlatTree';\nimport { treeDataTypes } from './tokens';\n/**\n * creates methods that depend on the unfilteredFlatTree and the current available openItems\n */\nexport function createVisibleFlatTree(unfilteredFlatTree, openItems) {\n  let visibleItems = null;\n  const getNextNavigableItem = data => {\n    const item = unfilteredFlatTree.itemsPerId.get(data.target.id);\n    if (!item || !visibleItems) {\n      return null;\n    }\n    switch (data.type) {\n      case treeDataTypes.arrowLeft:\n        var _unfilteredFlatTree_itemsPerId_get;\n        return item.parentId ? (_unfilteredFlatTree_itemsPerId_get = unfilteredFlatTree.itemsPerId.get(item.parentId)) !== null && _unfilteredFlatTree_itemsPerId_get !== void 0 ? _unfilteredFlatTree_itemsPerId_get : null : null;\n      case treeDataTypes.arrowRight:\n        var _visibleItems_;\n        return (_visibleItems_ = visibleItems[item.index + 1]) !== null && _visibleItems_ !== void 0 ? _visibleItems_ : null;\n      case treeDataTypes.end:\n        return visibleItems[visibleItems.length - 1];\n      case treeDataTypes.home:\n        return visibleItems[0];\n      case treeDataTypes.arrowDown:\n        var _visibleItems_1;\n        return (_visibleItems_1 = visibleItems[item.index + 1]) !== null && _visibleItems_1 !== void 0 ? _visibleItems_1 : null;\n      case treeDataTypes.arrowUp:\n        var _visibleItems_2;\n        return (_visibleItems_2 = visibleItems[item.index - 1]) !== null && _visibleItems_2 !== void 0 ? _visibleItems_2 : null;\n      default:\n        return null;\n    }\n  };\n  function* makeVisibleItemsGenerator() {\n    visibleItems = [];\n    for (let index = 0, visibleIndex = 0; index < unfilteredFlatTree.items.length; index++) {\n      const item = unfilteredFlatTree.items[index];\n      var _item_parentId;\n      const parent = unfilteredFlatTree.itemsPerId.get((_item_parentId = item.parentId) !== null && _item_parentId !== void 0 ? _item_parentId : flatTreeRootParentId);\n      if (!parent) {\n        break;\n      }\n      if (isFlatTreeItemVisible(item, {\n        openItems,\n        unfilteredFlatTree\n      })) {\n        item.index = visibleIndex++;\n        visibleItems.push({\n          ...item\n        });\n        yield item;\n      } else {\n        index += parent.childrenSize - 1 + item.childrenSize;\n      }\n    }\n  }\n  return {\n    getNextNavigableItem,\n    items: () => {\n      return visibleItems || makeVisibleItemsGenerator();\n    }\n  };\n}\nfunction isFlatTreeItemVisible(item, {\n  openItems,\n  unfilteredFlatTree: flatTree\n}) {\n  if (item.level === 1) {\n    return true;\n  }\n  while (item.parentId && item.parentId !== flatTreeRootParentId) {\n    if (!openItems.has(item.parentId)) {\n      return false;\n    }\n    const parent = flatTree.itemsPerId.get(item.parentId);\n    if (!parent) {\n      return false;\n    }\n    item = parent;\n  }\n  return true;\n}\n//# sourceMappingURL=createVisibleFlatTree.js.map"],"names":["createVisibleFlatTree","unfilteredFlatTree","openItems","visibleItems","getNextNavigableItem","data","item","itemsPerId","get","target","id","type","treeDataTypes","arrowLeft","_unfilteredFlatTree_itemsPerId_get","parentId","arrowRight","_visibleItems_","index","end","length","home","arrowDown","_visibleItems_1","arrowUp","_visibleItems_2","makeVisibleItemsGenerator","visibleIndex","items","_item_parentId","parent","flatTreeRootParentId","isFlatTreeItemVisible","push","childrenSize","flatTree","level","has"],"mappings":";;;;+BAKgBA;;aAAAA;;0CALqB;wBACP;AAIvB,SAASA,sBAAsBC,kBAAkB,EAAEC,SAAS,EAAE;IACnE,IAAIC,eAAe,IAAI;IACvB,MAAMC,uBAAuBC,CAAAA,OAAQ;QACnC,MAAMC,OAAOL,mBAAmBM,UAAU,CAACC,GAAG,CAACH,KAAKI,MAAM,CAACC,EAAE;QAC7D,IAAI,CAACJ,QAAQ,CAACH,cAAc;YAC1B,OAAO,IAAI;QACb,CAAC;QACD,OAAQE,KAAKM,IAAI;YACf,KAAKC,qBAAa,CAACC,SAAS;gBAC1B,IAAIC;gBACJ,OAAOR,KAAKS,QAAQ,GAAG,AAACD,CAAAA,qCAAqCb,mBAAmBM,UAAU,CAACC,GAAG,CAACF,KAAKS,QAAQ,CAAA,MAAO,IAAI,IAAID,uCAAuC,KAAK,IAAIA,qCAAqC,IAAI,GAAG,IAAI;YAC7N,KAAKF,qBAAa,CAACI,UAAU;gBAC3B,IAAIC;gBACJ,OAAO,AAACA,CAAAA,iBAAiBd,YAAY,CAACG,KAAKY,KAAK,GAAG,EAAE,AAAD,MAAO,IAAI,IAAID,mBAAmB,KAAK,IAAIA,iBAAiB,IAAI;YACtH,KAAKL,qBAAa,CAACO,GAAG;gBACpB,OAAOhB,YAAY,CAACA,aAAaiB,MAAM,GAAG,EAAE;YAC9C,KAAKR,qBAAa,CAACS,IAAI;gBACrB,OAAOlB,YAAY,CAAC,EAAE;YACxB,KAAKS,qBAAa,CAACU,SAAS;gBAC1B,IAAIC;gBACJ,OAAO,AAACA,CAAAA,kBAAkBpB,YAAY,CAACG,KAAKY,KAAK,GAAG,EAAE,AAAD,MAAO,IAAI,IAAIK,oBAAoB,KAAK,IAAIA,kBAAkB,IAAI;YACzH,KAAKX,qBAAa,CAACY,OAAO;gBACxB,IAAIC;gBACJ,OAAO,AAACA,CAAAA,kBAAkBtB,YAAY,CAACG,KAAKY,KAAK,GAAG,EAAE,AAAD,MAAO,IAAI,IAAIO,oBAAoB,KAAK,IAAIA,kBAAkB,IAAI;YACzH;gBACE,OAAO,IAAI;QACf;IACF;IACA,UAAUC,4BAA4B;QACpCvB,eAAe,EAAE;QACjB,IAAK,IAAIe,QAAQ,GAAGS,eAAe,GAAGT,QAAQjB,mBAAmB2B,KAAK,CAACR,MAAM,EAAEF,QAAS;YACtF,MAAMZ,OAAOL,mBAAmB2B,KAAK,CAACV,MAAM;YAC5C,IAAIW;YACJ,MAAMC,SAAS7B,mBAAmBM,UAAU,CAACC,GAAG,CAAC,AAACqB,CAAAA,iBAAiBvB,KAAKS,QAAQ,AAAD,MAAO,IAAI,IAAIc,mBAAmB,KAAK,IAAIA,iBAAiBE,8CAAoB;YAC/J,IAAI,CAACD,QAAQ;gBACX,KAAM;YACR,CAAC;YACD,IAAIE,sBAAsB1B,MAAM;gBAC9BJ;gBACAD;YACF,IAAI;gBACFK,KAAKY,KAAK,GAAGS;gBACbxB,aAAa8B,IAAI,CAAC;oBAChB,GAAG3B,IAAI;gBACT;gBACA,MAAMA;YACR,OAAO;gBACLY,SAASY,OAAOI,YAAY,GAAG,IAAI5B,KAAK4B,YAAY;YACtD,CAAC;QACH;IACF;IACA,OAAO;QACL9B;QACAwB,OAAO,IAAM;YACX,OAAOzB,gBAAgBuB;QACzB;IACF;AACF;AACA,SAASM,sBAAsB1B,IAAI,EAAE,EACnCJ,UAAS,EACTD,oBAAoBkC,SAAQ,EAC7B,EAAE;IACD,IAAI7B,KAAK8B,KAAK,KAAK,GAAG;QACpB,OAAO,IAAI;IACb,CAAC;IACD,MAAO9B,KAAKS,QAAQ,IAAIT,KAAKS,QAAQ,KAAKgB,8CAAoB,CAAE;QAC9D,IAAI,CAAC7B,UAAUmC,GAAG,CAAC/B,KAAKS,QAAQ,GAAG;YACjC,OAAO,KAAK;QACd,CAAC;QACD,MAAMe,SAASK,SAAS5B,UAAU,CAACC,GAAG,CAACF,KAAKS,QAAQ;QACpD,IAAI,CAACe,QAAQ;YACX,OAAO,KAAK;QACd,CAAC;QACDxB,OAAOwB;IACT;IACA,OAAO,IAAI;AACb,EACA,iDAAiD"}

package/lib-commonjs/utils/flattenTree.js

@@ -1,38 +1,34 @@
 "use strict";
-
 Object.defineProperty(exports, "__esModule", {
-  value: true
+    value: true
+});
+Object.defineProperty(exports, "flattenTree_unstable", {
+    enumerable: true,
+    get: ()=>flattenTree_unstable
 });
-exports.flattenTree_unstable = void 0;
 let count = 1;
 // eslint-disable-next-line @typescript-eslint/naming-convention
 function flattenTreeRecursive_unstable(items, parent, level = 1) {
-  var _a;
-  const flatTreeItems = [];
-  for (let index = 0; index < items.length; index++) {
-    const {
-      subtree,
-      ...item
-    } = items[index];
-    const flatTreeItem = {
-      'aria-level': level,
-      'aria-posinset': index + 1,
-      'aria-setsize': items.length,
-      parentId: parent === null || parent === void 0 ? void 0 : parent.id,
-      id: (_a = item.id) !== null && _a !== void 0 ? _a : `fui-FlatTreeItem-${count++}`,
-      leaf: subtree === undefined,
-      ...item
-    };
-    flatTreeItems.push(flatTreeItem);
-    if (subtree !== undefined) {
-      flatTreeItems.push(...flattenTreeRecursive_unstable(subtree, flatTreeItem, level + 1));
+    const flatTreeItems = [];
+    for(let index = 0; index < items.length; index++){
+        const { subtree , ...item } = items[index];
+        var _item_id;
+        const flatTreeItem = {
+            'aria-level': level,
+            'aria-posinset': index + 1,
+            'aria-setsize': items.length,
+            parentId: parent === null || parent === void 0 ? void 0 : parent.id,
+            id: (_item_id = item.id) !== null && _item_id !== void 0 ? _item_id : `fui-FlatTreeItem-${count++}`,
+            leaf: subtree === undefined,
+            ...item
+        };
+        flatTreeItems.push(flatTreeItem);
+        if (subtree !== undefined) {
+            flatTreeItems.push(...flattenTreeRecursive_unstable(subtree, flatTreeItem, level + 1));
+        }
     }
-  }
-  return flatTreeItems;
+    return flatTreeItems;
 }
-/**
- * Converts a nested structure to a flat one which can be consumed by `useFlatTreeItems`
- */
-// eslint-disable-next-line @typescript-eslint/naming-convention
-exports.flattenTree_unstable = flattenTreeRecursive_unstable;
+const flattenTree_unstable = flattenTreeRecursive_unstable; //# sourceMappingURL=flattenTree.js.map
+
 //# sourceMappingURL=flattenTree.js.map

package/lib-commonjs/utils/flattenTree.js.map

@@ -1 +1 @@
-{"version":3,"names":["count","flattenTreeRecursive_unstable","items","parent","level","flatTreeItems","index","length","subtree","item","flatTreeItem","parentId","id","_a","leaf","undefined","push","exports","flattenTree_unstable"],"sources":["../src/packages/react-components/react-tree/src/utils/flattenTree.ts"],"sourcesContent":["import { FlatTreeItemProps } from '../hooks/useFlatTree';\nimport { TreeItemProps } from '../TreeItem';\n\nexport type NestedTreeItem = Omit<TreeItemProps, 'subtree'> & {\n  subtree?: NestedTreeItem[];\n};\n\nlet count = 1;\n\n// eslint-disable-next-line @typescript-eslint/naming-convention\nfunction flattenTreeRecursive_unstable(\n  items: NestedTreeItem[],\n  parent?: FlatTreeItemProps,\n  level = 1,\n): FlatTreeItemProps[] {\n  const flatTreeItems: FlatTreeItemProps[] = [];\n  for (let index = 0; index < items.length; index++) {\n    const { subtree, ...item } = items[index];\n    const flatTreeItem: FlatTreeItemProps = {\n      'aria-level': level,\n      'aria-posinset': index + 1,\n      'aria-setsize': items.length,\n      parentId: parent?.id,\n      id: item.id ?? `fui-FlatTreeItem-${count++}`,\n      leaf: subtree === undefined,\n      ...item,\n    };\n    flatTreeItems.push(flatTreeItem);\n    if (subtree !== undefined) {\n      flatTreeItems.push(...flattenTreeRecursive_unstable(subtree, flatTreeItem, level + 1));\n    }\n  }\n  return flatTreeItems;\n}\n\n/**\n * Converts a nested structure to a flat one which can be consumed by `useFlatTreeItems`\n */\n// eslint-disable-next-line @typescript-eslint/naming-convention\nexport const flattenTree_unstable: (items: NestedTreeItem[]) => FlatTreeItemProps[] = flattenTreeRecursive_unstable;\n"],"mappings":";;;;;;AAOA,IAAIA,KAAK,GAAG,CAAC;AAEb;AACA,SAASC,6BAA6BA,CACpCC,KAAuB,EACvBC,MAA0B,EAC1BC,KAAK,GAAG,CAAC;;EAET,MAAMC,aAAa,GAAwB,EAAE;EAC7C,KAAK,IAAIC,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAGJ,KAAK,CAACK,MAAM,EAAED,KAAK,EAAE,EAAE;IACjD,MAAM;MAAEE,OAAO;MAAE,GAAGC;IAAI,CAAE,GAAGP,KAAK,CAACI,KAAK,CAAC;IACzC,MAAMI,YAAY,GAAsB;MACtC,YAAY,EAAEN,KAAK;MACnB,eAAe,EAAEE,KAAK,GAAG,CAAC;MAC1B,cAAc,EAAEJ,KAAK,CAACK,MAAM;MAC5BI,QAAQ,EAAER,MAAM,aAANA,MAAM,uBAANA,MAAM,CAAES,EAAE;MACpBA,EAAE,EAAE,CAAAC,EAAA,GAAAJ,IAAI,CAACG,EAAE,cAAAC,EAAA,cAAAA,EAAA,GAAI,oBAAoBb,KAAK,EAAE,EAAE;MAC5Cc,IAAI,EAAEN,OAAO,KAAKO,SAAS;MAC3B,GAAGN;KACJ;IACDJ,aAAa,CAACW,IAAI,CAACN,YAAY,CAAC;IAChC,IAAIF,OAAO,KAAKO,SAAS,EAAE;MACzBV,aAAa,CAACW,IAAI,CAAC,GAAGf,6BAA6B,CAACO,OAAO,EAAEE,YAAY,EAAEN,KAAK,GAAG,CAAC,CAAC,CAAC;;;EAG1F,OAAOC,aAAa;AACtB;AAEA;;;AAGA;AACaY,OAAA,CAAAC,oBAAoB,GAAqDjB,6BAA6B"}
+{"version":3,"sources":["../../lib/utils/flattenTree.js"],"sourcesContent":["let count = 1;\n// eslint-disable-next-line @typescript-eslint/naming-convention\nfunction flattenTreeRecursive_unstable(items, parent, level = 1) {\n  const flatTreeItems = [];\n  for (let index = 0; index < items.length; index++) {\n    const {\n      subtree,\n      ...item\n    } = items[index];\n    var _item_id;\n    const flatTreeItem = {\n      'aria-level': level,\n      'aria-posinset': index + 1,\n      'aria-setsize': items.length,\n      parentId: parent === null || parent === void 0 ? void 0 : parent.id,\n      id: (_item_id = item.id) !== null && _item_id !== void 0 ? _item_id : `fui-FlatTreeItem-${count++}`,\n      leaf: subtree === undefined,\n      ...item\n    };\n    flatTreeItems.push(flatTreeItem);\n    if (subtree !== undefined) {\n      flatTreeItems.push(...flattenTreeRecursive_unstable(subtree, flatTreeItem, level + 1));\n    }\n  }\n  return flatTreeItems;\n}\n/**\n * Converts a nested structure to a flat one which can be consumed by `useFlatTreeItems`\n */ // eslint-disable-next-line @typescript-eslint/naming-convention\nexport const flattenTree_unstable = flattenTreeRecursive_unstable;\n//# sourceMappingURL=flattenTree.js.map"],"names":["flattenTree_unstable","count","flattenTreeRecursive_unstable","items","parent","level","flatTreeItems","index","length","subtree","item","_item_id","flatTreeItem","parentId","id","leaf","undefined","push"],"mappings":";;;;+BA6BaA;;aAAAA;;AA7Bb,IAAIC,QAAQ;AACZ,gEAAgE;AAChE,SAASC,8BAA8BC,KAAK,EAAEC,MAAM,EAAEC,QAAQ,CAAC,EAAE;IAC/D,MAAMC,gBAAgB,EAAE;IACxB,IAAK,IAAIC,QAAQ,GAAGA,QAAQJ,MAAMK,MAAM,EAAED,QAAS;QACjD,MAAM,EACJE,QAAO,EACP,GAAGC,MACJ,GAAGP,KAAK,CAACI,MAAM;QAChB,IAAII;QACJ,MAAMC,eAAe;YACnB,cAAcP;YACd,iBAAiBE,QAAQ;YACzB,gBAAgBJ,MAAMK,MAAM;YAC5BK,UAAUT,WAAW,IAAI,IAAIA,WAAW,KAAK,IAAI,KAAK,IAAIA,OAAOU,EAAE;YACnEA,IAAI,AAACH,CAAAA,WAAWD,KAAKI,EAAE,AAAD,MAAO,IAAI,IAAIH,aAAa,KAAK,IAAIA,WAAW,CAAC,iBAAiB,EAAEV,QAAQ,CAAC;YACnGc,MAAMN,YAAYO;YAClB,GAAGN,IAAI;QACT;QACAJ,cAAcW,IAAI,CAACL;QACnB,IAAIH,YAAYO,WAAW;YACzBV,cAAcW,IAAI,IAAIf,8BAA8BO,SAASG,cAAcP,QAAQ;QACrF,CAAC;IACH;IACA,OAAOC;AACT;AAIO,MAAMN,uBAAuBE,+BACpC,uCAAuC"}

package/lib-commonjs/utils/nextTypeAheadElement.js

@@ -1,21 +1,23 @@
 "use strict";
-
 Object.defineProperty(exports, "__esModule", {
-  value: true
+    value: true
+});
+Object.defineProperty(exports, "nextTypeAheadElement", {
+    enumerable: true,
+    get: ()=>nextTypeAheadElement
 });
-exports.nextTypeAheadElement = void 0;
 function nextTypeAheadElement(treeWalker, key) {
-  const keyToLowerCase = key.toLowerCase();
-  const typeAheadFilter = element => {
-    var _a;
-    return ((_a = element.textContent) === null || _a === void 0 ? void 0 : _a.trim().charAt(0).toLowerCase()) === keyToLowerCase ? NodeFilter.FILTER_ACCEPT : NodeFilter.FILTER_SKIP;
-  };
-  let nextElement = treeWalker.nextElement(typeAheadFilter);
-  if (!nextElement) {
-    treeWalker.currentElement = treeWalker.root;
-    nextElement = treeWalker.nextElement(typeAheadFilter);
-  }
-  return nextElement;
-}
-exports.nextTypeAheadElement = nextTypeAheadElement;
+    const keyToLowerCase = key.toLowerCase();
+    const typeAheadFilter = (element)=>{
+        var _element_textContent;
+        return ((_element_textContent = element.textContent) === null || _element_textContent === void 0 ? void 0 : _element_textContent.trim().charAt(0).toLowerCase()) === keyToLowerCase ? NodeFilter.FILTER_ACCEPT : NodeFilter.FILTER_SKIP;
+    };
+    let nextElement = treeWalker.nextElement(typeAheadFilter);
+    if (!nextElement) {
+        treeWalker.currentElement = treeWalker.root;
+        nextElement = treeWalker.nextElement(typeAheadFilter);
+    }
+    return nextElement;
+} //# sourceMappingURL=nextTypeAheadElement.js.map
+
 //# sourceMappingURL=nextTypeAheadElement.js.map

package/lib-commonjs/utils/nextTypeAheadElement.js.map

@@ -1 +1 @@
-{"version":3,"names":["nextTypeAheadElement","treeWalker","key","keyToLowerCase","toLowerCase","typeAheadFilter","element","_a","textContent","trim","charAt","NodeFilter","FILTER_ACCEPT","FILTER_SKIP","nextElement","currentElement","root","exports"],"sources":["../src/packages/react-components/react-tree/src/utils/nextTypeAheadElement.ts"],"sourcesContent":["import { HTMLElementWalker } from '../hooks/useHTMLElementWalker';\n\nexport function nextTypeAheadElement(treeWalker: HTMLElementWalker, key: string) {\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"],"mappings":";;;;;;AAEA,SAAgBA,oBAAoBA,CAACC,UAA6B,EAAEC,GAAW;EAC7E,MAAMC,cAAc,GAAGD,GAAG,CAACE,WAAW,EAAE;EACxC,MAAMC,eAAe,GAAIC,OAAoB,IAAI;;IAC/C,OAAO,EAAAC,EAAA,GAAAD,OAAO,CAACE,WAAW,cAAAD,EAAA,uBAAAA,EAAA,CAAEE,IAAI,GAAGC,MAAM,CAAC,CAAC,EAAEN,WAAW,EAAE,MAAKD,cAAc,GACzEQ,UAAU,CAACC,aAAa,GACxBD,UAAU,CAACE,WAAW;EAC5B,CAAC;EACD,IAAIC,WAAW,GAAGb,UAAU,CAACa,WAAW,CAACT,eAAe,CAAC;EACzD,IAAI,CAACS,WAAW,EAAE;IAChBb,UAAU,CAACc,cAAc,GAAGd,UAAU,CAACe,IAAI;IAC3CF,WAAW,GAAGb,UAAU,CAACa,WAAW,CAACT,eAAe,CAAC;;EAEvD,OAAOS,WAAW;AACpB;AAbAG,OAAA,CAAAjB,oBAAA,GAAAA,oBAAA"}
+{"version":3,"sources":["../../lib/utils/nextTypeAheadElement.js"],"sourcesContent":["export function nextTypeAheadElement(treeWalker, key) {\n  const keyToLowerCase = key.toLowerCase();\n  const typeAheadFilter = element => {\n    var _element_textContent;\n    return ((_element_textContent = element.textContent) === null || _element_textContent === void 0 ? void 0 : _element_textContent.trim().charAt(0).toLowerCase()) === keyToLowerCase ? NodeFilter.FILTER_ACCEPT : 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//# sourceMappingURL=nextTypeAheadElement.js.map"],"names":["nextTypeAheadElement","treeWalker","key","keyToLowerCase","toLowerCase","typeAheadFilter","element","_element_textContent","textContent","trim","charAt","NodeFilter","FILTER_ACCEPT","FILTER_SKIP","nextElement","currentElement","root"],"mappings":";;;;+BAAgBA;;aAAAA;;AAAT,SAASA,qBAAqBC,UAAU,EAAEC,GAAG,EAAE;IACpD,MAAMC,iBAAiBD,IAAIE,WAAW;IACtC,MAAMC,kBAAkBC,CAAAA,UAAW;QACjC,IAAIC;QACJ,OAAO,AAAC,CAAA,AAACA,CAAAA,uBAAuBD,QAAQE,WAAW,AAAD,MAAO,IAAI,IAAID,yBAAyB,KAAK,IAAI,KAAK,IAAIA,qBAAqBE,IAAI,GAAGC,MAAM,CAAC,GAAGN,WAAW,EAAE,AAAD,MAAOD,iBAAiBQ,WAAWC,aAAa,GAAGD,WAAWE,WAAW;IACzO;IACA,IAAIC,cAAcb,WAAWa,WAAW,CAACT;IACzC,IAAI,CAACS,aAAa;QAChBb,WAAWc,cAAc,GAAGd,WAAWe,IAAI;QAC3CF,cAAcb,WAAWa,WAAW,CAACT;IACvC,CAAC;IACD,OAAOS;AACT,EACA,gDAAgD"}