npm - react-stately - Versions diffs - 3.46.0 → 3.47.0 - Mend

react-stately 3.46.0 → 3.47.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (496) hide show

package/dist/private/data/useTreeData.cjs.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"mappings":";;;;;;;;AAAA;;;;;;;;;;CAUC;AAkIM,SAAS,0CAA8B,OAAuB;IACnE,IAAI,gBACF,eAAe,EAAE,uBACjB,mBAAmB,UACnB,SAAS,CAAC,OAAc,KAAK,EAAE,IAAI,KAAK,GAAG,eAC3C,cAAc,CAAC,OAAc,KAAK,QAAQ,EAC3C,GAAG;IAEJ,kDAAkD;IAClD,IAAI,CAAC,MAAM,SAAS,GAAG,CAAA,GAAA,qBAAO,EAAoB,IAAM,UAAU,cAAc,IAAI;IACpF,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;IAEvB,IAAI,CAAC,cAAc,gBAAgB,GAAG,CAAA,GAAA,qBAAO,EAAE,IAAI,IAAS,uBAAuB,EAAE;IAErF,SAAS,UAAU,eAA2B,EAAE,EAAE,GAA0B,EAAE,SAAsB;QAClG,IAAI,gBAAgB,MAClB,eAAe,EAAE;QAEnB,OAAO;YACL,OAAO,aAAa,GAAG,CAAC,CAAA;gBACtB,IAAI,OAAoB;oBACtB,KAAK,OAAO;oBACZ,WAAW,aAAa;oBACxB,OAAO;oBACP,UAAU;gBACZ;gBAEA,KAAK,QAAQ,GAAG,UAAU,YAAY,OAAO,KAAK,KAAK,GAAG,EAAE,KAAK;gBACjE,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE;gBAClB,OAAO;YACT;YACA,SAAS;QACX;IACF;IAEA,SAAS,WAAW,KAAoB,EAAE,GAAe,EAAE,MAAiD,EAAE,WAAkC;QAC9I,IAAI,OAAO,OAAO,OAAO,OAAO,YAAY,GAAG,CAAC;QAChD,IAAI,QAAQ,MACV,OAAO;mBAAC;YAAO,SAAS;QAAW;QAErC,IAAI,MAAM,IAAI,IAAsB;QAEpC,uEAAuE;QACvE,IAAI,UAAU,OAAO;QACrB,IAAI,WAAW,MACb,WAAW,MAAM;aAEjB,QAAQ,SAAS;QAGnB,wEAAwE;QACxE,MAAO,QAAQ,KAAK,SAAS,CAAE;YAC7B,IAAI,aAAa,IAAI,GAAG,CAAC,KAAK,SAAS;YACvC,IAAI,OAAoB;gBACtB,KAAK,WAAW,GAAG;gBACnB,WAAW,WAAW,SAAS;gBAC/B,OAAO,WAAW,KAAK;gBACvB,UAAU;YACZ;YAEA,IAAI,WAAW,WAAW,QAAQ;YAClC,IAAI,WAAW,QAAQ,UACrB,WAAW,SAAS,MAAM,CAAC,CAAA,IAAK,MAAM;YAGxC,KAAK,QAAQ,GAAG,UAAU,IAAI,CAAA;gBAC5B,IAAI,UAAU,MACZ,uDAAuD;gBACvD,OAAO;gBAGT,OAAO;YACT,MAAM;YAEN,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE;YAElB,UAAU;YACV,OAAO;QACT;QAEA,IAAI,WAAW,MACb,QAAQ,MAAM,MAAM,CAAC,CAAA,IAAK,MAAM;QAGlC,OAAO;YACL,OAAO,MAAM,GAAG,CAAC,CAAA;gBACf,IAAI,SAAS,MACX,uDAAuD;gBACvD,OAAO;gBAGT,OAAO;YACT;YACA,SAAS;QACX;IACF;IAEA,SAAS,QAAQ,IAAiB,EAAE,GAA0B;QAC5D,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE;QAClB,IAAI,KAAK,QAAQ,EACf,KAAK,IAAI,SAAS,KAAK,QAAQ,CAC7B,QAAQ,OAAO;IAGrB;IAEA,SAAS,WAAW,IAAiB,EAAE,GAA0B;QAC/D,IAAI,MAAM,CAAC,KAAK,GAAG;QACnB,IAAI,KAAK,QAAQ,EACf,KAAK,IAAI,SAAS,KAAK,QAAQ,CAC7B,WAAW,OAAO;IAGxB;IACA,OAAO;eACL;sBACA;yBACA;QACA,SAAQ,GAAQ;YACd,OAAO,QAAQ,GAAG,CAAC;QACrB;QACA,QAAO,SAAqB,EAAE,KAAa,EAAE,GAAG,MAAW;YACzD,SAAS,CAAC,SAAC,KAAK,EAAE,SAAS,WAAW,EAAC;gBACrC,IAAI,EAAC,OAAO,QAAQ,EAAE,SAAS,MAAM,EAAC,GAAG,UAAU,QAAQ,IAAI,IAAI,cAAc;gBAEjF,8CAA8C;gBAC9C,IAAI,aAAa,MACf,OAAO;oBACL,OAAO;2BACF,MAAM,KAAK,CAAC,GAAG;2BACf;2BACA,MAAM,KAAK,CAAC;qBAChB;oBACD,SAAS;gBACX;gBAGF,uDAAuD;gBACvD,OAAO,WAAW,OAAO,WAAW,CAAA,aAAe,CAAA;wBACjD,KAAK,WAAW,GAAG;wBACnB,WAAW,WAAW,SAAS;wBAC/B,OAAO,WAAW,KAAK;wBACvB,UAAU;+BACL,WAAW,QAAQ,CAAE,KAAK,CAAC,GAAG;+BAC9B;+BACA,WAAW,QAAQ,CAAE,KAAK,CAAC;yBAC/B;oBACH,CAAA,GAAI;YACN;QACF;QACA,cAAa,GAAQ,EAAE,GAAG,MAAW;YACnC,IAAI,OAAO,QAAQ,GAAG,CAAC;YACvB,IAAI,CAAC,MACH;YAGF,IAAI,aAAa,QAAQ,GAAG,CAAC,KAAK,SAAS;YAC3C,IAAI,QAAQ,aAAa,WAAW,QAAQ,GAAG;YAC/C,IAAI,QAAQ,MAAO,OAAO,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,YAAY,OAAO,MAAM,UAAU;QACjD;QACA,aAAY,GAAQ,EAAE,GAAG,MAAW;YAClC,IAAI,OAAO,QAAQ,GAAG,CAAC;YACvB,IAAI,CAAC,MACH;YAGF,IAAI,aAAa,QAAQ,GAAG,CAAC,KAAK,SAAS;YAC3C,IAAI,QAAQ,aAAa,WAAW,QAAQ,GAAG;YAC/C,IAAI,QAAQ,MAAO,OAAO,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,YAAY,OAAO,MAAM,QAAQ,MAAM;QACrD;QACA,SAAQ,SAAqB,EAAE,GAAG,MAAW;YAC3C,IAAI,CAAC,MAAM,CAAC,WAAW,MAAM;QAC/B;QACA,QAAO,SAAqB,EAAE,GAAG,MAAW;YAC1C,IAAI,aAAa,MACf,IAAI,CAAC,MAAM,CAAC,MAAM,MAAM,MAAM,KAAK;iBAC9B;gBACL,IAAI,aAAa,QAAQ,GAAG,CAAC;gBAC7B,IAAI,CAAC,YACH;gBAGF,IAAI,CAAC,MAAM,CAAC,WAAW,WAAW,QAAQ,CAAE,MAAM,KAAK;YACzD;QACF;QACA,QAAO,GAAG,IAAW;YACnB,IAAI,KAAK,MAAM,KAAK,GAClB;YAGF,IAAI,WAAW;YACf,IAAI,UAAU;YACd,IAAI;YACJ,KAAK,IAAI,OAAO,KAAM;gBACpB,UAAU,WAAW,UAAU,KAAK,IAAM,MAAM;gBAChD,UAAU,QAAQ,OAAO;gBACzB,WAAW,QAAQ,KAAK;YAC1B;YAEA,SAAS;YAET,IAAI,YAAY,IAAI,IAAI;YACxB,KAAK,IAAI,OAAO,aACd,IAAI,CAAC,QAAQ,OAAO,CAAC,GAAG,CAAC,MACvB,UAAU,MAAM,CAAC;YAIrB,gBAAgB;QAClB;QACA;YACE,IAAI,CAAC,MAAM,IAAI;QACjB;QACA,MAAK,GAAQ,EAAE,WAAuB,EAAE,KAAa;YACnD,SAAS,CAAC,SAAC,KAAK,EAAE,SAAS,WAAW,EAAC;gBACrC,IAAI,OAAO,YAAY,GAAG,CAAC;gBAC3B,IAAI,CAAC,MACH,OAAO;2BAAC;oBAAO,SAAS;gBAAW;gBAGrC,IAAI,EAAC,OAAO,QAAQ,EAAE,SAAS,MAAM,EAAC,GAAG,WAAW,OAAO,KAAK,IAAM,MAAM;gBAG5E,MAAM,YAAY;oBAChB,GAAG,IAAI;oBACP,WAAW;gBACb;gBAEA,8CAA8C;gBAC9C,IAAI,eAAe,MAAM;oBACvB,QAAQ,WAAW;oBACnB,OAAO;wBAAC,OAAO;+BACV,SAAS,KAAK,CAAC,GAAG;4BACrB;+BACG,SAAS,KAAK,CAAC;yBACnB;wBAAE,SAAS;oBAAM;gBACpB;gBAEA,uDAAuD;gBACvD,OAAO,WAAW,UAAU,aAAa,CAAA,aAAe,CAAA;wBACtD,KAAK,WAAW,GAAG;wBACnB,WAAW,WAAW,SAAS;wBAC/B,OAAO,WAAW,KAAK;wBACvB,UAAU;+BACL,WAAW,QAAQ,CAAE,KAAK,CAAC,GAAG;4BACjC;+BACG,WAAW,QAAQ,CAAE,KAAK,CAAC;yBAC/B;oBACH,CAAA,GAAI;YACN;QACF;QACA,YAAW,GAAQ,EAAE,IAAmB;YACtC,SAAS,CAAC;gBACR,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;gBACvB,IAAI,OAAO,QAAQ,GAAG,CAAC;gBACvB,IAAI,CAAC,MACH,OAAO;gBAET,IAAI,cAAc,KAAK,SAAS,IAAI;gBACpC,IAAI,SAA6B;gBACjC,IAAI,eAAe,MACjB,SAAS,QAAQ,GAAG,CAAC,gBAAgB;gBAEvC,IAAI,UAAU,QAAQ,WAAW,OAAO,QAAQ,CAAC,OAAO,CAAC,QAAQ,MAAM,OAAO,CAAC;gBAC/E,OAAO,gCAAU,WAAW,MAAM,QAAQ,SAAS,YAAY;YACjE;QACF;QACA,WAAU,GAAQ,EAAE,IAAmB;YACrC,SAAS,CAAC;gBACR,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;gBACvB,IAAI,OAAO,QAAQ,GAAG,CAAC;gBACvB,IAAI,CAAC,MACH,OAAO;gBAET,IAAI,cAAc,KAAK,SAAS,IAAI;gBACpC,IAAI,SAA6B;gBACjC,IAAI,eAAe,MACjB,SAAS,QAAQ,GAAG,CAAC,gBAAgB;gBAEvC,IAAI,UAAU,QAAQ,WAAW,OAAO,QAAQ,CAAC,OAAO,CAAC,QAAQ,MAAM,OAAO,CAAC;gBAC/E;gBACA,OAAO,gCAAU,WAAW,MAAM,QAAQ,SAAS,YAAY;YACjE;QACF;QACA,QAAO,MAAW,EAAE,QAAW;YAC7B,SAAS,CAAC,SAAC,KAAK,EAAE,SAAS,WAAW,EAAC,GAAK,WAAW,OAAO,QAAQ,CAAA;oBACpE,IAAI,OAAoB;wBACtB,KAAK,QAAQ,GAAG;wBAChB,WAAW,QAAQ,SAAS;wBAC5B,OAAO;wBACP,UAAU;oBACZ;oBAEA,IAAI,OAAO,UAAU,YAAY,WAAW,aAAa,KAAK,GAAG;oBACjE,KAAK,QAAQ,GAAG,KAAK,KAAK;oBAC1B,OAAO;gBACT,GAAG;QACL;IACF;AACF;AAEA,SAAS,gCACP,KAAuB,EACvB,IAAmB,EACnB,QAA4B,EAC5B,OAAe,EACf,UAKqB,EACrB,OAAgE;IAEhE,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;IAEvB,IAAI,SAAS;IACb,IAAI,aAAa,IAAI,IAAI;IACzB,MAAO,QAAQ,aAAa,KAAM;QAChC,IAAI,WAAW,GAAG,CAAC,OAAO,GAAG,GAC3B,MAAM,IAAI,MAAM;QAElB,SAAS,QAAQ,GAAG,CAAC,OAAO,SAAS,KAAM;IAC7C;IAEA,IAAI,kBAAkB;IAEtB,IAAI,WAAW,MAAM,OAAO,CAAC,QAAQ,OAAO;WAAI;KAAK;IACrD,0CAA0C;IAC1C,IAAI,cAAgC,IAAI;IACxC,IAAI,eAAmC,EAAE;IACzC,IAAI,WAAW;IACf,IAAI,SAAS;IACb,IAAI,IAAI;IAER,SAAS,UAAU,IAAI,EAAE,WAAC,OAAO,aAAE,SAAS,EAAC;QAC3C,UAAU;QACV,IAAI,QAAQ,MACV,KAAK,IAAI,SAAS,KAAK,QAAQ,IAAI,EAAE,CAAE;YACrC,UAAU,OAAO;yBAAC;2BAAS;YAAS;YACpC,YAAY;QACd;IAEJ;IAEA,SAAS,QAAQ,KAAK;QACpB,6GAA6G;QAC7G,IAAI,SAAS,QAAQ,CAAC,MAAM,GAAG,GAC7B,YAAY,GAAG,CAAC,MAAM,GAAG,EAAE;IAE/B;IAEA,SAAS,UAAU,KAAK;QACtB,8FAA8F;QAC9F,iEAAiE;QACjE,IAAI,SAAS,QAAQ,CAAC,MAAM,GAAG,GAAG;YAChC,aAAa,IAAI,CAAC;gBAAC,GAAG,OAAO,GAAG,CAAC,MAAM,GAAG,CAAC;gBAAG,WAAW,UAAU,OAAO;YAAI;YAC9E,IAAI,EAAC,OAAO,SAAS,EAAE,SAAS,OAAO,EAAC,GAAG,WAAW,UAAU,MAAM,GAAG,EAAE,IAAM,MAAM;YACvF,WAAW;YACX,SAAS;QACX;QACA,qGAAqG;QACrG,4GAA4G;QAC5G,IAAI,AAAC,CAAA,MAAM,SAAS,KAAK,YACpB,MAAM,SAAS,KAAK,UAAU,GAAE,KAChC,SAAS,QAAQ,CAAC,MAAM,GAAG,KAC3B,AAAC,CAAA,UAAU,WAAW,SAAS,QAAQ,CAAC,OAAO,CAAC,SAAS,MAAM,OAAO,CAAC,MAAK,IAAK,iBACpF;IAEJ;IAEA,UAAU;QAAC,UAAU;IAAK,GAAG;iBAAC;mBAAS;IAAS;IAEhD,IAAI,eAAe,aAAa,IAAI,CAAC,CAAC,GAAG,IAAM,YAAY,GAAG,CAAC,EAAE,GAAG,IAAK,YAAY,GAAG,CAAC,EAAE,GAAG,IAAK,IAAI;IACvG,8CAA8C;IAC9C,IAAI,CAAC,YAAY,SAAS,GAAG,IAAI,MAAM;QACrC,aAAa,OAAO,CAAC,CAAA;YACnB,QAAQ,WAAW;QACrB;QACA,OAAO;YAAC,OAAO;mBACV,SAAS,KAAK,CAAC,GAAG;mBAClB;mBACA,SAAS,KAAK,CAAC;aACnB;YAAE,SAAS;QAAM;IACpB;IAEA,uDAAuD;IACvD,OAAO,WAAW,UAAU,SAAS,GAAG,EAAE,CAAA,aAAe,CAAA;YACvD,KAAK,WAAW,GAAG;YACnB,WAAW,WAAW,SAAS;YAC/B,OAAO,WAAW,KAAK;YACvB,UAAU;mBACL,WAAW,QAAQ,CAAE,KAAK,CAAC,GAAG;mBAC9B;mBACA,WAAW,QAAQ,CAAE,KAAK,CAAC;aAC/B;QACH,CAAA,GAAI;AACN","sources":["packages/react-stately/src/data/useTreeData.ts"],"sourcesContent":["/\n Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n \n Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n /\n\nimport {Key} from '@react-types/shared';\nimport {useState} from 'react';\n\nexport interface TreeOptions<T extends object> {\n /* Initial root items in the tree. /\n initialItems?: T[],\n /* The keys for the initially selected items. /\n initialSelectedKeys?: Iterable<Key>,\n /* A function that returns a unique key for an item object. /\n getKey?: (item: T) => Key,\n /* A function that returns the children for an item object. /\n getChildren?: (item: T) => T[]\n}\n\ninterface TreeNode<T extends object> {\n /* A unique key for the tree node. /\n key: Key,\n /* The key of the parent node. /\n parentKey?: Key \| null,\n /* The value object for the tree node. /\n value: T,\n /* Children of the tree node. /\n children: TreeNode<T>[] \| null\n}\n\nexport interface TreeData<T extends object> {\n /* The root nodes in the tree. /\n items: TreeNode<T>[],\n\n /* The keys of the currently selected items in the tree. /\n selectedKeys: Set<Key>,\n\n /* Sets the selected keys. /\n setSelectedKeys(keys: Set<Key>): void,\n\n /\n Gets a node from the tree by key.\n * @param key - The key of the item to retrieve.\n /\n getItem(key: Key): TreeNode<T> \| undefined,\n\n /\n Inserts an item into a parent node as a child.\n * @param parentKey - The key of the parent item to insert into. `null` for the root.\n * @param index - The index within the parent to insert into.\n * @param value - The value to insert.\n /\n insert(parentKey: Key \| null, index: number, ...values: T[]): void,\n\n /\n Inserts items into the list before the item at the given key.\n * @param key - The key of the item to insert before.\n * @param values - The values to insert.\n /\n insertBefore(key: Key, ...values: T[]): void,\n\n /\n Inserts items into the list after the item at the given key.\n * @param key - The key of the item to insert after.\n * @param values - The values to insert.\n /\n insertAfter(key: Key, ...values: T[]): void,\n\n /\n Appends an item into a parent node as a child.\n * @param parentKey - The key of the parent item to insert into. `null` for the root.\n * @param value - The value to insert.\n /\n append(parentKey: Key \| null, ...values: T[]): void,\n\n /\n Prepends an item into a parent node as a child.\n * @param parentKey - The key of the parent item to insert into. `null` for the root.\n * @param value - The value to insert.\n /\n prepend(parentKey: Key \| null, ...value: T[]): void,\n\n /\n Removes an item from the tree by its key.\n * @param key - The key of the item to remove.\n /\n remove(...keys: Key[]): void,\n\n /\n Removes all items from the tree that are currently\n * in the set of selected items.\n /\n removeSelectedItems(): void,\n\n /\n Moves an item within the tree.\n * @param key - The key of the item to move.\n * @param toParentKey - The key of the new parent to insert into. `null` for the root.\n * @param index - The index within the new parent to insert at.\n /\n move(key: Key, toParentKey: Key \| null, index: number): void,\n\n /\n Moves one or more items before a given key.\n * @param key - The key of the item to move the items before.\n * @param keys - The keys of the items to move.\n /\n moveBefore(key: Key, keys: Iterable<Key>): void,\n\n /\n Moves one or more items after a given key.\n * @param key - The key of the item to move the items after.\n * @param keys - The keys of the items to move.\n /\n moveAfter(key: Key, keys: Iterable<Key>): void,\n\n /\n Updates an item in the tree.\n * @param key - The key of the item to update.\n * @param newValue - The new value for the item.\n /\n update(key: Key, newValue: T): void\n}\n\ninterface TreeDataState<T extends object> {\n items: TreeNode<T>[],\n nodeMap: Map<Key, TreeNode<T>>\n}\n\n/\n Manages state for an immutable tree data structure, and provides convenience methods to\n * update the data over time.\n */\nexport function useTreeData<T extends object>(options: TreeOptions<T>): TreeData<T> {\n let {\n initialItems = [],\n initialSelectedKeys,\n getKey = (item: any) => item.id ?? item.key,\n getChildren = (item: any) => item.children\n } = options;\n\n // We only want to compute this on initial render.\n let [tree, setItems] = useState<TreeDataState<T>>(() => buildTree(initialItems, new Map()));\n let {items, nodeMap} = tree;\n\n let [selectedKeys, setSelectedKeys] = useState(new Set<Key>(initialSelectedKeys \|\| []));\n\n function buildTree(initialItems: T[] \| null = [], map: Map<Key, TreeNode<T>>, parentKey?: Key \| null) {\n if (initialItems == null) {\n initialItems = [];\n }\n return {\n items: initialItems.map(item => {\n let node: TreeNode<T> = {\n key: getKey(item),\n parentKey: parentKey ?? null,\n value: item,\n children: null\n };\n\n node.children = buildTree(getChildren(item), map, node.key).items;\n map.set(node.key, node);\n return node;\n }),\n nodeMap: map\n };\n }\n\n function updateTree(items: TreeNode<T>[], key: Key \| null, update: (node: TreeNode<T>) => TreeNode<T> \| null, originalMap: Map<Key, TreeNode<T>>) {\n let node = key == null ? null : originalMap.get(key);\n if (node == null) {\n return {items, nodeMap: originalMap};\n }\n let map = new Map<Key, TreeNode<T>>(originalMap);\n\n // Create a new node. If null, then delete the node, otherwise replace.\n let newNode = update(node);\n if (newNode == null) {\n deleteNode(node, map);\n } else {\n addNode(newNode, map);\n }\n\n // Walk up the tree and update each parent to refer to the new children.\n while (node && node.parentKey) {\n let nextParent = map.get(node.parentKey)!;\n let copy: TreeNode<T> = {\n key: nextParent.key,\n parentKey: nextParent.parentKey,\n value: nextParent.value,\n children: null\n };\n\n let children = nextParent.children;\n if (newNode == null && children) {\n children = children.filter(c => c !== node);\n }\n\n copy.children = children?.map(child => {\n if (child === node) {\n // newNode cannot be null here due to the above filter.\n return newNode!;\n }\n\n return child;\n }) ?? null;\n\n map.set(copy.key, copy);\n\n newNode = copy;\n node = nextParent;\n }\n\n if (newNode == null) {\n items = items.filter(c => c !== node);\n }\n\n return {\n items: items.map(item => {\n if (item === node) {\n // newNode cannot be null here due to the above filter.\n return newNode!;\n }\n\n return item;\n }),\n nodeMap: map\n };\n }\n\n function addNode(node: TreeNode<T>, map: Map<Key, TreeNode<T>>) {\n map.set(node.key, node);\n if (node.children) {\n for (let child of node.children) {\n addNode(child, map);\n }\n }\n }\n\n function deleteNode(node: TreeNode<T>, map: Map<Key, TreeNode<T>>) {\n map.delete(node.key);\n if (node.children) {\n for (let child of node.children) {\n deleteNode(child, map);\n }\n }\n }\n return {\n items,\n selectedKeys,\n setSelectedKeys,\n getItem(key: Key) {\n return nodeMap.get(key);\n },\n insert(parentKey: Key \| null, index: number, ...values: T[]) {\n setItems(({items, nodeMap: originalMap}) => {\n let {items: newNodes, nodeMap: newMap} = buildTree(values, new Map(originalMap), parentKey);\n\n // If parentKey is null, insert into the root.\n if (parentKey == null) {\n return {\n items: [\n ...items.slice(0, index),\n ...newNodes,\n ...items.slice(index)\n ],\n nodeMap: newMap\n };\n }\n\n // Otherwise, update the parent node and its ancestors.\n return updateTree(items, parentKey, parentNode => ({\n key: parentNode.key,\n parentKey: parentNode.parentKey,\n value: parentNode.value,\n children: [\n ...parentNode.children!.slice(0, index),\n ...newNodes,\n ...parentNode.children!.slice(index)\n ]\n }), newMap);\n });\n },\n insertBefore(key: Key, ...values: T[]): void {\n let node = nodeMap.get(key);\n if (!node) {\n return;\n }\n\n let parentNode = nodeMap.get(node.parentKey!);\n let nodes = parentNode ? parentNode.children : items;\n let index = nodes!.indexOf(node);\n this.insert(parentNode?.key ?? null, index, ...values);\n },\n insertAfter(key: Key, ...values: T[]): void {\n let node = nodeMap.get(key);\n if (!node) {\n return;\n }\n\n let parentNode = nodeMap.get(node.parentKey!);\n let nodes = parentNode ? parentNode.children : items;\n let index = nodes!.indexOf(node);\n this.insert(parentNode?.key ?? null, index + 1, ...values);\n },\n prepend(parentKey: Key \| null, ...values: T[]) {\n this.insert(parentKey, 0, ...values);\n },\n append(parentKey: Key \| null, ...values: T[]) {\n if (parentKey == null) {\n this.insert(null, items.length, ...values);\n } else {\n let parentNode = nodeMap.get(parentKey);\n if (!parentNode) {\n return;\n }\n\n this.insert(parentKey, parentNode.children!.length, ...values);\n }\n },\n remove(...keys: Key[]) {\n if (keys.length === 0) {\n return;\n }\n\n let newItems = items;\n let prevMap = nodeMap;\n let newTree;\n for (let key of keys) {\n newTree = updateTree(newItems, key, () => null, prevMap);\n prevMap = newTree.nodeMap;\n newItems = newTree.items;\n }\n\n setItems(newTree);\n\n let selection = new Set(selectedKeys);\n for (let key of selectedKeys) {\n if (!newTree.nodeMap.has(key)) {\n selection.delete(key);\n }\n }\n\n setSelectedKeys(selection);\n },\n removeSelectedItems() {\n this.remove(...selectedKeys);\n },\n move(key: Key, toParentKey: Key \| null, index: number) {\n setItems(({items, nodeMap: originalMap}) => {\n let node = originalMap.get(key);\n if (!node) {\n return {items, nodeMap: originalMap};\n }\n\n let {items: newItems, nodeMap: newMap} = updateTree(items, key, () => null, originalMap);\n\n\n const movedNode = {\n ...node,\n parentKey: toParentKey\n };\n\n // If parentKey is null, insert into the root.\n if (toParentKey == null) {\n addNode(movedNode, newMap);\n return {items: [\n ...newItems.slice(0, index),\n movedNode,\n ...newItems.slice(index)\n ], nodeMap: newMap};\n }\n\n // Otherwise, update the parent node and its ancestors.\n return updateTree(newItems, toParentKey, parentNode => ({\n key: parentNode.key,\n parentKey: parentNode.parentKey,\n value: parentNode.value,\n children: [\n ...parentNode.children!.slice(0, index),\n movedNode,\n ...parentNode.children!.slice(index)\n ]\n }), newMap);\n });\n },\n moveBefore(key: Key, keys: Iterable<Key>) {\n setItems((prevState) => {\n let {items, nodeMap} = prevState;\n let node = nodeMap.get(key);\n if (!node) {\n return prevState;\n }\n let toParentKey = node.parentKey ?? null;\n let parent: null \| TreeNode<T> = null;\n if (toParentKey != null) {\n parent = nodeMap.get(toParentKey) ?? null;\n }\n let toIndex = parent?.children ? parent.children.indexOf(node) : items.indexOf(node);\n return moveItems(prevState, keys, parent, toIndex, updateTree, addNode);\n });\n },\n moveAfter(key: Key, keys: Iterable<Key>) {\n setItems((prevState) => {\n let {items, nodeMap} = prevState;\n let node = nodeMap.get(key);\n if (!node) {\n return prevState;\n }\n let toParentKey = node.parentKey ?? null;\n let parent: null \| TreeNode<T> = null;\n if (toParentKey != null) {\n parent = nodeMap.get(toParentKey) ?? null;\n }\n let toIndex = parent?.children ? parent.children.indexOf(node) : items.indexOf(node);\n toIndex++;\n return moveItems(prevState, keys, parent, toIndex, updateTree, addNode);\n });\n },\n update(oldKey: Key, newValue: T) {\n setItems(({items, nodeMap: originalMap}) => updateTree(items, oldKey, oldNode => {\n let node: TreeNode<T> = {\n key: oldNode.key,\n parentKey: oldNode.parentKey,\n value: newValue,\n children: null\n };\n\n let tree = buildTree(getChildren(newValue), originalMap, node.key);\n node.children = tree.items;\n return node;\n }, originalMap));\n }\n };\n}\n\nfunction moveItems<T extends object>(\n state: TreeDataState<T>,\n keys: Iterable<Key>,\n toParent: TreeNode<T> \| null,\n toIndex: number,\n updateTree: (\n items: TreeNode<T>[],\n key: Key \| null,\n update: (node: TreeNode<T>) => TreeNode<T> \| null,\n originalMap: Map<Key, TreeNode<T>>\n ) => TreeDataState<T>,\n addNode: (node: TreeNode<T>, map: Map<Key, TreeNode<T>>) => void\n): TreeDataState<T> {\n let {items, nodeMap} = state;\n\n let parent = toParent;\n let removeKeys = new Set(keys);\n while (parent?.parentKey != null) {\n if (removeKeys.has(parent.key)) {\n throw new Error('Cannot move an item to be a child of itself.');\n }\n parent = nodeMap.get(parent.parentKey!) ?? null;\n }\n\n let originalToIndex = toIndex;\n\n let keyArray = Array.isArray(keys) ? keys : [...keys];\n // depth first search to put keys in order\n let inOrderKeys: Map<Key, number> = new Map();\n let removedItems: Array<TreeNode<T>> = [];\n let newItems = items;\n let newMap = nodeMap;\n let i = 0;\n\n function traversal(node, {inorder, postorder}) {\n inorder?.(node);\n if (node != null) {\n for (let child of node.children ?? []) {\n traversal(child, {inorder, postorder});\n postorder?.(child);\n }\n }\n }\n\n function inorder(child) {\n // in-order so we add items as we encounter them in the tree, then we can insert them in expected order later\n if (keyArray.includes(child.key)) {\n inOrderKeys.set(child.key, i++);\n }\n }\n\n function postorder(child) {\n // remove items and update the tree from the leaves and work upwards toward the root, this way\n // we don't copy child node references from parents inadvertently\n if (keyArray.includes(child.key)) {\n removedItems.push({...newMap.get(child.key)!, parentKey: toParent?.key ?? null});\n let {items: nextItems, nodeMap: nextMap} = updateTree(newItems, child.key, () => null, newMap);\n newItems = nextItems;\n newMap = nextMap;\n }\n // decrement the index if the child being removed is in the target parent and before the target index\n // the root node is special, it is null, and will not have a key, however, a parentKey can still point to it\n if ((child.parentKey === toParent\n \|\| child.parentKey === toParent?.key)\n && keyArray.includes(child.key)\n && (toParent?.children ? toParent.children.indexOf(child) : items.indexOf(child)) < originalToIndex) {\n toIndex--;\n }\n }\n\n traversal({children: items}, {inorder, postorder});\n\n let inOrderItems = removedItems.sort((a, b) => inOrderKeys.get(a.key)! > inOrderKeys.get(b.key)! ? 1 : -1);\n // If parentKey is null, insert into the root.\n if (!toParent \|\| toParent.key == null) {\n inOrderItems.forEach(movedNode => {\n addNode(movedNode, newMap); \n });\n return {items: [\n ...newItems.slice(0, toIndex),\n ...inOrderItems,\n ...newItems.slice(toIndex)\n ], nodeMap: newMap};\n }\n\n // Otherwise, update the parent node and its ancestors.\n return updateTree(newItems, toParent.key, parentNode => ({\n key: parentNode.key,\n parentKey: parentNode.parentKey,\n value: parentNode.value,\n children: [\n ...parentNode.children!.slice(0, toIndex),\n ...inOrderItems,\n ...parentNode.children!.slice(toIndex)\n ]\n }), newMap);\n}\n"],"names":[],"version":3,"file":"useTreeData.cjs.map"}
1	+ {"mappings":";;;;;;;;AAAA;;;;;;;;;;CAUC;AA6IM,SAAS,0CAA8B,OAAuB;IACnE,IAAI,gBACF,eAAe,EAAE,uBACjB,mBAAmB,UACnB,SAAS,CAAC,OAAc,KAAK,EAAE,IAAI,KAAK,GAAG,eAC3C,cAAc,CAAC,OAAc,KAAK,QAAQ,EAC3C,GAAG;IAEJ,kDAAkD;IAClD,IAAI,CAAC,MAAM,SAAS,GAAG,CAAA,GAAA,qBAAO,EAAoB,IAAM,UAAU,cAAc,IAAI;IACpF,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;IAEvB,IAAI,CAAC,cAAc,gBAAgB,GAAG,CAAA,GAAA,qBAAO,EAAE,IAAI,IAAS,uBAAuB,EAAE;IAErF,SAAS,UACP,eAA2B,EAAE,EAC7B,GAA0B,EAC1B,SAAsB;QAEtB,IAAI,gBAAgB,MAClB,eAAe,EAAE;QAEnB,OAAO;YACL,OAAO,aAAa,GAAG,CAAC,CAAA;gBACtB,IAAI,OAAoB;oBACtB,KAAK,OAAO;oBACZ,WAAW,aAAa;oBACxB,OAAO;oBACP,UAAU;gBACZ;gBAEA,KAAK,QAAQ,GAAG,UAAU,YAAY,OAAO,KAAK,KAAK,GAAG,EAAE,KAAK;gBACjE,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE;gBAClB,OAAO;YACT;YACA,SAAS;QACX;IACF;IAEA,SAAS,WACP,KAAoB,EACpB,GAAe,EACf,MAAiD,EACjD,WAAkC;QAElC,IAAI,OAAO,OAAO,OAAO,OAAO,YAAY,GAAG,CAAC;QAChD,IAAI,QAAQ,MACV,OAAO;mBAAC;YAAO,SAAS;QAAW;QAErC,IAAI,MAAM,IAAI,IAAsB;QAEpC,uEAAuE;QACvE,IAAI,UAAU,OAAO;QACrB,IAAI,WAAW,MACb,WAAW,MAAM;aAEjB,QAAQ,SAAS;QAGnB,wEAAwE;QACxE,MAAO,QAAQ,KAAK,SAAS,CAAE;YAC7B,IAAI,aAAa,IAAI,GAAG,CAAC,KAAK,SAAS;YACvC,IAAI,OAAoB;gBACtB,KAAK,WAAW,GAAG;gBACnB,WAAW,WAAW,SAAS;gBAC/B,OAAO,WAAW,KAAK;gBACvB,UAAU;YACZ;YAEA,IAAI,WAAW,WAAW,QAAQ;YAClC,IAAI,WAAW,QAAQ,UACrB,WAAW,SAAS,MAAM,CAAC,CAAA,IAAK,MAAM;YAGxC,KAAK,QAAQ,GACX,UAAU,IAAI,CAAA;gBACZ,IAAI,UAAU,MACZ,uDAAuD;gBACvD,OAAO;gBAGT,OAAO;YACT,MAAM;YAER,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE;YAElB,UAAU;YACV,OAAO;QACT;QAEA,IAAI,WAAW,MACb,QAAQ,MAAM,MAAM,CAAC,CAAA,IAAK,MAAM;QAGlC,OAAO;YACL,OAAO,MAAM,GAAG,CAAC,CAAA;gBACf,IAAI,SAAS,MACX,uDAAuD;gBACvD,OAAO;gBAGT,OAAO;YACT;YACA,SAAS;QACX;IACF;IAEA,SAAS,QAAQ,IAAiB,EAAE,GAA0B;QAC5D,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE;QAClB,IAAI,KAAK,QAAQ,EACf,KAAK,IAAI,SAAS,KAAK,QAAQ,CAC7B,QAAQ,OAAO;IAGrB;IAEA,SAAS,WAAW,IAAiB,EAAE,GAA0B;QAC/D,IAAI,MAAM,CAAC,KAAK,GAAG;QACnB,IAAI,KAAK,QAAQ,EACf,KAAK,IAAI,SAAS,KAAK,QAAQ,CAC7B,WAAW,OAAO;IAGxB;IACA,OAAO;eACL;sBACA;yBACA;QACA,SAAQ,GAAQ;YACd,OAAO,QAAQ,GAAG,CAAC;QACrB;QACA,QAAO,SAAqB,EAAE,KAAa,EAAE,GAAG,MAAW;YACzD,SAAS,CAAC,SAAC,KAAK,EAAE,SAAS,WAAW,EAAC;gBACrC,IAAI,EAAC,OAAO,QAAQ,EAAE,SAAS,MAAM,EAAC,GAAG,UAAU,QAAQ,IAAI,IAAI,cAAc;gBAEjF,8CAA8C;gBAC9C,IAAI,aAAa,MACf,OAAO;oBACL,OAAO;2BAAI,MAAM,KAAK,CAAC,GAAG;2BAAW;2BAAa,MAAM,KAAK,CAAC;qBAAO;oBACrE,SAAS;gBACX;gBAGF,uDAAuD;gBACvD,OAAO,WACL,OACA,WACA,CAAA,aAAe,CAAA;wBACb,KAAK,WAAW,GAAG;wBACnB,WAAW,WAAW,SAAS;wBAC/B,OAAO,WAAW,KAAK;wBACvB,UAAU;+BACL,WAAW,QAAQ,CAAE,KAAK,CAAC,GAAG;+BAC9B;+BACA,WAAW,QAAQ,CAAE,KAAK,CAAC;yBAC/B;oBACH,CAAA,GACA;YAEJ;QACF;QACA,cAAa,GAAQ,EAAE,GAAG,MAAW;YACnC,IAAI,OAAO,QAAQ,GAAG,CAAC;YACvB,IAAI,CAAC,MACH;YAGF,IAAI,aAAa,QAAQ,GAAG,CAAC,KAAK,SAAS;YAC3C,IAAI,QAAQ,aAAa,WAAW,QAAQ,GAAG;YAC/C,IAAI,QAAQ,MAAO,OAAO,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,YAAY,OAAO,MAAM,UAAU;QACjD;QACA,aAAY,GAAQ,EAAE,GAAG,MAAW;YAClC,IAAI,OAAO,QAAQ,GAAG,CAAC;YACvB,IAAI,CAAC,MACH;YAGF,IAAI,aAAa,QAAQ,GAAG,CAAC,KAAK,SAAS;YAC3C,IAAI,QAAQ,aAAa,WAAW,QAAQ,GAAG;YAC/C,IAAI,QAAQ,MAAO,OAAO,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,YAAY,OAAO,MAAM,QAAQ,MAAM;QACrD;QACA,SAAQ,SAAqB,EAAE,GAAG,MAAW;YAC3C,IAAI,CAAC,MAAM,CAAC,WAAW,MAAM;QAC/B;QACA,QAAO,SAAqB,EAAE,GAAG,MAAW;YAC1C,IAAI,aAAa,MACf,IAAI,CAAC,MAAM,CAAC,MAAM,MAAM,MAAM,KAAK;iBAC9B;gBACL,IAAI,aAAa,QAAQ,GAAG,CAAC;gBAC7B,IAAI,CAAC,YACH;gBAGF,IAAI,CAAC,MAAM,CAAC,WAAW,WAAW,QAAQ,CAAE,MAAM,KAAK;YACzD;QACF;QACA,QAAO,GAAG,IAAW;YACnB,IAAI,KAAK,MAAM,KAAK,GAClB;YAGF,IAAI,WAAW;YACf,IAAI,UAAU;YACd,IAAI;YACJ,KAAK,IAAI,OAAO,KAAM;gBACpB,UAAU,WAAW,UAAU,KAAK,IAAM,MAAM;gBAChD,UAAU,QAAQ,OAAO;gBACzB,WAAW,QAAQ,KAAK;YAC1B;YAEA,SAAS;YAET,IAAI,YAAY,IAAI,IAAI;YACxB,KAAK,IAAI,OAAO,aACd,IAAI,CAAC,QAAQ,OAAO,CAAC,GAAG,CAAC,MACvB,UAAU,MAAM,CAAC;YAIrB,gBAAgB;QAClB;QACA;YACE,IAAI,CAAC,MAAM,IAAI;QACjB;QACA,MAAK,GAAQ,EAAE,WAAuB,EAAE,KAAa;YACnD,SAAS,CAAC,SAAC,KAAK,EAAE,SAAS,WAAW,EAAC;gBACrC,IAAI,OAAO,YAAY,GAAG,CAAC;gBAC3B,IAAI,CAAC,MACH,OAAO;2BAAC;oBAAO,SAAS;gBAAW;gBAGrC,IAAI,EAAC,OAAO,QAAQ,EAAE,SAAS,MAAM,EAAC,GAAG,WAAW,OAAO,KAAK,IAAM,MAAM;gBAE5E,MAAM,YAAY;oBAChB,GAAG,IAAI;oBACP,WAAW;gBACb;gBAEA,8CAA8C;gBAC9C,IAAI,eAAe,MAAM;oBACvB,QAAQ,WAAW;oBACnB,OAAO;wBACL,OAAO;+BAAI,SAAS,KAAK,CAAC,GAAG;4BAAQ;+BAAc,SAAS,KAAK,CAAC;yBAAO;wBACzE,SAAS;oBACX;gBACF;gBAEA,uDAAuD;gBACvD,OAAO,WACL,UACA,aACA,CAAA,aAAe,CAAA;wBACb,KAAK,WAAW,GAAG;wBACnB,WAAW,WAAW,SAAS;wBAC/B,OAAO,WAAW,KAAK;wBACvB,UAAU;+BACL,WAAW,QAAQ,CAAE,KAAK,CAAC,GAAG;4BACjC;+BACG,WAAW,QAAQ,CAAE,KAAK,CAAC;yBAC/B;oBACH,CAAA,GACA;YAEJ;QACF;QACA,YAAW,GAAQ,EAAE,IAAmB;YACtC,SAAS,CAAA;gBACP,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;gBACvB,IAAI,OAAO,QAAQ,GAAG,CAAC;gBACvB,IAAI,CAAC,MACH,OAAO;gBAET,IAAI,cAAc,KAAK,SAAS,IAAI;gBACpC,IAAI,SAA6B;gBACjC,IAAI,eAAe,MACjB,SAAS,QAAQ,GAAG,CAAC,gBAAgB;gBAEvC,IAAI,UAAU,QAAQ,WAAW,OAAO,QAAQ,CAAC,OAAO,CAAC,QAAQ,MAAM,OAAO,CAAC;gBAC/E,OAAO,gCAAU,WAAW,MAAM,QAAQ,SAAS,YAAY;YACjE;QACF;QACA,WAAU,GAAQ,EAAE,IAAmB;YACrC,SAAS,CAAA;gBACP,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;gBACvB,IAAI,OAAO,QAAQ,GAAG,CAAC;gBACvB,IAAI,CAAC,MACH,OAAO;gBAET,IAAI,cAAc,KAAK,SAAS,IAAI;gBACpC,IAAI,SAA6B;gBACjC,IAAI,eAAe,MACjB,SAAS,QAAQ,GAAG,CAAC,gBAAgB;gBAEvC,IAAI,UAAU,QAAQ,WAAW,OAAO,QAAQ,CAAC,OAAO,CAAC,QAAQ,MAAM,OAAO,CAAC;gBAC/E;gBACA,OAAO,gCAAU,WAAW,MAAM,QAAQ,SAAS,YAAY;YACjE;QACF;QACA,QAAO,MAAW,EAAE,QAAW;YAC7B,SAAS,CAAC,SAAC,KAAK,EAAE,SAAS,WAAW,EAAC,GACrC,WACE,OACA,QACA,CAAA;oBACE,IAAI,OAAoB;wBACtB,KAAK,QAAQ,GAAG;wBAChB,WAAW,QAAQ,SAAS;wBAC5B,OAAO;wBACP,UAAU;oBACZ;oBAEA,IAAI,OAAO,UAAU,YAAY,WAAW,aAAa,KAAK,GAAG;oBACjE,KAAK,QAAQ,GAAG,KAAK,KAAK;oBAC1B,OAAO;gBACT,GACA;QAGN;IACF;AACF;AAEA,SAAS,gCACP,KAAuB,EACvB,IAAmB,EACnB,QAA4B,EAC5B,OAAe,EACf,UAKqB,EACrB,OAAgE;IAEhE,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;IAEvB,IAAI,SAAS;IACb,IAAI,aAAa,IAAI,IAAI;IACzB,MAAO,QAAQ,aAAa,KAAM;QAChC,IAAI,WAAW,GAAG,CAAC,OAAO,GAAG,GAC3B,MAAM,IAAI,MAAM;QAElB,SAAS,QAAQ,GAAG,CAAC,OAAO,SAAS,KAAM;IAC7C;IAEA,IAAI,kBAAkB;IAEtB,IAAI,WAAW,MAAM,OAAO,CAAC,QAAQ,OAAO;WAAI;KAAK;IACrD,0CAA0C;IAC1C,IAAI,cAAgC,IAAI;IACxC,IAAI,eAAmC,EAAE;IACzC,IAAI,WAAW;IACf,IAAI,SAAS;IACb,IAAI,IAAI;IAER,SAAS,UAAU,IAAI,EAAE,WAAC,OAAO,aAAE,SAAS,EAAC;QAC3C,UAAU;QACV,IAAI,QAAQ,MACV,KAAK,IAAI,SAAS,KAAK,QAAQ,IAAI,EAAE,CAAE;YACrC,UAAU,OAAO;yBAAC;2BAAS;YAAS;YACpC,YAAY;QACd;IAEJ;IAEA,SAAS,QAAQ,KAAK;QACpB,6GAA6G;QAC7G,IAAI,SAAS,QAAQ,CAAC,MAAM,GAAG,GAC7B,YAAY,GAAG,CAAC,MAAM,GAAG,EAAE;IAE/B;IAEA,SAAS,UAAU,KAAK;QACtB,8FAA8F;QAC9F,iEAAiE;QACjE,IAAI,SAAS,QAAQ,CAAC,MAAM,GAAG,GAAG;YAChC,aAAa,IAAI,CAAC;gBAAC,GAAG,OAAO,GAAG,CAAC,MAAM,GAAG,CAAC;gBAAG,WAAW,UAAU,OAAO;YAAI;YAC9E,IAAI,EAAC,OAAO,SAAS,EAAE,SAAS,OAAO,EAAC,GAAG,WACzC,UACA,MAAM,GAAG,EACT,IAAM,MACN;YAEF,WAAW;YACX,SAAS;QACX;QACA,qGAAqG;QACrG,4GAA4G;QAC5G,IACE,AAAC,CAAA,MAAM,SAAS,KAAK,YAAY,MAAM,SAAS,KAAK,UAAU,GAAE,KACjE,SAAS,QAAQ,CAAC,MAAM,GAAG,KAC3B,AAAC,CAAA,UAAU,WAAW,SAAS,QAAQ,CAAC,OAAO,CAAC,SAAS,MAAM,OAAO,CAAC,MAAK,IAC1E,iBAEF;IAEJ;IAEA,UAAU;QAAC,UAAU;IAAK,GAAG;iBAAC;mBAAS;IAAS;IAEhD,IAAI,eAAe,aAAa,IAAI,CAAC,CAAC,GAAG,IACvC,YAAY,GAAG,CAAC,EAAE,GAAG,IAAK,YAAY,GAAG,CAAC,EAAE,GAAG,IAAK,IAAI;IAE1D,8CAA8C;IAC9C,IAAI,CAAC,YAAY,SAAS,GAAG,IAAI,MAAM;QACrC,aAAa,OAAO,CAAC,CAAA;YACnB,QAAQ,WAAW;QACrB;QACA,OAAO;YACL,OAAO;mBAAI,SAAS,KAAK,CAAC,GAAG;mBAAa;mBAAiB,SAAS,KAAK,CAAC;aAAS;YACnF,SAAS;QACX;IACF;IAEA,uDAAuD;IACvD,OAAO,WACL,UACA,SAAS,GAAG,EACZ,CAAA,aAAe,CAAA;YACb,KAAK,WAAW,GAAG;YACnB,WAAW,WAAW,SAAS;YAC/B,OAAO,WAAW,KAAK;YACvB,UAAU;mBACL,WAAW,QAAQ,CAAE,KAAK,CAAC,GAAG;mBAC9B;mBACA,WAAW,QAAQ,CAAE,KAAK,CAAC;aAC/B;QACH,CAAA,GACA;AAEJ","sources":["packages/react-stately/src/data/useTreeData.ts"],"sourcesContent":["/\n Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n \n Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n /\n\nimport {Key} from '@react-types/shared';\nimport {useState} from 'react';\n\nexport interface TreeOptions<T extends object> {\n /* Initial root items in the tree. /\n initialItems?: T[];\n /* The keys for the initially selected items. /\n initialSelectedKeys?: Iterable<Key>;\n /* A function that returns a unique key for an item object. /\n getKey?: (item: T) => Key;\n /* A function that returns the children for an item object. /\n getChildren?: (item: T) => T[];\n}\n\ninterface TreeNode<T extends object> {\n /* A unique key for the tree node. /\n key: Key;\n /* The key of the parent node. /\n parentKey?: Key \| null;\n /* The value object for the tree node. /\n value: T;\n /* Children of the tree node. /\n children: TreeNode<T>[] \| null;\n}\n\nexport interface TreeData<T extends object> {\n /* The root nodes in the tree. /\n items: TreeNode<T>[];\n\n /* The keys of the currently selected items in the tree. /\n selectedKeys: Set<Key>;\n\n /* Sets the selected keys. /\n setSelectedKeys(keys: Set<Key>): void;\n\n /\n Gets a node from the tree by key.\n \n @param key - The key of the item to retrieve.\n /\n getItem(key: Key): TreeNode<T> \| undefined;\n\n /\n Inserts an item into a parent node as a child.\n \n @param parentKey - The key of the parent item to insert into. `null` for the root.\n * @param index - The index within the parent to insert into.\n * @param value - The value to insert.\n /\n insert(parentKey: Key \| null, index: number, ...values: T[]): void;\n\n /\n Inserts items into the list before the item at the given key.\n \n @param key - The key of the item to insert before.\n * @param values - The values to insert.\n /\n insertBefore(key: Key, ...values: T[]): void;\n\n /\n Inserts items into the list after the item at the given key.\n \n @param key - The key of the item to insert after.\n * @param values - The values to insert.\n /\n insertAfter(key: Key, ...values: T[]): void;\n\n /\n Appends an item into a parent node as a child.\n \n @param parentKey - The key of the parent item to insert into. `null` for the root.\n * @param value - The value to insert.\n /\n append(parentKey: Key \| null, ...values: T[]): void;\n\n /\n Prepends an item into a parent node as a child.\n \n @param parentKey - The key of the parent item to insert into. `null` for the root.\n * @param value - The value to insert.\n /\n prepend(parentKey: Key \| null, ...value: T[]): void;\n\n /\n Removes an item from the tree by its key.\n \n @param key - The key of the item to remove.\n /\n remove(...keys: Key[]): void;\n\n /\n Removes all items from the tree that are currently\n * in the set of selected items.\n /\n removeSelectedItems(): void;\n\n /\n Moves an item within the tree.\n \n @param key - The key of the item to move.\n * @param toParentKey - The key of the new parent to insert into. `null` for the root.\n * @param index - The index within the new parent to insert at.\n /\n move(key: Key, toParentKey: Key \| null, index: number): void;\n\n /\n Moves one or more items before a given key.\n \n @param key - The key of the item to move the items before.\n * @param keys - The keys of the items to move.\n /\n moveBefore(key: Key, keys: Iterable<Key>): void;\n\n /\n Moves one or more items after a given key.\n \n @param key - The key of the item to move the items after.\n * @param keys - The keys of the items to move.\n /\n moveAfter(key: Key, keys: Iterable<Key>): void;\n\n /\n Updates an item in the tree.\n \n @param key - The key of the item to update.\n * @param newValue - The new value for the item.\n /\n update(key: Key, newValue: T): void;\n}\n\ninterface TreeDataState<T extends object> {\n items: TreeNode<T>[];\n nodeMap: Map<Key, TreeNode<T>>;\n}\n\n/\n Manages state for an immutable tree data structure, and provides convenience methods to\n * update the data over time.\n */\nexport function useTreeData<T extends object>(options: TreeOptions<T>): TreeData<T> {\n let {\n initialItems = [],\n initialSelectedKeys,\n getKey = (item: any) => item.id ?? item.key,\n getChildren = (item: any) => item.children\n } = options;\n\n // We only want to compute this on initial render.\n let [tree, setItems] = useState<TreeDataState<T>>(() => buildTree(initialItems, new Map()));\n let {items, nodeMap} = tree;\n\n let [selectedKeys, setSelectedKeys] = useState(new Set<Key>(initialSelectedKeys \|\| []));\n\n function buildTree(\n initialItems: T[] \| null = [],\n map: Map<Key, TreeNode<T>>,\n parentKey?: Key \| null\n ) {\n if (initialItems == null) {\n initialItems = [];\n }\n return {\n items: initialItems.map(item => {\n let node: TreeNode<T> = {\n key: getKey(item),\n parentKey: parentKey ?? null,\n value: item,\n children: null\n };\n\n node.children = buildTree(getChildren(item), map, node.key).items;\n map.set(node.key, node);\n return node;\n }),\n nodeMap: map\n };\n }\n\n function updateTree(\n items: TreeNode<T>[],\n key: Key \| null,\n update: (node: TreeNode<T>) => TreeNode<T> \| null,\n originalMap: Map<Key, TreeNode<T>>\n ) {\n let node = key == null ? null : originalMap.get(key);\n if (node == null) {\n return {items, nodeMap: originalMap};\n }\n let map = new Map<Key, TreeNode<T>>(originalMap);\n\n // Create a new node. If null, then delete the node, otherwise replace.\n let newNode = update(node);\n if (newNode == null) {\n deleteNode(node, map);\n } else {\n addNode(newNode, map);\n }\n\n // Walk up the tree and update each parent to refer to the new children.\n while (node && node.parentKey) {\n let nextParent = map.get(node.parentKey)!;\n let copy: TreeNode<T> = {\n key: nextParent.key,\n parentKey: nextParent.parentKey,\n value: nextParent.value,\n children: null\n };\n\n let children = nextParent.children;\n if (newNode == null && children) {\n children = children.filter(c => c !== node);\n }\n\n copy.children =\n children?.map(child => {\n if (child === node) {\n // newNode cannot be null here due to the above filter.\n return newNode!;\n }\n\n return child;\n }) ?? null;\n\n map.set(copy.key, copy);\n\n newNode = copy;\n node = nextParent;\n }\n\n if (newNode == null) {\n items = items.filter(c => c !== node);\n }\n\n return {\n items: items.map(item => {\n if (item === node) {\n // newNode cannot be null here due to the above filter.\n return newNode!;\n }\n\n return item;\n }),\n nodeMap: map\n };\n }\n\n function addNode(node: TreeNode<T>, map: Map<Key, TreeNode<T>>) {\n map.set(node.key, node);\n if (node.children) {\n for (let child of node.children) {\n addNode(child, map);\n }\n }\n }\n\n function deleteNode(node: TreeNode<T>, map: Map<Key, TreeNode<T>>) {\n map.delete(node.key);\n if (node.children) {\n for (let child of node.children) {\n deleteNode(child, map);\n }\n }\n }\n return {\n items,\n selectedKeys,\n setSelectedKeys,\n getItem(key: Key) {\n return nodeMap.get(key);\n },\n insert(parentKey: Key \| null, index: number, ...values: T[]) {\n setItems(({items, nodeMap: originalMap}) => {\n let {items: newNodes, nodeMap: newMap} = buildTree(values, new Map(originalMap), parentKey);\n\n // If parentKey is null, insert into the root.\n if (parentKey == null) {\n return {\n items: [...items.slice(0, index), ...newNodes, ...items.slice(index)],\n nodeMap: newMap\n };\n }\n\n // Otherwise, update the parent node and its ancestors.\n return updateTree(\n items,\n parentKey,\n parentNode => ({\n key: parentNode.key,\n parentKey: parentNode.parentKey,\n value: parentNode.value,\n children: [\n ...parentNode.children!.slice(0, index),\n ...newNodes,\n ...parentNode.children!.slice(index)\n ]\n }),\n newMap\n );\n });\n },\n insertBefore(key: Key, ...values: T[]): void {\n let node = nodeMap.get(key);\n if (!node) {\n return;\n }\n\n let parentNode = nodeMap.get(node.parentKey!);\n let nodes = parentNode ? parentNode.children : items;\n let index = nodes!.indexOf(node);\n this.insert(parentNode?.key ?? null, index, ...values);\n },\n insertAfter(key: Key, ...values: T[]): void {\n let node = nodeMap.get(key);\n if (!node) {\n return;\n }\n\n let parentNode = nodeMap.get(node.parentKey!);\n let nodes = parentNode ? parentNode.children : items;\n let index = nodes!.indexOf(node);\n this.insert(parentNode?.key ?? null, index + 1, ...values);\n },\n prepend(parentKey: Key \| null, ...values: T[]) {\n this.insert(parentKey, 0, ...values);\n },\n append(parentKey: Key \| null, ...values: T[]) {\n if (parentKey == null) {\n this.insert(null, items.length, ...values);\n } else {\n let parentNode = nodeMap.get(parentKey);\n if (!parentNode) {\n return;\n }\n\n this.insert(parentKey, parentNode.children!.length, ...values);\n }\n },\n remove(...keys: Key[]) {\n if (keys.length === 0) {\n return;\n }\n\n let newItems = items;\n let prevMap = nodeMap;\n let newTree;\n for (let key of keys) {\n newTree = updateTree(newItems, key, () => null, prevMap);\n prevMap = newTree.nodeMap;\n newItems = newTree.items;\n }\n\n setItems(newTree);\n\n let selection = new Set(selectedKeys);\n for (let key of selectedKeys) {\n if (!newTree.nodeMap.has(key)) {\n selection.delete(key);\n }\n }\n\n setSelectedKeys(selection);\n },\n removeSelectedItems() {\n this.remove(...selectedKeys);\n },\n move(key: Key, toParentKey: Key \| null, index: number) {\n setItems(({items, nodeMap: originalMap}) => {\n let node = originalMap.get(key);\n if (!node) {\n return {items, nodeMap: originalMap};\n }\n\n let {items: newItems, nodeMap: newMap} = updateTree(items, key, () => null, originalMap);\n\n const movedNode = {\n ...node,\n parentKey: toParentKey\n };\n\n // If parentKey is null, insert into the root.\n if (toParentKey == null) {\n addNode(movedNode, newMap);\n return {\n items: [...newItems.slice(0, index), movedNode, ...newItems.slice(index)],\n nodeMap: newMap\n };\n }\n\n // Otherwise, update the parent node and its ancestors.\n return updateTree(\n newItems,\n toParentKey,\n parentNode => ({\n key: parentNode.key,\n parentKey: parentNode.parentKey,\n value: parentNode.value,\n children: [\n ...parentNode.children!.slice(0, index),\n movedNode,\n ...parentNode.children!.slice(index)\n ]\n }),\n newMap\n );\n });\n },\n moveBefore(key: Key, keys: Iterable<Key>) {\n setItems(prevState => {\n let {items, nodeMap} = prevState;\n let node = nodeMap.get(key);\n if (!node) {\n return prevState;\n }\n let toParentKey = node.parentKey ?? null;\n let parent: null \| TreeNode<T> = null;\n if (toParentKey != null) {\n parent = nodeMap.get(toParentKey) ?? null;\n }\n let toIndex = parent?.children ? parent.children.indexOf(node) : items.indexOf(node);\n return moveItems(prevState, keys, parent, toIndex, updateTree, addNode);\n });\n },\n moveAfter(key: Key, keys: Iterable<Key>) {\n setItems(prevState => {\n let {items, nodeMap} = prevState;\n let node = nodeMap.get(key);\n if (!node) {\n return prevState;\n }\n let toParentKey = node.parentKey ?? null;\n let parent: null \| TreeNode<T> = null;\n if (toParentKey != null) {\n parent = nodeMap.get(toParentKey) ?? null;\n }\n let toIndex = parent?.children ? parent.children.indexOf(node) : items.indexOf(node);\n toIndex++;\n return moveItems(prevState, keys, parent, toIndex, updateTree, addNode);\n });\n },\n update(oldKey: Key, newValue: T) {\n setItems(({items, nodeMap: originalMap}) =>\n updateTree(\n items,\n oldKey,\n oldNode => {\n let node: TreeNode<T> = {\n key: oldNode.key,\n parentKey: oldNode.parentKey,\n value: newValue,\n children: null\n };\n\n let tree = buildTree(getChildren(newValue), originalMap, node.key);\n node.children = tree.items;\n return node;\n },\n originalMap\n )\n );\n }\n };\n}\n\nfunction moveItems<T extends object>(\n state: TreeDataState<T>,\n keys: Iterable<Key>,\n toParent: TreeNode<T> \| null,\n toIndex: number,\n updateTree: (\n items: TreeNode<T>[],\n key: Key \| null,\n update: (node: TreeNode<T>) => TreeNode<T> \| null,\n originalMap: Map<Key, TreeNode<T>>\n ) => TreeDataState<T>,\n addNode: (node: TreeNode<T>, map: Map<Key, TreeNode<T>>) => void\n): TreeDataState<T> {\n let {items, nodeMap} = state;\n\n let parent = toParent;\n let removeKeys = new Set(keys);\n while (parent?.parentKey != null) {\n if (removeKeys.has(parent.key)) {\n throw new Error('Cannot move an item to be a child of itself.');\n }\n parent = nodeMap.get(parent.parentKey!) ?? null;\n }\n\n let originalToIndex = toIndex;\n\n let keyArray = Array.isArray(keys) ? keys : [...keys];\n // depth first search to put keys in order\n let inOrderKeys: Map<Key, number> = new Map();\n let removedItems: Array<TreeNode<T>> = [];\n let newItems = items;\n let newMap = nodeMap;\n let i = 0;\n\n function traversal(node, {inorder, postorder}) {\n inorder?.(node);\n if (node != null) {\n for (let child of node.children ?? []) {\n traversal(child, {inorder, postorder});\n postorder?.(child);\n }\n }\n }\n\n function inorder(child) {\n // in-order so we add items as we encounter them in the tree, then we can insert them in expected order later\n if (keyArray.includes(child.key)) {\n inOrderKeys.set(child.key, i++);\n }\n }\n\n function postorder(child) {\n // remove items and update the tree from the leaves and work upwards toward the root, this way\n // we don't copy child node references from parents inadvertently\n if (keyArray.includes(child.key)) {\n removedItems.push({...newMap.get(child.key)!, parentKey: toParent?.key ?? null});\n let {items: nextItems, nodeMap: nextMap} = updateTree(\n newItems,\n child.key,\n () => null,\n newMap\n );\n newItems = nextItems;\n newMap = nextMap;\n }\n // decrement the index if the child being removed is in the target parent and before the target index\n // the root node is special, it is null, and will not have a key, however, a parentKey can still point to it\n if (\n (child.parentKey === toParent \|\| child.parentKey === toParent?.key) &&\n keyArray.includes(child.key) &&\n (toParent?.children ? toParent.children.indexOf(child) : items.indexOf(child)) <\n originalToIndex\n ) {\n toIndex--;\n }\n }\n\n traversal({children: items}, {inorder, postorder});\n\n let inOrderItems = removedItems.sort((a, b) =>\n inOrderKeys.get(a.key)! > inOrderKeys.get(b.key)! ? 1 : -1\n );\n // If parentKey is null, insert into the root.\n if (!toParent \|\| toParent.key == null) {\n inOrderItems.forEach(movedNode => {\n addNode(movedNode, newMap);\n });\n return {\n items: [...newItems.slice(0, toIndex), ...inOrderItems, ...newItems.slice(toIndex)],\n nodeMap: newMap\n };\n }\n\n // Otherwise, update the parent node and its ancestors.\n return updateTree(\n newItems,\n toParent.key,\n parentNode => ({\n key: parentNode.key,\n parentKey: parentNode.parentKey,\n value: parentNode.value,\n children: [\n ...parentNode.children!.slice(0, toIndex),\n ...inOrderItems,\n ...parentNode.children!.slice(toIndex)\n ]\n }),\n newMap\n );\n}\n"],"names":[],"version":3,"file":"useTreeData.cjs.map"}

