@react-stately/tree 3.1.3 → 3.2.2

package/dist/main.js

@@ -1,166 +1,139 @@
-var {
-  useControlledState
-} = require("@react-stately/utils");
-
-var {
-  useCollection
-} = require("@react-stately/collections");
-
-var {
-  SelectionManager,
-  useMultipleSelectionState
-} = require("@react-stately/selection");
-
-var {
-  useEffect,
-  useMemo
-} = require("react");
-
-let $f4c7caecb598119f63e2918a55ec91a9$var$_Symbol$iterator;
-$f4c7caecb598119f63e2918a55ec91a9$var$_Symbol$iterator = Symbol.iterator;
-
-/*
- * Copyright 2020 Adobe. All rights reserved.
- * This file is licensed to you under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License. You may obtain a copy
- * of the License at http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software distributed under
- * the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS
- * OF ANY KIND, either express or implied. See the License for the specific language
- * governing permissions and limitations under the License.
- */
-class $f4c7caecb598119f63e2918a55ec91a9$export$TreeCollection {
-  constructor(nodes, _temp) {
-    var _last;
-
-    let {
-      expandedKeys
-    } = _temp === void 0 ? {} : _temp;
-    this.keyMap = new Map();
-    this.iterable = void 0;
-    this.firstKey = void 0;
-    this.lastKey = void 0;
-    this.iterable = nodes;
-    expandedKeys = expandedKeys || new Set();
-
-    let visit = node => {
-      this.keyMap.set(node.key, node);
-
-      if (node.childNodes && (node.type === 'section' || expandedKeys.has(node.key))) {
-        for (let child of node.childNodes) {
-          visit(child);
-        }
-      }
-    };
-
-    for (let node of nodes) {
-      visit(node);
+var $8jMun$react = require("react");
+var $8jMun$reactstatelyselection = require("@react-stately/selection");
+var $8jMun$reactstatelycollections = require("@react-stately/collections");
+var $8jMun$reactstatelyutils = require("@react-stately/utils");
+
+function $parcel$exportWildcard(dest, source) {
+  Object.keys(source).forEach(function(key) {
+    if (key === 'default' || key === '__esModule' || dest.hasOwnProperty(key)) {
+      return;
     }
 
-    let last;
-    let index = 0;
-
-    for (let [key, node] of this.keyMap) {
-      if (last) {
-        last.nextKey = key;
-        node.prevKey = last.key;
-      } else {
-        this.firstKey = key;
-        node.prevKey = undefined;
+    Object.defineProperty(dest, key, {
+      enumerable: true,
+      get: function get() {
+        return source[key];
       }
+    });
+  });
 
-      if (node.type === 'item') {
-        node.index = index++;
-      }
-
-      last = node; // Set nextKey as undefined since this might be the last node
-      // If it isn't the last node, last.nextKey will properly set at start of new loop
-
-      last.nextKey = undefined;
-    }
-
-    this.lastKey = (_last = last) == null ? void 0 : _last.key;
-  }
-
-  *[$f4c7caecb598119f63e2918a55ec91a9$var$_Symbol$iterator]() {
-    yield* this.iterable;
-  }
-
-  get size() {
-    return this.keyMap.size;
-  }
-
-  getKeys() {
-    return this.keyMap.keys();
-  }
-
-  getKeyBefore(key) {
-    let node = this.keyMap.get(key);
-    return node ? node.prevKey : null;
-  }
-
-  getKeyAfter(key) {
-    let node = this.keyMap.get(key);
-    return node ? node.nextKey : null;
-  }
-
-  getFirstKey() {
-    return this.firstKey;
-  }
+  return dest;
+}
+function $parcel$export(e, n, v, s) {
+  Object.defineProperty(e, n, {get: v, set: s, enumerable: true, configurable: true});
+}
+var $9fca792b9f1dbe9f$exports = {};
 
-  getLastKey() {
-    return this.lastKey;
-  }
+$parcel$export($9fca792b9f1dbe9f$exports, "useTreeState", () => $9fca792b9f1dbe9f$export$728d6ba534403756);
 
-  getItem(key) {
-    return this.keyMap.get(key);
-  }
 
+var tmp = Symbol.iterator;
+class $dd657f4eb6746c96$export$863faf230ee2118a {
+    *[tmp]() {
+        yield* this.iterable;
+    }
+    get size() {
+        return this.keyMap.size;
+    }
+    getKeys() {
+        return this.keyMap.keys();
+    }
+    getKeyBefore(key) {
+        let node = this.keyMap.get(key);
+        return node ? node.prevKey : null;
+    }
+    getKeyAfter(key) {
+        let node = this.keyMap.get(key);
+        return node ? node.nextKey : null;
+    }
+    getFirstKey() {
+        return this.firstKey;
+    }
+    getLastKey() {
+        return this.lastKey;
+    }
+    getItem(key) {
+        return this.keyMap.get(key);
+    }
+    at(idx) {
+        const keys = [
+            ...this.getKeys()
+        ];
+        return this.getItem(keys[idx]);
+    }
+    constructor(nodes, { expandedKeys: expandedKeys  } = {
+    }){
+        this.keyMap = new Map();
+        this.iterable = nodes;
+        expandedKeys = expandedKeys || new Set();
+        let visit = (node)=>{
+            this.keyMap.set(node.key, node);
+            if (node.childNodes && (node.type === 'section' || expandedKeys.has(node.key))) for (let child of node.childNodes)visit(child);
+        };
+        for (let node2 of nodes)visit(node2);
+        let last;
+        let index = 0;
+        for (let [key, node1] of this.keyMap){
+            if (last) {
+                last.nextKey = key;
+                node1.prevKey = last.key;
+            } else {
+                this.firstKey = key;
+                node1.prevKey = undefined;
+            }
+            if (node1.type === 'item') node1.index = index++;
+            last = node1;
+            // Set nextKey as undefined since this might be the last node
+            // If it isn't the last node, last.nextKey will properly set at start of new loop
+            last.nextKey = undefined;
+        }
+        this.lastKey = last === null || last === void 0 ? void 0 : last.key;
+    }
 }
 
-/**
- * Provides state management for tree-like components. Handles building a collection
- * of items from props, item expanded state, and manages multiple selection state.
- */
-function useTreeState(props) {
-  let [expandedKeys, setExpandedKeys] = useControlledState(props.expandedKeys ? new Set(props.expandedKeys) : undefined, props.defaultExpandedKeys ? new Set(props.defaultExpandedKeys) : new Set(), props.onExpandedChange);
-  let selectionState = useMultipleSelectionState(props);
-  let disabledKeys = useMemo(() => props.disabledKeys ? new Set(props.disabledKeys) : new Set(), [props.disabledKeys]);
-  let tree = useCollection(props, nodes => new $f4c7caecb598119f63e2918a55ec91a9$export$TreeCollection(nodes, {
-    expandedKeys
-  })); // Reset focused key if that item is deleted from the collection.
 
-  useEffect(() => {
-    if (selectionState.focusedKey != null && !tree.getItem(selectionState.focusedKey)) {
-      selectionState.setFocusedKey(null);
-    }
-  }, [tree, selectionState.focusedKey]);
 
-  let onToggle = key => {
-    setExpandedKeys(expandedKeys => $f01b8043d944d5f04fffbeb1df9fd6cb$var$toggleKey(expandedKeys, key));
-  };
 
-  return {
-    collection: tree,
-    expandedKeys,
-    disabledKeys,
-    toggleKey: onToggle,
-    selectionManager: new SelectionManager(tree, selectionState)
-  };
+function $9fca792b9f1dbe9f$export$728d6ba534403756(props) {
+    let [expandedKeys, setExpandedKeys] = $8jMun$reactstatelyutils.useControlledState(props.expandedKeys ? new Set(props.expandedKeys) : undefined, props.defaultExpandedKeys ? new Set(props.defaultExpandedKeys) : new Set(), props.onExpandedChange);
+    let selectionState = $8jMun$reactstatelyselection.useMultipleSelectionState(props);
+    let disabledKeys = $8jMun$react.useMemo(()=>props.disabledKeys ? new Set(props.disabledKeys) : new Set()
+    , [
+        props.disabledKeys
+    ]);
+    let tree = $8jMun$reactstatelycollections.useCollection(props, (nodes)=>new $dd657f4eb6746c96$export$863faf230ee2118a(nodes, {
+            expandedKeys: expandedKeys
+        })
+    , null, [
+        expandedKeys
+    ]);
+    // Reset focused key if that item is deleted from the collection.
+    $8jMun$react.useEffect(()=>{
+        if (selectionState.focusedKey != null && !tree.getItem(selectionState.focusedKey)) selectionState.setFocusedKey(null);
+    }, [
+        tree,
+        selectionState.focusedKey
+    ]);
+    let onToggle = (key)=>{
+        setExpandedKeys($9fca792b9f1dbe9f$var$toggleKey(expandedKeys, key));
+    };
+    return {
+        collection: tree,
+        expandedKeys: expandedKeys,
+        disabledKeys: disabledKeys,
+        toggleKey: onToggle,
+        selectionManager: new $8jMun$reactstatelyselection.SelectionManager(tree, selectionState)
+    };
+}
+function $9fca792b9f1dbe9f$var$toggleKey(set, key) {
+    let res = new Set(set);
+    if (res.has(key)) res.delete(key);
+    else res.add(key);
+    return res;
 }
 
-exports.useTreeState = useTreeState;
 
-function $f01b8043d944d5f04fffbeb1df9fd6cb$var$toggleKey(set, key) {
-  let res = new Set(set);
+$parcel$exportWildcard(module.exports, $9fca792b9f1dbe9f$exports);
 
-  if (res.has(key)) {
-    res.delete(key);
-  } else {
-    res.add(key);
-  }
 
-  return res;
-}
 //# sourceMappingURL=main.js.map

package/dist/main.js.map

@@ -1 +1 @@
-{"mappings":";;;;;;;;;;;;;;;;;;;yDAgEIA,MAAM,CAACC,Q;;AAhEX;;;;;;;;;;;AAeO,MAAMC,uDAAN,CAAuD;AAM5DC,EAAAA,WAAW,CAACC,KAAD,SAA2E;AAAA;;AAAA,QAAhD;AAACC,MAAAA;AAAD,KAAgD,sBAAJ,EAAI;AAAA,SAL9EC,MAK8E,GALlD,IAAIC,GAAJ,EAKkD;AAAA,SAJ9EC,QAI8E;AAAA,SAH9EC,QAG8E;AAAA,SAF9EC,OAE8E;AACpF,SAAKF,QAAL,GAAgBJ,KAAhB;AACAC,IAAAA,YAAY,GAAGA,YAAY,IAAI,IAAIM,GAAJ,EAA/B;;AAEA,QAAIC,KAAK,GAAIC,IAAD,IAAmB;AAC7B,WAAKP,MAAL,CAAYQ,GAAZ,CAAgBD,IAAI,CAACE,GAArB,EAA0BF,IAA1B;;AAEA,UAAIA,IAAI,CAACG,UAAL,KAAoBH,IAAI,CAACI,IAAL,KAAc,SAAd,IAA2BZ,YAAY,CAACa,GAAb,CAAiBL,IAAI,CAACE,GAAtB,CAA/C,CAAJ,EAAgF;AAC9E,aAAK,IAAII,KAAT,IAAkBN,IAAI,CAACG,UAAvB,EAAmC;AACjCJ,UAAAA,KAAK,CAACO,KAAD,CAAL;AACD;AACF;AACF,KARD;;AAUA,SAAK,IAAIN,IAAT,IAAiBT,KAAjB,EAAwB;AACtBQ,MAAAA,KAAK,CAACC,IAAD,CAAL;AACD;;AAED,QAAIO,IAAJ;AACA,QAAIC,KAAK,GAAG,CAAZ;;AACA,SAAK,IAAI,CAACN,GAAD,EAAMF,IAAN,CAAT,IAAwB,KAAKP,MAA7B,EAAqC;AACnC,UAAIc,IAAJ,EAAU;AACRA,QAAAA,IAAI,CAACE,OAAL,GAAeP,GAAf;AACAF,QAAAA,IAAI,CAACU,OAAL,GAAeH,IAAI,CAACL,GAApB;AACD,OAHD,MAGO;AACL,aAAKN,QAAL,GAAgBM,GAAhB;AACAF,QAAAA,IAAI,CAACU,OAAL,GAAeC,SAAf;AACD;;AAED,UAAIX,IAAI,CAACI,IAAL,KAAc,MAAlB,EAA0B;AACxBJ,QAAAA,IAAI,CAACQ,KAAL,GAAaA,KAAK,EAAlB;AACD;;AAEDD,MAAAA,IAAI,GAAGP,IAAP,CAbmC,CAenC;AACA;;AACAO,MAAAA,IAAI,CAACE,OAAL,GAAeE,SAAf;AACD;;AAED,SAAKd,OAAL,YAAeU,IAAf,qBAAe,MAAML,GAArB;AACD;;AAED,8DAAqB;AACnB,WAAO,KAAKP,QAAZ;AACD;;AAED,MAAIiB,IAAJ,GAAW;AACT,WAAO,KAAKnB,MAAL,CAAYmB,IAAnB;AACD;;AAEDC,EAAAA,OAAO,GAAG;AACR,WAAO,KAAKpB,MAAL,CAAYqB,IAAZ,EAAP;AACD;;AAEDC,EAAAA,YAAY,CAACb,GAAD,EAAW;AACrB,QAAIF,IAAI,GAAG,KAAKP,MAAL,CAAYuB,GAAZ,CAAgBd,GAAhB,CAAX;AACA,WAAOF,IAAI,GAAGA,IAAI,CAACU,OAAR,GAAkB,IAA7B;AACD;;AAEDO,EAAAA,WAAW,CAACf,GAAD,EAAW;AACpB,QAAIF,IAAI,GAAG,KAAKP,MAAL,CAAYuB,GAAZ,CAAgBd,GAAhB,CAAX;AACA,WAAOF,IAAI,GAAGA,IAAI,CAACS,OAAR,GAAkB,IAA7B;AACD;;AAEDS,EAAAA,WAAW,GAAG;AACZ,WAAO,KAAKtB,QAAZ;AACD;;AAEDuB,EAAAA,UAAU,GAAG;AACX,WAAO,KAAKtB,OAAZ;AACD;;AAEDuB,EAAAA,OAAO,CAAClB,GAAD,EAAW;AAChB,WAAO,KAAKT,MAAL,CAAYuB,GAAZ,CAAgBd,GAAhB,CAAP;AACD;;AAjF2D;;ACsB9D;;;;AAIO,SAASmB,YAAT,CAAwCC,KAAxC,EAA2E;AAChF,MAAI,CAAC9B,YAAD,EAAe+B,eAAf,IAAkCC,kBAAkB,CACtDF,KAAK,CAAC9B,YAAN,GAAqB,IAAIM,GAAJ,CAAQwB,KAAK,CAAC9B,YAAd,CAArB,GAAmDmB,SADG,EAEtDW,KAAK,CAACG,mBAAN,GAA4B,IAAI3B,GAAJ,CAAQwB,KAAK,CAACG,mBAAd,CAA5B,GAAiE,IAAI3B,GAAJ,EAFX,EAGtDwB,KAAK,CAACI,gBAHgD,CAAxD;AAMA,MAAIC,cAAc,GAAGC,yBAAyB,CAACN,KAAD,CAA9C;AACA,MAAIO,YAAY,GAAGC,OAAO,CAAC,MACzBR,KAAK,CAACO,YAAN,GAAqB,IAAI/B,GAAJ,CAAQwB,KAAK,CAACO,YAAd,CAArB,GAAmD,IAAI/B,GAAJ,EAD3B,EAExB,CAACwB,KAAK,CAACO,YAAP,CAFwB,CAA1B;AAIA,MAAIE,IAAI,GAAGC,aAAa,CAACV,KAAD,EAAQ/B,KAAK,IAAI,4DAAmBA,KAAnB,EAA0B;AAACC,IAAAA;AAAD,GAA1B,CAAjB,CAAxB,CAZgF,CAchF;;AACAyC,EAAAA,SAAS,CAAC,MAAM;AACd,QAAIN,cAAc,CAACO,UAAf,IAA6B,IAA7B,IAAqC,CAACH,IAAI,CAACX,OAAL,CAAaO,cAAc,CAACO,UAA5B,CAA1C,EAAmF;AACjFP,MAAAA,cAAc,CAACQ,aAAf,CAA6B,IAA7B;AACD;AACF,GAJQ,EAIN,CAACJ,IAAD,EAAOJ,cAAc,CAACO,UAAtB,CAJM,CAAT;;AAMA,MAAIE,QAAQ,GAAIlC,GAAD,IAAc;AAC3BqB,IAAAA,eAAe,CAAC/B,YAAY,IAAI6C,+CAAS,CAAC7C,YAAD,EAAeU,GAAf,CAA1B,CAAf;AACD,GAFD;;AAIA,SAAO;AACLoC,IAAAA,UAAU,EAAEP,IADP;AAELvC,IAAAA,YAFK;AAGLqC,IAAAA,YAHK;AAILQ,IAAAA,SAAS,EAAED,QAJN;AAKLG,IAAAA,gBAAgB,EAAE,IAAIC,gBAAJ,CAAqBT,IAArB,EAA2BJ,cAA3B;AALb,GAAP;AAOD;;;;AAED,SAASU,+CAAT,CAAmBpC,GAAnB,EAAkCC,GAAlC,EAAsD;AACpD,MAAIuC,GAAG,GAAG,IAAI3C,GAAJ,CAAQG,GAAR,CAAV;;AACA,MAAIwC,GAAG,CAACpC,GAAJ,CAAQH,GAAR,CAAJ,EAAkB;AAChBuC,IAAAA,GAAG,CAACC,MAAJ,CAAWxC,GAAX;AACD,GAFD,MAEO;AACLuC,IAAAA,GAAG,CAACE,GAAJ,CAAQzC,GAAR;AACD;;AAED,SAAOuC,GAAP;AACD","sources":["./packages/@react-stately/tree/src/TreeCollection.ts","./packages/@react-stately/tree/src/useTreeState.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 {Collection, Node} from '@react-types/shared';\nimport {Key} from 'react';\n\nexport class TreeCollection<T> implements Collection<Node<T>> {\n  private keyMap: Map<Key, Node<T>> = new Map();\n  private iterable: Iterable<Node<T>>;\n  private firstKey: Key;\n  private lastKey: Key;\n\n  constructor(nodes: Iterable<Node<T>>, {expandedKeys}: {expandedKeys?: Set<Key>} = {}) {\n    this.iterable = nodes;\n    expandedKeys = expandedKeys || new Set();\n\n    let visit = (node: Node<T>) => {\n      this.keyMap.set(node.key, node);\n\n      if (node.childNodes && (node.type === 'section' || expandedKeys.has(node.key))) {\n        for (let child of node.childNodes) {\n          visit(child);\n        }\n      }\n    };\n\n    for (let node of nodes) {\n      visit(node);\n    }\n\n    let last: Node<T>;\n    let index = 0;\n    for (let [key, node] of this.keyMap) {\n      if (last) {\n        last.nextKey = key;\n        node.prevKey = last.key;\n      } else {\n        this.firstKey = key;\n        node.prevKey = undefined;\n      }\n\n      if (node.type === 'item') {\n        node.index = index++;\n      }\n\n      last = node;\n\n      // Set nextKey as undefined since this might be the last node\n      // If it isn't the last node, last.nextKey will properly set at start of new loop\n      last.nextKey = undefined;\n    }\n\n    this.lastKey = last?.key;\n  }\n\n  *[Symbol.iterator]() {\n    yield* this.iterable;\n  }\n\n  get size() {\n    return this.keyMap.size;\n  }\n\n  getKeys() {\n    return this.keyMap.keys();\n  }\n\n  getKeyBefore(key: Key) {\n    let node = this.keyMap.get(key);\n    return node ? node.prevKey : null;\n  }\n\n  getKeyAfter(key: Key) {\n    let node = this.keyMap.get(key);\n    return node ? node.nextKey : null;\n  }\n\n  getFirstKey() {\n    return this.firstKey;\n  }\n\n  getLastKey() {\n    return this.lastKey;\n  }\n\n  getItem(key: Key) {\n    return this.keyMap.get(key);\n  }\n}\n","/*\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 {Collection, CollectionBase, Expandable, MultipleSelection, Node} from '@react-types/shared';\nimport {Key, useEffect, useMemo} from 'react';\nimport {SelectionManager, useMultipleSelectionState} from '@react-stately/selection';\nimport {TreeCollection} from './TreeCollection';\nimport {useCollection} from '@react-stately/collections';\nimport {useControlledState} from '@react-stately/utils';\n\nexport interface TreeProps<T> extends CollectionBase<T>, Expandable, MultipleSelection {}\nexport interface TreeState<T> {\n  /** A collection of items in the tree. */\n  readonly collection: Collection<Node<T>>,\n\n  /** A set of keys for items that are disabled. */\n  readonly disabledKeys: Set<Key>,\n\n  /** A set of keys for items that are expanded. */\n  readonly expandedKeys: Set<Key>,\n\n  /** Toggles the expanded state for an item by its key. */\n  toggleKey(key: Key): void,\n\n  /** A selection manager to read and update multiple selection state. */\n  readonly selectionManager: SelectionManager\n}\n\n/**\n * Provides state management for tree-like components. Handles building a collection\n * of items from props, item expanded state, and manages multiple selection state.\n */\nexport function useTreeState<T extends object>(props: TreeProps<T>): TreeState<T> {\n  let [expandedKeys, setExpandedKeys] = useControlledState(\n    props.expandedKeys ? new Set(props.expandedKeys) : undefined,\n    props.defaultExpandedKeys ? new Set(props.defaultExpandedKeys) : new Set(),\n    props.onExpandedChange\n  );\n\n  let selectionState = useMultipleSelectionState(props);\n  let disabledKeys = useMemo(() =>\n    props.disabledKeys ? new Set(props.disabledKeys) : new Set<Key>()\n  , [props.disabledKeys]);\n\n  let tree = useCollection(props, nodes => new TreeCollection(nodes, {expandedKeys}));\n\n  // Reset focused key if that item is deleted from the collection.\n  useEffect(() => {\n    if (selectionState.focusedKey != null && !tree.getItem(selectionState.focusedKey)) {\n      selectionState.setFocusedKey(null);\n    }\n  }, [tree, selectionState.focusedKey]);\n\n  let onToggle = (key: Key) => {\n    setExpandedKeys(expandedKeys => toggleKey(expandedKeys, key));\n  };\n\n  return {\n    collection: tree,\n    expandedKeys,\n    disabledKeys,\n    toggleKey: onToggle,\n    selectionManager: new SelectionManager(tree, selectionState)\n  };\n}\n\nfunction toggleKey(set: Set<Key>, key: Key): Set<Key> {\n  let res = new Set(set);\n  if (res.has(key)) {\n    res.delete(key);\n  } else {\n    res.add(key);\n  }\n\n  return res;\n}\n"],"names":["Symbol","iterator","TreeCollection","constructor","nodes","expandedKeys","keyMap","Map","iterable","firstKey","lastKey","Set","visit","node","set","key","childNodes","type","has","child","last","index","nextKey","prevKey","undefined","size","getKeys","keys","getKeyBefore","get","getKeyAfter","getFirstKey","getLastKey","getItem","useTreeState","props","setExpandedKeys","useControlledState","defaultExpandedKeys","onExpandedChange","selectionState","useMultipleSelectionState","disabledKeys","useMemo","tree","useCollection","useEffect","focusedKey","setFocusedKey","onToggle","toggleKey","collection","selectionManager","SelectionManager","res","delete","add"],"version":3,"file":"main.js.map"}
+{"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;UEgEI,MAAM,CAAC,QAAQ;MAjDN,yCAAc;aAiDJ,CAAC;eACb,IAAI,CAAC,QAAQ;IACtB,CAAC;QAEG,IAAI,GAAG,CAAC;QACV,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI;IACzB,CAAC;IAED,OAAO,GAAG,CAAC;QACT,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI;IACzB,CAAC;IAED,YAAY,CAAC,GAAQ,EAAE,CAAC;QACtB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG;QAC9B,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI;IACnC,CAAC;IAED,WAAW,CAAC,GAAQ,EAAE,CAAC;QACrB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG;QAC9B,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI;IACnC,CAAC;IAED,WAAW,GAAG,CAAC;QACb,MAAM,CAAC,IAAI,CAAC,QAAQ;IACtB,CAAC;IAED,UAAU,GAAG,CAAC;QACZ,MAAM,CAAC,IAAI,CAAC,OAAO;IACrB,CAAC;IAED,OAAO,CAAC,GAAQ,EAAE,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG;IAC5B,CAAC;IAED,EAAE,CAAC,GAAW,EAAE,CAAC;QACf,KAAK,CAAC,IAAI,GAAG,CAAC;eAAG,IAAI,CAAC,OAAO;QAAE,CAAC;QAChC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG;IAC9B,CAAC;gBAhFW,KAAwB,EAAE,CAAC,eAAA,YAAY,EAA2B,CAAC,GAAG,CAAC;IAAA,CAAC,CAAE,CAAC;QANlF,IAuFN,CAtFS,MAAM,GAAsB,GAAG,CAAC,GAAG;QAMzC,IAAI,CAAC,QAAQ,GAAG,KAAK;QACrB,YAAY,GAAG,YAAY,IAAI,GAAG,CAAC,GAAG;QAEtC,GAAG,CAAC,KAAK,IAAI,IAAa,GAAK,CAAC;YAC9B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI;YAE9B,EAAE,EAAE,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC,IAAI,KAAK,CAAS,YAAI,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,IAC1E,GAAG,EAAE,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,UAAU,CAC/B,KAAK,CAAC,KAAK;QAGjB,CAAC;QAED,GAAG,EAAE,GAAG,CAAC,KAAI,IAAI,KAAK,CACpB,KAAK,CAAC,KAAI;QAGZ,GAAG,CAAC,IAAI;QACR,GAAG,CAAC,KAAK,GAAG,CAAC;QACb,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,KAAI,KAAK,IAAI,CAAC,MAAM,CAAE,CAAC;YACpC,EAAE,EAAE,IAAI,EAAE,CAAC;gBACT,IAAI,CAAC,OAAO,GAAG,GAAG;gBAClB,KAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG;YACzB,CAAC,MAAM,CAAC;gBACN,IAAI,CAAC,QAAQ,GAAG,GAAG;gBACnB,KAAI,CAAC,OAAO,GAAG,SAAS;YAC1B,CAAC;YAED,EAAE,EAAE,KAAI,CAAC,IAAI,KAAK,CAAM,OACtB,KAAI,CAAC,KAAK,GAAG,KAAK;YAGpB,IAAI,GAAG,KAAI;YAEX,EAA6D,AAA7D,2DAA6D;YAC7D,EAAiF,AAAjF,+EAAiF;YACjF,IAAI,CAAC,OAAO,GAAG,SAAS;QAC1B,CAAC;QAED,IAAI,CAAC,OAAO,GAAG,IAAI,aAAJ,IAAI,KAAJ,IAAI,CAAJ,CAAS,GAAT,IAAI,CAAJ,CAAS,GAAT,IAAI,CAAE,GAAG;IAC1B,CAAC;;;;;;SDrBa,yCAAY,CAAmB,KAAmB,EAAgB,CAAC;IACjF,GAAG,EAAE,YAAY,EAAE,eAAe,IAAI,2CAAkB,CACtD,KAAK,CAAC,YAAY,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,IAAI,SAAS,EAC5D,KAAK,CAAC,mBAAmB,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,mBAAmB,IAAI,GAAG,CAAC,GAAG,IACxE,KAAK,CAAC,gBAAgB;IAGxB,GAAG,CAAC,cAAc,GAAG,sDAAyB,CAAC,KAAK;IACpD,GAAG,CAAC,YAAY,GAAG,oBAAO,KACxB,KAAK,CAAC,YAAY,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,IAAI,GAAG,CAAC,GAAG;MAC1D,CAAC;QAAA,KAAK,CAAC,YAAY;IAAA,CAAC;IAEtB,GAAG,CAAC,IAAI,GAAG,4CAAa,CAAC,KAAK,GAAE,KAAK,GAAI,GAAG,CAAC,yCAAc,CAAC,KAAK,EAAE,CAAC;0BAAA,YAAY;QAAA,CAAC;MAAG,IAAI,EAAE,CAAC;QAAA,YAAY;IAAA,CAAC;IAExG,EAAiE,AAAjE,+DAAiE;IACjE,sBAAS,KAAO,CAAC;QACf,EAAE,EAAE,cAAc,CAAC,UAAU,IAAI,IAAI,KAAK,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,UAAU,GAC9E,cAAc,CAAC,aAAa,CAAC,IAAI;IAErC,CAAC,EAAE,CAAC;QAAA,IAAI;QAAE,cAAc,CAAC,UAAU;IAAA,CAAC;IAEpC,GAAG,CAAC,QAAQ,IAAI,GAAQ,GAAK,CAAC;QAC5B,eAAe,CAAC,+BAAS,CAAC,YAAY,EAAE,GAAG;IAC7C,CAAC;IAED,MAAM,CAAC,CAAC;QACN,UAAU,EAAE,IAAI;sBAChB,YAAY;sBACZ,YAAY;QACZ,SAAS,EAAE,QAAQ;QACnB,gBAAgB,EAAE,GAAG,CAAC,6CAAgB,CAAC,IAAI,EAAE,cAAc;IAC7D,CAAC;AACH,CAAC;SAEQ,+BAAS,CAAC,GAAa,EAAE,GAAQ,EAAY,CAAC;IACrD,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG;IACrB,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,GACb,GAAG,CAAC,MAAM,CAAC,GAAG;SAEd,GAAG,CAAC,GAAG,CAAC,GAAG;IAGb,MAAM,CAAC,GAAG;AACZ,CAAC","sources":["packages/@react-stately/tree/src/index.ts","packages/@react-stately/tree/src/useTreeState.ts","packages/@react-stately/tree/src/TreeCollection.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\nexport * from './useTreeState';\n","/*\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 {Collection, CollectionBase, Expandable, MultipleSelection, Node} from '@react-types/shared';\nimport {Key, useEffect, useMemo} from 'react';\nimport {SelectionManager, useMultipleSelectionState} from '@react-stately/selection';\nimport {TreeCollection} from './TreeCollection';\nimport {useCollection} from '@react-stately/collections';\nimport {useControlledState} from '@react-stately/utils';\n\nexport interface TreeProps<T> extends CollectionBase<T>, Expandable, MultipleSelection {}\nexport interface TreeState<T> {\n  /** A collection of items in the tree. */\n  readonly collection: Collection<Node<T>>,\n\n  /** A set of keys for items that are disabled. */\n  readonly disabledKeys: Set<Key>,\n\n  /** A set of keys for items that are expanded. */\n  readonly expandedKeys: Set<Key>,\n\n  /** Toggles the expanded state for an item by its key. */\n  toggleKey(key: Key): void,\n\n  /** A selection manager to read and update multiple selection state. */\n  readonly selectionManager: SelectionManager\n}\n\n/**\n * Provides state management for tree-like components. Handles building a collection\n * of items from props, item expanded state, and manages multiple selection state.\n */\nexport function useTreeState<T extends object>(props: TreeProps<T>): TreeState<T> {\n  let [expandedKeys, setExpandedKeys] = useControlledState(\n    props.expandedKeys ? new Set(props.expandedKeys) : undefined,\n    props.defaultExpandedKeys ? new Set(props.defaultExpandedKeys) : new Set(),\n    props.onExpandedChange\n  );\n\n  let selectionState = useMultipleSelectionState(props);\n  let disabledKeys = useMemo(() =>\n    props.disabledKeys ? new Set(props.disabledKeys) : new Set<Key>()\n  , [props.disabledKeys]);\n\n  let tree = useCollection(props, nodes => new TreeCollection(nodes, {expandedKeys}), null, [expandedKeys]);\n\n  // Reset focused key if that item is deleted from the collection.\n  useEffect(() => {\n    if (selectionState.focusedKey != null && !tree.getItem(selectionState.focusedKey)) {\n      selectionState.setFocusedKey(null);\n    }\n  }, [tree, selectionState.focusedKey]);\n\n  let onToggle = (key: Key) => {\n    setExpandedKeys(toggleKey(expandedKeys, key));\n  };\n\n  return {\n    collection: tree,\n    expandedKeys,\n    disabledKeys,\n    toggleKey: onToggle,\n    selectionManager: new SelectionManager(tree, selectionState)\n  };\n}\n\nfunction toggleKey(set: Set<Key>, key: Key): Set<Key> {\n  let res = new Set(set);\n  if (res.has(key)) {\n    res.delete(key);\n  } else {\n    res.add(key);\n  }\n\n  return res;\n}\n","/*\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 {Collection, Node} from '@react-types/shared';\nimport {Key} from 'react';\n\nexport class TreeCollection<T> implements Collection<Node<T>> {\n  private keyMap: Map<Key, Node<T>> = new Map();\n  private iterable: Iterable<Node<T>>;\n  private firstKey: Key;\n  private lastKey: Key;\n\n  constructor(nodes: Iterable<Node<T>>, {expandedKeys}: {expandedKeys?: Set<Key>} = {}) {\n    this.iterable = nodes;\n    expandedKeys = expandedKeys || new Set();\n\n    let visit = (node: Node<T>) => {\n      this.keyMap.set(node.key, node);\n\n      if (node.childNodes && (node.type === 'section' || expandedKeys.has(node.key))) {\n        for (let child of node.childNodes) {\n          visit(child);\n        }\n      }\n    };\n\n    for (let node of nodes) {\n      visit(node);\n    }\n\n    let last: Node<T>;\n    let index = 0;\n    for (let [key, node] of this.keyMap) {\n      if (last) {\n        last.nextKey = key;\n        node.prevKey = last.key;\n      } else {\n        this.firstKey = key;\n        node.prevKey = undefined;\n      }\n\n      if (node.type === 'item') {\n        node.index = index++;\n      }\n\n      last = node;\n\n      // Set nextKey as undefined since this might be the last node\n      // If it isn't the last node, last.nextKey will properly set at start of new loop\n      last.nextKey = undefined;\n    }\n\n    this.lastKey = last?.key;\n  }\n\n  *[Symbol.iterator]() {\n    yield* this.iterable;\n  }\n\n  get size() {\n    return this.keyMap.size;\n  }\n\n  getKeys() {\n    return this.keyMap.keys();\n  }\n\n  getKeyBefore(key: Key) {\n    let node = this.keyMap.get(key);\n    return node ? node.prevKey : null;\n  }\n\n  getKeyAfter(key: Key) {\n    let node = this.keyMap.get(key);\n    return node ? node.nextKey : null;\n  }\n\n  getFirstKey() {\n    return this.firstKey;\n  }\n\n  getLastKey() {\n    return this.lastKey;\n  }\n\n  getItem(key: Key) {\n    return this.keyMap.get(key);\n  }\n\n  at(idx: number) {\n    const keys = [...this.getKeys()];\n    return this.getItem(keys[idx]);\n  }\n}\n"],"names":[],"version":3,"file":"main.js.map"}

package/dist/module.js

@@ -1,150 +1,123 @@
-import { useControlledState } from "@react-stately/utils";
-import { useCollection } from "@react-stately/collections";
-import { SelectionManager, useMultipleSelectionState } from "@react-stately/selection";
-import { useEffect, useMemo } from "react";
-let $afa6f708e32ecf7f97d9a58dfd59c$var$_Symbol$iterator;
-$afa6f708e32ecf7f97d9a58dfd59c$var$_Symbol$iterator = Symbol.iterator;
+import {useMemo as $9TXm6$useMemo, useEffect as $9TXm6$useEffect} from "react";
+import {useMultipleSelectionState as $9TXm6$useMultipleSelectionState, SelectionManager as $9TXm6$SelectionManager} from "@react-stately/selection";
+import {useCollection as $9TXm6$useCollection} from "@react-stately/collections";
+import {useControlledState as $9TXm6$useControlledState} from "@react-stately/utils";
 
-/*
- * Copyright 2020 Adobe. All rights reserved.
- * This file is licensed to you under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License. You may obtain a copy
- * of the License at http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software distributed under
- * the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS
- * OF ANY KIND, either express or implied. See the License for the specific language
- * governing permissions and limitations under the License.
- */
-class $afa6f708e32ecf7f97d9a58dfd59c$export$TreeCollection {
-  constructor(nodes, _temp) {
-    var _last;
+function $parcel$export(e, n, v, s) {
+  Object.defineProperty(e, n, {get: v, set: s, enumerable: true, configurable: true});
+}
+var $36d99f0640511db5$exports = {};
 
-    let {
-      expandedKeys
-    } = _temp === void 0 ? {} : _temp;
-    this.keyMap = new Map();
-    this.iterable = void 0;
-    this.firstKey = void 0;
-    this.lastKey = void 0;
-    this.iterable = nodes;
-    expandedKeys = expandedKeys || new Set();
+$parcel$export($36d99f0640511db5$exports, "useTreeState", () => $36d99f0640511db5$export$728d6ba534403756);
 
-    let visit = node => {
-      this.keyMap.set(node.key, node);
 
-      if (node.childNodes && (node.type === 'section' || expandedKeys.has(node.key))) {
-        for (let child of node.childNodes) {
-          visit(child);
-        }
-      }
-    };
-
-    for (let node of nodes) {
-      visit(node);
+var tmp = Symbol.iterator;
+class $c8161626733397a0$export$863faf230ee2118a {
+    *[tmp]() {
+        yield* this.iterable;
     }
-
-    let last;
-    let index = 0;
-
-    for (let [key, node] of this.keyMap) {
-      if (last) {
-        last.nextKey = key;
-        node.prevKey = last.key;
-      } else {
-        this.firstKey = key;
-        node.prevKey = undefined;
-      }
-
-      if (node.type === 'item') {
-        node.index = index++;
-      }
-
-      last = node; // Set nextKey as undefined since this might be the last node
-      // If it isn't the last node, last.nextKey will properly set at start of new loop
-
-      last.nextKey = undefined;
+    get size() {
+        return this.keyMap.size;
+    }
+    getKeys() {
+        return this.keyMap.keys();
+    }
+    getKeyBefore(key) {
+        let node = this.keyMap.get(key);
+        return node ? node.prevKey : null;
+    }
+    getKeyAfter(key) {
+        let node = this.keyMap.get(key);
+        return node ? node.nextKey : null;
+    }
+    getFirstKey() {
+        return this.firstKey;
+    }
+    getLastKey() {
+        return this.lastKey;
+    }
+    getItem(key) {
+        return this.keyMap.get(key);
+    }
+    at(idx) {
+        const keys = [
+            ...this.getKeys()
+        ];
+        return this.getItem(keys[idx]);
+    }
+    constructor(nodes, { expandedKeys: expandedKeys  } = {
+    }){
+        this.keyMap = new Map();
+        this.iterable = nodes;
+        expandedKeys = expandedKeys || new Set();
+        let visit = (node)=>{
+            this.keyMap.set(node.key, node);
+            if (node.childNodes && (node.type === 'section' || expandedKeys.has(node.key))) for (let child of node.childNodes)visit(child);
+        };
+        for (let node2 of nodes)visit(node2);
+        let last;
+        let index = 0;
+        for (let [key, node1] of this.keyMap){
+            if (last) {
+                last.nextKey = key;
+                node1.prevKey = last.key;
+            } else {
+                this.firstKey = key;
+                node1.prevKey = undefined;
+            }
+            if (node1.type === 'item') node1.index = index++;
+            last = node1;
+            // Set nextKey as undefined since this might be the last node
+            // If it isn't the last node, last.nextKey will properly set at start of new loop
+            last.nextKey = undefined;
+        }
+        this.lastKey = last === null || last === void 0 ? void 0 : last.key;
     }
-
-    this.lastKey = (_last = last) == null ? void 0 : _last.key;
-  }
-
-  *[$afa6f708e32ecf7f97d9a58dfd59c$var$_Symbol$iterator]() {
-    yield* this.iterable;
-  }
-
-  get size() {
-    return this.keyMap.size;
-  }
-
-  getKeys() {
-    return this.keyMap.keys();
-  }
-
-  getKeyBefore(key) {
-    let node = this.keyMap.get(key);
-    return node ? node.prevKey : null;
-  }
-
-  getKeyAfter(key) {
-    let node = this.keyMap.get(key);
-    return node ? node.nextKey : null;
-  }
-
-  getFirstKey() {
-    return this.firstKey;
-  }
-
-  getLastKey() {
-    return this.lastKey;
-  }
-
-  getItem(key) {
-    return this.keyMap.get(key);
-  }
-
 }
 
-/**
- * Provides state management for tree-like components. Handles building a collection
- * of items from props, item expanded state, and manages multiple selection state.
- */
-export function useTreeState(props) {
-  let [expandedKeys, setExpandedKeys] = useControlledState(props.expandedKeys ? new Set(props.expandedKeys) : undefined, props.defaultExpandedKeys ? new Set(props.defaultExpandedKeys) : new Set(), props.onExpandedChange);
-  let selectionState = useMultipleSelectionState(props);
-  let disabledKeys = useMemo(() => props.disabledKeys ? new Set(props.disabledKeys) : new Set(), [props.disabledKeys]);
-  let tree = useCollection(props, nodes => new $afa6f708e32ecf7f97d9a58dfd59c$export$TreeCollection(nodes, {
-    expandedKeys
-  })); // Reset focused key if that item is deleted from the collection.
 
-  useEffect(() => {
-    if (selectionState.focusedKey != null && !tree.getItem(selectionState.focusedKey)) {
-      selectionState.setFocusedKey(null);
-    }
-  }, [tree, selectionState.focusedKey]);
 
-  let onToggle = key => {
-    setExpandedKeys(expandedKeys => $f51dc3c5c900bd3cdb4a06df11d84697$var$toggleKey(expandedKeys, key));
-  };
 
-  return {
-    collection: tree,
-    expandedKeys,
-    disabledKeys,
-    toggleKey: onToggle,
-    selectionManager: new SelectionManager(tree, selectionState)
-  };
+function $36d99f0640511db5$export$728d6ba534403756(props) {
+    let [expandedKeys, setExpandedKeys] = $9TXm6$useControlledState(props.expandedKeys ? new Set(props.expandedKeys) : undefined, props.defaultExpandedKeys ? new Set(props.defaultExpandedKeys) : new Set(), props.onExpandedChange);
+    let selectionState = $9TXm6$useMultipleSelectionState(props);
+    let disabledKeys = $9TXm6$useMemo(()=>props.disabledKeys ? new Set(props.disabledKeys) : new Set()
+    , [
+        props.disabledKeys
+    ]);
+    let tree = $9TXm6$useCollection(props, (nodes)=>new $c8161626733397a0$export$863faf230ee2118a(nodes, {
+            expandedKeys: expandedKeys
+        })
+    , null, [
+        expandedKeys
+    ]);
+    // Reset focused key if that item is deleted from the collection.
+    $9TXm6$useEffect(()=>{
+        if (selectionState.focusedKey != null && !tree.getItem(selectionState.focusedKey)) selectionState.setFocusedKey(null);
+    }, [
+        tree,
+        selectionState.focusedKey
+    ]);
+    let onToggle = (key)=>{
+        setExpandedKeys($36d99f0640511db5$var$toggleKey(expandedKeys, key));
+    };
+    return {
+        collection: tree,
+        expandedKeys: expandedKeys,
+        disabledKeys: disabledKeys,
+        toggleKey: onToggle,
+        selectionManager: new $9TXm6$SelectionManager(tree, selectionState)
+    };
+}
+function $36d99f0640511db5$var$toggleKey(set, key) {
+    let res = new Set(set);
+    if (res.has(key)) res.delete(key);
+    else res.add(key);
+    return res;
 }
 
-function $f51dc3c5c900bd3cdb4a06df11d84697$var$toggleKey(set, key) {
-  let res = new Set(set);
 
-  if (res.has(key)) {
-    res.delete(key);
-  } else {
-    res.add(key);
-  }
 
-  return res;
-}
+
+export {$36d99f0640511db5$export$728d6ba534403756 as useTreeState};
 //# sourceMappingURL=module.js.map

package/dist/module.js.map

@@ -1 +1 @@
-{"mappings":";;;;;sDAgEIA,MAAM,CAACC,Q;;AAhEX;;;;;;;;;;;AAeO,MAAMC,oDAAN,CAAuD;AAM5DC,EAAAA,WAAW,CAACC,KAAD,SAA2E;AAAA;;AAAA,QAAhD;AAACC,MAAAA;AAAD,KAAgD,sBAAJ,EAAI;AAAA,SAL9EC,MAK8E,GALlD,IAAIC,GAAJ,EAKkD;AAAA,SAJ9EC,QAI8E;AAAA,SAH9EC,QAG8E;AAAA,SAF9EC,OAE8E;AACpF,SAAKF,QAAL,GAAgBJ,KAAhB;AACAC,IAAAA,YAAY,GAAGA,YAAY,IAAI,IAAIM,GAAJ,EAA/B;;AAEA,QAAIC,KAAK,GAAIC,IAAD,IAAmB;AAC7B,WAAKP,MAAL,CAAYQ,GAAZ,CAAgBD,IAAI,CAACE,GAArB,EAA0BF,IAA1B;;AAEA,UAAIA,IAAI,CAACG,UAAL,KAAoBH,IAAI,CAACI,IAAL,KAAc,SAAd,IAA2BZ,YAAY,CAACa,GAAb,CAAiBL,IAAI,CAACE,GAAtB,CAA/C,CAAJ,EAAgF;AAC9E,aAAK,IAAII,KAAT,IAAkBN,IAAI,CAACG,UAAvB,EAAmC;AACjCJ,UAAAA,KAAK,CAACO,KAAD,CAAL;AACD;AACF;AACF,KARD;;AAUA,SAAK,IAAIN,IAAT,IAAiBT,KAAjB,EAAwB;AACtBQ,MAAAA,KAAK,CAACC,IAAD,CAAL;AACD;;AAED,QAAIO,IAAJ;AACA,QAAIC,KAAK,GAAG,CAAZ;;AACA,SAAK,IAAI,CAACN,GAAD,EAAMF,IAAN,CAAT,IAAwB,KAAKP,MAA7B,EAAqC;AACnC,UAAIc,IAAJ,EAAU;AACRA,QAAAA,IAAI,CAACE,OAAL,GAAeP,GAAf;AACAF,QAAAA,IAAI,CAACU,OAAL,GAAeH,IAAI,CAACL,GAApB;AACD,OAHD,MAGO;AACL,aAAKN,QAAL,GAAgBM,GAAhB;AACAF,QAAAA,IAAI,CAACU,OAAL,GAAeC,SAAf;AACD;;AAED,UAAIX,IAAI,CAACI,IAAL,KAAc,MAAlB,EAA0B;AACxBJ,QAAAA,IAAI,CAACQ,KAAL,GAAaA,KAAK,EAAlB;AACD;;AAEDD,MAAAA,IAAI,GAAGP,IAAP,CAbmC,CAenC;AACA;;AACAO,MAAAA,IAAI,CAACE,OAAL,GAAeE,SAAf;AACD;;AAED,SAAKd,OAAL,YAAeU,IAAf,qBAAe,MAAML,GAArB;AACD;;AAED,2DAAqB;AACnB,WAAO,KAAKP,QAAZ;AACD;;AAED,MAAIiB,IAAJ,GAAW;AACT,WAAO,KAAKnB,MAAL,CAAYmB,IAAnB;AACD;;AAEDC,EAAAA,OAAO,GAAG;AACR,WAAO,KAAKpB,MAAL,CAAYqB,IAAZ,EAAP;AACD;;AAEDC,EAAAA,YAAY,CAACb,GAAD,EAAW;AACrB,QAAIF,IAAI,GAAG,KAAKP,MAAL,CAAYuB,GAAZ,CAAgBd,GAAhB,CAAX;AACA,WAAOF,IAAI,GAAGA,IAAI,CAACU,OAAR,GAAkB,IAA7B;AACD;;AAEDO,EAAAA,WAAW,CAACf,GAAD,EAAW;AACpB,QAAIF,IAAI,GAAG,KAAKP,MAAL,CAAYuB,GAAZ,CAAgBd,GAAhB,CAAX;AACA,WAAOF,IAAI,GAAGA,IAAI,CAACS,OAAR,GAAkB,IAA7B;AACD;;AAEDS,EAAAA,WAAW,GAAG;AACZ,WAAO,KAAKtB,QAAZ;AACD;;AAEDuB,EAAAA,UAAU,GAAG;AACX,WAAO,KAAKtB,OAAZ;AACD;;AAEDuB,EAAAA,OAAO,CAAClB,GAAD,EAAW;AAChB,WAAO,KAAKT,MAAL,CAAYuB,GAAZ,CAAgBd,GAAhB,CAAP;AACD;;AAjF2D;;ACsB9D;;;;OAIO,SAASmB,YAAT,CAAwCC,KAAxC,EAA2E;AAChF,MAAI,CAAC9B,YAAD,EAAe+B,eAAf,IAAkCC,kBAAkB,CACtDF,KAAK,CAAC9B,YAAN,GAAqB,IAAIM,GAAJ,CAAQwB,KAAK,CAAC9B,YAAd,CAArB,GAAmDmB,SADG,EAEtDW,KAAK,CAACG,mBAAN,GAA4B,IAAI3B,GAAJ,CAAQwB,KAAK,CAACG,mBAAd,CAA5B,GAAiE,IAAI3B,GAAJ,EAFX,EAGtDwB,KAAK,CAACI,gBAHgD,CAAxD;AAMA,MAAIC,cAAc,GAAGC,yBAAyB,CAACN,KAAD,CAA9C;AACA,MAAIO,YAAY,GAAGC,OAAO,CAAC,MACzBR,KAAK,CAACO,YAAN,GAAqB,IAAI/B,GAAJ,CAAQwB,KAAK,CAACO,YAAd,CAArB,GAAmD,IAAI/B,GAAJ,EAD3B,EAExB,CAACwB,KAAK,CAACO,YAAP,CAFwB,CAA1B;AAIA,MAAIE,IAAI,GAAGC,aAAa,CAACV,KAAD,EAAQ/B,KAAK,IAAI,yDAAmBA,KAAnB,EAA0B;AAACC,IAAAA;AAAD,GAA1B,CAAjB,CAAxB,CAZgF,CAchF;;AACAyC,EAAAA,SAAS,CAAC,MAAM;AACd,QAAIN,cAAc,CAACO,UAAf,IAA6B,IAA7B,IAAqC,CAACH,IAAI,CAACX,OAAL,CAAaO,cAAc,CAACO,UAA5B,CAA1C,EAAmF;AACjFP,MAAAA,cAAc,CAACQ,aAAf,CAA6B,IAA7B;AACD;AACF,GAJQ,EAIN,CAACJ,IAAD,EAAOJ,cAAc,CAACO,UAAtB,CAJM,CAAT;;AAMA,MAAIE,QAAQ,GAAIlC,GAAD,IAAc;AAC3BqB,IAAAA,eAAe,CAAC/B,YAAY,IAAI6C,+CAAS,CAAC7C,YAAD,EAAeU,GAAf,CAA1B,CAAf;AACD,GAFD;;AAIA,SAAO;AACLoC,IAAAA,UAAU,EAAEP,IADP;AAELvC,IAAAA,YAFK;AAGLqC,IAAAA,YAHK;AAILQ,IAAAA,SAAS,EAAED,QAJN;AAKLG,IAAAA,gBAAgB,EAAE,IAAIC,gBAAJ,CAAqBT,IAArB,EAA2BJ,cAA3B;AALb,GAAP;AAOD;;AAED,SAASU,+CAAT,CAAmBpC,GAAnB,EAAkCC,GAAlC,EAAsD;AACpD,MAAIuC,GAAG,GAAG,IAAI3C,GAAJ,CAAQG,GAAR,CAAV;;AACA,MAAIwC,GAAG,CAACpC,GAAJ,CAAQH,GAAR,CAAJ,EAAkB;AAChBuC,IAAAA,GAAG,CAACC,MAAJ,CAAWxC,GAAX;AACD,GAFD,MAEO;AACLuC,IAAAA,GAAG,CAACE,GAAJ,CAAQzC,GAAR;AACD;;AAED,SAAOuC,GAAP;AACD","sources":["./packages/@react-stately/tree/src/TreeCollection.ts","./packages/@react-stately/tree/src/useTreeState.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 {Collection, Node} from '@react-types/shared';\nimport {Key} from 'react';\n\nexport class TreeCollection<T> implements Collection<Node<T>> {\n  private keyMap: Map<Key, Node<T>> = new Map();\n  private iterable: Iterable<Node<T>>;\n  private firstKey: Key;\n  private lastKey: Key;\n\n  constructor(nodes: Iterable<Node<T>>, {expandedKeys}: {expandedKeys?: Set<Key>} = {}) {\n    this.iterable = nodes;\n    expandedKeys = expandedKeys || new Set();\n\n    let visit = (node: Node<T>) => {\n      this.keyMap.set(node.key, node);\n\n      if (node.childNodes && (node.type === 'section' || expandedKeys.has(node.key))) {\n        for (let child of node.childNodes) {\n          visit(child);\n        }\n      }\n    };\n\n    for (let node of nodes) {\n      visit(node);\n    }\n\n    let last: Node<T>;\n    let index = 0;\n    for (let [key, node] of this.keyMap) {\n      if (last) {\n        last.nextKey = key;\n        node.prevKey = last.key;\n      } else {\n        this.firstKey = key;\n        node.prevKey = undefined;\n      }\n\n      if (node.type === 'item') {\n        node.index = index++;\n      }\n\n      last = node;\n\n      // Set nextKey as undefined since this might be the last node\n      // If it isn't the last node, last.nextKey will properly set at start of new loop\n      last.nextKey = undefined;\n    }\n\n    this.lastKey = last?.key;\n  }\n\n  *[Symbol.iterator]() {\n    yield* this.iterable;\n  }\n\n  get size() {\n    return this.keyMap.size;\n  }\n\n  getKeys() {\n    return this.keyMap.keys();\n  }\n\n  getKeyBefore(key: Key) {\n    let node = this.keyMap.get(key);\n    return node ? node.prevKey : null;\n  }\n\n  getKeyAfter(key: Key) {\n    let node = this.keyMap.get(key);\n    return node ? node.nextKey : null;\n  }\n\n  getFirstKey() {\n    return this.firstKey;\n  }\n\n  getLastKey() {\n    return this.lastKey;\n  }\n\n  getItem(key: Key) {\n    return this.keyMap.get(key);\n  }\n}\n","/*\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 {Collection, CollectionBase, Expandable, MultipleSelection, Node} from '@react-types/shared';\nimport {Key, useEffect, useMemo} from 'react';\nimport {SelectionManager, useMultipleSelectionState} from '@react-stately/selection';\nimport {TreeCollection} from './TreeCollection';\nimport {useCollection} from '@react-stately/collections';\nimport {useControlledState} from '@react-stately/utils';\n\nexport interface TreeProps<T> extends CollectionBase<T>, Expandable, MultipleSelection {}\nexport interface TreeState<T> {\n  /** A collection of items in the tree. */\n  readonly collection: Collection<Node<T>>,\n\n  /** A set of keys for items that are disabled. */\n  readonly disabledKeys: Set<Key>,\n\n  /** A set of keys for items that are expanded. */\n  readonly expandedKeys: Set<Key>,\n\n  /** Toggles the expanded state for an item by its key. */\n  toggleKey(key: Key): void,\n\n  /** A selection manager to read and update multiple selection state. */\n  readonly selectionManager: SelectionManager\n}\n\n/**\n * Provides state management for tree-like components. Handles building a collection\n * of items from props, item expanded state, and manages multiple selection state.\n */\nexport function useTreeState<T extends object>(props: TreeProps<T>): TreeState<T> {\n  let [expandedKeys, setExpandedKeys] = useControlledState(\n    props.expandedKeys ? new Set(props.expandedKeys) : undefined,\n    props.defaultExpandedKeys ? new Set(props.defaultExpandedKeys) : new Set(),\n    props.onExpandedChange\n  );\n\n  let selectionState = useMultipleSelectionState(props);\n  let disabledKeys = useMemo(() =>\n    props.disabledKeys ? new Set(props.disabledKeys) : new Set<Key>()\n  , [props.disabledKeys]);\n\n  let tree = useCollection(props, nodes => new TreeCollection(nodes, {expandedKeys}));\n\n  // Reset focused key if that item is deleted from the collection.\n  useEffect(() => {\n    if (selectionState.focusedKey != null && !tree.getItem(selectionState.focusedKey)) {\n      selectionState.setFocusedKey(null);\n    }\n  }, [tree, selectionState.focusedKey]);\n\n  let onToggle = (key: Key) => {\n    setExpandedKeys(expandedKeys => toggleKey(expandedKeys, key));\n  };\n\n  return {\n    collection: tree,\n    expandedKeys,\n    disabledKeys,\n    toggleKey: onToggle,\n    selectionManager: new SelectionManager(tree, selectionState)\n  };\n}\n\nfunction toggleKey(set: Set<Key>, key: Key): Set<Key> {\n  let res = new Set(set);\n  if (res.has(key)) {\n    res.delete(key);\n  } else {\n    res.add(key);\n  }\n\n  return res;\n}\n"],"names":["Symbol","iterator","TreeCollection","constructor","nodes","expandedKeys","keyMap","Map","iterable","firstKey","lastKey","Set","visit","node","set","key","childNodes","type","has","child","last","index","nextKey","prevKey","undefined","size","getKeys","keys","getKeyBefore","get","getKeyAfter","getFirstKey","getLastKey","getItem","useTreeState","props","setExpandedKeys","useControlledState","defaultExpandedKeys","onExpandedChange","selectionState","useMultipleSelectionState","disabledKeys","useMemo","tree","useCollection","useEffect","focusedKey","setFocusedKey","onToggle","toggleKey","collection","selectionManager","SelectionManager","res","delete","add"],"version":3,"file":"module.js.map"}
+{"mappings":";;;;;;;;;;;;;UEgEI,MAAM,CAAC,QAAQ;MAjDN,yCAAc;aAiDJ,CAAC;eACb,IAAI,CAAC,QAAQ;IACtB,CAAC;QAEG,IAAI,GAAG,CAAC;QACV,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI;IACzB,CAAC;IAED,OAAO,GAAG,CAAC;QACT,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI;IACzB,CAAC;IAED,YAAY,CAAC,GAAQ,EAAE,CAAC;QACtB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG;QAC9B,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI;IACnC,CAAC;IAED,WAAW,CAAC,GAAQ,EAAE,CAAC;QACrB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG;QAC9B,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI;IACnC,CAAC;IAED,WAAW,GAAG,CAAC;QACb,MAAM,CAAC,IAAI,CAAC,QAAQ;IACtB,CAAC;IAED,UAAU,GAAG,CAAC;QACZ,MAAM,CAAC,IAAI,CAAC,OAAO;IACrB,CAAC;IAED,OAAO,CAAC,GAAQ,EAAE,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG;IAC5B,CAAC;IAED,EAAE,CAAC,GAAW,EAAE,CAAC;QACf,KAAK,CAAC,IAAI,GAAG,CAAC;eAAG,IAAI,CAAC,OAAO;QAAE,CAAC;QAChC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG;IAC9B,CAAC;gBAhFW,KAAwB,EAAE,CAAC,eAAA,YAAY,EAA2B,CAAC,GAAG,CAAC;IAAA,CAAC,CAAE,CAAC;QANlF,IAuFN,CAtFS,MAAM,GAAsB,GAAG,CAAC,GAAG;QAMzC,IAAI,CAAC,QAAQ,GAAG,KAAK;QACrB,YAAY,GAAG,YAAY,IAAI,GAAG,CAAC,GAAG;QAEtC,GAAG,CAAC,KAAK,IAAI,IAAa,GAAK,CAAC;YAC9B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI;YAE9B,EAAE,EAAE,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC,IAAI,KAAK,CAAS,YAAI,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,IAC1E,GAAG,EAAE,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,UAAU,CAC/B,KAAK,CAAC,KAAK;QAGjB,CAAC;QAED,GAAG,EAAE,GAAG,CAAC,KAAI,IAAI,KAAK,CACpB,KAAK,CAAC,KAAI;QAGZ,GAAG,CAAC,IAAI;QACR,GAAG,CAAC,KAAK,GAAG,CAAC;QACb,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,KAAI,KAAK,IAAI,CAAC,MAAM,CAAE,CAAC;YACpC,EAAE,EAAE,IAAI,EAAE,CAAC;gBACT,IAAI,CAAC,OAAO,GAAG,GAAG;gBAClB,KAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG;YACzB,CAAC,MAAM,CAAC;gBACN,IAAI,CAAC,QAAQ,GAAG,GAAG;gBACnB,KAAI,CAAC,OAAO,GAAG,SAAS;YAC1B,CAAC;YAED,EAAE,EAAE,KAAI,CAAC,IAAI,KAAK,CAAM,OACtB,KAAI,CAAC,KAAK,GAAG,KAAK;YAGpB,IAAI,GAAG,KAAI;YAEX,EAA6D,AAA7D,2DAA6D;YAC7D,EAAiF,AAAjF,+EAAiF;YACjF,IAAI,CAAC,OAAO,GAAG,SAAS;QAC1B,CAAC;QAED,IAAI,CAAC,OAAO,GAAG,IAAI,aAAJ,IAAI,KAAJ,IAAI,CAAJ,CAAS,GAAT,IAAI,CAAJ,CAAS,GAAT,IAAI,CAAE,GAAG;IAC1B,CAAC;;;;;;SDrBa,yCAAY,CAAmB,KAAmB,EAAgB,CAAC;IACjF,GAAG,EAAE,YAAY,EAAE,eAAe,IAAI,yBAAkB,CACtD,KAAK,CAAC,YAAY,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,IAAI,SAAS,EAC5D,KAAK,CAAC,mBAAmB,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,mBAAmB,IAAI,GAAG,CAAC,GAAG,IACxE,KAAK,CAAC,gBAAgB;IAGxB,GAAG,CAAC,cAAc,GAAG,gCAAyB,CAAC,KAAK;IACpD,GAAG,CAAC,YAAY,GAAG,cAAO,KACxB,KAAK,CAAC,YAAY,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,IAAI,GAAG,CAAC,GAAG;MAC1D,CAAC;QAAA,KAAK,CAAC,YAAY;IAAA,CAAC;IAEtB,GAAG,CAAC,IAAI,GAAG,oBAAa,CAAC,KAAK,GAAE,KAAK,GAAI,GAAG,CAAC,yCAAc,CAAC,KAAK,EAAE,CAAC;0BAAA,YAAY;QAAA,CAAC;MAAG,IAAI,EAAE,CAAC;QAAA,YAAY;IAAA,CAAC;IAExG,EAAiE,AAAjE,+DAAiE;IACjE,gBAAS,KAAO,CAAC;QACf,EAAE,EAAE,cAAc,CAAC,UAAU,IAAI,IAAI,KAAK,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,UAAU,GAC9E,cAAc,CAAC,aAAa,CAAC,IAAI;IAErC,CAAC,EAAE,CAAC;QAAA,IAAI;QAAE,cAAc,CAAC,UAAU;IAAA,CAAC;IAEpC,GAAG,CAAC,QAAQ,IAAI,GAAQ,GAAK,CAAC;QAC5B,eAAe,CAAC,+BAAS,CAAC,YAAY,EAAE,GAAG;IAC7C,CAAC;IAED,MAAM,CAAC,CAAC;QACN,UAAU,EAAE,IAAI;sBAChB,YAAY;sBACZ,YAAY;QACZ,SAAS,EAAE,QAAQ;QACnB,gBAAgB,EAAE,GAAG,CAAC,uBAAgB,CAAC,IAAI,EAAE,cAAc;IAC7D,CAAC;AACH,CAAC;SAEQ,+BAAS,CAAC,GAAa,EAAE,GAAQ,EAAY,CAAC;IACrD,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG;IACrB,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,GACb,GAAG,CAAC,MAAM,CAAC,GAAG;SAEd,GAAG,CAAC,GAAG,CAAC,GAAG;IAGb,MAAM,CAAC,GAAG;AACZ,CAAC","sources":["packages/@react-stately/tree/src/index.ts","packages/@react-stately/tree/src/useTreeState.ts","packages/@react-stately/tree/src/TreeCollection.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\nexport * from './useTreeState';\n","/*\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 {Collection, CollectionBase, Expandable, MultipleSelection, Node} from '@react-types/shared';\nimport {Key, useEffect, useMemo} from 'react';\nimport {SelectionManager, useMultipleSelectionState} from '@react-stately/selection';\nimport {TreeCollection} from './TreeCollection';\nimport {useCollection} from '@react-stately/collections';\nimport {useControlledState} from '@react-stately/utils';\n\nexport interface TreeProps<T> extends CollectionBase<T>, Expandable, MultipleSelection {}\nexport interface TreeState<T> {\n  /** A collection of items in the tree. */\n  readonly collection: Collection<Node<T>>,\n\n  /** A set of keys for items that are disabled. */\n  readonly disabledKeys: Set<Key>,\n\n  /** A set of keys for items that are expanded. */\n  readonly expandedKeys: Set<Key>,\n\n  /** Toggles the expanded state for an item by its key. */\n  toggleKey(key: Key): void,\n\n  /** A selection manager to read and update multiple selection state. */\n  readonly selectionManager: SelectionManager\n}\n\n/**\n * Provides state management for tree-like components. Handles building a collection\n * of items from props, item expanded state, and manages multiple selection state.\n */\nexport function useTreeState<T extends object>(props: TreeProps<T>): TreeState<T> {\n  let [expandedKeys, setExpandedKeys] = useControlledState(\n    props.expandedKeys ? new Set(props.expandedKeys) : undefined,\n    props.defaultExpandedKeys ? new Set(props.defaultExpandedKeys) : new Set(),\n    props.onExpandedChange\n  );\n\n  let selectionState = useMultipleSelectionState(props);\n  let disabledKeys = useMemo(() =>\n    props.disabledKeys ? new Set(props.disabledKeys) : new Set<Key>()\n  , [props.disabledKeys]);\n\n  let tree = useCollection(props, nodes => new TreeCollection(nodes, {expandedKeys}), null, [expandedKeys]);\n\n  // Reset focused key if that item is deleted from the collection.\n  useEffect(() => {\n    if (selectionState.focusedKey != null && !tree.getItem(selectionState.focusedKey)) {\n      selectionState.setFocusedKey(null);\n    }\n  }, [tree, selectionState.focusedKey]);\n\n  let onToggle = (key: Key) => {\n    setExpandedKeys(toggleKey(expandedKeys, key));\n  };\n\n  return {\n    collection: tree,\n    expandedKeys,\n    disabledKeys,\n    toggleKey: onToggle,\n    selectionManager: new SelectionManager(tree, selectionState)\n  };\n}\n\nfunction toggleKey(set: Set<Key>, key: Key): Set<Key> {\n  let res = new Set(set);\n  if (res.has(key)) {\n    res.delete(key);\n  } else {\n    res.add(key);\n  }\n\n  return res;\n}\n","/*\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 {Collection, Node} from '@react-types/shared';\nimport {Key} from 'react';\n\nexport class TreeCollection<T> implements Collection<Node<T>> {\n  private keyMap: Map<Key, Node<T>> = new Map();\n  private iterable: Iterable<Node<T>>;\n  private firstKey: Key;\n  private lastKey: Key;\n\n  constructor(nodes: Iterable<Node<T>>, {expandedKeys}: {expandedKeys?: Set<Key>} = {}) {\n    this.iterable = nodes;\n    expandedKeys = expandedKeys || new Set();\n\n    let visit = (node: Node<T>) => {\n      this.keyMap.set(node.key, node);\n\n      if (node.childNodes && (node.type === 'section' || expandedKeys.has(node.key))) {\n        for (let child of node.childNodes) {\n          visit(child);\n        }\n      }\n    };\n\n    for (let node of nodes) {\n      visit(node);\n    }\n\n    let last: Node<T>;\n    let index = 0;\n    for (let [key, node] of this.keyMap) {\n      if (last) {\n        last.nextKey = key;\n        node.prevKey = last.key;\n      } else {\n        this.firstKey = key;\n        node.prevKey = undefined;\n      }\n\n      if (node.type === 'item') {\n        node.index = index++;\n      }\n\n      last = node;\n\n      // Set nextKey as undefined since this might be the last node\n      // If it isn't the last node, last.nextKey will properly set at start of new loop\n      last.nextKey = undefined;\n    }\n\n    this.lastKey = last?.key;\n  }\n\n  *[Symbol.iterator]() {\n    yield* this.iterable;\n  }\n\n  get size() {\n    return this.keyMap.size;\n  }\n\n  getKeys() {\n    return this.keyMap.keys();\n  }\n\n  getKeyBefore(key: Key) {\n    let node = this.keyMap.get(key);\n    return node ? node.prevKey : null;\n  }\n\n  getKeyAfter(key: Key) {\n    let node = this.keyMap.get(key);\n    return node ? node.nextKey : null;\n  }\n\n  getFirstKey() {\n    return this.firstKey;\n  }\n\n  getLastKey() {\n    return this.lastKey;\n  }\n\n  getItem(key: Key) {\n    return this.keyMap.get(key);\n  }\n\n  at(idx: number) {\n    const keys = [...this.getKeys()];\n    return this.getItem(keys[idx]);\n  }\n}\n"],"names":[],"version":3,"file":"module.js.map"}

package/dist/types.d.ts.map

@@ -1 +1 @@
-{"mappings":"A;A;A;ACmBA,2BAA2B,CAAC,CAAE,SAAQ,eAAe,CAAC,CAAC,EAAE,UAAU,EAAE,iBAAiB;CAAG;AACzF,2BAA2B,CAAC;IAC1B,yCAAyC;IACzC,QAAQ,CAAC,UAAU,EAAE,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC;IAEzC,iDAAiD;IACjD,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IAEhC,iDAAiD;IACjD,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IAEhC,yDAAyD;IACzD,SAAS,CAAC,GAAG,EAAE,GAAG,GAAG,IAAI,CAAC;IAE1B,uEAAuE;IACvE,QAAQ,CAAC,gBAAgB,EAAE,gBAAgB,CAAA;CAC5C;AAED;A;A;GAGG;AACH,6BAA6B,CAAC,SAAS,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAgChF","sources":["./packages/@react-stately/tree/src/packages/@react-stately/tree/src/TreeCollection.ts","./packages/@react-stately/tree/src/packages/@react-stately/tree/src/useTreeState.ts","./packages/@react-stately/tree/src/packages/@react-stately/tree/src/index.ts"],"sourcesContent":[null,null,null],"names":[],"version":3,"file":"types.d.ts.map"}
+{"mappings":";;;ACmBA,2BAA2B,CAAC,CAAE,SAAQ,eAAe,CAAC,CAAC,EAAE,UAAU,EAAE,iBAAiB;CAAG;AACzF,2BAA2B,CAAC;IAC1B,yCAAyC;IACzC,QAAQ,CAAC,UAAU,EAAE,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC;IAEzC,iDAAiD;IACjD,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IAEhC,iDAAiD;IACjD,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IAEhC,yDAAyD;IACzD,SAAS,CAAC,GAAG,EAAE,GAAG,GAAG,IAAI,CAAC;IAE1B,uEAAuE;IACvE,QAAQ,CAAC,gBAAgB,EAAE,gBAAgB,CAAA;CAC5C;AAED;;;GAGG;AACH,6BAA6B,CAAC,SAAS,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAgChF","sources":["packages/@react-stately/tree/src/packages/@react-stately/tree/src/TreeCollection.ts","packages/@react-stately/tree/src/packages/@react-stately/tree/src/useTreeState.ts","packages/@react-stately/tree/src/packages/@react-stately/tree/src/index.ts","packages/@react-stately/tree/src/index.ts"],"sourcesContent":[null,null,null,"/*\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\nexport * from './useTreeState';\n"],"names":[],"version":3,"file":"types.d.ts.map"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@react-stately/tree",
-  "version": "3.1.3",
+  "version": "3.2.2",
   "description": "Spectrum UI components in React",
   "license": "Apache-2.0",
   "main": "dist/main.js",
@@ -18,10 +18,10 @@
   },
   "dependencies": {
     "@babel/runtime": "^7.6.2",
-    "@react-stately/collections": "^3.3.1",
-    "@react-stately/selection": "^3.4.0",
-    "@react-stately/utils": "^3.1.1",
-    "@react-types/shared": "^3.5.0"
+    "@react-stately/collections": "^3.3.6",
+    "@react-stately/selection": "^3.9.2",
+    "@react-stately/utils": "^3.4.1",
+    "@react-types/shared": "^3.11.1"
   },
   "peerDependencies": {
     "react": "^16.8.0 || ^17.0.0-rc.1"
@@ -29,5 +29,5 @@
   "publishConfig": {
     "access": "public"
   },
-  "gitHead": "9920ffaa2596a03c4498a15cb940bd2f4ba5cd6a"
+  "gitHead": "404d41859b7d6f56201d7fc01bd9f22ae3512937"
 }

package/src/TreeCollection.ts

@@ -95,4 +95,9 @@ export class TreeCollection<T> implements Collection<Node<T>> {
   getItem(key: Key) {
     return this.keyMap.get(key);
   }
+
+  at(idx: number) {
+    const keys = [...this.getKeys()];
+    return this.getItem(keys[idx]);
+  }
 }

package/src/useTreeState.ts

@@ -51,7 +51,7 @@ export function useTreeState<T extends object>(props: TreeProps<T>): TreeState<T
     props.disabledKeys ? new Set(props.disabledKeys) : new Set<Key>()
   , [props.disabledKeys]);
 
-  let tree = useCollection(props, nodes => new TreeCollection(nodes, {expandedKeys}));
+  let tree = useCollection(props, nodes => new TreeCollection(nodes, {expandedKeys}), null, [expandedKeys]);
 
   // Reset focused key if that item is deleted from the collection.
   useEffect(() => {
@@ -61,7 +61,7 @@ export function useTreeState<T extends object>(props: TreeProps<T>): TreeState<T
   }, [tree, selectionState.focusedKey]);
 
   let onToggle = (key: Key) => {
-    setExpandedKeys(expandedKeys => toggleKey(expandedKeys, key));
+    setExpandedKeys(toggleKey(expandedKeys, key));
   };
 
   return {