package/dist/private/data/useTreeData.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"mappings":";;AAAA;;;;;;;;;;CAUC;AAkIM,SAAS,0CAA8B,OAAuB;IACnE,IAAI,gBACF,eAAe,EAAE,uBACjB,mBAAmB,UACnB,SAAS,CAAC;YAAc;eAAA,CAAA,WAAA,KAAK,EAAE,cAAP,sBAAA,WAAW,KAAK,GAAG;oBAC3C,cAAc,CAAC,OAAc,KAAK,QAAQ,EAC3C,GAAG;IAEJ,kDAAkD;IAClD,IAAI,CAAC,MAAM,SAAS,GAAG,CAAA,GAAA,eAAO,EAAoB,IAAM,UAAU,cAAc,IAAI;IACpF,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;IAEvB,IAAI,CAAC,cAAc,gBAAgB,GAAG,CAAA,GAAA,eAAO,EAAE,IAAI,IAAS,uBAAuB,EAAE;IAErF,SAAS,UAAU,eAA2B,EAAE,EAAE,GAA0B,EAAE,SAAsB;QAClG,IAAI,gBAAgB,MAClB,eAAe,EAAE;QAEnB,OAAO;YACL,OAAO,aAAa,GAAG,CAAC,CAAA;gBACtB,IAAI,OAAoB;oBACtB,KAAK,OAAO;oBACZ,WAAW,sBAAA,uBAAA,YAAa;oBACxB,OAAO;oBACP,UAAU;gBACZ;gBAEA,KAAK,QAAQ,GAAG,UAAU,YAAY,OAAO,KAAK,KAAK,GAAG,EAAE,KAAK;gBACjE,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE;gBAClB,OAAO;YACT;YACA,SAAS;QACX;IACF;IAEA,SAAS,WAAW,KAAoB,EAAE,GAAe,EAAE,MAAiD,EAAE,WAAkC;QAC9I,IAAI,OAAO,OAAO,OAAO,OAAO,YAAY,GAAG,CAAC;QAChD,IAAI,QAAQ,MACV,OAAO;mBAAC;YAAO,SAAS;QAAW;QAErC,IAAI,MAAM,IAAI,IAAsB;QAEpC,uEAAuE;QACvE,IAAI,UAAU,OAAO;QACrB,IAAI,WAAW,MACb,WAAW,MAAM;aAEjB,QAAQ,SAAS;QAGnB,wEAAwE;QACxE,MAAO,QAAQ,KAAK,SAAS,CAAE;YAC7B,IAAI,aAAa,IAAI,GAAG,CAAC,KAAK,SAAS;YACvC,IAAI,OAAoB;gBACtB,KAAK,WAAW,GAAG;gBACnB,WAAW,WAAW,SAAS;gBAC/B,OAAO,WAAW,KAAK;gBACvB,UAAU;YACZ;YAEA,IAAI,WAAW,WAAW,QAAQ;YAClC,IAAI,WAAW,QAAQ,UACrB,WAAW,SAAS,MAAM,CAAC,CAAA,IAAK,MAAM;gBAGxB;YAAhB,KAAK,QAAQ,GAAG,CAAA,gBAAA,qBAAA,+BAAA,SAAU,GAAG,CAAC,CAAA;gBAC5B,IAAI,UAAU,MACZ,uDAAuD;gBACvD,OAAO;gBAGT,OAAO;YACT,gBAPgB,2BAAA,gBAOV;YAEN,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE;YAElB,UAAU;YACV,OAAO;QACT;QAEA,IAAI,WAAW,MACb,QAAQ,MAAM,MAAM,CAAC,CAAA,IAAK,MAAM;QAGlC,OAAO;YACL,OAAO,MAAM,GAAG,CAAC,CAAA;gBACf,IAAI,SAAS,MACX,uDAAuD;gBACvD,OAAO;gBAGT,OAAO;YACT;YACA,SAAS;QACX;IACF;IAEA,SAAS,QAAQ,IAAiB,EAAE,GAA0B;QAC5D,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE;QAClB,IAAI,KAAK,QAAQ,EACf,KAAK,IAAI,SAAS,KAAK,QAAQ,CAC7B,QAAQ,OAAO;IAGrB;IAEA,SAAS,WAAW,IAAiB,EAAE,GAA0B;QAC/D,IAAI,MAAM,CAAC,KAAK,GAAG;QACnB,IAAI,KAAK,QAAQ,EACf,KAAK,IAAI,SAAS,KAAK,QAAQ,CAC7B,WAAW,OAAO;IAGxB;IACA,OAAO;eACL;sBACA;yBACA;QACA,SAAQ,GAAQ;YACd,OAAO,QAAQ,GAAG,CAAC;QACrB;QACA,QAAO,SAAqB,EAAE,KAAa,EAAE,GAAG,MAAW;YACzD,SAAS,CAAC,SAAC,KAAK,EAAE,SAAS,WAAW,EAAC;gBACrC,IAAI,EAAC,OAAO,QAAQ,EAAE,SAAS,MAAM,EAAC,GAAG,UAAU,QAAQ,IAAI,IAAI,cAAc;gBAEjF,8CAA8C;gBAC9C,IAAI,aAAa,MACf,OAAO;oBACL,OAAO;2BACF,MAAM,KAAK,CAAC,GAAG;2BACf;2BACA,MAAM,KAAK,CAAC;qBAChB;oBACD,SAAS;gBACX;gBAGF,uDAAuD;gBACvD,OAAO,WAAW,OAAO,WAAW,CAAA,aAAe,CAAA;wBACjD,KAAK,WAAW,GAAG;wBACnB,WAAW,WAAW,SAAS;wBAC/B,OAAO,WAAW,KAAK;wBACvB,UAAU;+BACL,WAAW,QAAQ,CAAE,KAAK,CAAC,GAAG;+BAC9B;+BACA,WAAW,QAAQ,CAAE,KAAK,CAAC;yBAC/B;oBACH,CAAA,GAAI;YACN;QACF;QACA,cAAa,GAAQ,EAAE,GAAG,MAAW;YACnC,IAAI,OAAO,QAAQ,GAAG,CAAC;YACvB,IAAI,CAAC,MACH;YAGF,IAAI,aAAa,QAAQ,GAAG,CAAC,KAAK,SAAS;YAC3C,IAAI,QAAQ,aAAa,WAAW,QAAQ,GAAG;YAC/C,IAAI,QAAQ,MAAO,OAAO,CAAC;gBACf;YAAZ,IAAI,CAAC,MAAM,CAAC,CAAA,kBAAA,uBAAA,iCAAA,WAAY,GAAG,cAAf,6BAAA,kBAAmB,MAAM,UAAU;QACjD;QACA,aAAY,GAAQ,EAAE,GAAG,MAAW;YAClC,IAAI,OAAO,QAAQ,GAAG,CAAC;YACvB,IAAI,CAAC,MACH;YAGF,IAAI,aAAa,QAAQ,GAAG,CAAC,KAAK,SAAS;YAC3C,IAAI,QAAQ,aAAa,WAAW,QAAQ,GAAG;YAC/C,IAAI,QAAQ,MAAO,OAAO,CAAC;gBACf;YAAZ,IAAI,CAAC,MAAM,CAAC,CAAA,kBAAA,uBAAA,iCAAA,WAAY,GAAG,cAAf,6BAAA,kBAAmB,MAAM,QAAQ,MAAM;QACrD;QACA,SAAQ,SAAqB,EAAE,GAAG,MAAW;YAC3C,IAAI,CAAC,MAAM,CAAC,WAAW,MAAM;QAC/B;QACA,QAAO,SAAqB,EAAE,GAAG,MAAW;YAC1C,IAAI,aAAa,MACf,IAAI,CAAC,MAAM,CAAC,MAAM,MAAM,MAAM,KAAK;iBAC9B;gBACL,IAAI,aAAa,QAAQ,GAAG,CAAC;gBAC7B,IAAI,CAAC,YACH;gBAGF,IAAI,CAAC,MAAM,CAAC,WAAW,WAAW,QAAQ,CAAE,MAAM,KAAK;YACzD;QACF;QACA,QAAO,GAAG,IAAW;YACnB,IAAI,KAAK,MAAM,KAAK,GAClB;YAGF,IAAI,WAAW;YACf,IAAI,UAAU;YACd,IAAI;YACJ,KAAK,IAAI,OAAO,KAAM;gBACpB,UAAU,WAAW,UAAU,KAAK,IAAM,MAAM;gBAChD,UAAU,QAAQ,OAAO;gBACzB,WAAW,QAAQ,KAAK;YAC1B;YAEA,SAAS;YAET,IAAI,YAAY,IAAI,IAAI;YACxB,KAAK,IAAI,OAAO,aACd,IAAI,CAAC,QAAQ,OAAO,CAAC,GAAG,CAAC,MACvB,UAAU,MAAM,CAAC;YAIrB,gBAAgB;QAClB;QACA;YACE,IAAI,CAAC,MAAM,IAAI;QACjB;QACA,MAAK,GAAQ,EAAE,WAAuB,EAAE,KAAa;YACnD,SAAS,CAAC,SAAC,KAAK,EAAE,SAAS,WAAW,EAAC;gBACrC,IAAI,OAAO,YAAY,GAAG,CAAC;gBAC3B,IAAI,CAAC,MACH,OAAO;2BAAC;oBAAO,SAAS;gBAAW;gBAGrC,IAAI,EAAC,OAAO,QAAQ,EAAE,SAAS,MAAM,EAAC,GAAG,WAAW,OAAO,KAAK,IAAM,MAAM;gBAG5E,MAAM,YAAY;oBAChB,GAAG,IAAI;oBACP,WAAW;gBACb;gBAEA,8CAA8C;gBAC9C,IAAI,eAAe,MAAM;oBACvB,QAAQ,WAAW;oBACnB,OAAO;wBAAC,OAAO;+BACV,SAAS,KAAK,CAAC,GAAG;4BACrB;+BACG,SAAS,KAAK,CAAC;yBACnB;wBAAE,SAAS;oBAAM;gBACpB;gBAEA,uDAAuD;gBACvD,OAAO,WAAW,UAAU,aAAa,CAAA,aAAe,CAAA;wBACtD,KAAK,WAAW,GAAG;wBACnB,WAAW,WAAW,SAAS;wBAC/B,OAAO,WAAW,KAAK;wBACvB,UAAU;+BACL,WAAW,QAAQ,CAAE,KAAK,CAAC,GAAG;4BACjC;+BACG,WAAW,QAAQ,CAAE,KAAK,CAAC;yBAC/B;oBACH,CAAA,GAAI;YACN;QACF;QACA,YAAW,GAAQ,EAAE,IAAmB;YACtC,SAAS,CAAC;gBACR,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;gBACvB,IAAI,OAAO,QAAQ,GAAG,CAAC;gBACvB,IAAI,CAAC,MACH,OAAO;oBAES;gBAAlB,IAAI,cAAc,CAAA,kBAAA,KAAK,SAAS,cAAd,6BAAA,kBAAkB;gBACpC,IAAI,SAA6B;oBAEtB;gBADX,IAAI,eAAe,MACjB,SAAS,CAAA,eAAA,QAAQ,GAAG,CAAC,0BAAZ,0BAAA,eAA4B;gBAEvC,IAAI,UAAU,CAAA,mBAAA,6BAAA,OAAQ,QAAQ,IAAG,OAAO,QAAQ,CAAC,OAAO,CAAC,QAAQ,MAAM,OAAO,CAAC;gBAC/E,OAAO,gCAAU,WAAW,MAAM,QAAQ,SAAS,YAAY;YACjE;QACF;QACA,WAAU,GAAQ,EAAE,IAAmB;YACrC,SAAS,CAAC;gBACR,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;gBACvB,IAAI,OAAO,QAAQ,GAAG,CAAC;gBACvB,IAAI,CAAC,MACH,OAAO;oBAES;gBAAlB,IAAI,cAAc,CAAA,kBAAA,KAAK,SAAS,cAAd,6BAAA,kBAAkB;gBACpC,IAAI,SAA6B;oBAEtB;gBADX,IAAI,eAAe,MACjB,SAAS,CAAA,eAAA,QAAQ,GAAG,CAAC,0BAAZ,0BAAA,eAA4B;gBAEvC,IAAI,UAAU,CAAA,mBAAA,6BAAA,OAAQ,QAAQ,IAAG,OAAO,QAAQ,CAAC,OAAO,CAAC,QAAQ,MAAM,OAAO,CAAC;gBAC/E;gBACA,OAAO,gCAAU,WAAW,MAAM,QAAQ,SAAS,YAAY;YACjE;QACF;QACA,QAAO,MAAW,EAAE,QAAW;YAC7B,SAAS,CAAC,SAAC,KAAK,EAAE,SAAS,WAAW,EAAC,GAAK,WAAW,OAAO,QAAQ,CAAA;oBACpE,IAAI,OAAoB;wBACtB,KAAK,QAAQ,GAAG;wBAChB,WAAW,QAAQ,SAAS;wBAC5B,OAAO;wBACP,UAAU;oBACZ;oBAEA,IAAI,OAAO,UAAU,YAAY,WAAW,aAAa,KAAK,GAAG;oBACjE,KAAK,QAAQ,GAAG,KAAK,KAAK;oBAC1B,OAAO;gBACT,GAAG;QACL;IACF;AACF;AAEA,SAAS,gCACP,KAAuB,EACvB,IAAmB,EACnB,QAA4B,EAC5B,OAAe,EACf,UAKqB,EACrB,OAAgE;IAEhE,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;IAEvB,IAAI,SAAS;IACb,IAAI,aAAa,IAAI,IAAI;IACzB,MAAO,CAAA,mBAAA,6BAAA,OAAQ,SAAS,KAAI,KAAM;QAChC,IAAI,WAAW,GAAG,CAAC,OAAO,GAAG,GAC3B,MAAM,IAAI,MAAM;YAET;QAAT,SAAS,CAAA,eAAA,QAAQ,GAAG,CAAC,OAAO,SAAS,eAA5B,0BAAA,eAAkC;IAC7C;IAEA,IAAI,kBAAkB;IAEtB,IAAI,WAAW,MAAM,OAAO,CAAC,QAAQ,OAAO;WAAI;KAAK;IACrD,0CAA0C;IAC1C,IAAI,cAAgC,IAAI;IACxC,IAAI,eAAmC,EAAE;IACzC,IAAI,WAAW;IACf,IAAI,SAAS;IACb,IAAI,IAAI;IAER,SAAS,UAAU,IAAI,EAAE,WAAC,OAAO,aAAE,SAAS,EAAC;QAC3C,oBAAA,8BAAA,QAAU;YAEU;QADpB,IAAI,QAAQ,MACV,KAAK,IAAI,SAAS,CAAA,iBAAA,KAAK,QAAQ,cAAb,4BAAA,iBAAiB,EAAE,CAAE;YACrC,UAAU,OAAO;yBAAC;2BAAS;YAAS;YACpC,sBAAA,gCAAA,UAAY;QACd;IAEJ;IAEA,SAAS,QAAQ,KAAK;QACpB,6GAA6G;QAC7G,IAAI,SAAS,QAAQ,CAAC,MAAM,GAAG,GAC7B,YAAY,GAAG,CAAC,MAAM,GAAG,EAAE;IAE/B;IAEA,SAAS,UAAU,KAAK;QACtB,8FAA8F;QAC9F,iEAAiE;QACjE,IAAI,SAAS,QAAQ,CAAC,MAAM,GAAG,GAAG;gBACyB;YAAzD,aAAa,IAAI,CAAC;gBAAC,GAAG,OAAO,GAAG,CAAC,MAAM,GAAG,CAAC;gBAAG,WAAW,CAAA,gBAAA,qBAAA,+BAAA,SAAU,GAAG,cAAb,2BAAA,gBAAiB;YAAI;YAC9E,IAAI,EAAC,OAAO,SAAS,EAAE,SAAS,OAAO,EAAC,GAAG,WAAW,UAAU,MAAM,GAAG,EAAE,IAAM,MAAM;YACvF,WAAW;YACX,SAAS;QACX;QACA,qGAAqG;QACrG,4GAA4G;QAC5G,IAAI,AAAC,CAAA,MAAM,SAAS,KAAK,YACpB,MAAM,SAAS,MAAK,qBAAA,+BAAA,SAAU,GAAG,CAAD,KAChC,SAAS,QAAQ,CAAC,MAAM,GAAG,KAC3B,AAAC,CAAA,CAAA,qBAAA,+BAAA,SAAU,QAAQ,IAAG,SAAS,QAAQ,CAAC,OAAO,CAAC,SAAS,MAAM,OAAO,CAAC,MAAK,IAAK,iBACpF;IAEJ;IAEA,UAAU;QAAC,UAAU;IAAK,GAAG;iBAAC;mBAAS;IAAS;IAEhD,IAAI,eAAe,aAAa,IAAI,CAAC,CAAC,GAAG,IAAM,YAAY,GAAG,CAAC,EAAE,GAAG,IAAK,YAAY,GAAG,CAAC,EAAE,GAAG,IAAK,IAAI;IACvG,8CAA8C;IAC9C,IAAI,CAAC,YAAY,SAAS,GAAG,IAAI,MAAM;QACrC,aAAa,OAAO,CAAC,CAAA;YACnB,QAAQ,WAAW;QACrB;QACA,OAAO;YAAC,OAAO;mBACV,SAAS,KAAK,CAAC,GAAG;mBAClB;mBACA,SAAS,KAAK,CAAC;aACnB;YAAE,SAAS;QAAM;IACpB;IAEA,uDAAuD;IACvD,OAAO,WAAW,UAAU,SAAS,GAAG,EAAE,CAAA,aAAe,CAAA;YACvD,KAAK,WAAW,GAAG;YACnB,WAAW,WAAW,SAAS;YAC/B,OAAO,WAAW,KAAK;YACvB,UAAU;mBACL,WAAW,QAAQ,CAAE,KAAK,CAAC,GAAG;mBAC9B;mBACA,WAAW,QAAQ,CAAE,KAAK,CAAC;aAC/B;QACH,CAAA,GAAI;AACN","sources":["packages/react-stately/src/data/useTreeData.ts"],"sourcesContent":["/\n Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n \n Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n /\n\nimport {Key} from '@react-types/shared';\nimport {useState} from 'react';\n\nexport interface TreeOptions<T extends object> {\n /* Initial root items in the tree. /\n initialItems?: T[],\n /* The keys for the initially selected items. /\n initialSelectedKeys?: Iterable<Key>,\n /* A function that returns a unique key for an item object. /\n getKey?: (item: T) => Key,\n /* A function that returns the children for an item object. /\n getChildren?: (item: T) => T[]\n}\n\ninterface TreeNode<T extends object> {\n /* A unique key for the tree node. /\n key: Key,\n /* The key of the parent node. /\n parentKey?: Key \| null,\n /* The value object for the tree node. /\n value: T,\n /* Children of the tree node. /\n children: TreeNode<T>[] \| null\n}\n\nexport interface TreeData<T extends object> {\n /* The root nodes in the tree. /\n items: TreeNode<T>[],\n\n /* The keys of the currently selected items in the tree. /\n selectedKeys: Set<Key>,\n\n /* Sets the selected keys. /\n setSelectedKeys(keys: Set<Key>): void,\n\n /\n Gets a node from the tree by key.\n * @param key - The key of the item to retrieve.\n /\n getItem(key: Key): TreeNode<T> \| undefined,\n\n /\n Inserts an item into a parent node as a child.\n * @param parentKey - The key of the parent item to insert into. `null` for the root.\n * @param index - The index within the parent to insert into.\n * @param value - The value to insert.\n /\n insert(parentKey: Key \| null, index: number, ...values: T[]): void,\n\n /\n Inserts items into the list before the item at the given key.\n * @param key - The key of the item to insert before.\n * @param values - The values to insert.\n /\n insertBefore(key: Key, ...values: T[]): void,\n\n /\n Inserts items into the list after the item at the given key.\n * @param key - The key of the item to insert after.\n * @param values - The values to insert.\n /\n insertAfter(key: Key, ...values: T[]): void,\n\n /\n Appends an item into a parent node as a child.\n * @param parentKey - The key of the parent item to insert into. `null` for the root.\n * @param value - The value to insert.\n /\n append(parentKey: Key \| null, ...values: T[]): void,\n\n /\n Prepends an item into a parent node as a child.\n * @param parentKey - The key of the parent item to insert into. `null` for the root.\n * @param value - The value to insert.\n /\n prepend(parentKey: Key \| null, ...value: T[]): void,\n\n /\n Removes an item from the tree by its key.\n * @param key - The key of the item to remove.\n /\n remove(...keys: Key[]): void,\n\n /\n Removes all items from the tree that are currently\n * in the set of selected items.\n /\n removeSelectedItems(): void,\n\n /\n Moves an item within the tree.\n * @param key - The key of the item to move.\n * @param toParentKey - The key of the new parent to insert into. `null` for the root.\n * @param index - The index within the new parent to insert at.\n /\n move(key: Key, toParentKey: Key \| null, index: number): void,\n\n /\n Moves one or more items before a given key.\n * @param key - The key of the item to move the items before.\n * @param keys - The keys of the items to move.\n /\n moveBefore(key: Key, keys: Iterable<Key>): void,\n\n /\n Moves one or more items after a given key.\n * @param key - The key of the item to move the items after.\n * @param keys - The keys of the items to move.\n /\n moveAfter(key: Key, keys: Iterable<Key>): void,\n\n /\n Updates an item in the tree.\n * @param key - The key of the item to update.\n * @param newValue - The new value for the item.\n /\n update(key: Key, newValue: T): void\n}\n\ninterface TreeDataState<T extends object> {\n items: TreeNode<T>[],\n nodeMap: Map<Key, TreeNode<T>>\n}\n\n/\n Manages state for an immutable tree data structure, and provides convenience methods to\n * update the data over time.\n */\nexport function useTreeData<T extends object>(options: TreeOptions<T>): TreeData<T> {\n let {\n initialItems = [],\n initialSelectedKeys,\n getKey = (item: any) => item.id ?? item.key,\n getChildren = (item: any) => item.children\n } = options;\n\n // We only want to compute this on initial render.\n let [tree, setItems] = useState<TreeDataState<T>>(() => buildTree(initialItems, new Map()));\n let {items, nodeMap} = tree;\n\n let [selectedKeys, setSelectedKeys] = useState(new Set<Key>(initialSelectedKeys \|\| []));\n\n function buildTree(initialItems: T[] \| null = [], map: Map<Key, TreeNode<T>>, parentKey?: Key \| null) {\n if (initialItems == null) {\n initialItems = [];\n }\n return {\n items: initialItems.map(item => {\n let node: TreeNode<T> = {\n key: getKey(item),\n parentKey: parentKey ?? null,\n value: item,\n children: null\n };\n\n node.children = buildTree(getChildren(item), map, node.key).items;\n map.set(node.key, node);\n return node;\n }),\n nodeMap: map\n };\n }\n\n function updateTree(items: TreeNode<T>[], key: Key \| null, update: (node: TreeNode<T>) => TreeNode<T> \| null, originalMap: Map<Key, TreeNode<T>>) {\n let node = key == null ? null : originalMap.get(key);\n if (node == null) {\n return {items, nodeMap: originalMap};\n }\n let map = new Map<Key, TreeNode<T>>(originalMap);\n\n // Create a new node. If null, then delete the node, otherwise replace.\n let newNode = update(node);\n if (newNode == null) {\n deleteNode(node, map);\n } else {\n addNode(newNode, map);\n }\n\n // Walk up the tree and update each parent to refer to the new children.\n while (node && node.parentKey) {\n let nextParent = map.get(node.parentKey)!;\n let copy: TreeNode<T> = {\n key: nextParent.key,\n parentKey: nextParent.parentKey,\n value: nextParent.value,\n children: null\n };\n\n let children = nextParent.children;\n if (newNode == null && children) {\n children = children.filter(c => c !== node);\n }\n\n copy.children = children?.map(child => {\n if (child === node) {\n // newNode cannot be null here due to the above filter.\n return newNode!;\n }\n\n return child;\n }) ?? null;\n\n map.set(copy.key, copy);\n\n newNode = copy;\n node = nextParent;\n }\n\n if (newNode == null) {\n items = items.filter(c => c !== node);\n }\n\n return {\n items: items.map(item => {\n if (item === node) {\n // newNode cannot be null here due to the above filter.\n return newNode!;\n }\n\n return item;\n }),\n nodeMap: map\n };\n }\n\n function addNode(node: TreeNode<T>, map: Map<Key, TreeNode<T>>) {\n map.set(node.key, node);\n if (node.children) {\n for (let child of node.children) {\n addNode(child, map);\n }\n }\n }\n\n function deleteNode(node: TreeNode<T>, map: Map<Key, TreeNode<T>>) {\n map.delete(node.key);\n if (node.children) {\n for (let child of node.children) {\n deleteNode(child, map);\n }\n }\n }\n return {\n items,\n selectedKeys,\n setSelectedKeys,\n getItem(key: Key) {\n return nodeMap.get(key);\n },\n insert(parentKey: Key \| null, index: number, ...values: T[]) {\n setItems(({items, nodeMap: originalMap}) => {\n let {items: newNodes, nodeMap: newMap} = buildTree(values, new Map(originalMap), parentKey);\n\n // If parentKey is null, insert into the root.\n if (parentKey == null) {\n return {\n items: [\n ...items.slice(0, index),\n ...newNodes,\n ...items.slice(index)\n ],\n nodeMap: newMap\n };\n }\n\n // Otherwise, update the parent node and its ancestors.\n return updateTree(items, parentKey, parentNode => ({\n key: parentNode.key,\n parentKey: parentNode.parentKey,\n value: parentNode.value,\n children: [\n ...parentNode.children!.slice(0, index),\n ...newNodes,\n ...parentNode.children!.slice(index)\n ]\n }), newMap);\n });\n },\n insertBefore(key: Key, ...values: T[]): void {\n let node = nodeMap.get(key);\n if (!node) {\n return;\n }\n\n let parentNode = nodeMap.get(node.parentKey!);\n let nodes = parentNode ? parentNode.children : items;\n let index = nodes!.indexOf(node);\n this.insert(parentNode?.key ?? null, index, ...values);\n },\n insertAfter(key: Key, ...values: T[]): void {\n let node = nodeMap.get(key);\n if (!node) {\n return;\n }\n\n let parentNode = nodeMap.get(node.parentKey!);\n let nodes = parentNode ? parentNode.children : items;\n let index = nodes!.indexOf(node);\n this.insert(parentNode?.key ?? null, index + 1, ...values);\n },\n prepend(parentKey: Key \| null, ...values: T[]) {\n this.insert(parentKey, 0, ...values);\n },\n append(parentKey: Key \| null, ...values: T[]) {\n if (parentKey == null) {\n this.insert(null, items.length, ...values);\n } else {\n let parentNode = nodeMap.get(parentKey);\n if (!parentNode) {\n return;\n }\n\n this.insert(parentKey, parentNode.children!.length, ...values);\n }\n },\n remove(...keys: Key[]) {\n if (keys.length === 0) {\n return;\n }\n\n let newItems = items;\n let prevMap = nodeMap;\n let newTree;\n for (let key of keys) {\n newTree = updateTree(newItems, key, () => null, prevMap);\n prevMap = newTree.nodeMap;\n newItems = newTree.items;\n }\n\n setItems(newTree);\n\n let selection = new Set(selectedKeys);\n for (let key of selectedKeys) {\n if (!newTree.nodeMap.has(key)) {\n selection.delete(key);\n }\n }\n\n setSelectedKeys(selection);\n },\n removeSelectedItems() {\n this.remove(...selectedKeys);\n },\n move(key: Key, toParentKey: Key \| null, index: number) {\n setItems(({items, nodeMap: originalMap}) => {\n let node = originalMap.get(key);\n if (!node) {\n return {items, nodeMap: originalMap};\n }\n\n let {items: newItems, nodeMap: newMap} = updateTree(items, key, () => null, originalMap);\n\n\n const movedNode = {\n ...node,\n parentKey: toParentKey\n };\n\n // If parentKey is null, insert into the root.\n if (toParentKey == null) {\n addNode(movedNode, newMap);\n return {items: [\n ...newItems.slice(0, index),\n movedNode,\n ...newItems.slice(index)\n ], nodeMap: newMap};\n }\n\n // Otherwise, update the parent node and its ancestors.\n return updateTree(newItems, toParentKey, parentNode => ({\n key: parentNode.key,\n parentKey: parentNode.parentKey,\n value: parentNode.value,\n children: [\n ...parentNode.children!.slice(0, index),\n movedNode,\n ...parentNode.children!.slice(index)\n ]\n }), newMap);\n });\n },\n moveBefore(key: Key, keys: Iterable<Key>) {\n setItems((prevState) => {\n let {items, nodeMap} = prevState;\n let node = nodeMap.get(key);\n if (!node) {\n return prevState;\n }\n let toParentKey = node.parentKey ?? null;\n let parent: null \| TreeNode<T> = null;\n if (toParentKey != null) {\n parent = nodeMap.get(toParentKey) ?? null;\n }\n let toIndex = parent?.children ? parent.children.indexOf(node) : items.indexOf(node);\n return moveItems(prevState, keys, parent, toIndex, updateTree, addNode);\n });\n },\n moveAfter(key: Key, keys: Iterable<Key>) {\n setItems((prevState) => {\n let {items, nodeMap} = prevState;\n let node = nodeMap.get(key);\n if (!node) {\n return prevState;\n }\n let toParentKey = node.parentKey ?? null;\n let parent: null \| TreeNode<T> = null;\n if (toParentKey != null) {\n parent = nodeMap.get(toParentKey) ?? null;\n }\n let toIndex = parent?.children ? parent.children.indexOf(node) : items.indexOf(node);\n toIndex++;\n return moveItems(prevState, keys, parent, toIndex, updateTree, addNode);\n });\n },\n update(oldKey: Key, newValue: T) {\n setItems(({items, nodeMap: originalMap}) => updateTree(items, oldKey, oldNode => {\n let node: TreeNode<T> = {\n key: oldNode.key,\n parentKey: oldNode.parentKey,\n value: newValue,\n children: null\n };\n\n let tree = buildTree(getChildren(newValue), originalMap, node.key);\n node.children = tree.items;\n return node;\n }, originalMap));\n }\n };\n}\n\nfunction moveItems<T extends object>(\n state: TreeDataState<T>,\n keys: Iterable<Key>,\n toParent: TreeNode<T> \| null,\n toIndex: number,\n updateTree: (\n items: TreeNode<T>[],\n key: Key \| null,\n update: (node: TreeNode<T>) => TreeNode<T> \| null,\n originalMap: Map<Key, TreeNode<T>>\n ) => TreeDataState<T>,\n addNode: (node: TreeNode<T>, map: Map<Key, TreeNode<T>>) => void\n): TreeDataState<T> {\n let {items, nodeMap} = state;\n\n let parent = toParent;\n let removeKeys = new Set(keys);\n while (parent?.parentKey != null) {\n if (removeKeys.has(parent.key)) {\n throw new Error('Cannot move an item to be a child of itself.');\n }\n parent = nodeMap.get(parent.parentKey!) ?? null;\n }\n\n let originalToIndex = toIndex;\n\n let keyArray = Array.isArray(keys) ? keys : [...keys];\n // depth first search to put keys in order\n let inOrderKeys: Map<Key, number> = new Map();\n let removedItems: Array<TreeNode<T>> = [];\n let newItems = items;\n let newMap = nodeMap;\n let i = 0;\n\n function traversal(node, {inorder, postorder}) {\n inorder?.(node);\n if (node != null) {\n for (let child of node.children ?? []) {\n traversal(child, {inorder, postorder});\n postorder?.(child);\n }\n }\n }\n\n function inorder(child) {\n // in-order so we add items as we encounter them in the tree, then we can insert them in expected order later\n if (keyArray.includes(child.key)) {\n inOrderKeys.set(child.key, i++);\n }\n }\n\n function postorder(child) {\n // remove items and update the tree from the leaves and work upwards toward the root, this way\n // we don't copy child node references from parents inadvertently\n if (keyArray.includes(child.key)) {\n removedItems.push({...newMap.get(child.key)!, parentKey: toParent?.key ?? null});\n let {items: nextItems, nodeMap: nextMap} = updateTree(newItems, child.key, () => null, newMap);\n newItems = nextItems;\n newMap = nextMap;\n }\n // decrement the index if the child being removed is in the target parent and before the target index\n // the root node is special, it is null, and will not have a key, however, a parentKey can still point to it\n if ((child.parentKey === toParent\n \|\| child.parentKey === toParent?.key)\n && keyArray.includes(child.key)\n && (toParent?.children ? toParent.children.indexOf(child) : items.indexOf(child)) < originalToIndex) {\n toIndex--;\n }\n }\n\n traversal({children: items}, {inorder, postorder});\n\n let inOrderItems = removedItems.sort((a, b) => inOrderKeys.get(a.key)! > inOrderKeys.get(b.key)! ? 1 : -1);\n // If parentKey is null, insert into the root.\n if (!toParent \|\| toParent.key == null) {\n inOrderItems.forEach(movedNode => {\n addNode(movedNode, newMap); \n });\n return {items: [\n ...newItems.slice(0, toIndex),\n ...inOrderItems,\n ...newItems.slice(toIndex)\n ], nodeMap: newMap};\n }\n\n // Otherwise, update the parent node and its ancestors.\n return updateTree(newItems, toParent.key, parentNode => ({\n key: parentNode.key,\n parentKey: parentNode.parentKey,\n value: parentNode.value,\n children: [\n ...parentNode.children!.slice(0, toIndex),\n ...inOrderItems,\n ...parentNode.children!.slice(toIndex)\n ]\n }), newMap);\n}\n"],"names":[],"version":3,"file":"useTreeData.js.map"}
1	+ {"mappings":";;AAAA;;;;;;;;;;CAUC;AA6IM,SAAS,0CAA8B,OAAuB;IACnE,IAAI,gBACF,eAAe,EAAE,uBACjB,mBAAmB,UACnB,SAAS,CAAC;YAAc;eAAA,CAAA,WAAA,KAAK,EAAE,cAAP,sBAAA,WAAW,KAAK,GAAG;oBAC3C,cAAc,CAAC,OAAc,KAAK,QAAQ,EAC3C,GAAG;IAEJ,kDAAkD;IAClD,IAAI,CAAC,MAAM,SAAS,GAAG,CAAA,GAAA,eAAO,EAAoB,IAAM,UAAU,cAAc,IAAI;IACpF,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;IAEvB,IAAI,CAAC,cAAc,gBAAgB,GAAG,CAAA,GAAA,eAAO,EAAE,IAAI,IAAS,uBAAuB,EAAE;IAErF,SAAS,UACP,eAA2B,EAAE,EAC7B,GAA0B,EAC1B,SAAsB;QAEtB,IAAI,gBAAgB,MAClB,eAAe,EAAE;QAEnB,OAAO;YACL,OAAO,aAAa,GAAG,CAAC,CAAA;gBACtB,IAAI,OAAoB;oBACtB,KAAK,OAAO;oBACZ,WAAW,sBAAA,uBAAA,YAAa;oBACxB,OAAO;oBACP,UAAU;gBACZ;gBAEA,KAAK,QAAQ,GAAG,UAAU,YAAY,OAAO,KAAK,KAAK,GAAG,EAAE,KAAK;gBACjE,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE;gBAClB,OAAO;YACT;YACA,SAAS;QACX;IACF;IAEA,SAAS,WACP,KAAoB,EACpB,GAAe,EACf,MAAiD,EACjD,WAAkC;QAElC,IAAI,OAAO,OAAO,OAAO,OAAO,YAAY,GAAG,CAAC;QAChD,IAAI,QAAQ,MACV,OAAO;mBAAC;YAAO,SAAS;QAAW;QAErC,IAAI,MAAM,IAAI,IAAsB;QAEpC,uEAAuE;QACvE,IAAI,UAAU,OAAO;QACrB,IAAI,WAAW,MACb,WAAW,MAAM;aAEjB,QAAQ,SAAS;QAGnB,wEAAwE;QACxE,MAAO,QAAQ,KAAK,SAAS,CAAE;YAC7B,IAAI,aAAa,IAAI,GAAG,CAAC,KAAK,SAAS;YACvC,IAAI,OAAoB;gBACtB,KAAK,WAAW,GAAG;gBACnB,WAAW,WAAW,SAAS;gBAC/B,OAAO,WAAW,KAAK;gBACvB,UAAU;YACZ;YAEA,IAAI,WAAW,WAAW,QAAQ;YAClC,IAAI,WAAW,QAAQ,UACrB,WAAW,SAAS,MAAM,CAAC,CAAA,IAAK,MAAM;gBAItC;YADF,KAAK,QAAQ,GACX,CAAA,gBAAA,qBAAA,+BAAA,SAAU,GAAG,CAAC,CAAA;gBACZ,IAAI,UAAU,MACZ,uDAAuD;gBACvD,OAAO;gBAGT,OAAO;YACT,gBAPA,2BAAA,gBAOM;YAER,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE;YAElB,UAAU;YACV,OAAO;QACT;QAEA,IAAI,WAAW,MACb,QAAQ,MAAM,MAAM,CAAC,CAAA,IAAK,MAAM;QAGlC,OAAO;YACL,OAAO,MAAM,GAAG,CAAC,CAAA;gBACf,IAAI,SAAS,MACX,uDAAuD;gBACvD,OAAO;gBAGT,OAAO;YACT;YACA,SAAS;QACX;IACF;IAEA,SAAS,QAAQ,IAAiB,EAAE,GAA0B;QAC5D,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE;QAClB,IAAI,KAAK,QAAQ,EACf,KAAK,IAAI,SAAS,KAAK,QAAQ,CAC7B,QAAQ,OAAO;IAGrB;IAEA,SAAS,WAAW,IAAiB,EAAE,GAA0B;QAC/D,IAAI,MAAM,CAAC,KAAK,GAAG;QACnB,IAAI,KAAK,QAAQ,EACf,KAAK,IAAI,SAAS,KAAK,QAAQ,CAC7B,WAAW,OAAO;IAGxB;IACA,OAAO;eACL;sBACA;yBACA;QACA,SAAQ,GAAQ;YACd,OAAO,QAAQ,GAAG,CAAC;QACrB;QACA,QAAO,SAAqB,EAAE,KAAa,EAAE,GAAG,MAAW;YACzD,SAAS,CAAC,SAAC,KAAK,EAAE,SAAS,WAAW,EAAC;gBACrC,IAAI,EAAC,OAAO,QAAQ,EAAE,SAAS,MAAM,EAAC,GAAG,UAAU,QAAQ,IAAI,IAAI,cAAc;gBAEjF,8CAA8C;gBAC9C,IAAI,aAAa,MACf,OAAO;oBACL,OAAO;2BAAI,MAAM,KAAK,CAAC,GAAG;2BAAW;2BAAa,MAAM,KAAK,CAAC;qBAAO;oBACrE,SAAS;gBACX;gBAGF,uDAAuD;gBACvD,OAAO,WACL,OACA,WACA,CAAA,aAAe,CAAA;wBACb,KAAK,WAAW,GAAG;wBACnB,WAAW,WAAW,SAAS;wBAC/B,OAAO,WAAW,KAAK;wBACvB,UAAU;+BACL,WAAW,QAAQ,CAAE,KAAK,CAAC,GAAG;+BAC9B;+BACA,WAAW,QAAQ,CAAE,KAAK,CAAC;yBAC/B;oBACH,CAAA,GACA;YAEJ;QACF;QACA,cAAa,GAAQ,EAAE,GAAG,MAAW;YACnC,IAAI,OAAO,QAAQ,GAAG,CAAC;YACvB,IAAI,CAAC,MACH;YAGF,IAAI,aAAa,QAAQ,GAAG,CAAC,KAAK,SAAS;YAC3C,IAAI,QAAQ,aAAa,WAAW,QAAQ,GAAG;YAC/C,IAAI,QAAQ,MAAO,OAAO,CAAC;gBACf;YAAZ,IAAI,CAAC,MAAM,CAAC,CAAA,kBAAA,uBAAA,iCAAA,WAAY,GAAG,cAAf,6BAAA,kBAAmB,MAAM,UAAU;QACjD;QACA,aAAY,GAAQ,EAAE,GAAG,MAAW;YAClC,IAAI,OAAO,QAAQ,GAAG,CAAC;YACvB,IAAI,CAAC,MACH;YAGF,IAAI,aAAa,QAAQ,GAAG,CAAC,KAAK,SAAS;YAC3C,IAAI,QAAQ,aAAa,WAAW,QAAQ,GAAG;YAC/C,IAAI,QAAQ,MAAO,OAAO,CAAC;gBACf;YAAZ,IAAI,CAAC,MAAM,CAAC,CAAA,kBAAA,uBAAA,iCAAA,WAAY,GAAG,cAAf,6BAAA,kBAAmB,MAAM,QAAQ,MAAM;QACrD;QACA,SAAQ,SAAqB,EAAE,GAAG,MAAW;YAC3C,IAAI,CAAC,MAAM,CAAC,WAAW,MAAM;QAC/B;QACA,QAAO,SAAqB,EAAE,GAAG,MAAW;YAC1C,IAAI,aAAa,MACf,IAAI,CAAC,MAAM,CAAC,MAAM,MAAM,MAAM,KAAK;iBAC9B;gBACL,IAAI,aAAa,QAAQ,GAAG,CAAC;gBAC7B,IAAI,CAAC,YACH;gBAGF,IAAI,CAAC,MAAM,CAAC,WAAW,WAAW,QAAQ,CAAE,MAAM,KAAK;YACzD;QACF;QACA,QAAO,GAAG,IAAW;YACnB,IAAI,KAAK,MAAM,KAAK,GAClB;YAGF,IAAI,WAAW;YACf,IAAI,UAAU;YACd,IAAI;YACJ,KAAK,IAAI,OAAO,KAAM;gBACpB,UAAU,WAAW,UAAU,KAAK,IAAM,MAAM;gBAChD,UAAU,QAAQ,OAAO;gBACzB,WAAW,QAAQ,KAAK;YAC1B;YAEA,SAAS;YAET,IAAI,YAAY,IAAI,IAAI;YACxB,KAAK,IAAI,OAAO,aACd,IAAI,CAAC,QAAQ,OAAO,CAAC,GAAG,CAAC,MACvB,UAAU,MAAM,CAAC;YAIrB,gBAAgB;QAClB;QACA;YACE,IAAI,CAAC,MAAM,IAAI;QACjB;QACA,MAAK,GAAQ,EAAE,WAAuB,EAAE,KAAa;YACnD,SAAS,CAAC,SAAC,KAAK,EAAE,SAAS,WAAW,EAAC;gBACrC,IAAI,OAAO,YAAY,GAAG,CAAC;gBAC3B,IAAI,CAAC,MACH,OAAO;2BAAC;oBAAO,SAAS;gBAAW;gBAGrC,IAAI,EAAC,OAAO,QAAQ,EAAE,SAAS,MAAM,EAAC,GAAG,WAAW,OAAO,KAAK,IAAM,MAAM;gBAE5E,MAAM,YAAY;oBAChB,GAAG,IAAI;oBACP,WAAW;gBACb;gBAEA,8CAA8C;gBAC9C,IAAI,eAAe,MAAM;oBACvB,QAAQ,WAAW;oBACnB,OAAO;wBACL,OAAO;+BAAI,SAAS,KAAK,CAAC,GAAG;4BAAQ;+BAAc,SAAS,KAAK,CAAC;yBAAO;wBACzE,SAAS;oBACX;gBACF;gBAEA,uDAAuD;gBACvD,OAAO,WACL,UACA,aACA,CAAA,aAAe,CAAA;wBACb,KAAK,WAAW,GAAG;wBACnB,WAAW,WAAW,SAAS;wBAC/B,OAAO,WAAW,KAAK;wBACvB,UAAU;+BACL,WAAW,QAAQ,CAAE,KAAK,CAAC,GAAG;4BACjC;+BACG,WAAW,QAAQ,CAAE,KAAK,CAAC;yBAC/B;oBACH,CAAA,GACA;YAEJ;QACF;QACA,YAAW,GAAQ,EAAE,IAAmB;YACtC,SAAS,CAAA;gBACP,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;gBACvB,IAAI,OAAO,QAAQ,GAAG,CAAC;gBACvB,IAAI,CAAC,MACH,OAAO;oBAES;gBAAlB,IAAI,cAAc,CAAA,kBAAA,KAAK,SAAS,cAAd,6BAAA,kBAAkB;gBACpC,IAAI,SAA6B;oBAEtB;gBADX,IAAI,eAAe,MACjB,SAAS,CAAA,eAAA,QAAQ,GAAG,CAAC,0BAAZ,0BAAA,eAA4B;gBAEvC,IAAI,UAAU,CAAA,mBAAA,6BAAA,OAAQ,QAAQ,IAAG,OAAO,QAAQ,CAAC,OAAO,CAAC,QAAQ,MAAM,OAAO,CAAC;gBAC/E,OAAO,gCAAU,WAAW,MAAM,QAAQ,SAAS,YAAY;YACjE;QACF;QACA,WAAU,GAAQ,EAAE,IAAmB;YACrC,SAAS,CAAA;gBACP,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;gBACvB,IAAI,OAAO,QAAQ,GAAG,CAAC;gBACvB,IAAI,CAAC,MACH,OAAO;oBAES;gBAAlB,IAAI,cAAc,CAAA,kBAAA,KAAK,SAAS,cAAd,6BAAA,kBAAkB;gBACpC,IAAI,SAA6B;oBAEtB;gBADX,IAAI,eAAe,MACjB,SAAS,CAAA,eAAA,QAAQ,GAAG,CAAC,0BAAZ,0BAAA,eAA4B;gBAEvC,IAAI,UAAU,CAAA,mBAAA,6BAAA,OAAQ,QAAQ,IAAG,OAAO,QAAQ,CAAC,OAAO,CAAC,QAAQ,MAAM,OAAO,CAAC;gBAC/E;gBACA,OAAO,gCAAU,WAAW,MAAM,QAAQ,SAAS,YAAY;YACjE;QACF;QACA,QAAO,MAAW,EAAE,QAAW;YAC7B,SAAS,CAAC,SAAC,KAAK,EAAE,SAAS,WAAW,EAAC,GACrC,WACE,OACA,QACA,CAAA;oBACE,IAAI,OAAoB;wBACtB,KAAK,QAAQ,GAAG;wBAChB,WAAW,QAAQ,SAAS;wBAC5B,OAAO;wBACP,UAAU;oBACZ;oBAEA,IAAI,OAAO,UAAU,YAAY,WAAW,aAAa,KAAK,GAAG;oBACjE,KAAK,QAAQ,GAAG,KAAK,KAAK;oBAC1B,OAAO;gBACT,GACA;QAGN;IACF;AACF;AAEA,SAAS,gCACP,KAAuB,EACvB,IAAmB,EACnB,QAA4B,EAC5B,OAAe,EACf,UAKqB,EACrB,OAAgE;IAEhE,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;IAEvB,IAAI,SAAS;IACb,IAAI,aAAa,IAAI,IAAI;IACzB,MAAO,CAAA,mBAAA,6BAAA,OAAQ,SAAS,KAAI,KAAM;QAChC,IAAI,WAAW,GAAG,CAAC,OAAO,GAAG,GAC3B,MAAM,IAAI,MAAM;YAET;QAAT,SAAS,CAAA,eAAA,QAAQ,GAAG,CAAC,OAAO,SAAS,eAA5B,0BAAA,eAAkC;IAC7C;IAEA,IAAI,kBAAkB;IAEtB,IAAI,WAAW,MAAM,OAAO,CAAC,QAAQ,OAAO;WAAI;KAAK;IACrD,0CAA0C;IAC1C,IAAI,cAAgC,IAAI;IACxC,IAAI,eAAmC,EAAE;IACzC,IAAI,WAAW;IACf,IAAI,SAAS;IACb,IAAI,IAAI;IAER,SAAS,UAAU,IAAI,EAAE,WAAC,OAAO,aAAE,SAAS,EAAC;QAC3C,oBAAA,8BAAA,QAAU;YAEU;QADpB,IAAI,QAAQ,MACV,KAAK,IAAI,SAAS,CAAA,iBAAA,KAAK,QAAQ,cAAb,4BAAA,iBAAiB,EAAE,CAAE;YACrC,UAAU,OAAO;yBAAC;2BAAS;YAAS;YACpC,sBAAA,gCAAA,UAAY;QACd;IAEJ;IAEA,SAAS,QAAQ,KAAK;QACpB,6GAA6G;QAC7G,IAAI,SAAS,QAAQ,CAAC,MAAM,GAAG,GAC7B,YAAY,GAAG,CAAC,MAAM,GAAG,EAAE;IAE/B;IAEA,SAAS,UAAU,KAAK;QACtB,8FAA8F;QAC9F,iEAAiE;QACjE,IAAI,SAAS,QAAQ,CAAC,MAAM,GAAG,GAAG;gBACyB;YAAzD,aAAa,IAAI,CAAC;gBAAC,GAAG,OAAO,GAAG,CAAC,MAAM,GAAG,CAAC;gBAAG,WAAW,CAAA,gBAAA,qBAAA,+BAAA,SAAU,GAAG,cAAb,2BAAA,gBAAiB;YAAI;YAC9E,IAAI,EAAC,OAAO,SAAS,EAAE,SAAS,OAAO,EAAC,GAAG,WACzC,UACA,MAAM,GAAG,EACT,IAAM,MACN;YAEF,WAAW;YACX,SAAS;QACX;QACA,qGAAqG;QACrG,4GAA4G;QAC5G,IACE,AAAC,CAAA,MAAM,SAAS,KAAK,YAAY,MAAM,SAAS,MAAK,qBAAA,+BAAA,SAAU,GAAG,CAAD,KACjE,SAAS,QAAQ,CAAC,MAAM,GAAG,KAC3B,AAAC,CAAA,CAAA,qBAAA,+BAAA,SAAU,QAAQ,IAAG,SAAS,QAAQ,CAAC,OAAO,CAAC,SAAS,MAAM,OAAO,CAAC,MAAK,IAC1E,iBAEF;IAEJ;IAEA,UAAU;QAAC,UAAU;IAAK,GAAG;iBAAC;mBAAS;IAAS;IAEhD,IAAI,eAAe,aAAa,IAAI,CAAC,CAAC,GAAG,IACvC,YAAY,GAAG,CAAC,EAAE,GAAG,IAAK,YAAY,GAAG,CAAC,EAAE,GAAG,IAAK,IAAI;IAE1D,8CAA8C;IAC9C,IAAI,CAAC,YAAY,SAAS,GAAG,IAAI,MAAM;QACrC,aAAa,OAAO,CAAC,CAAA;YACnB,QAAQ,WAAW;QACrB;QACA,OAAO;YACL,OAAO;mBAAI,SAAS,KAAK,CAAC,GAAG;mBAAa;mBAAiB,SAAS,KAAK,CAAC;aAAS;YACnF,SAAS;QACX;IACF;IAEA,uDAAuD;IACvD,OAAO,WACL,UACA,SAAS,GAAG,EACZ,CAAA,aAAe,CAAA;YACb,KAAK,WAAW,GAAG;YACnB,WAAW,WAAW,SAAS;YAC/B,OAAO,WAAW,KAAK;YACvB,UAAU;mBACL,WAAW,QAAQ,CAAE,KAAK,CAAC,GAAG;mBAC9B;mBACA,WAAW,QAAQ,CAAE,KAAK,CAAC;aAC/B;QACH,CAAA,GACA;AAEJ","sources":["packages/react-stately/src/data/useTreeData.ts"],"sourcesContent":["/\n Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n \n Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n /\n\nimport {Key} from '@react-types/shared';\nimport {useState} from 'react';\n\nexport interface TreeOptions<T extends object> {\n /* Initial root items in the tree. /\n initialItems?: T[];\n /* The keys for the initially selected items. /\n initialSelectedKeys?: Iterable<Key>;\n /* A function that returns a unique key for an item object. /\n getKey?: (item: T) => Key;\n /* A function that returns the children for an item object. /\n getChildren?: (item: T) => T[];\n}\n\ninterface TreeNode<T extends object> {\n /* A unique key for the tree node. /\n key: Key;\n /* The key of the parent node. /\n parentKey?: Key \| null;\n /* The value object for the tree node. /\n value: T;\n /* Children of the tree node. /\n children: TreeNode<T>[] \| null;\n}\n\nexport interface TreeData<T extends object> {\n /* The root nodes in the tree. /\n items: TreeNode<T>[];\n\n /* The keys of the currently selected items in the tree. /\n selectedKeys: Set<Key>;\n\n /* Sets the selected keys. /\n setSelectedKeys(keys: Set<Key>): void;\n\n /\n Gets a node from the tree by key.\n \n @param key - The key of the item to retrieve.\n /\n getItem(key: Key): TreeNode<T> \| undefined;\n\n /\n Inserts an item into a parent node as a child.\n \n @param parentKey - The key of the parent item to insert into. `null` for the root.\n * @param index - The index within the parent to insert into.\n * @param value - The value to insert.\n /\n insert(parentKey: Key \| null, index: number, ...values: T[]): void;\n\n /\n Inserts items into the list before the item at the given key.\n \n @param key - The key of the item to insert before.\n * @param values - The values to insert.\n /\n insertBefore(key: Key, ...values: T[]): void;\n\n /\n Inserts items into the list after the item at the given key.\n \n @param key - The key of the item to insert after.\n * @param values - The values to insert.\n /\n insertAfter(key: Key, ...values: T[]): void;\n\n /\n Appends an item into a parent node as a child.\n \n @param parentKey - The key of the parent item to insert into. `null` for the root.\n * @param value - The value to insert.\n /\n append(parentKey: Key \| null, ...values: T[]): void;\n\n /\n Prepends an item into a parent node as a child.\n \n @param parentKey - The key of the parent item to insert into. `null` for the root.\n * @param value - The value to insert.\n /\n prepend(parentKey: Key \| null, ...value: T[]): void;\n\n /\n Removes an item from the tree by its key.\n \n @param key - The key of the item to remove.\n /\n remove(...keys: Key[]): void;\n\n /\n Removes all items from the tree that are currently\n * in the set of selected items.\n /\n removeSelectedItems(): void;\n\n /\n Moves an item within the tree.\n \n @param key - The key of the item to move.\n * @param toParentKey - The key of the new parent to insert into. `null` for the root.\n * @param index - The index within the new parent to insert at.\n /\n move(key: Key, toParentKey: Key \| null, index: number): void;\n\n /\n Moves one or more items before a given key.\n \n @param key - The key of the item to move the items before.\n * @param keys - The keys of the items to move.\n /\n moveBefore(key: Key, keys: Iterable<Key>): void;\n\n /\n Moves one or more items after a given key.\n \n @param key - The key of the item to move the items after.\n * @param keys - The keys of the items to move.\n /\n moveAfter(key: Key, keys: Iterable<Key>): void;\n\n /\n Updates an item in the tree.\n \n @param key - The key of the item to update.\n * @param newValue - The new value for the item.\n /\n update(key: Key, newValue: T): void;\n}\n\ninterface TreeDataState<T extends object> {\n items: TreeNode<T>[];\n nodeMap: Map<Key, TreeNode<T>>;\n}\n\n/\n Manages state for an immutable tree data structure, and provides convenience methods to\n * update the data over time.\n */\nexport function useTreeData<T extends object>(options: TreeOptions<T>): TreeData<T> {\n let {\n initialItems = [],\n initialSelectedKeys,\n getKey = (item: any) => item.id ?? item.key,\n getChildren = (item: any) => item.children\n } = options;\n\n // We only want to compute this on initial render.\n let [tree, setItems] = useState<TreeDataState<T>>(() => buildTree(initialItems, new Map()));\n let {items, nodeMap} = tree;\n\n let [selectedKeys, setSelectedKeys] = useState(new Set<Key>(initialSelectedKeys \|\| []));\n\n function buildTree(\n initialItems: T[] \| null = [],\n map: Map<Key, TreeNode<T>>,\n parentKey?: Key \| null\n ) {\n if (initialItems == null) {\n initialItems = [];\n }\n return {\n items: initialItems.map(item => {\n let node: TreeNode<T> = {\n key: getKey(item),\n parentKey: parentKey ?? null,\n value: item,\n children: null\n };\n\n node.children = buildTree(getChildren(item), map, node.key).items;\n map.set(node.key, node);\n return node;\n }),\n nodeMap: map\n };\n }\n\n function updateTree(\n items: TreeNode<T>[],\n key: Key \| null,\n update: (node: TreeNode<T>) => TreeNode<T> \| null,\n originalMap: Map<Key, TreeNode<T>>\n ) {\n let node = key == null ? null : originalMap.get(key);\n if (node == null) {\n return {items, nodeMap: originalMap};\n }\n let map = new Map<Key, TreeNode<T>>(originalMap);\n\n // Create a new node. If null, then delete the node, otherwise replace.\n let newNode = update(node);\n if (newNode == null) {\n deleteNode(node, map);\n } else {\n addNode(newNode, map);\n }\n\n // Walk up the tree and update each parent to refer to the new children.\n while (node && node.parentKey) {\n let nextParent = map.get(node.parentKey)!;\n let copy: TreeNode<T> = {\n key: nextParent.key,\n parentKey: nextParent.parentKey,\n value: nextParent.value,\n children: null\n };\n\n let children = nextParent.children;\n if (newNode == null && children) {\n children = children.filter(c => c !== node);\n }\n\n copy.children =\n children?.map(child => {\n if (child === node) {\n // newNode cannot be null here due to the above filter.\n return newNode!;\n }\n\n return child;\n }) ?? null;\n\n map.set(copy.key, copy);\n\n newNode = copy;\n node = nextParent;\n }\n\n if (newNode == null) {\n items = items.filter(c => c !== node);\n }\n\n return {\n items: items.map(item => {\n if (item === node) {\n // newNode cannot be null here due to the above filter.\n return newNode!;\n }\n\n return item;\n }),\n nodeMap: map\n };\n }\n\n function addNode(node: TreeNode<T>, map: Map<Key, TreeNode<T>>) {\n map.set(node.key, node);\n if (node.children) {\n for (let child of node.children) {\n addNode(child, map);\n }\n }\n }\n\n function deleteNode(node: TreeNode<T>, map: Map<Key, TreeNode<T>>) {\n map.delete(node.key);\n if (node.children) {\n for (let child of node.children) {\n deleteNode(child, map);\n }\n }\n }\n return {\n items,\n selectedKeys,\n setSelectedKeys,\n getItem(key: Key) {\n return nodeMap.get(key);\n },\n insert(parentKey: Key \| null, index: number, ...values: T[]) {\n setItems(({items, nodeMap: originalMap}) => {\n let {items: newNodes, nodeMap: newMap} = buildTree(values, new Map(originalMap), parentKey);\n\n // If parentKey is null, insert into the root.\n if (parentKey == null) {\n return {\n items: [...items.slice(0, index), ...newNodes, ...items.slice(index)],\n nodeMap: newMap\n };\n }\n\n // Otherwise, update the parent node and its ancestors.\n return updateTree(\n items,\n parentKey,\n parentNode => ({\n key: parentNode.key,\n parentKey: parentNode.parentKey,\n value: parentNode.value,\n children: [\n ...parentNode.children!.slice(0, index),\n ...newNodes,\n ...parentNode.children!.slice(index)\n ]\n }),\n newMap\n );\n });\n },\n insertBefore(key: Key, ...values: T[]): void {\n let node = nodeMap.get(key);\n if (!node) {\n return;\n }\n\n let parentNode = nodeMap.get(node.parentKey!);\n let nodes = parentNode ? parentNode.children : items;\n let index = nodes!.indexOf(node);\n this.insert(parentNode?.key ?? null, index, ...values);\n },\n insertAfter(key: Key, ...values: T[]): void {\n let node = nodeMap.get(key);\n if (!node) {\n return;\n }\n\n let parentNode = nodeMap.get(node.parentKey!);\n let nodes = parentNode ? parentNode.children : items;\n let index = nodes!.indexOf(node);\n this.insert(parentNode?.key ?? null, index + 1, ...values);\n },\n prepend(parentKey: Key \| null, ...values: T[]) {\n this.insert(parentKey, 0, ...values);\n },\n append(parentKey: Key \| null, ...values: T[]) {\n if (parentKey == null) {\n this.insert(null, items.length, ...values);\n } else {\n let parentNode = nodeMap.get(parentKey);\n if (!parentNode) {\n return;\n }\n\n this.insert(parentKey, parentNode.children!.length, ...values);\n }\n },\n remove(...keys: Key[]) {\n if (keys.length === 0) {\n return;\n }\n\n let newItems = items;\n let prevMap = nodeMap;\n let newTree;\n for (let key of keys) {\n newTree = updateTree(newItems, key, () => null, prevMap);\n prevMap = newTree.nodeMap;\n newItems = newTree.items;\n }\n\n setItems(newTree);\n\n let selection = new Set(selectedKeys);\n for (let key of selectedKeys) {\n if (!newTree.nodeMap.has(key)) {\n selection.delete(key);\n }\n }\n\n setSelectedKeys(selection);\n },\n removeSelectedItems() {\n this.remove(...selectedKeys);\n },\n move(key: Key, toParentKey: Key \| null, index: number) {\n setItems(({items, nodeMap: originalMap}) => {\n let node = originalMap.get(key);\n if (!node) {\n return {items, nodeMap: originalMap};\n }\n\n let {items: newItems, nodeMap: newMap} = updateTree(items, key, () => null, originalMap);\n\n const movedNode = {\n ...node,\n parentKey: toParentKey\n };\n\n // If parentKey is null, insert into the root.\n if (toParentKey == null) {\n addNode(movedNode, newMap);\n return {\n items: [...newItems.slice(0, index), movedNode, ...newItems.slice(index)],\n nodeMap: newMap\n };\n }\n\n // Otherwise, update the parent node and its ancestors.\n return updateTree(\n newItems,\n toParentKey,\n parentNode => ({\n key: parentNode.key,\n parentKey: parentNode.parentKey,\n value: parentNode.value,\n children: [\n ...parentNode.children!.slice(0, index),\n movedNode,\n ...parentNode.children!.slice(index)\n ]\n }),\n newMap\n );\n });\n },\n moveBefore(key: Key, keys: Iterable<Key>) {\n setItems(prevState => {\n let {items, nodeMap} = prevState;\n let node = nodeMap.get(key);\n if (!node) {\n return prevState;\n }\n let toParentKey = node.parentKey ?? null;\n let parent: null \| TreeNode<T> = null;\n if (toParentKey != null) {\n parent = nodeMap.get(toParentKey) ?? null;\n }\n let toIndex = parent?.children ? parent.children.indexOf(node) : items.indexOf(node);\n return moveItems(prevState, keys, parent, toIndex, updateTree, addNode);\n });\n },\n moveAfter(key: Key, keys: Iterable<Key>) {\n setItems(prevState => {\n let {items, nodeMap} = prevState;\n let node = nodeMap.get(key);\n if (!node) {\n return prevState;\n }\n let toParentKey = node.parentKey ?? null;\n let parent: null \| TreeNode<T> = null;\n if (toParentKey != null) {\n parent = nodeMap.get(toParentKey) ?? null;\n }\n let toIndex = parent?.children ? parent.children.indexOf(node) : items.indexOf(node);\n toIndex++;\n return moveItems(prevState, keys, parent, toIndex, updateTree, addNode);\n });\n },\n update(oldKey: Key, newValue: T) {\n setItems(({items, nodeMap: originalMap}) =>\n updateTree(\n items,\n oldKey,\n oldNode => {\n let node: TreeNode<T> = {\n key: oldNode.key,\n parentKey: oldNode.parentKey,\n value: newValue,\n children: null\n };\n\n let tree = buildTree(getChildren(newValue), originalMap, node.key);\n node.children = tree.items;\n return node;\n },\n originalMap\n )\n );\n }\n };\n}\n\nfunction moveItems<T extends object>(\n state: TreeDataState<T>,\n keys: Iterable<Key>,\n toParent: TreeNode<T> \| null,\n toIndex: number,\n updateTree: (\n items: TreeNode<T>[],\n key: Key \| null,\n update: (node: TreeNode<T>) => TreeNode<T> \| null,\n originalMap: Map<Key, TreeNode<T>>\n ) => TreeDataState<T>,\n addNode: (node: TreeNode<T>, map: Map<Key, TreeNode<T>>) => void\n): TreeDataState<T> {\n let {items, nodeMap} = state;\n\n let parent = toParent;\n let removeKeys = new Set(keys);\n while (parent?.parentKey != null) {\n if (removeKeys.has(parent.key)) {\n throw new Error('Cannot move an item to be a child of itself.');\n }\n parent = nodeMap.get(parent.parentKey!) ?? null;\n }\n\n let originalToIndex = toIndex;\n\n let keyArray = Array.isArray(keys) ? keys : [...keys];\n // depth first search to put keys in order\n let inOrderKeys: Map<Key, number> = new Map();\n let removedItems: Array<TreeNode<T>> = [];\n let newItems = items;\n let newMap = nodeMap;\n let i = 0;\n\n function traversal(node, {inorder, postorder}) {\n inorder?.(node);\n if (node != null) {\n for (let child of node.children ?? []) {\n traversal(child, {inorder, postorder});\n postorder?.(child);\n }\n }\n }\n\n function inorder(child) {\n // in-order so we add items as we encounter them in the tree, then we can insert them in expected order later\n if (keyArray.includes(child.key)) {\n inOrderKeys.set(child.key, i++);\n }\n }\n\n function postorder(child) {\n // remove items and update the tree from the leaves and work upwards toward the root, this way\n // we don't copy child node references from parents inadvertently\n if (keyArray.includes(child.key)) {\n removedItems.push({...newMap.get(child.key)!, parentKey: toParent?.key ?? null});\n let {items: nextItems, nodeMap: nextMap} = updateTree(\n newItems,\n child.key,\n () => null,\n newMap\n );\n newItems = nextItems;\n newMap = nextMap;\n }\n // decrement the index if the child being removed is in the target parent and before the target index\n // the root node is special, it is null, and will not have a key, however, a parentKey can still point to it\n if (\n (child.parentKey === toParent \|\| child.parentKey === toParent?.key) &&\n keyArray.includes(child.key) &&\n (toParent?.children ? toParent.children.indexOf(child) : items.indexOf(child)) <\n originalToIndex\n ) {\n toIndex--;\n }\n }\n\n traversal({children: items}, {inorder, postorder});\n\n let inOrderItems = removedItems.sort((a, b) =>\n inOrderKeys.get(a.key)! > inOrderKeys.get(b.key)! ? 1 : -1\n );\n // If parentKey is null, insert into the root.\n if (!toParent \|\| toParent.key == null) {\n inOrderItems.forEach(movedNode => {\n addNode(movedNode, newMap);\n });\n return {\n items: [...newItems.slice(0, toIndex), ...inOrderItems, ...newItems.slice(toIndex)],\n nodeMap: newMap\n };\n }\n\n // Otherwise, update the parent node and its ancestors.\n return updateTree(\n newItems,\n toParent.key,\n parentNode => ({\n key: parentNode.key,\n parentKey: parentNode.parentKey,\n value: parentNode.value,\n children: [\n ...parentNode.children!.slice(0, toIndex),\n ...inOrderItems,\n ...parentNode.children!.slice(toIndex)\n ]\n }),\n newMap\n );\n}\n"],"names":[],"version":3,"file":"useTreeData.js.map"}

package/dist/private/data/useTreeData.mjs.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"mappings":";;AAAA;;;;;;;;;;CAUC;AAkIM,SAAS,0CAA8B,OAAuB;IACnE,IAAI,gBACF,eAAe,EAAE,uBACjB,mBAAmB,UACnB,SAAS,CAAC,OAAc,KAAK,EAAE,IAAI,KAAK,GAAG,eAC3C,cAAc,CAAC,OAAc,KAAK,QAAQ,EAC3C,GAAG;IAEJ,kDAAkD;IAClD,IAAI,CAAC,MAAM,SAAS,GAAG,CAAA,GAAA,eAAO,EAAoB,IAAM,UAAU,cAAc,IAAI;IACpF,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;IAEvB,IAAI,CAAC,cAAc,gBAAgB,GAAG,CAAA,GAAA,eAAO,EAAE,IAAI,IAAS,uBAAuB,EAAE;IAErF,SAAS,UAAU,eAA2B,EAAE,EAAE,GAA0B,EAAE,SAAsB;QAClG,IAAI,gBAAgB,MAClB,eAAe,EAAE;QAEnB,OAAO;YACL,OAAO,aAAa,GAAG,CAAC,CAAA;gBACtB,IAAI,OAAoB;oBACtB,KAAK,OAAO;oBACZ,WAAW,aAAa;oBACxB,OAAO;oBACP,UAAU;gBACZ;gBAEA,KAAK,QAAQ,GAAG,UAAU,YAAY,OAAO,KAAK,KAAK,GAAG,EAAE,KAAK;gBACjE,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE;gBAClB,OAAO;YACT;YACA,SAAS;QACX;IACF;IAEA,SAAS,WAAW,KAAoB,EAAE,GAAe,EAAE,MAAiD,EAAE,WAAkC;QAC9I,IAAI,OAAO,OAAO,OAAO,OAAO,YAAY,GAAG,CAAC;QAChD,IAAI,QAAQ,MACV,OAAO;mBAAC;YAAO,SAAS;QAAW;QAErC,IAAI,MAAM,IAAI,IAAsB;QAEpC,uEAAuE;QACvE,IAAI,UAAU,OAAO;QACrB,IAAI,WAAW,MACb,WAAW,MAAM;aAEjB,QAAQ,SAAS;QAGnB,wEAAwE;QACxE,MAAO,QAAQ,KAAK,SAAS,CAAE;YAC7B,IAAI,aAAa,IAAI,GAAG,CAAC,KAAK,SAAS;YACvC,IAAI,OAAoB;gBACtB,KAAK,WAAW,GAAG;gBACnB,WAAW,WAAW,SAAS;gBAC/B,OAAO,WAAW,KAAK;gBACvB,UAAU;YACZ;YAEA,IAAI,WAAW,WAAW,QAAQ;YAClC,IAAI,WAAW,QAAQ,UACrB,WAAW,SAAS,MAAM,CAAC,CAAA,IAAK,MAAM;YAGxC,KAAK,QAAQ,GAAG,UAAU,IAAI,CAAA;gBAC5B,IAAI,UAAU,MACZ,uDAAuD;gBACvD,OAAO;gBAGT,OAAO;YACT,MAAM;YAEN,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE;YAElB,UAAU;YACV,OAAO;QACT;QAEA,IAAI,WAAW,MACb,QAAQ,MAAM,MAAM,CAAC,CAAA,IAAK,MAAM;QAGlC,OAAO;YACL,OAAO,MAAM,GAAG,CAAC,CAAA;gBACf,IAAI,SAAS,MACX,uDAAuD;gBACvD,OAAO;gBAGT,OAAO;YACT;YACA,SAAS;QACX;IACF;IAEA,SAAS,QAAQ,IAAiB,EAAE,GAA0B;QAC5D,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE;QAClB,IAAI,KAAK,QAAQ,EACf,KAAK,IAAI,SAAS,KAAK,QAAQ,CAC7B,QAAQ,OAAO;IAGrB;IAEA,SAAS,WAAW,IAAiB,EAAE,GAA0B;QAC/D,IAAI,MAAM,CAAC,KAAK,GAAG;QACnB,IAAI,KAAK,QAAQ,EACf,KAAK,IAAI,SAAS,KAAK,QAAQ,CAC7B,WAAW,OAAO;IAGxB;IACA,OAAO;eACL;sBACA;yBACA;QACA,SAAQ,GAAQ;YACd,OAAO,QAAQ,GAAG,CAAC;QACrB;QACA,QAAO,SAAqB,EAAE,KAAa,EAAE,GAAG,MAAW;YACzD,SAAS,CAAC,SAAC,KAAK,EAAE,SAAS,WAAW,EAAC;gBACrC,IAAI,EAAC,OAAO,QAAQ,EAAE,SAAS,MAAM,EAAC,GAAG,UAAU,QAAQ,IAAI,IAAI,cAAc;gBAEjF,8CAA8C;gBAC9C,IAAI,aAAa,MACf,OAAO;oBACL,OAAO;2BACF,MAAM,KAAK,CAAC,GAAG;2BACf;2BACA,MAAM,KAAK,CAAC;qBAChB;oBACD,SAAS;gBACX;gBAGF,uDAAuD;gBACvD,OAAO,WAAW,OAAO,WAAW,CAAA,aAAe,CAAA;wBACjD,KAAK,WAAW,GAAG;wBACnB,WAAW,WAAW,SAAS;wBAC/B,OAAO,WAAW,KAAK;wBACvB,UAAU;+BACL,WAAW,QAAQ,CAAE,KAAK,CAAC,GAAG;+BAC9B;+BACA,WAAW,QAAQ,CAAE,KAAK,CAAC;yBAC/B;oBACH,CAAA,GAAI;YACN;QACF;QACA,cAAa,GAAQ,EAAE,GAAG,MAAW;YACnC,IAAI,OAAO,QAAQ,GAAG,CAAC;YACvB,IAAI,CAAC,MACH;YAGF,IAAI,aAAa,QAAQ,GAAG,CAAC,KAAK,SAAS;YAC3C,IAAI,QAAQ,aAAa,WAAW,QAAQ,GAAG;YAC/C,IAAI,QAAQ,MAAO,OAAO,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,YAAY,OAAO,MAAM,UAAU;QACjD;QACA,aAAY,GAAQ,EAAE,GAAG,MAAW;YAClC,IAAI,OAAO,QAAQ,GAAG,CAAC;YACvB,IAAI,CAAC,MACH;YAGF,IAAI,aAAa,QAAQ,GAAG,CAAC,KAAK,SAAS;YAC3C,IAAI,QAAQ,aAAa,WAAW,QAAQ,GAAG;YAC/C,IAAI,QAAQ,MAAO,OAAO,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,YAAY,OAAO,MAAM,QAAQ,MAAM;QACrD;QACA,SAAQ,SAAqB,EAAE,GAAG,MAAW;YAC3C,IAAI,CAAC,MAAM,CAAC,WAAW,MAAM;QAC/B;QACA,QAAO,SAAqB,EAAE,GAAG,MAAW;YAC1C,IAAI,aAAa,MACf,IAAI,CAAC,MAAM,CAAC,MAAM,MAAM,MAAM,KAAK;iBAC9B;gBACL,IAAI,aAAa,QAAQ,GAAG,CAAC;gBAC7B,IAAI,CAAC,YACH;gBAGF,IAAI,CAAC,MAAM,CAAC,WAAW,WAAW,QAAQ,CAAE,MAAM,KAAK;YACzD;QACF;QACA,QAAO,GAAG,IAAW;YACnB,IAAI,KAAK,MAAM,KAAK,GAClB;YAGF,IAAI,WAAW;YACf,IAAI,UAAU;YACd,IAAI;YACJ,KAAK,IAAI,OAAO,KAAM;gBACpB,UAAU,WAAW,UAAU,KAAK,IAAM,MAAM;gBAChD,UAAU,QAAQ,OAAO;gBACzB,WAAW,QAAQ,KAAK;YAC1B;YAEA,SAAS;YAET,IAAI,YAAY,IAAI,IAAI;YACxB,KAAK,IAAI,OAAO,aACd,IAAI,CAAC,QAAQ,OAAO,CAAC,GAAG,CAAC,MACvB,UAAU,MAAM,CAAC;YAIrB,gBAAgB;QAClB;QACA;YACE,IAAI,CAAC,MAAM,IAAI;QACjB;QACA,MAAK,GAAQ,EAAE,WAAuB,EAAE,KAAa;YACnD,SAAS,CAAC,SAAC,KAAK,EAAE,SAAS,WAAW,EAAC;gBACrC,IAAI,OAAO,YAAY,GAAG,CAAC;gBAC3B,IAAI,CAAC,MACH,OAAO;2BAAC;oBAAO,SAAS;gBAAW;gBAGrC,IAAI,EAAC,OAAO,QAAQ,EAAE,SAAS,MAAM,EAAC,GAAG,WAAW,OAAO,KAAK,IAAM,MAAM;gBAG5E,MAAM,YAAY;oBAChB,GAAG,IAAI;oBACP,WAAW;gBACb;gBAEA,8CAA8C;gBAC9C,IAAI,eAAe,MAAM;oBACvB,QAAQ,WAAW;oBACnB,OAAO;wBAAC,OAAO;+BACV,SAAS,KAAK,CAAC,GAAG;4BACrB;+BACG,SAAS,KAAK,CAAC;yBACnB;wBAAE,SAAS;oBAAM;gBACpB;gBAEA,uDAAuD;gBACvD,OAAO,WAAW,UAAU,aAAa,CAAA,aAAe,CAAA;wBACtD,KAAK,WAAW,GAAG;wBACnB,WAAW,WAAW,SAAS;wBAC/B,OAAO,WAAW,KAAK;wBACvB,UAAU;+BACL,WAAW,QAAQ,CAAE,KAAK,CAAC,GAAG;4BACjC;+BACG,WAAW,QAAQ,CAAE,KAAK,CAAC;yBAC/B;oBACH,CAAA,GAAI;YACN;QACF;QACA,YAAW,GAAQ,EAAE,IAAmB;YACtC,SAAS,CAAC;gBACR,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;gBACvB,IAAI,OAAO,QAAQ,GAAG,CAAC;gBACvB,IAAI,CAAC,MACH,OAAO;gBAET,IAAI,cAAc,KAAK,SAAS,IAAI;gBACpC,IAAI,SAA6B;gBACjC,IAAI,eAAe,MACjB,SAAS,QAAQ,GAAG,CAAC,gBAAgB;gBAEvC,IAAI,UAAU,QAAQ,WAAW,OAAO,QAAQ,CAAC,OAAO,CAAC,QAAQ,MAAM,OAAO,CAAC;gBAC/E,OAAO,gCAAU,WAAW,MAAM,QAAQ,SAAS,YAAY;YACjE;QACF;QACA,WAAU,GAAQ,EAAE,IAAmB;YACrC,SAAS,CAAC;gBACR,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;gBACvB,IAAI,OAAO,QAAQ,GAAG,CAAC;gBACvB,IAAI,CAAC,MACH,OAAO;gBAET,IAAI,cAAc,KAAK,SAAS,IAAI;gBACpC,IAAI,SAA6B;gBACjC,IAAI,eAAe,MACjB,SAAS,QAAQ,GAAG,CAAC,gBAAgB;gBAEvC,IAAI,UAAU,QAAQ,WAAW,OAAO,QAAQ,CAAC,OAAO,CAAC,QAAQ,MAAM,OAAO,CAAC;gBAC/E;gBACA,OAAO,gCAAU,WAAW,MAAM,QAAQ,SAAS,YAAY;YACjE;QACF;QACA,QAAO,MAAW,EAAE,QAAW;YAC7B,SAAS,CAAC,SAAC,KAAK,EAAE,SAAS,WAAW,EAAC,GAAK,WAAW,OAAO,QAAQ,CAAA;oBACpE,IAAI,OAAoB;wBACtB,KAAK,QAAQ,GAAG;wBAChB,WAAW,QAAQ,SAAS;wBAC5B,OAAO;wBACP,UAAU;oBACZ;oBAEA,IAAI,OAAO,UAAU,YAAY,WAAW,aAAa,KAAK,GAAG;oBACjE,KAAK,QAAQ,GAAG,KAAK,KAAK;oBAC1B,OAAO;gBACT,GAAG;QACL;IACF;AACF;AAEA,SAAS,gCACP,KAAuB,EACvB,IAAmB,EACnB,QAA4B,EAC5B,OAAe,EACf,UAKqB,EACrB,OAAgE;IAEhE,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;IAEvB,IAAI,SAAS;IACb,IAAI,aAAa,IAAI,IAAI;IACzB,MAAO,QAAQ,aAAa,KAAM;QAChC,IAAI,WAAW,GAAG,CAAC,OAAO,GAAG,GAC3B,MAAM,IAAI,MAAM;QAElB,SAAS,QAAQ,GAAG,CAAC,OAAO,SAAS,KAAM;IAC7C;IAEA,IAAI,kBAAkB;IAEtB,IAAI,WAAW,MAAM,OAAO,CAAC,QAAQ,OAAO;WAAI;KAAK;IACrD,0CAA0C;IAC1C,IAAI,cAAgC,IAAI;IACxC,IAAI,eAAmC,EAAE;IACzC,IAAI,WAAW;IACf,IAAI,SAAS;IACb,IAAI,IAAI;IAER,SAAS,UAAU,IAAI,EAAE,WAAC,OAAO,aAAE,SAAS,EAAC;QAC3C,UAAU;QACV,IAAI,QAAQ,MACV,KAAK,IAAI,SAAS,KAAK,QAAQ,IAAI,EAAE,CAAE;YACrC,UAAU,OAAO;yBAAC;2BAAS;YAAS;YACpC,YAAY;QACd;IAEJ;IAEA,SAAS,QAAQ,KAAK;QACpB,6GAA6G;QAC7G,IAAI,SAAS,QAAQ,CAAC,MAAM,GAAG,GAC7B,YAAY,GAAG,CAAC,MAAM,GAAG,EAAE;IAE/B;IAEA,SAAS,UAAU,KAAK;QACtB,8FAA8F;QAC9F,iEAAiE;QACjE,IAAI,SAAS,QAAQ,CAAC,MAAM,GAAG,GAAG;YAChC,aAAa,IAAI,CAAC;gBAAC,GAAG,OAAO,GAAG,CAAC,MAAM,GAAG,CAAC;gBAAG,WAAW,UAAU,OAAO;YAAI;YAC9E,IAAI,EAAC,OAAO,SAAS,EAAE,SAAS,OAAO,EAAC,GAAG,WAAW,UAAU,MAAM,GAAG,EAAE,IAAM,MAAM;YACvF,WAAW;YACX,SAAS;QACX;QACA,qGAAqG;QACrG,4GAA4G;QAC5G,IAAI,AAAC,CAAA,MAAM,SAAS,KAAK,YACpB,MAAM,SAAS,KAAK,UAAU,GAAE,KAChC,SAAS,QAAQ,CAAC,MAAM,GAAG,KAC3B,AAAC,CAAA,UAAU,WAAW,SAAS,QAAQ,CAAC,OAAO,CAAC,SAAS,MAAM,OAAO,CAAC,MAAK,IAAK,iBACpF;IAEJ;IAEA,UAAU;QAAC,UAAU;IAAK,GAAG;iBAAC;mBAAS;IAAS;IAEhD,IAAI,eAAe,aAAa,IAAI,CAAC,CAAC,GAAG,IAAM,YAAY,GAAG,CAAC,EAAE,GAAG,IAAK,YAAY,GAAG,CAAC,EAAE,GAAG,IAAK,IAAI;IACvG,8CAA8C;IAC9C,IAAI,CAAC,YAAY,SAAS,GAAG,IAAI,MAAM;QACrC,aAAa,OAAO,CAAC,CAAA;YACnB,QAAQ,WAAW;QACrB;QACA,OAAO;YAAC,OAAO;mBACV,SAAS,KAAK,CAAC,GAAG;mBAClB;mBACA,SAAS,KAAK,CAAC;aACnB;YAAE,SAAS;QAAM;IACpB;IAEA,uDAAuD;IACvD,OAAO,WAAW,UAAU,SAAS,GAAG,EAAE,CAAA,aAAe,CAAA;YACvD,KAAK,WAAW,GAAG;YACnB,WAAW,WAAW,SAAS;YAC/B,OAAO,WAAW,KAAK;YACvB,UAAU;mBACL,WAAW,QAAQ,CAAE,KAAK,CAAC,GAAG;mBAC9B;mBACA,WAAW,QAAQ,CAAE,KAAK,CAAC;aAC/B;QACH,CAAA,GAAI;AACN","sources":["packages/react-stately/src/data/useTreeData.ts"],"sourcesContent":["/\n Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n \n Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n /\n\nimport {Key} from '@react-types/shared';\nimport {useState} from 'react';\n\nexport interface TreeOptions<T extends object> {\n /* Initial root items in the tree. /\n initialItems?: T[],\n /* The keys for the initially selected items. /\n initialSelectedKeys?: Iterable<Key>,\n /* A function that returns a unique key for an item object. /\n getKey?: (item: T) => Key,\n /* A function that returns the children for an item object. /\n getChildren?: (item: T) => T[]\n}\n\ninterface TreeNode<T extends object> {\n /* A unique key for the tree node. /\n key: Key,\n /* The key of the parent node. /\n parentKey?: Key \| null,\n /* The value object for the tree node. /\n value: T,\n /* Children of the tree node. /\n children: TreeNode<T>[] \| null\n}\n\nexport interface TreeData<T extends object> {\n /* The root nodes in the tree. /\n items: TreeNode<T>[],\n\n /* The keys of the currently selected items in the tree. /\n selectedKeys: Set<Key>,\n\n /* Sets the selected keys. /\n setSelectedKeys(keys: Set<Key>): void,\n\n /\n Gets a node from the tree by key.\n * @param key - The key of the item to retrieve.\n /\n getItem(key: Key): TreeNode<T> \| undefined,\n\n /\n Inserts an item into a parent node as a child.\n * @param parentKey - The key of the parent item to insert into. `null` for the root.\n * @param index - The index within the parent to insert into.\n * @param value - The value to insert.\n /\n insert(parentKey: Key \| null, index: number, ...values: T[]): void,\n\n /\n Inserts items into the list before the item at the given key.\n * @param key - The key of the item to insert before.\n * @param values - The values to insert.\n /\n insertBefore(key: Key, ...values: T[]): void,\n\n /\n Inserts items into the list after the item at the given key.\n * @param key - The key of the item to insert after.\n * @param values - The values to insert.\n /\n insertAfter(key: Key, ...values: T[]): void,\n\n /\n Appends an item into a parent node as a child.\n * @param parentKey - The key of the parent item to insert into. `null` for the root.\n * @param value - The value to insert.\n /\n append(parentKey: Key \| null, ...values: T[]): void,\n\n /\n Prepends an item into a parent node as a child.\n * @param parentKey - The key of the parent item to insert into. `null` for the root.\n * @param value - The value to insert.\n /\n prepend(parentKey: Key \| null, ...value: T[]): void,\n\n /\n Removes an item from the tree by its key.\n * @param key - The key of the item to remove.\n /\n remove(...keys: Key[]): void,\n\n /\n Removes all items from the tree that are currently\n * in the set of selected items.\n /\n removeSelectedItems(): void,\n\n /\n Moves an item within the tree.\n * @param key - The key of the item to move.\n * @param toParentKey - The key of the new parent to insert into. `null` for the root.\n * @param index - The index within the new parent to insert at.\n /\n move(key: Key, toParentKey: Key \| null, index: number): void,\n\n /\n Moves one or more items before a given key.\n * @param key - The key of the item to move the items before.\n * @param keys - The keys of the items to move.\n /\n moveBefore(key: Key, keys: Iterable<Key>): void,\n\n /\n Moves one or more items after a given key.\n * @param key - The key of the item to move the items after.\n * @param keys - The keys of the items to move.\n /\n moveAfter(key: Key, keys: Iterable<Key>): void,\n\n /\n Updates an item in the tree.\n * @param key - The key of the item to update.\n * @param newValue - The new value for the item.\n /\n update(key: Key, newValue: T): void\n}\n\ninterface TreeDataState<T extends object> {\n items: TreeNode<T>[],\n nodeMap: Map<Key, TreeNode<T>>\n}\n\n/\n Manages state for an immutable tree data structure, and provides convenience methods to\n * update the data over time.\n */\nexport function useTreeData<T extends object>(options: TreeOptions<T>): TreeData<T> {\n let {\n initialItems = [],\n initialSelectedKeys,\n getKey = (item: any) => item.id ?? item.key,\n getChildren = (item: any) => item.children\n } = options;\n\n // We only want to compute this on initial render.\n let [tree, setItems] = useState<TreeDataState<T>>(() => buildTree(initialItems, new Map()));\n let {items, nodeMap} = tree;\n\n let [selectedKeys, setSelectedKeys] = useState(new Set<Key>(initialSelectedKeys \|\| []));\n\n function buildTree(initialItems: T[] \| null = [], map: Map<Key, TreeNode<T>>, parentKey?: Key \| null) {\n if (initialItems == null) {\n initialItems = [];\n }\n return {\n items: initialItems.map(item => {\n let node: TreeNode<T> = {\n key: getKey(item),\n parentKey: parentKey ?? null,\n value: item,\n children: null\n };\n\n node.children = buildTree(getChildren(item), map, node.key).items;\n map.set(node.key, node);\n return node;\n }),\n nodeMap: map\n };\n }\n\n function updateTree(items: TreeNode<T>[], key: Key \| null, update: (node: TreeNode<T>) => TreeNode<T> \| null, originalMap: Map<Key, TreeNode<T>>) {\n let node = key == null ? null : originalMap.get(key);\n if (node == null) {\n return {items, nodeMap: originalMap};\n }\n let map = new Map<Key, TreeNode<T>>(originalMap);\n\n // Create a new node. If null, then delete the node, otherwise replace.\n let newNode = update(node);\n if (newNode == null) {\n deleteNode(node, map);\n } else {\n addNode(newNode, map);\n }\n\n // Walk up the tree and update each parent to refer to the new children.\n while (node && node.parentKey) {\n let nextParent = map.get(node.parentKey)!;\n let copy: TreeNode<T> = {\n key: nextParent.key,\n parentKey: nextParent.parentKey,\n value: nextParent.value,\n children: null\n };\n\n let children = nextParent.children;\n if (newNode == null && children) {\n children = children.filter(c => c !== node);\n }\n\n copy.children = children?.map(child => {\n if (child === node) {\n // newNode cannot be null here due to the above filter.\n return newNode!;\n }\n\n return child;\n }) ?? null;\n\n map.set(copy.key, copy);\n\n newNode = copy;\n node = nextParent;\n }\n\n if (newNode == null) {\n items = items.filter(c => c !== node);\n }\n\n return {\n items: items.map(item => {\n if (item === node) {\n // newNode cannot be null here due to the above filter.\n return newNode!;\n }\n\n return item;\n }),\n nodeMap: map\n };\n }\n\n function addNode(node: TreeNode<T>, map: Map<Key, TreeNode<T>>) {\n map.set(node.key, node);\n if (node.children) {\n for (let child of node.children) {\n addNode(child, map);\n }\n }\n }\n\n function deleteNode(node: TreeNode<T>, map: Map<Key, TreeNode<T>>) {\n map.delete(node.key);\n if (node.children) {\n for (let child of node.children) {\n deleteNode(child, map);\n }\n }\n }\n return {\n items,\n selectedKeys,\n setSelectedKeys,\n getItem(key: Key) {\n return nodeMap.get(key);\n },\n insert(parentKey: Key \| null, index: number, ...values: T[]) {\n setItems(({items, nodeMap: originalMap}) => {\n let {items: newNodes, nodeMap: newMap} = buildTree(values, new Map(originalMap), parentKey);\n\n // If parentKey is null, insert into the root.\n if (parentKey == null) {\n return {\n items: [\n ...items.slice(0, index),\n ...newNodes,\n ...items.slice(index)\n ],\n nodeMap: newMap\n };\n }\n\n // Otherwise, update the parent node and its ancestors.\n return updateTree(items, parentKey, parentNode => ({\n key: parentNode.key,\n parentKey: parentNode.parentKey,\n value: parentNode.value,\n children: [\n ...parentNode.children!.slice(0, index),\n ...newNodes,\n ...parentNode.children!.slice(index)\n ]\n }), newMap);\n });\n },\n insertBefore(key: Key, ...values: T[]): void {\n let node = nodeMap.get(key);\n if (!node) {\n return;\n }\n\n let parentNode = nodeMap.get(node.parentKey!);\n let nodes = parentNode ? parentNode.children : items;\n let index = nodes!.indexOf(node);\n this.insert(parentNode?.key ?? null, index, ...values);\n },\n insertAfter(key: Key, ...values: T[]): void {\n let node = nodeMap.get(key);\n if (!node) {\n return;\n }\n\n let parentNode = nodeMap.get(node.parentKey!);\n let nodes = parentNode ? parentNode.children : items;\n let index = nodes!.indexOf(node);\n this.insert(parentNode?.key ?? null, index + 1, ...values);\n },\n prepend(parentKey: Key \| null, ...values: T[]) {\n this.insert(parentKey, 0, ...values);\n },\n append(parentKey: Key \| null, ...values: T[]) {\n if (parentKey == null) {\n this.insert(null, items.length, ...values);\n } else {\n let parentNode = nodeMap.get(parentKey);\n if (!parentNode) {\n return;\n }\n\n this.insert(parentKey, parentNode.children!.length, ...values);\n }\n },\n remove(...keys: Key[]) {\n if (keys.length === 0) {\n return;\n }\n\n let newItems = items;\n let prevMap = nodeMap;\n let newTree;\n for (let key of keys) {\n newTree = updateTree(newItems, key, () => null, prevMap);\n prevMap = newTree.nodeMap;\n newItems = newTree.items;\n }\n\n setItems(newTree);\n\n let selection = new Set(selectedKeys);\n for (let key of selectedKeys) {\n if (!newTree.nodeMap.has(key)) {\n selection.delete(key);\n }\n }\n\n setSelectedKeys(selection);\n },\n removeSelectedItems() {\n this.remove(...selectedKeys);\n },\n move(key: Key, toParentKey: Key \| null, index: number) {\n setItems(({items, nodeMap: originalMap}) => {\n let node = originalMap.get(key);\n if (!node) {\n return {items, nodeMap: originalMap};\n }\n\n let {items: newItems, nodeMap: newMap} = updateTree(items, key, () => null, originalMap);\n\n\n const movedNode = {\n ...node,\n parentKey: toParentKey\n };\n\n // If parentKey is null, insert into the root.\n if (toParentKey == null) {\n addNode(movedNode, newMap);\n return {items: [\n ...newItems.slice(0, index),\n movedNode,\n ...newItems.slice(index)\n ], nodeMap: newMap};\n }\n\n // Otherwise, update the parent node and its ancestors.\n return updateTree(newItems, toParentKey, parentNode => ({\n key: parentNode.key,\n parentKey: parentNode.parentKey,\n value: parentNode.value,\n children: [\n ...parentNode.children!.slice(0, index),\n movedNode,\n ...parentNode.children!.slice(index)\n ]\n }), newMap);\n });\n },\n moveBefore(key: Key, keys: Iterable<Key>) {\n setItems((prevState) => {\n let {items, nodeMap} = prevState;\n let node = nodeMap.get(key);\n if (!node) {\n return prevState;\n }\n let toParentKey = node.parentKey ?? null;\n let parent: null \| TreeNode<T> = null;\n if (toParentKey != null) {\n parent = nodeMap.get(toParentKey) ?? null;\n }\n let toIndex = parent?.children ? parent.children.indexOf(node) : items.indexOf(node);\n return moveItems(prevState, keys, parent, toIndex, updateTree, addNode);\n });\n },\n moveAfter(key: Key, keys: Iterable<Key>) {\n setItems((prevState) => {\n let {items, nodeMap} = prevState;\n let node = nodeMap.get(key);\n if (!node) {\n return prevState;\n }\n let toParentKey = node.parentKey ?? null;\n let parent: null \| TreeNode<T> = null;\n if (toParentKey != null) {\n parent = nodeMap.get(toParentKey) ?? null;\n }\n let toIndex = parent?.children ? parent.children.indexOf(node) : items.indexOf(node);\n toIndex++;\n return moveItems(prevState, keys, parent, toIndex, updateTree, addNode);\n });\n },\n update(oldKey: Key, newValue: T) {\n setItems(({items, nodeMap: originalMap}) => updateTree(items, oldKey, oldNode => {\n let node: TreeNode<T> = {\n key: oldNode.key,\n parentKey: oldNode.parentKey,\n value: newValue,\n children: null\n };\n\n let tree = buildTree(getChildren(newValue), originalMap, node.key);\n node.children = tree.items;\n return node;\n }, originalMap));\n }\n };\n}\n\nfunction moveItems<T extends object>(\n state: TreeDataState<T>,\n keys: Iterable<Key>,\n toParent: TreeNode<T> \| null,\n toIndex: number,\n updateTree: (\n items: TreeNode<T>[],\n key: Key \| null,\n update: (node: TreeNode<T>) => TreeNode<T> \| null,\n originalMap: Map<Key, TreeNode<T>>\n ) => TreeDataState<T>,\n addNode: (node: TreeNode<T>, map: Map<Key, TreeNode<T>>) => void\n): TreeDataState<T> {\n let {items, nodeMap} = state;\n\n let parent = toParent;\n let removeKeys = new Set(keys);\n while (parent?.parentKey != null) {\n if (removeKeys.has(parent.key)) {\n throw new Error('Cannot move an item to be a child of itself.');\n }\n parent = nodeMap.get(parent.parentKey!) ?? null;\n }\n\n let originalToIndex = toIndex;\n\n let keyArray = Array.isArray(keys) ? keys : [...keys];\n // depth first search to put keys in order\n let inOrderKeys: Map<Key, number> = new Map();\n let removedItems: Array<TreeNode<T>> = [];\n let newItems = items;\n let newMap = nodeMap;\n let i = 0;\n\n function traversal(node, {inorder, postorder}) {\n inorder?.(node);\n if (node != null) {\n for (let child of node.children ?? []) {\n traversal(child, {inorder, postorder});\n postorder?.(child);\n }\n }\n }\n\n function inorder(child) {\n // in-order so we add items as we encounter them in the tree, then we can insert them in expected order later\n if (keyArray.includes(child.key)) {\n inOrderKeys.set(child.key, i++);\n }\n }\n\n function postorder(child) {\n // remove items and update the tree from the leaves and work upwards toward the root, this way\n // we don't copy child node references from parents inadvertently\n if (keyArray.includes(child.key)) {\n removedItems.push({...newMap.get(child.key)!, parentKey: toParent?.key ?? null});\n let {items: nextItems, nodeMap: nextMap} = updateTree(newItems, child.key, () => null, newMap);\n newItems = nextItems;\n newMap = nextMap;\n }\n // decrement the index if the child being removed is in the target parent and before the target index\n // the root node is special, it is null, and will not have a key, however, a parentKey can still point to it\n if ((child.parentKey === toParent\n \|\| child.parentKey === toParent?.key)\n && keyArray.includes(child.key)\n && (toParent?.children ? toParent.children.indexOf(child) : items.indexOf(child)) < originalToIndex) {\n toIndex--;\n }\n }\n\n traversal({children: items}, {inorder, postorder});\n\n let inOrderItems = removedItems.sort((a, b) => inOrderKeys.get(a.key)! > inOrderKeys.get(b.key)! ? 1 : -1);\n // If parentKey is null, insert into the root.\n if (!toParent \|\| toParent.key == null) {\n inOrderItems.forEach(movedNode => {\n addNode(movedNode, newMap); \n });\n return {items: [\n ...newItems.slice(0, toIndex),\n ...inOrderItems,\n ...newItems.slice(toIndex)\n ], nodeMap: newMap};\n }\n\n // Otherwise, update the parent node and its ancestors.\n return updateTree(newItems, toParent.key, parentNode => ({\n key: parentNode.key,\n parentKey: parentNode.parentKey,\n value: parentNode.value,\n children: [\n ...parentNode.children!.slice(0, toIndex),\n ...inOrderItems,\n ...parentNode.children!.slice(toIndex)\n ]\n }), newMap);\n}\n"],"names":[],"version":3,"file":"useTreeData.mjs.map"}
1	+ {"mappings":";;AAAA;;;;;;;;;;CAUC;AA6IM,SAAS,0CAA8B,OAAuB;IACnE,IAAI,gBACF,eAAe,EAAE,uBACjB,mBAAmB,UACnB,SAAS,CAAC,OAAc,KAAK,EAAE,IAAI,KAAK,GAAG,eAC3C,cAAc,CAAC,OAAc,KAAK,QAAQ,EAC3C,GAAG;IAEJ,kDAAkD;IAClD,IAAI,CAAC,MAAM,SAAS,GAAG,CAAA,GAAA,eAAO,EAAoB,IAAM,UAAU,cAAc,IAAI;IACpF,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;IAEvB,IAAI,CAAC,cAAc,gBAAgB,GAAG,CAAA,GAAA,eAAO,EAAE,IAAI,IAAS,uBAAuB,EAAE;IAErF,SAAS,UACP,eAA2B,EAAE,EAC7B,GAA0B,EAC1B,SAAsB;QAEtB,IAAI,gBAAgB,MAClB,eAAe,EAAE;QAEnB,OAAO;YACL,OAAO,aAAa,GAAG,CAAC,CAAA;gBACtB,IAAI,OAAoB;oBACtB,KAAK,OAAO;oBACZ,WAAW,aAAa;oBACxB,OAAO;oBACP,UAAU;gBACZ;gBAEA,KAAK,QAAQ,GAAG,UAAU,YAAY,OAAO,KAAK,KAAK,GAAG,EAAE,KAAK;gBACjE,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE;gBAClB,OAAO;YACT;YACA,SAAS;QACX;IACF;IAEA,SAAS,WACP,KAAoB,EACpB,GAAe,EACf,MAAiD,EACjD,WAAkC;QAElC,IAAI,OAAO,OAAO,OAAO,OAAO,YAAY,GAAG,CAAC;QAChD,IAAI,QAAQ,MACV,OAAO;mBAAC;YAAO,SAAS;QAAW;QAErC,IAAI,MAAM,IAAI,IAAsB;QAEpC,uEAAuE;QACvE,IAAI,UAAU,OAAO;QACrB,IAAI,WAAW,MACb,WAAW,MAAM;aAEjB,QAAQ,SAAS;QAGnB,wEAAwE;QACxE,MAAO,QAAQ,KAAK,SAAS,CAAE;YAC7B,IAAI,aAAa,IAAI,GAAG,CAAC,KAAK,SAAS;YACvC,IAAI,OAAoB;gBACtB,KAAK,WAAW,GAAG;gBACnB,WAAW,WAAW,SAAS;gBAC/B,OAAO,WAAW,KAAK;gBACvB,UAAU;YACZ;YAEA,IAAI,WAAW,WAAW,QAAQ;YAClC,IAAI,WAAW,QAAQ,UACrB,WAAW,SAAS,MAAM,CAAC,CAAA,IAAK,MAAM;YAGxC,KAAK,QAAQ,GACX,UAAU,IAAI,CAAA;gBACZ,IAAI,UAAU,MACZ,uDAAuD;gBACvD,OAAO;gBAGT,OAAO;YACT,MAAM;YAER,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE;YAElB,UAAU;YACV,OAAO;QACT;QAEA,IAAI,WAAW,MACb,QAAQ,MAAM,MAAM,CAAC,CAAA,IAAK,MAAM;QAGlC,OAAO;YACL,OAAO,MAAM,GAAG,CAAC,CAAA;gBACf,IAAI,SAAS,MACX,uDAAuD;gBACvD,OAAO;gBAGT,OAAO;YACT;YACA,SAAS;QACX;IACF;IAEA,SAAS,QAAQ,IAAiB,EAAE,GAA0B;QAC5D,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE;QAClB,IAAI,KAAK,QAAQ,EACf,KAAK,IAAI,SAAS,KAAK,QAAQ,CAC7B,QAAQ,OAAO;IAGrB;IAEA,SAAS,WAAW,IAAiB,EAAE,GAA0B;QAC/D,IAAI,MAAM,CAAC,KAAK,GAAG;QACnB,IAAI,KAAK,QAAQ,EACf,KAAK,IAAI,SAAS,KAAK,QAAQ,CAC7B,WAAW,OAAO;IAGxB;IACA,OAAO;eACL;sBACA;yBACA;QACA,SAAQ,GAAQ;YACd,OAAO,QAAQ,GAAG,CAAC;QACrB;QACA,QAAO,SAAqB,EAAE,KAAa,EAAE,GAAG,MAAW;YACzD,SAAS,CAAC,SAAC,KAAK,EAAE,SAAS,WAAW,EAAC;gBACrC,IAAI,EAAC,OAAO,QAAQ,EAAE,SAAS,MAAM,EAAC,GAAG,UAAU,QAAQ,IAAI,IAAI,cAAc;gBAEjF,8CAA8C;gBAC9C,IAAI,aAAa,MACf,OAAO;oBACL,OAAO;2BAAI,MAAM,KAAK,CAAC,GAAG;2BAAW;2BAAa,MAAM,KAAK,CAAC;qBAAO;oBACrE,SAAS;gBACX;gBAGF,uDAAuD;gBACvD,OAAO,WACL,OACA,WACA,CAAA,aAAe,CAAA;wBACb,KAAK,WAAW,GAAG;wBACnB,WAAW,WAAW,SAAS;wBAC/B,OAAO,WAAW,KAAK;wBACvB,UAAU;+BACL,WAAW,QAAQ,CAAE,KAAK,CAAC,GAAG;+BAC9B;+BACA,WAAW,QAAQ,CAAE,KAAK,CAAC;yBAC/B;oBACH,CAAA,GACA;YAEJ;QACF;QACA,cAAa,GAAQ,EAAE,GAAG,MAAW;YACnC,IAAI,OAAO,QAAQ,GAAG,CAAC;YACvB,IAAI,CAAC,MACH;YAGF,IAAI,aAAa,QAAQ,GAAG,CAAC,KAAK,SAAS;YAC3C,IAAI,QAAQ,aAAa,WAAW,QAAQ,GAAG;YAC/C,IAAI,QAAQ,MAAO,OAAO,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,YAAY,OAAO,MAAM,UAAU;QACjD;QACA,aAAY,GAAQ,EAAE,GAAG,MAAW;YAClC,IAAI,OAAO,QAAQ,GAAG,CAAC;YACvB,IAAI,CAAC,MACH;YAGF,IAAI,aAAa,QAAQ,GAAG,CAAC,KAAK,SAAS;YAC3C,IAAI,QAAQ,aAAa,WAAW,QAAQ,GAAG;YAC/C,IAAI,QAAQ,MAAO,OAAO,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,YAAY,OAAO,MAAM,QAAQ,MAAM;QACrD;QACA,SAAQ,SAAqB,EAAE,GAAG,MAAW;YAC3C,IAAI,CAAC,MAAM,CAAC,WAAW,MAAM;QAC/B;QACA,QAAO,SAAqB,EAAE,GAAG,MAAW;YAC1C,IAAI,aAAa,MACf,IAAI,CAAC,MAAM,CAAC,MAAM,MAAM,MAAM,KAAK;iBAC9B;gBACL,IAAI,aAAa,QAAQ,GAAG,CAAC;gBAC7B,IAAI,CAAC,YACH;gBAGF,IAAI,CAAC,MAAM,CAAC,WAAW,WAAW,QAAQ,CAAE,MAAM,KAAK;YACzD;QACF;QACA,QAAO,GAAG,IAAW;YACnB,IAAI,KAAK,MAAM,KAAK,GAClB;YAGF,IAAI,WAAW;YACf,IAAI,UAAU;YACd,IAAI;YACJ,KAAK,IAAI,OAAO,KAAM;gBACpB,UAAU,WAAW,UAAU,KAAK,IAAM,MAAM;gBAChD,UAAU,QAAQ,OAAO;gBACzB,WAAW,QAAQ,KAAK;YAC1B;YAEA,SAAS;YAET,IAAI,YAAY,IAAI,IAAI;YACxB,KAAK,IAAI,OAAO,aACd,IAAI,CAAC,QAAQ,OAAO,CAAC,GAAG,CAAC,MACvB,UAAU,MAAM,CAAC;YAIrB,gBAAgB;QAClB;QACA;YACE,IAAI,CAAC,MAAM,IAAI;QACjB;QACA,MAAK,GAAQ,EAAE,WAAuB,EAAE,KAAa;YACnD,SAAS,CAAC,SAAC,KAAK,EAAE,SAAS,WAAW,EAAC;gBACrC,IAAI,OAAO,YAAY,GAAG,CAAC;gBAC3B,IAAI,CAAC,MACH,OAAO;2BAAC;oBAAO,SAAS;gBAAW;gBAGrC,IAAI,EAAC,OAAO,QAAQ,EAAE,SAAS,MAAM,EAAC,GAAG,WAAW,OAAO,KAAK,IAAM,MAAM;gBAE5E,MAAM,YAAY;oBAChB,GAAG,IAAI;oBACP,WAAW;gBACb;gBAEA,8CAA8C;gBAC9C,IAAI,eAAe,MAAM;oBACvB,QAAQ,WAAW;oBACnB,OAAO;wBACL,OAAO;+BAAI,SAAS,KAAK,CAAC,GAAG;4BAAQ;+BAAc,SAAS,KAAK,CAAC;yBAAO;wBACzE,SAAS;oBACX;gBACF;gBAEA,uDAAuD;gBACvD,OAAO,WACL,UACA,aACA,CAAA,aAAe,CAAA;wBACb,KAAK,WAAW,GAAG;wBACnB,WAAW,WAAW,SAAS;wBAC/B,OAAO,WAAW,KAAK;wBACvB,UAAU;+BACL,WAAW,QAAQ,CAAE,KAAK,CAAC,GAAG;4BACjC;+BACG,WAAW,QAAQ,CAAE,KAAK,CAAC;yBAC/B;oBACH,CAAA,GACA;YAEJ;QACF;QACA,YAAW,GAAQ,EAAE,IAAmB;YACtC,SAAS,CAAA;gBACP,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;gBACvB,IAAI,OAAO,QAAQ,GAAG,CAAC;gBACvB,IAAI,CAAC,MACH,OAAO;gBAET,IAAI,cAAc,KAAK,SAAS,IAAI;gBACpC,IAAI,SAA6B;gBACjC,IAAI,eAAe,MACjB,SAAS,QAAQ,GAAG,CAAC,gBAAgB;gBAEvC,IAAI,UAAU,QAAQ,WAAW,OAAO,QAAQ,CAAC,OAAO,CAAC,QAAQ,MAAM,OAAO,CAAC;gBAC/E,OAAO,gCAAU,WAAW,MAAM,QAAQ,SAAS,YAAY;YACjE;QACF;QACA,WAAU,GAAQ,EAAE,IAAmB;YACrC,SAAS,CAAA;gBACP,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;gBACvB,IAAI,OAAO,QAAQ,GAAG,CAAC;gBACvB,IAAI,CAAC,MACH,OAAO;gBAET,IAAI,cAAc,KAAK,SAAS,IAAI;gBACpC,IAAI,SAA6B;gBACjC,IAAI,eAAe,MACjB,SAAS,QAAQ,GAAG,CAAC,gBAAgB;gBAEvC,IAAI,UAAU,QAAQ,WAAW,OAAO,QAAQ,CAAC,OAAO,CAAC,QAAQ,MAAM,OAAO,CAAC;gBAC/E;gBACA,OAAO,gCAAU,WAAW,MAAM,QAAQ,SAAS,YAAY;YACjE;QACF;QACA,QAAO,MAAW,EAAE,QAAW;YAC7B,SAAS,CAAC,SAAC,KAAK,EAAE,SAAS,WAAW,EAAC,GACrC,WACE,OACA,QACA,CAAA;oBACE,IAAI,OAAoB;wBACtB,KAAK,QAAQ,GAAG;wBAChB,WAAW,QAAQ,SAAS;wBAC5B,OAAO;wBACP,UAAU;oBACZ;oBAEA,IAAI,OAAO,UAAU,YAAY,WAAW,aAAa,KAAK,GAAG;oBACjE,KAAK,QAAQ,GAAG,KAAK,KAAK;oBAC1B,OAAO;gBACT,GACA;QAGN;IACF;AACF;AAEA,SAAS,gCACP,KAAuB,EACvB,IAAmB,EACnB,QAA4B,EAC5B,OAAe,EACf,UAKqB,EACrB,OAAgE;IAEhE,IAAI,SAAC,KAAK,WAAE,OAAO,EAAC,GAAG;IAEvB,IAAI,SAAS;IACb,IAAI,aAAa,IAAI,IAAI;IACzB,MAAO,QAAQ,aAAa,KAAM;QAChC,IAAI,WAAW,GAAG,CAAC,OAAO,GAAG,GAC3B,MAAM,IAAI,MAAM;QAElB,SAAS,QAAQ,GAAG,CAAC,OAAO,SAAS,KAAM;IAC7C;IAEA,IAAI,kBAAkB;IAEtB,IAAI,WAAW,MAAM,OAAO,CAAC,QAAQ,OAAO;WAAI;KAAK;IACrD,0CAA0C;IAC1C,IAAI,cAAgC,IAAI;IACxC,IAAI,eAAmC,EAAE;IACzC,IAAI,WAAW;IACf,IAAI,SAAS;IACb,IAAI,IAAI;IAER,SAAS,UAAU,IAAI,EAAE,WAAC,OAAO,aAAE,SAAS,EAAC;QAC3C,UAAU;QACV,IAAI,QAAQ,MACV,KAAK,IAAI,SAAS,KAAK,QAAQ,IAAI,EAAE,CAAE;YACrC,UAAU,OAAO;yBAAC;2BAAS;YAAS;YACpC,YAAY;QACd;IAEJ;IAEA,SAAS,QAAQ,KAAK;QACpB,6GAA6G;QAC7G,IAAI,SAAS,QAAQ,CAAC,MAAM,GAAG,GAC7B,YAAY,GAAG,CAAC,MAAM,GAAG,EAAE;IAE/B;IAEA,SAAS,UAAU,KAAK;QACtB,8FAA8F;QAC9F,iEAAiE;QACjE,IAAI,SAAS,QAAQ,CAAC,MAAM,GAAG,GAAG;YAChC,aAAa,IAAI,CAAC;gBAAC,GAAG,OAAO,GAAG,CAAC,MAAM,GAAG,CAAC;gBAAG,WAAW,UAAU,OAAO;YAAI;YAC9E,IAAI,EAAC,OAAO,SAAS,EAAE,SAAS,OAAO,EAAC,GAAG,WACzC,UACA,MAAM,GAAG,EACT,IAAM,MACN;YAEF,WAAW;YACX,SAAS;QACX;QACA,qGAAqG;QACrG,4GAA4G;QAC5G,IACE,AAAC,CAAA,MAAM,SAAS,KAAK,YAAY,MAAM,SAAS,KAAK,UAAU,GAAE,KACjE,SAAS,QAAQ,CAAC,MAAM,GAAG,KAC3B,AAAC,CAAA,UAAU,WAAW,SAAS,QAAQ,CAAC,OAAO,CAAC,SAAS,MAAM,OAAO,CAAC,MAAK,IAC1E,iBAEF;IAEJ;IAEA,UAAU;QAAC,UAAU;IAAK,GAAG;iBAAC;mBAAS;IAAS;IAEhD,IAAI,eAAe,aAAa,IAAI,CAAC,CAAC,GAAG,IACvC,YAAY,GAAG,CAAC,EAAE,GAAG,IAAK,YAAY,GAAG,CAAC,EAAE,GAAG,IAAK,IAAI;IAE1D,8CAA8C;IAC9C,IAAI,CAAC,YAAY,SAAS,GAAG,IAAI,MAAM;QACrC,aAAa,OAAO,CAAC,CAAA;YACnB,QAAQ,WAAW;QACrB;QACA,OAAO;YACL,OAAO;mBAAI,SAAS,KAAK,CAAC,GAAG;mBAAa;mBAAiB,SAAS,KAAK,CAAC;aAAS;YACnF,SAAS;QACX;IACF;IAEA,uDAAuD;IACvD,OAAO,WACL,UACA,SAAS,GAAG,EACZ,CAAA,aAAe,CAAA;YACb,KAAK,WAAW,GAAG;YACnB,WAAW,WAAW,SAAS;YAC/B,OAAO,WAAW,KAAK;YACvB,UAAU;mBACL,WAAW,QAAQ,CAAE,KAAK,CAAC,GAAG;mBAC9B;mBACA,WAAW,QAAQ,CAAE,KAAK,CAAC;aAC/B;QACH,CAAA,GACA;AAEJ","sources":["packages/react-stately/src/data/useTreeData.ts"],"sourcesContent":["/\n Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n \n Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n /\n\nimport {Key} from '@react-types/shared';\nimport {useState} from 'react';\n\nexport interface TreeOptions<T extends object> {\n /* Initial root items in the tree. /\n initialItems?: T[];\n /* The keys for the initially selected items. /\n initialSelectedKeys?: Iterable<Key>;\n /* A function that returns a unique key for an item object. /\n getKey?: (item: T) => Key;\n /* A function that returns the children for an item object. /\n getChildren?: (item: T) => T[];\n}\n\ninterface TreeNode<T extends object> {\n /* A unique key for the tree node. /\n key: Key;\n /* The key of the parent node. /\n parentKey?: Key \| null;\n /* The value object for the tree node. /\n value: T;\n /* Children of the tree node. /\n children: TreeNode<T>[] \| null;\n}\n\nexport interface TreeData<T extends object> {\n /* The root nodes in the tree. /\n items: TreeNode<T>[];\n\n /* The keys of the currently selected items in the tree. /\n selectedKeys: Set<Key>;\n\n /* Sets the selected keys. /\n setSelectedKeys(keys: Set<Key>): void;\n\n /\n Gets a node from the tree by key.\n \n @param key - The key of the item to retrieve.\n /\n getItem(key: Key): TreeNode<T> \| undefined;\n\n /\n Inserts an item into a parent node as a child.\n \n @param parentKey - The key of the parent item to insert into. `null` for the root.\n * @param index - The index within the parent to insert into.\n * @param value - The value to insert.\n /\n insert(parentKey: Key \| null, index: number, ...values: T[]): void;\n\n /\n Inserts items into the list before the item at the given key.\n \n @param key - The key of the item to insert before.\n * @param values - The values to insert.\n /\n insertBefore(key: Key, ...values: T[]): void;\n\n /\n Inserts items into the list after the item at the given key.\n \n @param key - The key of the item to insert after.\n * @param values - The values to insert.\n /\n insertAfter(key: Key, ...values: T[]): void;\n\n /\n Appends an item into a parent node as a child.\n \n @param parentKey - The key of the parent item to insert into. `null` for the root.\n * @param value - The value to insert.\n /\n append(parentKey: Key \| null, ...values: T[]): void;\n\n /\n Prepends an item into a parent node as a child.\n \n @param parentKey - The key of the parent item to insert into. `null` for the root.\n * @param value - The value to insert.\n /\n prepend(parentKey: Key \| null, ...value: T[]): void;\n\n /\n Removes an item from the tree by its key.\n \n @param key - The key of the item to remove.\n /\n remove(...keys: Key[]): void;\n\n /\n Removes all items from the tree that are currently\n * in the set of selected items.\n /\n removeSelectedItems(): void;\n\n /\n Moves an item within the tree.\n \n @param key - The key of the item to move.\n * @param toParentKey - The key of the new parent to insert into. `null` for the root.\n * @param index - The index within the new parent to insert at.\n /\n move(key: Key, toParentKey: Key \| null, index: number): void;\n\n /\n Moves one or more items before a given key.\n \n @param key - The key of the item to move the items before.\n * @param keys - The keys of the items to move.\n /\n moveBefore(key: Key, keys: Iterable<Key>): void;\n\n /\n Moves one or more items after a given key.\n \n @param key - The key of the item to move the items after.\n * @param keys - The keys of the items to move.\n /\n moveAfter(key: Key, keys: Iterable<Key>): void;\n\n /\n Updates an item in the tree.\n \n @param key - The key of the item to update.\n * @param newValue - The new value for the item.\n /\n update(key: Key, newValue: T): void;\n}\n\ninterface TreeDataState<T extends object> {\n items: TreeNode<T>[];\n nodeMap: Map<Key, TreeNode<T>>;\n}\n\n/\n Manages state for an immutable tree data structure, and provides convenience methods to\n * update the data over time.\n */\nexport function useTreeData<T extends object>(options: TreeOptions<T>): TreeData<T> {\n let {\n initialItems = [],\n initialSelectedKeys,\n getKey = (item: any) => item.id ?? item.key,\n getChildren = (item: any) => item.children\n } = options;\n\n // We only want to compute this on initial render.\n let [tree, setItems] = useState<TreeDataState<T>>(() => buildTree(initialItems, new Map()));\n let {items, nodeMap} = tree;\n\n let [selectedKeys, setSelectedKeys] = useState(new Set<Key>(initialSelectedKeys \|\| []));\n\n function buildTree(\n initialItems: T[] \| null = [],\n map: Map<Key, TreeNode<T>>,\n parentKey?: Key \| null\n ) {\n if (initialItems == null) {\n initialItems = [];\n }\n return {\n items: initialItems.map(item => {\n let node: TreeNode<T> = {\n key: getKey(item),\n parentKey: parentKey ?? null,\n value: item,\n children: null\n };\n\n node.children = buildTree(getChildren(item), map, node.key).items;\n map.set(node.key, node);\n return node;\n }),\n nodeMap: map\n };\n }\n\n function updateTree(\n items: TreeNode<T>[],\n key: Key \| null,\n update: (node: TreeNode<T>) => TreeNode<T> \| null,\n originalMap: Map<Key, TreeNode<T>>\n ) {\n let node = key == null ? null : originalMap.get(key);\n if (node == null) {\n return {items, nodeMap: originalMap};\n }\n let map = new Map<Key, TreeNode<T>>(originalMap);\n\n // Create a new node. If null, then delete the node, otherwise replace.\n let newNode = update(node);\n if (newNode == null) {\n deleteNode(node, map);\n } else {\n addNode(newNode, map);\n }\n\n // Walk up the tree and update each parent to refer to the new children.\n while (node && node.parentKey) {\n let nextParent = map.get(node.parentKey)!;\n let copy: TreeNode<T> = {\n key: nextParent.key,\n parentKey: nextParent.parentKey,\n value: nextParent.value,\n children: null\n };\n\n let children = nextParent.children;\n if (newNode == null && children) {\n children = children.filter(c => c !== node);\n }\n\n copy.children =\n children?.map(child => {\n if (child === node) {\n // newNode cannot be null here due to the above filter.\n return newNode!;\n }\n\n return child;\n }) ?? null;\n\n map.set(copy.key, copy);\n\n newNode = copy;\n node = nextParent;\n }\n\n if (newNode == null) {\n items = items.filter(c => c !== node);\n }\n\n return {\n items: items.map(item => {\n if (item === node) {\n // newNode cannot be null here due to the above filter.\n return newNode!;\n }\n\n return item;\n }),\n nodeMap: map\n };\n }\n\n function addNode(node: TreeNode<T>, map: Map<Key, TreeNode<T>>) {\n map.set(node.key, node);\n if (node.children) {\n for (let child of node.children) {\n addNode(child, map);\n }\n }\n }\n\n function deleteNode(node: TreeNode<T>, map: Map<Key, TreeNode<T>>) {\n map.delete(node.key);\n if (node.children) {\n for (let child of node.children) {\n deleteNode(child, map);\n }\n }\n }\n return {\n items,\n selectedKeys,\n setSelectedKeys,\n getItem(key: Key) {\n return nodeMap.get(key);\n },\n insert(parentKey: Key \| null, index: number, ...values: T[]) {\n setItems(({items, nodeMap: originalMap}) => {\n let {items: newNodes, nodeMap: newMap} = buildTree(values, new Map(originalMap), parentKey);\n\n // If parentKey is null, insert into the root.\n if (parentKey == null) {\n return {\n items: [...items.slice(0, index), ...newNodes, ...items.slice(index)],\n nodeMap: newMap\n };\n }\n\n // Otherwise, update the parent node and its ancestors.\n return updateTree(\n items,\n parentKey,\n parentNode => ({\n key: parentNode.key,\n parentKey: parentNode.parentKey,\n value: parentNode.value,\n children: [\n ...parentNode.children!.slice(0, index),\n ...newNodes,\n ...parentNode.children!.slice(index)\n ]\n }),\n newMap\n );\n });\n },\n insertBefore(key: Key, ...values: T[]): void {\n let node = nodeMap.get(key);\n if (!node) {\n return;\n }\n\n let parentNode = nodeMap.get(node.parentKey!);\n let nodes = parentNode ? parentNode.children : items;\n let index = nodes!.indexOf(node);\n this.insert(parentNode?.key ?? null, index, ...values);\n },\n insertAfter(key: Key, ...values: T[]): void {\n let node = nodeMap.get(key);\n if (!node) {\n return;\n }\n\n let parentNode = nodeMap.get(node.parentKey!);\n let nodes = parentNode ? parentNode.children : items;\n let index = nodes!.indexOf(node);\n this.insert(parentNode?.key ?? null, index + 1, ...values);\n },\n prepend(parentKey: Key \| null, ...values: T[]) {\n this.insert(parentKey, 0, ...values);\n },\n append(parentKey: Key \| null, ...values: T[]) {\n if (parentKey == null) {\n this.insert(null, items.length, ...values);\n } else {\n let parentNode = nodeMap.get(parentKey);\n if (!parentNode) {\n return;\n }\n\n this.insert(parentKey, parentNode.children!.length, ...values);\n }\n },\n remove(...keys: Key[]) {\n if (keys.length === 0) {\n return;\n }\n\n let newItems = items;\n let prevMap = nodeMap;\n let newTree;\n for (let key of keys) {\n newTree = updateTree(newItems, key, () => null, prevMap);\n prevMap = newTree.nodeMap;\n newItems = newTree.items;\n }\n\n setItems(newTree);\n\n let selection = new Set(selectedKeys);\n for (let key of selectedKeys) {\n if (!newTree.nodeMap.has(key)) {\n selection.delete(key);\n }\n }\n\n setSelectedKeys(selection);\n },\n removeSelectedItems() {\n this.remove(...selectedKeys);\n },\n move(key: Key, toParentKey: Key \| null, index: number) {\n setItems(({items, nodeMap: originalMap}) => {\n let node = originalMap.get(key);\n if (!node) {\n return {items, nodeMap: originalMap};\n }\n\n let {items: newItems, nodeMap: newMap} = updateTree(items, key, () => null, originalMap);\n\n const movedNode = {\n ...node,\n parentKey: toParentKey\n };\n\n // If parentKey is null, insert into the root.\n if (toParentKey == null) {\n addNode(movedNode, newMap);\n return {\n items: [...newItems.slice(0, index), movedNode, ...newItems.slice(index)],\n nodeMap: newMap\n };\n }\n\n // Otherwise, update the parent node and its ancestors.\n return updateTree(\n newItems,\n toParentKey,\n parentNode => ({\n key: parentNode.key,\n parentKey: parentNode.parentKey,\n value: parentNode.value,\n children: [\n ...parentNode.children!.slice(0, index),\n movedNode,\n ...parentNode.children!.slice(index)\n ]\n }),\n newMap\n );\n });\n },\n moveBefore(key: Key, keys: Iterable<Key>) {\n setItems(prevState => {\n let {items, nodeMap} = prevState;\n let node = nodeMap.get(key);\n if (!node) {\n return prevState;\n }\n let toParentKey = node.parentKey ?? null;\n let parent: null \| TreeNode<T> = null;\n if (toParentKey != null) {\n parent = nodeMap.get(toParentKey) ?? null;\n }\n let toIndex = parent?.children ? parent.children.indexOf(node) : items.indexOf(node);\n return moveItems(prevState, keys, parent, toIndex, updateTree, addNode);\n });\n },\n moveAfter(key: Key, keys: Iterable<Key>) {\n setItems(prevState => {\n let {items, nodeMap} = prevState;\n let node = nodeMap.get(key);\n if (!node) {\n return prevState;\n }\n let toParentKey = node.parentKey ?? null;\n let parent: null \| TreeNode<T> = null;\n if (toParentKey != null) {\n parent = nodeMap.get(toParentKey) ?? null;\n }\n let toIndex = parent?.children ? parent.children.indexOf(node) : items.indexOf(node);\n toIndex++;\n return moveItems(prevState, keys, parent, toIndex, updateTree, addNode);\n });\n },\n update(oldKey: Key, newValue: T) {\n setItems(({items, nodeMap: originalMap}) =>\n updateTree(\n items,\n oldKey,\n oldNode => {\n let node: TreeNode<T> = {\n key: oldNode.key,\n parentKey: oldNode.parentKey,\n value: newValue,\n children: null\n };\n\n let tree = buildTree(getChildren(newValue), originalMap, node.key);\n node.children = tree.items;\n return node;\n },\n originalMap\n )\n );\n }\n };\n}\n\nfunction moveItems<T extends object>(\n state: TreeDataState<T>,\n keys: Iterable<Key>,\n toParent: TreeNode<T> \| null,\n toIndex: number,\n updateTree: (\n items: TreeNode<T>[],\n key: Key \| null,\n update: (node: TreeNode<T>) => TreeNode<T> \| null,\n originalMap: Map<Key, TreeNode<T>>\n ) => TreeDataState<T>,\n addNode: (node: TreeNode<T>, map: Map<Key, TreeNode<T>>) => void\n): TreeDataState<T> {\n let {items, nodeMap} = state;\n\n let parent = toParent;\n let removeKeys = new Set(keys);\n while (parent?.parentKey != null) {\n if (removeKeys.has(parent.key)) {\n throw new Error('Cannot move an item to be a child of itself.');\n }\n parent = nodeMap.get(parent.parentKey!) ?? null;\n }\n\n let originalToIndex = toIndex;\n\n let keyArray = Array.isArray(keys) ? keys : [...keys];\n // depth first search to put keys in order\n let inOrderKeys: Map<Key, number> = new Map();\n let removedItems: Array<TreeNode<T>> = [];\n let newItems = items;\n let newMap = nodeMap;\n let i = 0;\n\n function traversal(node, {inorder, postorder}) {\n inorder?.(node);\n if (node != null) {\n for (let child of node.children ?? []) {\n traversal(child, {inorder, postorder});\n postorder?.(child);\n }\n }\n }\n\n function inorder(child) {\n // in-order so we add items as we encounter them in the tree, then we can insert them in expected order later\n if (keyArray.includes(child.key)) {\n inOrderKeys.set(child.key, i++);\n }\n }\n\n function postorder(child) {\n // remove items and update the tree from the leaves and work upwards toward the root, this way\n // we don't copy child node references from parents inadvertently\n if (keyArray.includes(child.key)) {\n removedItems.push({...newMap.get(child.key)!, parentKey: toParent?.key ?? null});\n let {items: nextItems, nodeMap: nextMap} = updateTree(\n newItems,\n child.key,\n () => null,\n newMap\n );\n newItems = nextItems;\n newMap = nextMap;\n }\n // decrement the index if the child being removed is in the target parent and before the target index\n // the root node is special, it is null, and will not have a key, however, a parentKey can still point to it\n if (\n (child.parentKey === toParent \|\| child.parentKey === toParent?.key) &&\n keyArray.includes(child.key) &&\n (toParent?.children ? toParent.children.indexOf(child) : items.indexOf(child)) <\n originalToIndex\n ) {\n toIndex--;\n }\n }\n\n traversal({children: items}, {inorder, postorder});\n\n let inOrderItems = removedItems.sort((a, b) =>\n inOrderKeys.get(a.key)! > inOrderKeys.get(b.key)! ? 1 : -1\n );\n // If parentKey is null, insert into the root.\n if (!toParent \|\| toParent.key == null) {\n inOrderItems.forEach(movedNode => {\n addNode(movedNode, newMap);\n });\n return {\n items: [...newItems.slice(0, toIndex), ...inOrderItems, ...newItems.slice(toIndex)],\n nodeMap: newMap\n };\n }\n\n // Otherwise, update the parent node and its ancestors.\n return updateTree(\n newItems,\n toParent.key,\n parentNode => ({\n key: parentNode.key,\n parentKey: parentNode.parentKey,\n value: parentNode.value,\n children: [\n ...parentNode.children!.slice(0, toIndex),\n ...inOrderItems,\n ...parentNode.children!.slice(toIndex)\n ]\n }),\n newMap\n );\n}\n"],"names":[],"version":3,"file":"useTreeData.mjs.map"}

package/dist/private/datepicker/IncompleteDate.cjs CHANGED Viewed

@@ -85,7 +85,10 @@ class $644c5fdef7cba18c$export$ae165b50d181e1ef {
         result.offset = null;
         return result;
     }
-    /** Increments or decrements the given field. If it is null, then it is set to the placeholder value. */ cycle(field, amount, placeholder, displaySegments) {
+    /**
+   * Increments or decrements the given field. If it is null, then it is set to the placeholder
+   * value.
+   */ cycle(field, amount, placeholder, displaySegments) {
         let res = this.copy();
         // If field is null, default to placeholder.
         if (res[field] == null && field !== 'dayPeriod' && field !== 'era') {
@@ -163,7 +166,10 @@ class $644c5fdef7cba18c$export$ae165b50d181e1ef {
         }
         return res;
     }
-    /** Converts the incomplete date to a full date value, using the provided value for any unset fields. */ toValue(value) {
+    /**
+   * Converts the incomplete date to a full date value, using the provided value for any unset
+   * fields.
+   */ toValue(value) {
         if ('hour' in value) {
             let hour = this.hour;
             if (hour != null) hour = $644c5fdef7cba18c$var$fromHourCycle(hour, this.dayPeriod ?? 0, this.hourCycle);

package/dist/private/datepicker/IncompleteDate.cjs.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"mappings":";;;;;;;;AAAA;;;;;;;;;;CAUC;AAcM,MAAM;IAcX,YAAY,QAAkB,EAAE,SAAoB,EAAE,SAAqD,CAAE;QAC3G,IAAI,CAAC,GAAG,GAAG,WAAW,OAAO;QAC7B,IAAI,CAAC,QAAQ,GAAG;QAChB,IAAI,CAAC,IAAI,GAAG,WAAW,QAAQ;QAC/B,IAAI,CAAC,KAAK,GAAG,WAAW,SAAS;QACjC,IAAI,CAAC,GAAG,GAAG,WAAW,OAAO;QAC7B,IAAI,CAAC,IAAI,GAAG,WAAW,QAAQ;QAC/B,IAAI,CAAC,SAAS,GAAG;QACjB,IAAI,CAAC,SAAS,GAAG;QACjB,IAAI,CAAC,MAAM,GAAG,WAAW,UAAU;QACnC,IAAI,CAAC,MAAM,GAAG,WAAW,UAAU;QACnC,IAAI,CAAC,WAAW,GAAG,WAAW,eAAe;QAC7C,IAAI,CAAC,MAAM,GAAG,YAAa,CAAA,aAAa,CAAC,CAAA,IAAK,AAAC,UAAkB,MAAM,GAAG;QAE1E,8DAA8D;QAC9D,IAAI,IAAI,CAAC,IAAI,IAAI,MAAM;YACrB,IAAI,CAAC,WAAW,KAAK,GAAG,kCAAY,IAAI,CAAC,IAAI,EAAE;YAC/C,IAAI,CAAC,SAAS,GAAG;YACjB,IAAI,CAAC,IAAI,GAAG;QACd;IACF;IAEA,OAAuB;QACrB,IAAI,MAAM,IAAI,0CAAe,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS;QAC1D,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG;QAClB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI;QACpB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK;QACtB,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG;QAClB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI;QACpB,IAAI,SAAS,GAAG,IAAI,CAAC,SAAS;QAC9B,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM;QACxB,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM;QACxB,IAAI,WAAW,GAAG,IAAI,CAAC,WAAW;QAClC,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM;QACxB,OAAO;IACT;IAEA,4DAA4D,GAC5D,WAAW,QAA2B,EAAE;QACtC,OAAO,SAAS,KAAK,CAAC,CAAA,UAAW,IAAI,CAAC,QAAQ,IAAI;IACpD;IAEA,uFAAuF,GACvF,SAAS,EAAa,EAAE,QAA2B,EAAE;QACnD,OAAO,SAAS,KAAK,CAAC,CAAA;YACpB,IAAI,AAAC,CAAA,YAAY,UAAU,YAAY,WAAU,KAAM,UAAU,IAAI;gBACnE,IAAI,CAAC,WAAW,KAAK,GAAG,kCAAY,GAAG,IAAI,EAAE,IAAI,CAAC,SAAS;gBAC3D,OAAO,IAAI,CAAC,SAAS,KAAK,aAAa,IAAI,CAAC,IAAI,KAAK;YACvD;YACA,OAAO,IAAI,CAAC,QAAQ,KAAK,EAAE,CAAC,QAAQ;QACtC;IACF;IAEA,wEAAwE,GACxE,UAAU,QAA2B,EAAW;QAC9C,OAAO,SAAS,KAAK,CAAC,CAAA,UAAW,IAAI,CAAC,QAAQ,KAAK;IACrD;IAEA,0BAA0B,GAC1B,IAAI,KAAsB,EAAE,KAAsB,EAAE,WAAsB,EAAkB;QAC1F,IAAI,SAAS,IAAI,CAAC,IAAI;QACtB,MAAM,CAAC,MAAM,GAAG;QAChB,IAAI,UAAU,UAAU,OAAO,SAAS,IAAI,QAAQ,UAAU,aAC5D,OAAO,SAAS,GAAG,kCAAY,YAAY,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE;QAErE,IAAI,UAAU,UAAU,OAAO,GAAG,IAAI,MACpC,OAAO,GAAG,GAAG,YAAY,GAAG;QAG9B,8EAA8E;QAC9E,IAAI,UAAU,YAAY,UAAU,aAAa,UAAU,gBACzD,OAAO,MAAM,GAAG;QAElB,OAAO;IACT;IAEA,kCAAkC,GAClC,MAAM,KAAsB,EAAkB;QAC5C,IAAI,SAAS,IAAI,CAAC,IAAI;QACtB,aAAa;QACb,MAAM,CAAC,MAAM,GAAG;QAChB,IAAI,UAAU,QACZ,OAAO,GAAG,GAAG;QAGf,uEAAuE;QACvE,OAAO,MAAM,GAAG;QAChB,OAAO;IACT;IAEA,sGAAsG,GACtG,MAAM,KAAsB,EAAE,MAAc,EAAE,WAAsB,EAAE,eAAkC,EAAkB;QACxH,IAAI,MAAM,IAAI,CAAC,IAAI;QAEnB,4CAA4C;QAC5C,IAAI,GAAG,CAAC,MAAM,IAAI,QAAQ,UAAU,eAAe,UAAU,OAAO;YAClE,IAAI,UAAU,UAAU,UAAU,aAAa;gBAC7C,IAAI,CAAC,WAAW,KAAK,GAAG,kCAAY,YAAY,IAAI,EAAE,IAAI,CAAC,SAAS;gBACpE,IAAI,SAAS,GAAG;gBAChB,IAAI,IAAI,GAAG;YACb,OACE,GAAG,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM;YAEjC,IAAI,UAAU,UAAU,IAAI,GAAG,IAAI,MACjC,IAAI,GAAG,GAAG,YAAY,GAAG;YAG3B,OAAO;QACT;QAEA,OAAQ;YACN,KAAK;gBAAO;oBACV,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO;oBAChC,IAAI,QAAQ,KAAK,OAAO,CAAC,IAAI,GAAG;oBAChC,QAAQ,iCAAW,OAAO,QAAQ,GAAG,KAAK,MAAM,GAAG;oBACnD,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM;oBACrB;gBACF;YACA,KAAK;gBAAQ;oBACX,wFAAwF;oBACxF,IAAI,OAAO,IAAI,CAAA,GAAA,yCAAW,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,IAAI,YAAY,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,YAAY,IAAI,EAAE,IAAI,CAAC,KAAK,IAAI,GAAG,IAAI,CAAC,GAAG,IAAI;oBACpI,OAAO,KAAK,KAAK,CAAC,OAAO,QAAQ;wBAAC,OAAO,UAAU;oBAAM;oBACzD,IAAI,GAAG,GAAG,KAAK,GAAG;oBAClB,IAAI,IAAI,GAAG,KAAK,IAAI;oBACpB;gBACF;YACA,KAAK;gBACH,IAAI,KAAK,GAAG,iCAAW,IAAI,KAAK,IAAI,GAAG,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,sBAAsB;gBACtF;YACF,KAAK;gBACH,oEAAoE;gBACpE,IAAI,GAAG,GAAG,iCAAW,IAAI,GAAG,IAAI,GAAG,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,qBAAqB;gBACjF;YACF,KAAK;gBAAQ;oBACX,4HAA4H;oBAC5H,sCAAsC;oBACtC,IAAI,mBAAmB,gBAAgB,IAAI,CAAC,CAAA,IAAK;4BAAC;4BAAQ;4BAAS;yBAAM,CAAC,QAAQ,CAAC;oBACnF,IAAI,cAAc,eAAgB,CAAA,CAAC,oBAAqB,IAAI,IAAI,IAAI,QAAQ,IAAI,KAAK,IAAI,QAAQ,IAAI,GAAG,IAAI,IAAI,GAAI;wBAClH,IAAI,OAAO,IAAI,CAAC,OAAO,CAAC;wBACxB,OAAO,KAAK,KAAK,CAAC,QAAQ,QAAQ;4BAAC,WAAW,IAAI,CAAC,SAAS,KAAK,QAAQ,KAAK;4BAAI,OAAO;wBAAK;wBAC9F,IAAI,CAAC,WAAW,aAAa,GAAG,kCAAY,KAAK,IAAI,EAAE,IAAI,CAAC,SAAS;wBACrE,IAAI,IAAI,GAAG;wBACX,IAAI,SAAS,GAAG;wBAChB,IAAI,MAAM,GAAG,KAAK,MAAM;oBAC1B,OAAO;wBACL,IAAI,QAAQ,IAAI,IAAI,IAAI;wBACxB,IAAI,SAAS,IAAI,CAAC,gBAAgB,CAAC;wBACnC,IAAI,IAAI,GAAG,iCAAW,OAAO,QAAQ,OAAO,QAAQ,EAAE,OAAO,QAAQ;wBACrE,IAAI,IAAI,SAAS,IAAI,QAAQ,UAAU,aACrC,IAAI,SAAS,GAAG,kCAAY,YAAY,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE;oBAEpE;oBACA;gBACF;YACA,KAAK;gBACH,IAAI,SAAS,GAAG,iCAAW,IAAI,SAAS,IAAI,GAAG,QAAQ,GAAG;gBAC1D;YACF,KAAK;gBACH,IAAI,MAAM,GAAG,iCAAW,IAAI,MAAM,IAAI,GAAG,QAAQ,GAAG,IAAI;gBACxD;YACF,KAAK;gBACH,IAAI,MAAM,GAAG,iCAAW,IAAI,MAAM,IAAI,GAAG,QAAQ,GAAG,IAAI;gBACxD;QACJ;QAEA,OAAO;IACT;IAEA,sGAAsG,GACtG,QAAQ,KAAgB,EAAa;QACnC,IAAI,UAAU,OAAO;YACnB,IAAI,OAAO,IAAI,CAAC,IAAI;YACpB,IAAI,QAAQ,MACV,OAAO,oCAAc,MAAM,IAAI,CAAC,SAAS,IAAI,GAAG,IAAI,CAAC,SAAS;iBACzD,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,IAAI,CAAC,SAAS,KAAK,OACxD,OAAO,IAAI,CAAC,SAAS,KAAK,IAAI,KAAK;YAGrC,IAAI,MAAM,MAAM,GAAG,CAAC;gBAClB,KAAK,IAAI,CAAC,GAAG,IAAI,MAAM,GAAG;gBAC1B,MAAM,IAAI,CAAC,IAAI,IAAI,MAAM,IAAI;gBAC7B,OAAO,IAAI,CAAC,KAAK,IAAI,MAAM,KAAK;gBAChC,KAAK,IAAI,CAAC,GAAG,IAAI,MAAM,GAAG;gBAC1B,MAAM,QAAQ,MAAM,IAAI;gBACxB,QAAQ,IAAI,CAAC,MAAM,IAAI,MAAM,MAAM;gBACnC,QAAQ,IAAI,CAAC,MAAM,IAAI,MAAM,MAAM;gBACnC,aAAa,IAAI,CAAC,WAAW,IAAI,MAAM,WAAW;YACpD;YAEA,IAAI,YAAY,OAAO,IAAI,CAAC,MAAM,IAAI,QAAQ,IAAI,MAAM,KAAK,IAAI,CAAC,MAAM,EACtE,MAAM,IAAI,GAAG,CAAC;gBAAC,cAAc,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM;YAAA;YAGvD,OAAO;QACT,OACE,OAAO,MAAM,GAAG,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,IAAI,MAAM,GAAG;YAC1B,MAAM,IAAI,CAAC,IAAI,IAAI,MAAM,IAAI;YAC7B,OAAO,IAAI,CAAC,KAAK,IAAI,MAAM,KAAK;YAChC,KAAK,IAAI,CAAC,GAAG,IAAI,MAAM,GAAG;QAC5B;IAEJ;IAEA,iBAAiB,IAAY,EAA0E;QACrG,OAAQ;YACN,KAAK;gBAAO;oBACV,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO;oBAChC,OAAO;wBACL,OAAO,IAAI,CAAC,GAAG,IAAI,OAAO,KAAK,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,KAAK,MAAM,GAAG;wBACjE,UAAU;wBACV,UAAU,KAAK,MAAM,GAAG;oBAC1B;gBACF;YACA,KAAK;gBACH,OAAO;oBACL,OAAO,IAAI,CAAC,IAAI;oBAChB,UAAU;oBACV,UAAU;gBACZ;YACF,KAAK;gBACH,OAAO;oBACL,OAAO,IAAI,CAAC,KAAK;oBACjB,UAAU;oBACV,UAAU,IAAI,CAAC,QAAQ,CAAC,sBAAsB;gBAChD;YACF,KAAK;gBACH,OAAO;oBACL,OAAO,IAAI,CAAC,GAAG;oBACf,UAAU;oBACV,UAAU,IAAI,CAAC,QAAQ,CAAC,qBAAqB;gBAC/C;YACF,KAAK;gBACH,OAAO;oBACL,OAAO,IAAI,CAAC,SAAS;oBACrB,UAAU;oBACV,UAAU;gBACZ;YAEF,KAAK;gBAAQ;oBACX,IAAI,WAAW;oBACf,IAAI,WAAW;oBACf,IAAI,IAAI,CAAC,SAAS,KAAK,OAAO;wBAC5B,WAAW;wBACX,WAAW;oBACb,OAAO,IAAI,IAAI,CAAC,SAAS,KAAK,OAAO;wBACnC,WAAW;wBACX,WAAW;oBACb;oBAEA,OAAO;wBACL,OAAO,IAAI,CAAC,IAAI;kCAChB;kCACA;oBACF;gBACF;YACA,KAAK;gBACH,OAAO;oBACL,OAAO,IAAI,CAAC,MAAM;oBAClB,UAAU;oBACV,UAAU;gBACZ;YACF,KAAK;gBACH,OAAO;oBACL,OAAO,IAAI,CAAC,MAAM;oBAClB,UAAU;oBACV,UAAU;gBACZ;QACJ;IACF;AACF;AAEA,SAAS,iCAAW,KAAa,EAAE,MAAc,EAAE,GAAW,EAAE,GAAW,EAAE,QAAQ,KAAK;IACxF,IAAI,OAAO;QACT,SAAS,KAAK,IAAI,CAAC;QAEnB,IAAI,QAAQ,KACV,QAAQ;QAGV,IAAI,MAAM,KAAK,GAAG,CAAC;QACnB,IAAI,SAAS,GACX,QAAQ,KAAK,IAAI,CAAC,QAAQ,OAAO;aAEjC,QAAQ,KAAK,KAAK,CAAC,QAAQ,OAAO;QAGpC,IAAI,QAAQ,KACV,QAAQ;IAEZ,OAAO;QACL,SAAS;QACT,IAAI,QAAQ,KACV,QAAQ,MAAO,CAAA,MAAM,QAAQ,CAAA;aACxB,IAAI,QAAQ,KACjB,QAAQ,MAAO,CAAA,QAAQ,MAAM,CAAA;IAEjC;IAEA,OAAO;AACT;AAEA,SAAS,kCAAY,IAAY,EAAE,SAAoB;IACrD,IAAI,YAA2B,QAAQ,KAAK,IAAI;IAChD,OAAQ;QACN,KAAK;YACH,kDAAkD;YAClD,IAAI,QAAQ,IACV,QAAQ;YAEV;QACF,KAAK;YACH,qDAAqD;YACrD,IAAI,SAAS,GACX,OAAO;iBACF,IAAI,OAAO,IAChB,QAAQ;YAEV;QACF,KAAK;YACH,kCAAkC;YAClC,YAAY;YACZ;QACF,KAAK;YACH,+EAA+E;YAC/E,QAAQ;YACR,YAAY;IAChB;IAEA,OAAO;QAAC;QAAW;KAAK;AAC1B;AAEA,SAAS,oCAAc,IAAY,EAAE,SAAiB,EAAE,SAAoB;IAC1E,OAAQ;QACN,KAAK;YACH,IAAI,cAAc,GAChB,QAAQ;YAEV;QACF,KAAK;YACH,IAAI,SAAS,IACX,OAAO;YAET,IAAI,cAAc,GAChB,QAAQ;YAEV;QACF,KAAK;YACH,QAAQ;YACR;IACJ;IAEA,OAAO;AACT","sources":["packages/react-stately/src/datepicker/IncompleteDate.ts"],"sourcesContent":["/\n Copyright 2026 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n \n Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n /\n\nimport {AnyDateTime, Calendar, CalendarDate, ZonedDateTime} from '@internationalized/date';\nimport {DateSegmentType} from './useDateFieldState';\nimport {DateValue} from './types';\n\ntype HourCycle = 'h12' \| 'h11' \| 'h23' \| 'h24';\n\n/\n This class represents a date that is incomplete or otherwise invalid as a result of user editing.\n * For example, it can represent temporary dates such as February 31st if the user edits the day before the month.\n * Times are represented according to an hour cycle rather than always in 24 hour time. This enables the user to adjust\n * the day period (e.g. am/pm) independently from the hour.\n /\nexport class IncompleteDate {\n calendar: Calendar;\n era: string \| null;\n year: number \| null;\n month: number \| null;\n day: number \| null;\n hour: number \| null;\n hourCycle: HourCycle;\n dayPeriod: number \| null;\n minute: number \| null;\n second: number \| null;\n millisecond: number \| null;\n offset: number \| null;\n\n constructor(calendar: Calendar, hourCycle: HourCycle, dateValue?: Partial<Omit<AnyDateTime, 'copy'>> \| null) {\n this.era = dateValue?.era ?? null;\n this.calendar = calendar;\n this.year = dateValue?.year ?? null;\n this.month = dateValue?.month ?? null;\n this.day = dateValue?.day ?? null;\n this.hour = dateValue?.hour ?? null;\n this.hourCycle = hourCycle;\n this.dayPeriod = null;\n this.minute = dateValue?.minute ?? null;\n this.second = dateValue?.second ?? null;\n this.millisecond = dateValue?.millisecond ?? null;\n this.offset = 'offset' in (dateValue ?? {}) ? (dateValue as any).offset : null;\n\n // Convert the hour from 24 hour time to the given hour cycle.\n if (this.hour != null) {\n let [dayPeriod, hour] = toHourCycle(this.hour, hourCycle);\n this.dayPeriod = dayPeriod;\n this.hour = hour;\n }\n }\n\n copy(): IncompleteDate {\n let res = new IncompleteDate(this.calendar, this.hourCycle);\n res.era = this.era;\n res.year = this.year;\n res.month = this.month;\n res.day = this.day;\n res.hour = this.hour;\n res.dayPeriod = this.dayPeriod;\n res.minute = this.minute;\n res.second = this.second;\n res.millisecond = this.millisecond;\n res.offset = this.offset;\n return res;\n }\n\n /* Checks whether all the specified segments have a value. /\n isComplete(segments: DateSegmentType[]) {\n return segments.every(segment => this[segment] != null);\n }\n\n /* Checks whether the given date value matches this value for the specified segments. /\n validate(dt: DateValue, segments: DateSegmentType[]) {\n return segments.every(segment => {\n if ((segment === 'hour' \|\| segment === 'dayPeriod') && 'hour' in dt) {\n let [dayPeriod, hour] = toHourCycle(dt.hour, this.hourCycle);\n return this.dayPeriod === dayPeriod && this.hour === hour;\n }\n return this[segment] === dt[segment];\n });\n }\n\n /* Checks if the date is empty (i.e. all specified segments are null). /\n isCleared(segments: DateSegmentType[]): boolean {\n return segments.every(segment => this[segment] === null);\n }\n\n /* Sets the given field. /\n set(field: DateSegmentType, value: number \| string, placeholder: DateValue): IncompleteDate {\n let result = this.copy();\n result[field] = value;\n if (field === 'hour' && result.dayPeriod == null && 'hour' in placeholder) {\n result.dayPeriod = toHourCycle(placeholder.hour, this.hourCycle)[0];\n }\n if (field === 'year' && result.era == null) {\n result.era = placeholder.era;\n }\n\n // clear offset when a date/time field changes since it may no longer be valid\n if (field !== 'second' && field !== 'literal' && field !== 'timeZoneName') {\n result.offset = null;\n }\n return result;\n }\n\n /* Sets the given field to null. /\n clear(field: DateSegmentType): IncompleteDate {\n let result = this.copy();\n // @ts-ignore\n result[field] = null;\n if (field === 'year') {\n result.era = null;\n }\n\n // clear offset when a field is cleared since it may no longer be valid\n result.offset = null;\n return result;\n }\n\n /* Increments or decrements the given field. If it is null, then it is set to the placeholder value. /\n cycle(field: DateSegmentType, amount: number, placeholder: DateValue, displaySegments: DateSegmentType[]): IncompleteDate {\n let res = this.copy();\n\n // If field is null, default to placeholder.\n if (res[field] == null && field !== 'dayPeriod' && field !== 'era') {\n if (field === 'hour' && 'hour' in placeholder) {\n let [dayPeriod, hour] = toHourCycle(placeholder.hour, this.hourCycle);\n res.dayPeriod = dayPeriod;\n res.hour = hour;\n } else {\n res[field] = placeholder[field];\n }\n if (field === 'year' && res.era == null) {\n res.era = placeholder.era;\n }\n\n return res;\n }\n\n switch (field) {\n case 'era': {\n let eras = this.calendar.getEras();\n let index = eras.indexOf(res.era!);\n index = cycleValue(index, amount, 0, eras.length - 1);\n res.era = eras[index];\n break;\n }\n case 'year': {\n // Use CalendarDate to cycle so that we update the era when going between 1 AD and 1 BC.\n let date = new CalendarDate(this.calendar, this.era ?? placeholder.era, this.year ?? placeholder.year, this.month ?? 1, this.day ?? 1);\n date = date.cycle(field, amount, {round: field === 'year'});\n res.era = date.era;\n res.year = date.year;\n break;\n }\n case 'month':\n res.month = cycleValue(res.month ?? 1, amount, 1, this.calendar.getMaximumMonthsInYear());\n break;\n case 'day':\n // Allow incrementing up to the maximum number of days in any month.\n res.day = cycleValue(res.day ?? 1, amount, 1, this.calendar.getMaximumDaysInMonth());\n break;\n case 'hour': {\n // if date is fully defined or it is just a time field, and we have a time zone, use toValue to get a ZonedDateTime to cycle\n // so DST fallback is properly handled\n let hasDateSegements = displaySegments.some(s => ['year', 'month', 'day'].includes(s));\n if ('timeZone' in placeholder && (!hasDateSegements \|\| (res.year != null && res.month != null && res.day != null))) {\n let date = this.toValue(placeholder) as ZonedDateTime;\n date = date.cycle('hour', amount, {hourCycle: this.hourCycle === 'h12' ? 12 : 24, round: false});\n let [dayPeriod, adjustedHour] = toHourCycle(date.hour, this.hourCycle);\n res.hour = adjustedHour;\n res.dayPeriod = dayPeriod;\n res.offset = date.offset;\n } else {\n let hours = res.hour ?? 0;\n let limits = this.getSegmentLimits('hour')!;\n res.hour = cycleValue(hours, amount, limits.minValue, limits.maxValue);\n if (res.dayPeriod == null && 'hour' in placeholder) {\n res.dayPeriod = toHourCycle(placeholder.hour, this.hourCycle)[0];\n }\n }\n break;\n }\n case 'dayPeriod':\n res.dayPeriod = cycleValue(res.dayPeriod ?? 0, amount, 0, 1);\n break;\n case 'minute':\n res.minute = cycleValue(res.minute ?? 0, amount, 0, 59, true);\n break;\n case 'second':\n res.second = cycleValue(res.second ?? 0, amount, 0, 59, true);\n break;\n }\n\n return res;\n }\n\n /* Converts the incomplete date to a full date value, using the provided value for any unset fields. /\n toValue(value: DateValue): DateValue {\n if ('hour' in value) {\n let hour = this.hour;\n if (hour != null) {\n hour = fromHourCycle(hour, this.dayPeriod ?? 0, this.hourCycle);\n } else if (this.hourCycle === 'h12' \|\| this.hourCycle === 'h11') {\n hour = this.dayPeriod === 1 ? 12 : 0;\n }\n\n let res = value.set({\n era: this.era ?? value.era,\n year: this.year ?? value.year,\n month: this.month ?? value.month,\n day: this.day ?? value.day,\n hour: hour ?? value.hour,\n minute: this.minute ?? value.minute,\n second: this.second ?? value.second,\n millisecond: this.millisecond ?? value.millisecond\n });\n\n if ('offset' in res && this.offset != null && res.offset !== this.offset) {\n res = res.add({milliseconds: res.offset - this.offset});\n }\n\n return res;\n } else {\n return value.set({\n era: this.era ?? value.era,\n year: this.year ?? value.year,\n month: this.month ?? value.month,\n day: this.day ?? value.day\n });\n }\n }\n\n getSegmentLimits(type: string): {value: number \| null, minValue: number, maxValue: number} \| undefined {\n switch (type) {\n case 'era': {\n let eras = this.calendar.getEras();\n return {\n value: this.era != null ? eras.indexOf(this.era) : eras.length - 1,\n minValue: 0,\n maxValue: eras.length - 1\n };\n }\n case 'year':\n return {\n value: this.year,\n minValue: 1,\n maxValue: 9999\n };\n case 'month':\n return {\n value: this.month,\n minValue: 1,\n maxValue: this.calendar.getMaximumMonthsInYear()\n };\n case 'day':\n return {\n value: this.day,\n minValue: 1,\n maxValue: this.calendar.getMaximumDaysInMonth()\n };\n case 'dayPeriod': {\n return {\n value: this.dayPeriod,\n minValue: 0,\n maxValue: 1\n };\n }\n case 'hour': {\n let minValue = 0;\n let maxValue = 23;\n if (this.hourCycle === 'h12') {\n minValue = 1;\n maxValue = 12;\n } else if (this.hourCycle === 'h11') {\n minValue = 0;\n maxValue = 11;\n }\n\n return {\n value: this.hour,\n minValue,\n maxValue\n };\n }\n case 'minute':\n return {\n value: this.minute,\n minValue: 0,\n maxValue: 59\n };\n case 'second':\n return {\n value: this.second,\n minValue: 0,\n maxValue: 59\n };\n }\n }\n}\n\nfunction cycleValue(value: number, amount: number, min: number, max: number, round = false) {\n if (round) {\n value += Math.sign(amount);\n\n if (value < min) {\n value = max;\n }\n\n let div = Math.abs(amount);\n if (amount > 0) {\n value = Math.ceil(value / div) div;\n } else {\n value = Math.floor(value / div) * div;\n }\n\n if (value > max) {\n value = min;\n }\n } else {\n value += amount;\n if (value < min) {\n value = max - (min - value - 1);\n } else if (value > max) {\n value = min + (value - max - 1);\n }\n }\n\n return value;\n}\n\nfunction toHourCycle(hour: number, hourCycle: HourCycle): [number \| null, number] {\n let dayPeriod: number \| null = hour >= 12 ? 1 : 0;\n switch (hourCycle) {\n case 'h11':\n // Hours are numbered from 0 to 11. Used in Japan.\n if (hour >= 12) {\n hour -= 12;\n }\n break;\n case 'h12':\n // Hours are numbered from 12 (representing 0) to 11.\n if (hour === 0) {\n hour = 12;\n } else if (hour > 12) {\n hour -= 12;\n }\n break;\n case 'h23':\n // 24 hour time, numbered 0 to 23.\n dayPeriod = null;\n break;\n case 'h24':\n // 24 hour time numbered 24 to 23. Unused but supported by Intl.DateTimeFormat.\n hour += 1;\n dayPeriod = null;\n }\n\n return [dayPeriod, hour];\n}\n\nfunction fromHourCycle(hour: number, dayPeriod: number, hourCycle: HourCycle): number {\n switch (hourCycle) {\n case 'h11':\n if (dayPeriod === 1) {\n hour += 12;\n }\n break;\n case 'h12':\n if (hour === 12) {\n hour = 0;\n }\n if (dayPeriod === 1) {\n hour += 12;\n }\n break;\n case 'h24':\n hour -= 1;\n break;\n }\n\n return hour;\n}\n"],"names":[],"version":3,"file":"IncompleteDate.cjs.map"}
1	+ {"mappings":";;;;;;;;AAAA;;;;;;;;;;CAUC;AAcM,MAAM;IAcX,YACE,QAAkB,EAClB,SAAoB,EACpB,SAAqD,CACrD;QACA,IAAI,CAAC,GAAG,GAAG,WAAW,OAAO;QAC7B,IAAI,CAAC,QAAQ,GAAG;QAChB,IAAI,CAAC,IAAI,GAAG,WAAW,QAAQ;QAC/B,IAAI,CAAC,KAAK,GAAG,WAAW,SAAS;QACjC,IAAI,CAAC,GAAG,GAAG,WAAW,OAAO;QAC7B,IAAI,CAAC,IAAI,GAAG,WAAW,QAAQ;QAC/B,IAAI,CAAC,SAAS,GAAG;QACjB,IAAI,CAAC,SAAS,GAAG;QACjB,IAAI,CAAC,MAAM,GAAG,WAAW,UAAU;QACnC,IAAI,CAAC,MAAM,GAAG,WAAW,UAAU;QACnC,IAAI,CAAC,WAAW,GAAG,WAAW,eAAe;QAC7C,IAAI,CAAC,MAAM,GAAG,YAAa,CAAA,aAAa,CAAC,CAAA,IAAK,AAAC,UAAkB,MAAM,GAAG;QAE1E,8DAA8D;QAC9D,IAAI,IAAI,CAAC,IAAI,IAAI,MAAM;YACrB,IAAI,CAAC,WAAW,KAAK,GAAG,kCAAY,IAAI,CAAC,IAAI,EAAE;YAC/C,IAAI,CAAC,SAAS,GAAG;YACjB,IAAI,CAAC,IAAI,GAAG;QACd;IACF;IAEA,OAAuB;QACrB,IAAI,MAAM,IAAI,0CAAe,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS;QAC1D,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG;QAClB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI;QACpB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK;QACtB,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG;QAClB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI;QACpB,IAAI,SAAS,GAAG,IAAI,CAAC,SAAS;QAC9B,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM;QACxB,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM;QACxB,IAAI,WAAW,GAAG,IAAI,CAAC,WAAW;QAClC,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM;QACxB,OAAO;IACT;IAEA,4DAA4D,GAC5D,WAAW,QAA2B,EAAE;QACtC,OAAO,SAAS,KAAK,CAAC,CAAA,UAAW,IAAI,CAAC,QAAQ,IAAI;IACpD;IAEA,uFAAuF,GACvF,SAAS,EAAa,EAAE,QAA2B,EAAE;QACnD,OAAO,SAAS,KAAK,CAAC,CAAA;YACpB,IAAI,AAAC,CAAA,YAAY,UAAU,YAAY,WAAU,KAAM,UAAU,IAAI;gBACnE,IAAI,CAAC,WAAW,KAAK,GAAG,kCAAY,GAAG,IAAI,EAAE,IAAI,CAAC,SAAS;gBAC3D,OAAO,IAAI,CAAC,SAAS,KAAK,aAAa,IAAI,CAAC,IAAI,KAAK;YACvD;YACA,OAAO,IAAI,CAAC,QAAQ,KAAK,EAAE,CAAC,QAAQ;QACtC;IACF;IAEA,wEAAwE,GACxE,UAAU,QAA2B,EAAW;QAC9C,OAAO,SAAS,KAAK,CAAC,CAAA,UAAW,IAAI,CAAC,QAAQ,KAAK;IACrD;IAEA,0BAA0B,GAC1B,IAAI,KAAsB,EAAE,KAAsB,EAAE,WAAsB,EAAkB;QAC1F,IAAI,SAAS,IAAI,CAAC,IAAI;QACtB,MAAM,CAAC,MAAM,GAAG;QAChB,IAAI,UAAU,UAAU,OAAO,SAAS,IAAI,QAAQ,UAAU,aAC5D,OAAO,SAAS,GAAG,kCAAY,YAAY,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE;QAErE,IAAI,UAAU,UAAU,OAAO,GAAG,IAAI,MACpC,OAAO,GAAG,GAAG,YAAY,GAAG;QAG9B,8EAA8E;QAC9E,IAAI,UAAU,YAAY,UAAU,aAAa,UAAU,gBACzD,OAAO,MAAM,GAAG;QAElB,OAAO;IACT;IAEA,kCAAkC,GAClC,MAAM,KAAsB,EAAkB;QAC5C,IAAI,SAAS,IAAI,CAAC,IAAI;QACtB,aAAa;QACb,MAAM,CAAC,MAAM,GAAG;QAChB,IAAI,UAAU,QACZ,OAAO,GAAG,GAAG;QAGf,uEAAuE;QACvE,OAAO,MAAM,GAAG;QAChB,OAAO;IACT;IAEA;;;GAGC,GACD,MACE,KAAsB,EACtB,MAAc,EACd,WAAsB,EACtB,eAAkC,EAClB;QAChB,IAAI,MAAM,IAAI,CAAC,IAAI;QAEnB,4CAA4C;QAC5C,IAAI,GAAG,CAAC,MAAM,IAAI,QAAQ,UAAU,eAAe,UAAU,OAAO;YAClE,IAAI,UAAU,UAAU,UAAU,aAAa;gBAC7C,IAAI,CAAC,WAAW,KAAK,GAAG,kCAAY,YAAY,IAAI,EAAE,IAAI,CAAC,SAAS;gBACpE,IAAI,SAAS,GAAG;gBAChB,IAAI,IAAI,GAAG;YACb,OACE,GAAG,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM;YAEjC,IAAI,UAAU,UAAU,IAAI,GAAG,IAAI,MACjC,IAAI,GAAG,GAAG,YAAY,GAAG;YAG3B,OAAO;QACT;QAEA,OAAQ;YACN,KAAK;gBAAO;oBACV,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO;oBAChC,IAAI,QAAQ,KAAK,OAAO,CAAC,IAAI,GAAG;oBAChC,QAAQ,iCAAW,OAAO,QAAQ,GAAG,KAAK,MAAM,GAAG;oBACnD,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM;oBACrB;gBACF;YACA,KAAK;gBAAQ;oBACX,wFAAwF;oBACxF,IAAI,OAAO,IAAI,CAAA,GAAA,yCAAW,EACxB,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,GAAG,IAAI,YAAY,GAAG,EAC3B,IAAI,CAAC,IAAI,IAAI,YAAY,IAAI,EAC7B,IAAI,CAAC,KAAK,IAAI,GACd,IAAI,CAAC,GAAG,IAAI;oBAEd,OAAO,KAAK,KAAK,CAAC,OAAO,QAAQ;wBAAC,OAAO,UAAU;oBAAM;oBACzD,IAAI,GAAG,GAAG,KAAK,GAAG;oBAClB,IAAI,IAAI,GAAG,KAAK,IAAI;oBACpB;gBACF;YACA,KAAK;gBACH,IAAI,KAAK,GAAG,iCAAW,IAAI,KAAK,IAAI,GAAG,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,sBAAsB;gBACtF;YACF,KAAK;gBACH,oEAAoE;gBACpE,IAAI,GAAG,GAAG,iCAAW,IAAI,GAAG,IAAI,GAAG,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,qBAAqB;gBACjF;YACF,KAAK;gBAAQ;oBACX,4HAA4H;oBAC5H,sCAAsC;oBACtC,IAAI,mBAAmB,gBAAgB,IAAI,CAAC,CAAA,IAAK;4BAAC;4BAAQ;4BAAS;yBAAM,CAAC,QAAQ,CAAC;oBACnF,IACE,cAAc,eACb,CAAA,CAAC,oBAAqB,IAAI,IAAI,IAAI,QAAQ,IAAI,KAAK,IAAI,QAAQ,IAAI,GAAG,IAAI,IAAI,GAC/E;wBACA,IAAI,OAAO,IAAI,CAAC,OAAO,CAAC;wBACxB,OAAO,KAAK,KAAK,CAAC,QAAQ,QAAQ;4BAChC,WAAW,IAAI,CAAC,SAAS,KAAK,QAAQ,KAAK;4BAC3C,OAAO;wBACT;wBACA,IAAI,CAAC,WAAW,aAAa,GAAG,kCAAY,KAAK,IAAI,EAAE,IAAI,CAAC,SAAS;wBACrE,IAAI,IAAI,GAAG;wBACX,IAAI,SAAS,GAAG;wBAChB,IAAI,MAAM,GAAG,KAAK,MAAM;oBAC1B,OAAO;wBACL,IAAI,QAAQ,IAAI,IAAI,IAAI;wBACxB,IAAI,SAAS,IAAI,CAAC,gBAAgB,CAAC;wBACnC,IAAI,IAAI,GAAG,iCAAW,OAAO,QAAQ,OAAO,QAAQ,EAAE,OAAO,QAAQ;wBACrE,IAAI,IAAI,SAAS,IAAI,QAAQ,UAAU,aACrC,IAAI,SAAS,GAAG,kCAAY,YAAY,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE;oBAEpE;oBACA;gBACF;YACA,KAAK;gBACH,IAAI,SAAS,GAAG,iCAAW,IAAI,SAAS,IAAI,GAAG,QAAQ,GAAG;gBAC1D;YACF,KAAK;gBACH,IAAI,MAAM,GAAG,iCAAW,IAAI,MAAM,IAAI,GAAG,QAAQ,GAAG,IAAI;gBACxD;YACF,KAAK;gBACH,IAAI,MAAM,GAAG,iCAAW,IAAI,MAAM,IAAI,GAAG,QAAQ,GAAG,IAAI;gBACxD;QACJ;QAEA,OAAO;IACT;IAEA;;;GAGC,GACD,QAAQ,KAAgB,EAAa;QACnC,IAAI,UAAU,OAAO;YACnB,IAAI,OAAO,IAAI,CAAC,IAAI;YACpB,IAAI,QAAQ,MACV,OAAO,oCAAc,MAAM,IAAI,CAAC,SAAS,IAAI,GAAG,IAAI,CAAC,SAAS;iBACzD,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,IAAI,CAAC,SAAS,KAAK,OACxD,OAAO,IAAI,CAAC,SAAS,KAAK,IAAI,KAAK;YAGrC,IAAI,MAAM,MAAM,GAAG,CAAC;gBAClB,KAAK,IAAI,CAAC,GAAG,IAAI,MAAM,GAAG;gBAC1B,MAAM,IAAI,CAAC,IAAI,IAAI,MAAM,IAAI;gBAC7B,OAAO,IAAI,CAAC,KAAK,IAAI,MAAM,KAAK;gBAChC,KAAK,IAAI,CAAC,GAAG,IAAI,MAAM,GAAG;gBAC1B,MAAM,QAAQ,MAAM,IAAI;gBACxB,QAAQ,IAAI,CAAC,MAAM,IAAI,MAAM,MAAM;gBACnC,QAAQ,IAAI,CAAC,MAAM,IAAI,MAAM,MAAM;gBACnC,aAAa,IAAI,CAAC,WAAW,IAAI,MAAM,WAAW;YACpD;YAEA,IAAI,YAAY,OAAO,IAAI,CAAC,MAAM,IAAI,QAAQ,IAAI,MAAM,KAAK,IAAI,CAAC,MAAM,EACtE,MAAM,IAAI,GAAG,CAAC;gBAAC,cAAc,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM;YAAA;YAGvD,OAAO;QACT,OACE,OAAO,MAAM,GAAG,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,IAAI,MAAM,GAAG;YAC1B,MAAM,IAAI,CAAC,IAAI,IAAI,MAAM,IAAI;YAC7B,OAAO,IAAI,CAAC,KAAK,IAAI,MAAM,KAAK;YAChC,KAAK,IAAI,CAAC,GAAG,IAAI,MAAM,GAAG;QAC5B;IAEJ;IAEA,iBACE,IAAY,EAC4D;QACxE,OAAQ;YACN,KAAK;gBAAO;oBACV,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO;oBAChC,OAAO;wBACL,OAAO,IAAI,CAAC,GAAG,IAAI,OAAO,KAAK,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,KAAK,MAAM,GAAG;wBACjE,UAAU;wBACV,UAAU,KAAK,MAAM,GAAG;oBAC1B;gBACF;YACA,KAAK;gBACH,OAAO;oBACL,OAAO,IAAI,CAAC,IAAI;oBAChB,UAAU;oBACV,UAAU;gBACZ;YACF,KAAK;gBACH,OAAO;oBACL,OAAO,IAAI,CAAC,KAAK;oBACjB,UAAU;oBACV,UAAU,IAAI,CAAC,QAAQ,CAAC,sBAAsB;gBAChD;YACF,KAAK;gBACH,OAAO;oBACL,OAAO,IAAI,CAAC,GAAG;oBACf,UAAU;oBACV,UAAU,IAAI,CAAC,QAAQ,CAAC,qBAAqB;gBAC/C;YACF,KAAK;gBACH,OAAO;oBACL,OAAO,IAAI,CAAC,SAAS;oBACrB,UAAU;oBACV,UAAU;gBACZ;YAEF,KAAK;gBAAQ;oBACX,IAAI,WAAW;oBACf,IAAI,WAAW;oBACf,IAAI,IAAI,CAAC,SAAS,KAAK,OAAO;wBAC5B,WAAW;wBACX,WAAW;oBACb,OAAO,IAAI,IAAI,CAAC,SAAS,KAAK,OAAO;wBACnC,WAAW;wBACX,WAAW;oBACb;oBAEA,OAAO;wBACL,OAAO,IAAI,CAAC,IAAI;kCAChB;kCACA;oBACF;gBACF;YACA,KAAK;gBACH,OAAO;oBACL,OAAO,IAAI,CAAC,MAAM;oBAClB,UAAU;oBACV,UAAU;gBACZ;YACF,KAAK;gBACH,OAAO;oBACL,OAAO,IAAI,CAAC,MAAM;oBAClB,UAAU;oBACV,UAAU;gBACZ;QACJ;IACF;AACF;AAEA,SAAS,iCAAW,KAAa,EAAE,MAAc,EAAE,GAAW,EAAE,GAAW,EAAE,QAAQ,KAAK;IACxF,IAAI,OAAO;QACT,SAAS,KAAK,IAAI,CAAC;QAEnB,IAAI,QAAQ,KACV,QAAQ;QAGV,IAAI,MAAM,KAAK,GAAG,CAAC;QACnB,IAAI,SAAS,GACX,QAAQ,KAAK,IAAI,CAAC,QAAQ,OAAO;aAEjC,QAAQ,KAAK,KAAK,CAAC,QAAQ,OAAO;QAGpC,IAAI,QAAQ,KACV,QAAQ;IAEZ,OAAO;QACL,SAAS;QACT,IAAI,QAAQ,KACV,QAAQ,MAAO,CAAA,MAAM,QAAQ,CAAA;aACxB,IAAI,QAAQ,KACjB,QAAQ,MAAO,CAAA,QAAQ,MAAM,CAAA;IAEjC;IAEA,OAAO;AACT;AAEA,SAAS,kCAAY,IAAY,EAAE,SAAoB;IACrD,IAAI,YAA2B,QAAQ,KAAK,IAAI;IAChD,OAAQ;QACN,KAAK;YACH,kDAAkD;YAClD,IAAI,QAAQ,IACV,QAAQ;YAEV;QACF,KAAK;YACH,qDAAqD;YACrD,IAAI,SAAS,GACX,OAAO;iBACF,IAAI,OAAO,IAChB,QAAQ;YAEV;QACF,KAAK;YACH,kCAAkC;YAClC,YAAY;YACZ;QACF,KAAK;YACH,+EAA+E;YAC/E,QAAQ;YACR,YAAY;IAChB;IAEA,OAAO;QAAC;QAAW;KAAK;AAC1B;AAEA,SAAS,oCAAc,IAAY,EAAE,SAAiB,EAAE,SAAoB;IAC1E,OAAQ;QACN,KAAK;YACH,IAAI,cAAc,GAChB,QAAQ;YAEV;QACF,KAAK;YACH,IAAI,SAAS,IACX,OAAO;YAET,IAAI,cAAc,GAChB,QAAQ;YAEV;QACF,KAAK;YACH,QAAQ;YACR;IACJ;IAEA,OAAO;AACT","sources":["packages/react-stately/src/datepicker/IncompleteDate.ts"],"sourcesContent":["/\n Copyright 2026 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n \n Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n /\n\nimport {AnyDateTime, Calendar, CalendarDate, ZonedDateTime} from '@internationalized/date';\nimport {DateSegmentType} from './useDateFieldState';\nimport {DateValue} from './types';\n\ntype HourCycle = 'h12' \| 'h11' \| 'h23' \| 'h24';\n\n/\n This class represents a date that is incomplete or otherwise invalid as a result of user editing.\n * For example, it can represent temporary dates such as February 31st if the user edits the day\n * before the month. Times are represented according to an hour cycle rather than always in 24 hour\n * time. This enables the user to adjust the day period (e.g. am/pm) independently from the hour.\n /\nexport class IncompleteDate {\n calendar: Calendar;\n era: string \| null;\n year: number \| null;\n month: number \| null;\n day: number \| null;\n hour: number \| null;\n hourCycle: HourCycle;\n dayPeriod: number \| null;\n minute: number \| null;\n second: number \| null;\n millisecond: number \| null;\n offset: number \| null;\n\n constructor(\n calendar: Calendar,\n hourCycle: HourCycle,\n dateValue?: Partial<Omit<AnyDateTime, 'copy'>> \| null\n ) {\n this.era = dateValue?.era ?? null;\n this.calendar = calendar;\n this.year = dateValue?.year ?? null;\n this.month = dateValue?.month ?? null;\n this.day = dateValue?.day ?? null;\n this.hour = dateValue?.hour ?? null;\n this.hourCycle = hourCycle;\n this.dayPeriod = null;\n this.minute = dateValue?.minute ?? null;\n this.second = dateValue?.second ?? null;\n this.millisecond = dateValue?.millisecond ?? null;\n this.offset = 'offset' in (dateValue ?? {}) ? (dateValue as any).offset : null;\n\n // Convert the hour from 24 hour time to the given hour cycle.\n if (this.hour != null) {\n let [dayPeriod, hour] = toHourCycle(this.hour, hourCycle);\n this.dayPeriod = dayPeriod;\n this.hour = hour;\n }\n }\n\n copy(): IncompleteDate {\n let res = new IncompleteDate(this.calendar, this.hourCycle);\n res.era = this.era;\n res.year = this.year;\n res.month = this.month;\n res.day = this.day;\n res.hour = this.hour;\n res.dayPeriod = this.dayPeriod;\n res.minute = this.minute;\n res.second = this.second;\n res.millisecond = this.millisecond;\n res.offset = this.offset;\n return res;\n }\n\n /* Checks whether all the specified segments have a value. /\n isComplete(segments: DateSegmentType[]) {\n return segments.every(segment => this[segment] != null);\n }\n\n /* Checks whether the given date value matches this value for the specified segments. /\n validate(dt: DateValue, segments: DateSegmentType[]) {\n return segments.every(segment => {\n if ((segment === 'hour' \|\| segment === 'dayPeriod') && 'hour' in dt) {\n let [dayPeriod, hour] = toHourCycle(dt.hour, this.hourCycle);\n return this.dayPeriod === dayPeriod && this.hour === hour;\n }\n return this[segment] === dt[segment];\n });\n }\n\n /* Checks if the date is empty (i.e. all specified segments are null). /\n isCleared(segments: DateSegmentType[]): boolean {\n return segments.every(segment => this[segment] === null);\n }\n\n /* Sets the given field. /\n set(field: DateSegmentType, value: number \| string, placeholder: DateValue): IncompleteDate {\n let result = this.copy();\n result[field] = value;\n if (field === 'hour' && result.dayPeriod == null && 'hour' in placeholder) {\n result.dayPeriod = toHourCycle(placeholder.hour, this.hourCycle)[0];\n }\n if (field === 'year' && result.era == null) {\n result.era = placeholder.era;\n }\n\n // clear offset when a date/time field changes since it may no longer be valid\n if (field !== 'second' && field !== 'literal' && field !== 'timeZoneName') {\n result.offset = null;\n }\n return result;\n }\n\n /* Sets the given field to null. /\n clear(field: DateSegmentType): IncompleteDate {\n let result = this.copy();\n // @ts-ignore\n result[field] = null;\n if (field === 'year') {\n result.era = null;\n }\n\n // clear offset when a field is cleared since it may no longer be valid\n result.offset = null;\n return result;\n }\n\n /\n Increments or decrements the given field. If it is null, then it is set to the placeholder\n * value.\n /\n cycle(\n field: DateSegmentType,\n amount: number,\n placeholder: DateValue,\n displaySegments: DateSegmentType[]\n ): IncompleteDate {\n let res = this.copy();\n\n // If field is null, default to placeholder.\n if (res[field] == null && field !== 'dayPeriod' && field !== 'era') {\n if (field === 'hour' && 'hour' in placeholder) {\n let [dayPeriod, hour] = toHourCycle(placeholder.hour, this.hourCycle);\n res.dayPeriod = dayPeriod;\n res.hour = hour;\n } else {\n res[field] = placeholder[field];\n }\n if (field === 'year' && res.era == null) {\n res.era = placeholder.era;\n }\n\n return res;\n }\n\n switch (field) {\n case 'era': {\n let eras = this.calendar.getEras();\n let index = eras.indexOf(res.era!);\n index = cycleValue(index, amount, 0, eras.length - 1);\n res.era = eras[index];\n break;\n }\n case 'year': {\n // Use CalendarDate to cycle so that we update the era when going between 1 AD and 1 BC.\n let date = new CalendarDate(\n this.calendar,\n this.era ?? placeholder.era,\n this.year ?? placeholder.year,\n this.month ?? 1,\n this.day ?? 1\n );\n date = date.cycle(field, amount, {round: field === 'year'});\n res.era = date.era;\n res.year = date.year;\n break;\n }\n case 'month':\n res.month = cycleValue(res.month ?? 1, amount, 1, this.calendar.getMaximumMonthsInYear());\n break;\n case 'day':\n // Allow incrementing up to the maximum number of days in any month.\n res.day = cycleValue(res.day ?? 1, amount, 1, this.calendar.getMaximumDaysInMonth());\n break;\n case 'hour': {\n // if date is fully defined or it is just a time field, and we have a time zone, use toValue to get a ZonedDateTime to cycle\n // so DST fallback is properly handled\n let hasDateSegements = displaySegments.some(s => ['year', 'month', 'day'].includes(s));\n if (\n 'timeZone' in placeholder &&\n (!hasDateSegements \|\| (res.year != null && res.month != null && res.day != null))\n ) {\n let date = this.toValue(placeholder) as ZonedDateTime;\n date = date.cycle('hour', amount, {\n hourCycle: this.hourCycle === 'h12' ? 12 : 24,\n round: false\n });\n let [dayPeriod, adjustedHour] = toHourCycle(date.hour, this.hourCycle);\n res.hour = adjustedHour;\n res.dayPeriod = dayPeriod;\n res.offset = date.offset;\n } else {\n let hours = res.hour ?? 0;\n let limits = this.getSegmentLimits('hour')!;\n res.hour = cycleValue(hours, amount, limits.minValue, limits.maxValue);\n if (res.dayPeriod == null && 'hour' in placeholder) {\n res.dayPeriod = toHourCycle(placeholder.hour, this.hourCycle)[0];\n }\n }\n break;\n }\n case 'dayPeriod':\n res.dayPeriod = cycleValue(res.dayPeriod ?? 0, amount, 0, 1);\n break;\n case 'minute':\n res.minute = cycleValue(res.minute ?? 0, amount, 0, 59, true);\n break;\n case 'second':\n res.second = cycleValue(res.second ?? 0, amount, 0, 59, true);\n break;\n }\n\n return res;\n }\n\n /\n Converts the incomplete date to a full date value, using the provided value for any unset\n * fields.\n /\n toValue(value: DateValue): DateValue {\n if ('hour' in value) {\n let hour = this.hour;\n if (hour != null) {\n hour = fromHourCycle(hour, this.dayPeriod ?? 0, this.hourCycle);\n } else if (this.hourCycle === 'h12' \|\| this.hourCycle === 'h11') {\n hour = this.dayPeriod === 1 ? 12 : 0;\n }\n\n let res = value.set({\n era: this.era ?? value.era,\n year: this.year ?? value.year,\n month: this.month ?? value.month,\n day: this.day ?? value.day,\n hour: hour ?? value.hour,\n minute: this.minute ?? value.minute,\n second: this.second ?? value.second,\n millisecond: this.millisecond ?? value.millisecond\n });\n\n if ('offset' in res && this.offset != null && res.offset !== this.offset) {\n res = res.add({milliseconds: res.offset - this.offset});\n }\n\n return res;\n } else {\n return value.set({\n era: this.era ?? value.era,\n year: this.year ?? value.year,\n month: this.month ?? value.month,\n day: this.day ?? value.day\n });\n }\n }\n\n getSegmentLimits(\n type: string\n ): {value: number \| null; minValue: number; maxValue: number} \| undefined {\n switch (type) {\n case 'era': {\n let eras = this.calendar.getEras();\n return {\n value: this.era != null ? eras.indexOf(this.era) : eras.length - 1,\n minValue: 0,\n maxValue: eras.length - 1\n };\n }\n case 'year':\n return {\n value: this.year,\n minValue: 1,\n maxValue: 9999\n };\n case 'month':\n return {\n value: this.month,\n minValue: 1,\n maxValue: this.calendar.getMaximumMonthsInYear()\n };\n case 'day':\n return {\n value: this.day,\n minValue: 1,\n maxValue: this.calendar.getMaximumDaysInMonth()\n };\n case 'dayPeriod': {\n return {\n value: this.dayPeriod,\n minValue: 0,\n maxValue: 1\n };\n }\n case 'hour': {\n let minValue = 0;\n let maxValue = 23;\n if (this.hourCycle === 'h12') {\n minValue = 1;\n maxValue = 12;\n } else if (this.hourCycle === 'h11') {\n minValue = 0;\n maxValue = 11;\n }\n\n return {\n value: this.hour,\n minValue,\n maxValue\n };\n }\n case 'minute':\n return {\n value: this.minute,\n minValue: 0,\n maxValue: 59\n };\n case 'second':\n return {\n value: this.second,\n minValue: 0,\n maxValue: 59\n };\n }\n }\n}\n\nfunction cycleValue(value: number, amount: number, min: number, max: number, round = false) {\n if (round) {\n value += Math.sign(amount);\n\n if (value < min) {\n value = max;\n }\n\n let div = Math.abs(amount);\n if (amount > 0) {\n value = Math.ceil(value / div) div;\n } else {\n value = Math.floor(value / div) * div;\n }\n\n if (value > max) {\n value = min;\n }\n } else {\n value += amount;\n if (value < min) {\n value = max - (min - value - 1);\n } else if (value > max) {\n value = min + (value - max - 1);\n }\n }\n\n return value;\n}\n\nfunction toHourCycle(hour: number, hourCycle: HourCycle): [number \| null, number] {\n let dayPeriod: number \| null = hour >= 12 ? 1 : 0;\n switch (hourCycle) {\n case 'h11':\n // Hours are numbered from 0 to 11. Used in Japan.\n if (hour >= 12) {\n hour -= 12;\n }\n break;\n case 'h12':\n // Hours are numbered from 12 (representing 0) to 11.\n if (hour === 0) {\n hour = 12;\n } else if (hour > 12) {\n hour -= 12;\n }\n break;\n case 'h23':\n // 24 hour time, numbered 0 to 23.\n dayPeriod = null;\n break;\n case 'h24':\n // 24 hour time numbered 24 to 23. Unused but supported by Intl.DateTimeFormat.\n hour += 1;\n dayPeriod = null;\n }\n\n return [dayPeriod, hour];\n}\n\nfunction fromHourCycle(hour: number, dayPeriod: number, hourCycle: HourCycle): number {\n switch (hourCycle) {\n case 'h11':\n if (dayPeriod === 1) {\n hour += 12;\n }\n break;\n case 'h12':\n if (hour === 12) {\n hour = 0;\n }\n if (dayPeriod === 1) {\n hour += 12;\n }\n break;\n case 'h24':\n hour -= 1;\n break;\n }\n\n return hour;\n}\n"],"names":[],"version":3,"file":"IncompleteDate.cjs.map"}

package/dist/private/datepicker/IncompleteDate.js CHANGED Viewed

@@ -59,7 +59,10 @@ class $79f9316e7c43839c$export$ae165b50d181e1ef {
         result.offset = null;
         return result;
     }
-    /** Increments or decrements the given field. If it is null, then it is set to the placeholder value. */ cycle(field, amount, placeholder, displaySegments) {
+    /**
+   * Increments or decrements the given field. If it is null, then it is set to the placeholder
+   * value.
+   */ cycle(field, amount, placeholder, displaySegments) {
         let res = this.copy();
         // If field is null, default to placeholder.
         if (res[field] == null && field !== 'dayPeriod' && field !== 'era') {
@@ -144,7 +147,10 @@ class $79f9316e7c43839c$export$ae165b50d181e1ef {
         }
         return res;
     }
-    /** Converts the incomplete date to a full date value, using the provided value for any unset fields. */ toValue(value) {
+    /**
+   * Converts the incomplete date to a full date value, using the provided value for any unset
+   * fields.
+   */ toValue(value) {
         var _this_era, _this_year, _this_month, _this_day;
         if ('hour' in value) {
             let hour = this.hour;