@react-stately/grid 3.0.0-beta.0 → 3.0.0-nightly-641446f65-240905

package/dist/GridCollection.main.js

@@ -0,0 +1,128 @@
+
+function $parcel$export(e, n, v, s) {
+  Object.defineProperty(e, n, {get: v, set: s, enumerable: true, configurable: true});
+}
+
+$parcel$export(module.exports, "GridCollection", () => $8bb6a9101b052a66$export$de3fdf6493c353d);
+/*
+ * 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 $8bb6a9101b052a66$export$de3fdf6493c353d {
+    *[Symbol.iterator]() {
+        yield* [
+            ...this.rows
+        ];
+    }
+    get size() {
+        return [
+            ...this.rows
+        ].length;
+    }
+    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() {
+        var _;
+        return (_ = [
+            ...this.rows
+        ][0]) === null || _ === void 0 ? void 0 : _.key;
+    }
+    getLastKey() {
+        var _rows_;
+        let rows = [
+            ...this.rows
+        ];
+        return (_rows_ = rows[rows.length - 1]) === null || _rows_ === void 0 ? void 0 : _rows_.key;
+    }
+    getItem(key) {
+        return this.keyMap.get(key);
+    }
+    at(idx) {
+        const keys = [
+            ...this.getKeys()
+        ];
+        return this.getItem(keys[idx]);
+    }
+    getChildren(key) {
+        let node = this.keyMap.get(key);
+        return (node === null || node === void 0 ? void 0 : node.childNodes) || [];
+    }
+    constructor(opts){
+        this.keyMap = new Map();
+        this.keyMap = new Map();
+        this.columnCount = opts === null || opts === void 0 ? void 0 : opts.columnCount;
+        this.rows = [];
+        let visit = (node)=>{
+            // If the node is the same object as the previous node for the same key,
+            // we can skip this node and its children. We always visit columns though,
+            // because we depend on order to build the columns array.
+            let prevNode = this.keyMap.get(node.key);
+            if (opts.visitNode) node = opts.visitNode(node);
+            this.keyMap.set(node.key, node);
+            let childKeys = new Set();
+            let last;
+            for (let child of node.childNodes){
+                if (child.type === 'cell' && child.parentKey == null) // if child is a cell parent key isn't already established by the collection, match child node to parent row
+                child.parentKey = node.key;
+                childKeys.add(child.key);
+                if (last) {
+                    last.nextKey = child.key;
+                    child.prevKey = last.key;
+                } else child.prevKey = null;
+                visit(child);
+                last = child;
+            }
+            if (last) last.nextKey = null;
+            // Remove deleted nodes and their children from the key map
+            if (prevNode) {
+                for (let child of prevNode.childNodes)if (!childKeys.has(child.key)) remove(child);
+            }
+        };
+        let remove = (node)=>{
+            this.keyMap.delete(node.key);
+            for (let child of node.childNodes)if (this.keyMap.get(child.key) === child) remove(child);
+        };
+        let last;
+        opts.items.forEach((node, i)=>{
+            let rowNode = {
+                level: 0,
+                key: 'row-' + i,
+                type: 'row',
+                value: undefined,
+                hasChildNodes: true,
+                childNodes: [
+                    ...node.childNodes
+                ],
+                rendered: undefined,
+                textValue: undefined,
+                ...node
+            };
+            if (last) {
+                last.nextKey = rowNode.key;
+                rowNode.prevKey = last.key;
+            } else rowNode.prevKey = null;
+            this.rows.push(rowNode);
+            visit(rowNode);
+            last = rowNode;
+        });
+        if (last) last.nextKey = null;
+    }
+}
+
+
+//# sourceMappingURL=GridCollection.main.js.map

package/dist/GridCollection.main.js.map

@@ -0,0 +1 @@
+{"mappings":";;;;;;AAAA;;;;;;;;;;CAUC,GAWM,MAAM;IAgGX,CAAC,CAAC,OAAO,QAAQ,CAAC,GAAG;QACnB,OAAO;eAAI,IAAI,CAAC,IAAI;SAAC;IACvB;IAEA,IAAI,OAAO;QACT,OAAO;eAAI,IAAI,CAAC,IAAI;SAAC,CAAC,MAAM;IAC9B;IAEA,UAAU;QACR,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI;IACzB;IAEA,aAAa,GAAQ,EAAE;QACrB,IAAI,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;QAC3B,OAAO,OAAO,KAAK,OAAO,GAAG;IAC/B;IAEA,YAAY,GAAQ,EAAE;QACpB,IAAI,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;QAC3B,OAAO,OAAO,KAAK,OAAO,GAAG;IAC/B;IAEA,cAAc;YACL;QAAP,QAAO,IAAA;eAAI,IAAI,CAAC,IAAI;SAAC,CAAC,EAAE,cAAjB,wBAAA,EAAmB,GAAG;IAC/B;IAEA,aAAa;YAEJ;QADP,IAAI,OAAO;eAAI,IAAI,CAAC,IAAI;SAAC;QACzB,QAAO,SAAA,IAAI,CAAC,KAAK,MAAM,GAAG,EAAE,cAArB,6BAAA,OAAuB,GAAG;IACnC;IAEA,QAAQ,GAAQ,EAAE;QAChB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;IACzB;IAEA,GAAG,GAAW,EAAE;QACd,MAAM,OAAO;eAAI,IAAI,CAAC,OAAO;SAAG;QAChC,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI;IAC/B;IAEA,YAAY,GAAQ,EAAyB;QAC3C,IAAI,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;QAC3B,OAAO,CAAA,iBAAA,2BAAA,KAAM,UAAU,KAAI,EAAE;IAC/B;IAtIA,YAAY,IAA+B,CAAE;aAJ7C,SAAgC,IAAI;QAKlC,IAAI,CAAC,MAAM,GAAG,IAAI;QAClB,IAAI,CAAC,WAAW,GAAG,iBAAA,2BAAA,KAAM,WAAW;QACpC,IAAI,CAAC,IAAI,GAAG,EAAE;QAEd,IAAI,QAAQ,CAAC;YACX,wEAAwE;YACxE,0EAA0E;YAC1E,yDAAyD;YACzD,IAAI,WAAW,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,GAAG;YACvC,IAAI,KAAK,SAAS,EAChB,OAAO,KAAK,SAAS,CAAC;YAGxB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,GAAG,EAAE;YAE1B,IAAI,YAAY,IAAI;YACpB,IAAI;YACJ,KAAK,IAAI,SAAS,KAAK,UAAU,CAAE;gBACjC,IAAI,MAAM,IAAI,KAAK,UAAU,MAAM,SAAS,IAAI,MAC9C,4GAA4G;gBAC5G,MAAM,SAAS,GAAG,KAAK,GAAG;gBAE5B,UAAU,GAAG,CAAC,MAAM,GAAG;gBAEvB,IAAI,MAAM;oBACR,KAAK,OAAO,GAAG,MAAM,GAAG;oBACxB,MAAM,OAAO,GAAG,KAAK,GAAG;gBAC1B,OACE,MAAM,OAAO,GAAG;gBAGlB,MAAM;gBACN,OAAO;YACT;YAEA,IAAI,MACF,KAAK,OAAO,GAAG;YAGjB,2DAA2D;YAC3D,IAAI,UAAU;gBACZ,KAAK,IAAI,SAAS,SAAS,UAAU,CACnC,IAAI,CAAC,UAAU,GAAG,CAAC,MAAM,GAAG,GAC1B,OAAO;YAGb;QACF;QAEA,IAAI,SAAS,CAAC;YACZ,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,GAAG;YAC3B,KAAK,IAAI,SAAS,KAAK,UAAU,CAC/B,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,GAAG,MAAM,OACjC,OAAO;QAGb;QAEA,IAAI;QACJ,KAAK,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM;YACxB,IAAI,UAAU;gBACZ,OAAO;gBACP,KAAK,SAAS;gBACd,MAAM;gBACN,OAAO;gBACP,eAAe;gBACf,YAAY;uBAAI,KAAK,UAAU;iBAAC;gBAChC,UAAU;gBACV,WAAW;gBACX,GAAG,IAAI;YACT;YAEA,IAAI,MAAM;gBACR,KAAK,OAAO,GAAG,QAAQ,GAAG;gBAC1B,QAAQ,OAAO,GAAG,KAAK,GAAG;YAC5B,OACE,QAAQ,OAAO,GAAG;YAGpB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;YACf,MAAM;YAEN,OAAO;QACT;QAEA,IAAI,MACF,KAAK,OAAO,GAAG;IAEnB;AA8CF","sources":["packages/@react-stately/grid/src/GridCollection.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 {GridNode, GridRow, GridCollection as IGridCollection} from '@react-types/grid';\nimport {Key} from '@react-types/shared';\n\ninterface GridCollectionOptions<T> {\n  columnCount: number,\n  items: GridRow<T>[],\n  visitNode?: (cell: GridNode<T>) => GridNode<T>\n}\n\nexport class GridCollection<T> implements IGridCollection<T> {\n  keyMap: Map<Key, GridNode<T>> = new Map();\n  columnCount: number;\n  rows: GridNode<T>[];\n\n  constructor(opts?: GridCollectionOptions<T>) {\n    this.keyMap = new Map();\n    this.columnCount = opts?.columnCount;\n    this.rows = [];\n\n    let visit = (node: GridNode<T>) => {\n      // If the node is the same object as the previous node for the same key,\n      // we can skip this node and its children. We always visit columns though,\n      // because we depend on order to build the columns array.\n      let prevNode = this.keyMap.get(node.key);\n      if (opts.visitNode) {\n        node = opts.visitNode(node);\n      }\n\n      this.keyMap.set(node.key, node);\n\n      let childKeys = new Set();\n      let last: GridNode<T>;\n      for (let child of node.childNodes) {\n        if (child.type === 'cell' && child.parentKey == null) {\n          // if child is a cell parent key isn't already established by the collection, match child node to parent row\n          child.parentKey = node.key;\n        }\n        childKeys.add(child.key);\n\n        if (last) {\n          last.nextKey = child.key;\n          child.prevKey = last.key;\n        } else {\n          child.prevKey = null;\n        }\n\n        visit(child);\n        last = child;\n      }\n\n      if (last) {\n        last.nextKey = null;\n      }\n\n      // Remove deleted nodes and their children from the key map\n      if (prevNode) {\n        for (let child of prevNode.childNodes) {\n          if (!childKeys.has(child.key)) {\n            remove(child);\n          }\n        }\n      }\n    };\n\n    let remove = (node: GridNode<T>) => {\n      this.keyMap.delete(node.key);\n      for (let child of node.childNodes) {\n        if (this.keyMap.get(child.key) === child) {\n          remove(child);\n        }\n      }\n    };\n\n    let last: GridNode<T>;\n    opts.items.forEach((node, i) => {\n      let rowNode = {\n        level: 0,\n        key: 'row-' + i,\n        type: 'row',\n        value: undefined,\n        hasChildNodes: true,\n        childNodes: [...node.childNodes],\n        rendered: undefined,\n        textValue: undefined,\n        ...node\n      } as GridNode<T>;\n\n      if (last) {\n        last.nextKey = rowNode.key;\n        rowNode.prevKey = last.key;\n      } else {\n        rowNode.prevKey = null;\n      }\n\n      this.rows.push(rowNode);\n      visit(rowNode);\n\n      last = rowNode;\n    });\n\n    if (last) {\n      last.nextKey = null;\n    }\n  }\n\n  *[Symbol.iterator]() {\n    yield* [...this.rows];\n  }\n\n  get size() {\n    return [...this.rows].length;\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.rows][0]?.key;\n  }\n\n  getLastKey() {\n    let rows = [...this.rows];\n    return rows[rows.length - 1]?.key;\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  getChildren(key: Key): Iterable<GridNode<T>> {\n    let node = this.keyMap.get(key);\n    return node?.childNodes || [];\n  }\n}\n"],"names":[],"version":3,"file":"GridCollection.main.js.map"}

package/dist/GridCollection.mjs

@@ -0,0 +1,123 @@
+/*
+ * 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 $16805b1b18093c5f$export$de3fdf6493c353d {
+    *[Symbol.iterator]() {
+        yield* [
+            ...this.rows
+        ];
+    }
+    get size() {
+        return [
+            ...this.rows
+        ].length;
+    }
+    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() {
+        var _;
+        return (_ = [
+            ...this.rows
+        ][0]) === null || _ === void 0 ? void 0 : _.key;
+    }
+    getLastKey() {
+        var _rows_;
+        let rows = [
+            ...this.rows
+        ];
+        return (_rows_ = rows[rows.length - 1]) === null || _rows_ === void 0 ? void 0 : _rows_.key;
+    }
+    getItem(key) {
+        return this.keyMap.get(key);
+    }
+    at(idx) {
+        const keys = [
+            ...this.getKeys()
+        ];
+        return this.getItem(keys[idx]);
+    }
+    getChildren(key) {
+        let node = this.keyMap.get(key);
+        return (node === null || node === void 0 ? void 0 : node.childNodes) || [];
+    }
+    constructor(opts){
+        this.keyMap = new Map();
+        this.keyMap = new Map();
+        this.columnCount = opts === null || opts === void 0 ? void 0 : opts.columnCount;
+        this.rows = [];
+        let visit = (node)=>{
+            // If the node is the same object as the previous node for the same key,
+            // we can skip this node and its children. We always visit columns though,
+            // because we depend on order to build the columns array.
+            let prevNode = this.keyMap.get(node.key);
+            if (opts.visitNode) node = opts.visitNode(node);
+            this.keyMap.set(node.key, node);
+            let childKeys = new Set();
+            let last;
+            for (let child of node.childNodes){
+                if (child.type === 'cell' && child.parentKey == null) // if child is a cell parent key isn't already established by the collection, match child node to parent row
+                child.parentKey = node.key;
+                childKeys.add(child.key);
+                if (last) {
+                    last.nextKey = child.key;
+                    child.prevKey = last.key;
+                } else child.prevKey = null;
+                visit(child);
+                last = child;
+            }
+            if (last) last.nextKey = null;
+            // Remove deleted nodes and their children from the key map
+            if (prevNode) {
+                for (let child of prevNode.childNodes)if (!childKeys.has(child.key)) remove(child);
+            }
+        };
+        let remove = (node)=>{
+            this.keyMap.delete(node.key);
+            for (let child of node.childNodes)if (this.keyMap.get(child.key) === child) remove(child);
+        };
+        let last;
+        opts.items.forEach((node, i)=>{
+            let rowNode = {
+                level: 0,
+                key: 'row-' + i,
+                type: 'row',
+                value: undefined,
+                hasChildNodes: true,
+                childNodes: [
+                    ...node.childNodes
+                ],
+                rendered: undefined,
+                textValue: undefined,
+                ...node
+            };
+            if (last) {
+                last.nextKey = rowNode.key;
+                rowNode.prevKey = last.key;
+            } else rowNode.prevKey = null;
+            this.rows.push(rowNode);
+            visit(rowNode);
+            last = rowNode;
+        });
+        if (last) last.nextKey = null;
+    }
+}
+
+
+export {$16805b1b18093c5f$export$de3fdf6493c353d as GridCollection};
+//# sourceMappingURL=GridCollection.module.js.map

package/dist/GridCollection.module.js

@@ -0,0 +1,123 @@
+/*
+ * 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 $16805b1b18093c5f$export$de3fdf6493c353d {
+    *[Symbol.iterator]() {
+        yield* [
+            ...this.rows
+        ];
+    }
+    get size() {
+        return [
+            ...this.rows
+        ].length;
+    }
+    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() {
+        var _;
+        return (_ = [
+            ...this.rows
+        ][0]) === null || _ === void 0 ? void 0 : _.key;
+    }
+    getLastKey() {
+        var _rows_;
+        let rows = [
+            ...this.rows
+        ];
+        return (_rows_ = rows[rows.length - 1]) === null || _rows_ === void 0 ? void 0 : _rows_.key;
+    }
+    getItem(key) {
+        return this.keyMap.get(key);
+    }
+    at(idx) {
+        const keys = [
+            ...this.getKeys()
+        ];
+        return this.getItem(keys[idx]);
+    }
+    getChildren(key) {
+        let node = this.keyMap.get(key);
+        return (node === null || node === void 0 ? void 0 : node.childNodes) || [];
+    }
+    constructor(opts){
+        this.keyMap = new Map();
+        this.keyMap = new Map();
+        this.columnCount = opts === null || opts === void 0 ? void 0 : opts.columnCount;
+        this.rows = [];
+        let visit = (node)=>{
+            // If the node is the same object as the previous node for the same key,
+            // we can skip this node and its children. We always visit columns though,
+            // because we depend on order to build the columns array.
+            let prevNode = this.keyMap.get(node.key);
+            if (opts.visitNode) node = opts.visitNode(node);
+            this.keyMap.set(node.key, node);
+            let childKeys = new Set();
+            let last;
+            for (let child of node.childNodes){
+                if (child.type === 'cell' && child.parentKey == null) // if child is a cell parent key isn't already established by the collection, match child node to parent row
+                child.parentKey = node.key;
+                childKeys.add(child.key);
+                if (last) {
+                    last.nextKey = child.key;
+                    child.prevKey = last.key;
+                } else child.prevKey = null;
+                visit(child);
+                last = child;
+            }
+            if (last) last.nextKey = null;
+            // Remove deleted nodes and their children from the key map
+            if (prevNode) {
+                for (let child of prevNode.childNodes)if (!childKeys.has(child.key)) remove(child);
+            }
+        };
+        let remove = (node)=>{
+            this.keyMap.delete(node.key);
+            for (let child of node.childNodes)if (this.keyMap.get(child.key) === child) remove(child);
+        };
+        let last;
+        opts.items.forEach((node, i)=>{
+            let rowNode = {
+                level: 0,
+                key: 'row-' + i,
+                type: 'row',
+                value: undefined,
+                hasChildNodes: true,
+                childNodes: [
+                    ...node.childNodes
+                ],
+                rendered: undefined,
+                textValue: undefined,
+                ...node
+            };
+            if (last) {
+                last.nextKey = rowNode.key;
+                rowNode.prevKey = last.key;
+            } else rowNode.prevKey = null;
+            this.rows.push(rowNode);
+            visit(rowNode);
+            last = rowNode;
+        });
+        if (last) last.nextKey = null;
+    }
+}
+
+
+export {$16805b1b18093c5f$export$de3fdf6493c353d as GridCollection};
+//# sourceMappingURL=GridCollection.module.js.map

package/dist/GridCollection.module.js.map

@@ -0,0 +1 @@
+{"mappings":"AAAA;;;;;;;;;;CAUC,GAWM,MAAM;IAgGX,CAAC,CAAC,OAAO,QAAQ,CAAC,GAAG;QACnB,OAAO;eAAI,IAAI,CAAC,IAAI;SAAC;IACvB;IAEA,IAAI,OAAO;QACT,OAAO;eAAI,IAAI,CAAC,IAAI;SAAC,CAAC,MAAM;IAC9B;IAEA,UAAU;QACR,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI;IACzB;IAEA,aAAa,GAAQ,EAAE;QACrB,IAAI,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;QAC3B,OAAO,OAAO,KAAK,OAAO,GAAG;IAC/B;IAEA,YAAY,GAAQ,EAAE;QACpB,IAAI,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;QAC3B,OAAO,OAAO,KAAK,OAAO,GAAG;IAC/B;IAEA,cAAc;YACL;QAAP,QAAO,IAAA;eAAI,IAAI,CAAC,IAAI;SAAC,CAAC,EAAE,cAAjB,wBAAA,EAAmB,GAAG;IAC/B;IAEA,aAAa;YAEJ;QADP,IAAI,OAAO;eAAI,IAAI,CAAC,IAAI;SAAC;QACzB,QAAO,SAAA,IAAI,CAAC,KAAK,MAAM,GAAG,EAAE,cAArB,6BAAA,OAAuB,GAAG;IACnC;IAEA,QAAQ,GAAQ,EAAE;QAChB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;IACzB;IAEA,GAAG,GAAW,EAAE;QACd,MAAM,OAAO;eAAI,IAAI,CAAC,OAAO;SAAG;QAChC,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI;IAC/B;IAEA,YAAY,GAAQ,EAAyB;QAC3C,IAAI,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;QAC3B,OAAO,CAAA,iBAAA,2BAAA,KAAM,UAAU,KAAI,EAAE;IAC/B;IAtIA,YAAY,IAA+B,CAAE;aAJ7C,SAAgC,IAAI;QAKlC,IAAI,CAAC,MAAM,GAAG,IAAI;QAClB,IAAI,CAAC,WAAW,GAAG,iBAAA,2BAAA,KAAM,WAAW;QACpC,IAAI,CAAC,IAAI,GAAG,EAAE;QAEd,IAAI,QAAQ,CAAC;YACX,wEAAwE;YACxE,0EAA0E;YAC1E,yDAAyD;YACzD,IAAI,WAAW,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,GAAG;YACvC,IAAI,KAAK,SAAS,EAChB,OAAO,KAAK,SAAS,CAAC;YAGxB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,GAAG,EAAE;YAE1B,IAAI,YAAY,IAAI;YACpB,IAAI;YACJ,KAAK,IAAI,SAAS,KAAK,UAAU,CAAE;gBACjC,IAAI,MAAM,IAAI,KAAK,UAAU,MAAM,SAAS,IAAI,MAC9C,4GAA4G;gBAC5G,MAAM,SAAS,GAAG,KAAK,GAAG;gBAE5B,UAAU,GAAG,CAAC,MAAM,GAAG;gBAEvB,IAAI,MAAM;oBACR,KAAK,OAAO,GAAG,MAAM,GAAG;oBACxB,MAAM,OAAO,GAAG,KAAK,GAAG;gBAC1B,OACE,MAAM,OAAO,GAAG;gBAGlB,MAAM;gBACN,OAAO;YACT;YAEA,IAAI,MACF,KAAK,OAAO,GAAG;YAGjB,2DAA2D;YAC3D,IAAI,UAAU;gBACZ,KAAK,IAAI,SAAS,SAAS,UAAU,CACnC,IAAI,CAAC,UAAU,GAAG,CAAC,MAAM,GAAG,GAC1B,OAAO;YAGb;QACF;QAEA,IAAI,SAAS,CAAC;YACZ,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,GAAG;YAC3B,KAAK,IAAI,SAAS,KAAK,UAAU,CAC/B,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,GAAG,MAAM,OACjC,OAAO;QAGb;QAEA,IAAI;QACJ,KAAK,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM;YACxB,IAAI,UAAU;gBACZ,OAAO;gBACP,KAAK,SAAS;gBACd,MAAM;gBACN,OAAO;gBACP,eAAe;gBACf,YAAY;uBAAI,KAAK,UAAU;iBAAC;gBAChC,UAAU;gBACV,WAAW;gBACX,GAAG,IAAI;YACT;YAEA,IAAI,MAAM;gBACR,KAAK,OAAO,GAAG,QAAQ,GAAG;gBAC1B,QAAQ,OAAO,GAAG,KAAK,GAAG;YAC5B,OACE,QAAQ,OAAO,GAAG;YAGpB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;YACf,MAAM;YAEN,OAAO;QACT;QAEA,IAAI,MACF,KAAK,OAAO,GAAG;IAEnB;AA8CF","sources":["packages/@react-stately/grid/src/GridCollection.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 {GridNode, GridRow, GridCollection as IGridCollection} from '@react-types/grid';\nimport {Key} from '@react-types/shared';\n\ninterface GridCollectionOptions<T> {\n  columnCount: number,\n  items: GridRow<T>[],\n  visitNode?: (cell: GridNode<T>) => GridNode<T>\n}\n\nexport class GridCollection<T> implements IGridCollection<T> {\n  keyMap: Map<Key, GridNode<T>> = new Map();\n  columnCount: number;\n  rows: GridNode<T>[];\n\n  constructor(opts?: GridCollectionOptions<T>) {\n    this.keyMap = new Map();\n    this.columnCount = opts?.columnCount;\n    this.rows = [];\n\n    let visit = (node: GridNode<T>) => {\n      // If the node is the same object as the previous node for the same key,\n      // we can skip this node and its children. We always visit columns though,\n      // because we depend on order to build the columns array.\n      let prevNode = this.keyMap.get(node.key);\n      if (opts.visitNode) {\n        node = opts.visitNode(node);\n      }\n\n      this.keyMap.set(node.key, node);\n\n      let childKeys = new Set();\n      let last: GridNode<T>;\n      for (let child of node.childNodes) {\n        if (child.type === 'cell' && child.parentKey == null) {\n          // if child is a cell parent key isn't already established by the collection, match child node to parent row\n          child.parentKey = node.key;\n        }\n        childKeys.add(child.key);\n\n        if (last) {\n          last.nextKey = child.key;\n          child.prevKey = last.key;\n        } else {\n          child.prevKey = null;\n        }\n\n        visit(child);\n        last = child;\n      }\n\n      if (last) {\n        last.nextKey = null;\n      }\n\n      // Remove deleted nodes and their children from the key map\n      if (prevNode) {\n        for (let child of prevNode.childNodes) {\n          if (!childKeys.has(child.key)) {\n            remove(child);\n          }\n        }\n      }\n    };\n\n    let remove = (node: GridNode<T>) => {\n      this.keyMap.delete(node.key);\n      for (let child of node.childNodes) {\n        if (this.keyMap.get(child.key) === child) {\n          remove(child);\n        }\n      }\n    };\n\n    let last: GridNode<T>;\n    opts.items.forEach((node, i) => {\n      let rowNode = {\n        level: 0,\n        key: 'row-' + i,\n        type: 'row',\n        value: undefined,\n        hasChildNodes: true,\n        childNodes: [...node.childNodes],\n        rendered: undefined,\n        textValue: undefined,\n        ...node\n      } as GridNode<T>;\n\n      if (last) {\n        last.nextKey = rowNode.key;\n        rowNode.prevKey = last.key;\n      } else {\n        rowNode.prevKey = null;\n      }\n\n      this.rows.push(rowNode);\n      visit(rowNode);\n\n      last = rowNode;\n    });\n\n    if (last) {\n      last.nextKey = null;\n    }\n  }\n\n  *[Symbol.iterator]() {\n    yield* [...this.rows];\n  }\n\n  get size() {\n    return [...this.rows].length;\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.rows][0]?.key;\n  }\n\n  getLastKey() {\n    let rows = [...this.rows];\n    return rows[rows.length - 1]?.key;\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  getChildren(key: Key): Iterable<GridNode<T>> {\n    let node = this.keyMap.get(key);\n    return node?.childNodes || [];\n  }\n}\n"],"names":[],"version":3,"file":"GridCollection.module.js.map"}

package/dist/import.mjs

@@ -0,0 +1,19 @@
+import {useGridState as $62967d126f3aa823$export$4007ac09ff9c68ed} from "./useGridState.mjs";
+import {GridCollection as $16805b1b18093c5f$export$de3fdf6493c353d} from "./GridCollection.mjs";
+
+/*
+ * 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.
+ */ 
+
+
+
+export {$62967d126f3aa823$export$4007ac09ff9c68ed as useGridState, $16805b1b18093c5f$export$de3fdf6493c353d as GridCollection};
+//# sourceMappingURL=module.js.map

package/dist/main.js

@@ -1,71 +1,13 @@
-var _babelRuntimeHelpersExtends = $parcel$interopDefault(require("@babel/runtime/helpers/extends"));
+var $38009b28e45912ea$exports = require("./useGridState.main.js");
+var $8bb6a9101b052a66$exports = require("./GridCollection.main.js");
 
-var {
-  SelectionManager,
-  useMultipleSelectionState
-} = require("@react-stately/selection");
 
-var {
-  useEffect,
-  useMemo
-} = require("react");
-
-function $parcel$interopDefault(a) {
-  return a && a.__esModule ? a.default : a;
+function $parcel$export(e, n, v, s) {
+  Object.defineProperty(e, n, {get: v, set: s, enumerable: true, configurable: true});
 }
 
-/**
- * Provides state management for a grid component. Handles row selection and focusing a grid cell's focusable child if applicable.
- */
-function useGridState(props) {
-  let {
-    collection,
-    focusMode
-  } = props;
-  let selectionState = useMultipleSelectionState(props);
-  let disabledKeys = useMemo(() => props.disabledKeys ? new Set(props.disabledKeys) : new Set(), [props.disabledKeys]);
-  let setFocusedKey = selectionState.setFocusedKey;
-
-  selectionState.setFocusedKey = (key, child) => {
-    // If focusMode is cell and an item is focused, focus a child cell instead.
-    if (focusMode === 'cell' && key != null) {
-      let item = collection.getItem(key);
-
-      if ((item == null ? void 0 : item.type) === 'item') {
-        let children = [...item.childNodes];
-
-        if (child === 'last') {
-          var _children;
-
-          key = (_children = children[children.length - 1]) == null ? void 0 : _children.key;
-        } else {
-          var _children$;
-
-          key = (_children$ = children[0]) == null ? void 0 : _children$.key;
-        }
-      }
-    }
-
-    setFocusedKey(key, child);
-  }; // Reset focused key if that item is deleted from the collection.
-
-
-  useEffect(() => {
-    if (selectionState.focusedKey != null && !collection.getItem(selectionState.focusedKey)) {
-      selectionState.setFocusedKey(null);
-    }
-  }, [collection, selectionState.focusedKey]);
-  return {
-    collection,
-    disabledKeys,
-    selectionManager: new SelectionManager(collection, selectionState)
-  };
-}
-
-exports.useGridState = useGridState;
-let $b9f358a1a5a44d4c3a26859$var$_Symbol$iterator;
-$b9f358a1a5a44d4c3a26859$var$_Symbol$iterator = Symbol.iterator;
-
+$parcel$export(module.exports, "useGridState", () => $38009b28e45912ea$exports.useGridState);
+$parcel$export(module.exports, "GridCollection", () => $8bb6a9101b052a66$exports.GridCollection);
 /*
  * Copyright 2020 Adobe. All rights reserved.
  * This file is licensed to you under the Apache License, Version 2.0 (the "License");
@@ -76,145 +18,8 @@ $b9f358a1a5a44d4c3a26859$var$_Symbol$iterator = Symbol.iterator;
  * 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 GridCollection {
-  constructor(opts) {
-    this.keyMap = new Map();
-    this.columnCount = void 0;
-    this.rows = void 0;
-    this.keyMap = new Map();
-    this.columnCount = opts == null ? void 0 : opts.columnCount;
-    this.rows = [];
-
-    let visit = node => {
-      // If the node is the same object as the previous node for the same key,
-      // we can skip this node and its children. We always visit columns though,
-      // because we depend on order to build the columns array.
-      let prevNode = this.keyMap.get(node.key);
-
-      if (opts.visitNode) {
-        node = opts.visitNode(node);
-      }
-
-      this.keyMap.set(node.key, node);
-      let childKeys = new Set();
-      let last;
-
-      for (let child of node.childNodes) {
-        if (child.type === 'cell' && child.parentKey == null) {
-          // if child is a cell parent key isn't already established by the collection, match child node to parent row
-          child.parentKey = node.key;
-        }
-
-        childKeys.add(child.key);
-
-        if (last) {
-          last.nextKey = child.key;
-          child.prevKey = last.key;
-        } else {
-          child.prevKey = null;
-        }
-
-        visit(child);
-        last = child;
-      }
+ */ 
 
-      if (last) {
-        last.nextKey = null;
-      } // Remove deleted nodes and their children from the key map
 
 
-      if (prevNode) {
-        for (let child of prevNode.childNodes) {
-          if (!childKeys.has(child.key)) {
-            remove(child);
-          }
-        }
-      }
-    };
-
-    let remove = node => {
-      this.keyMap.delete(node.key);
-
-      for (let child of node.childNodes) {
-        if (this.keyMap.get(child.key) === child) {
-          remove(child);
-        }
-      }
-    };
-
-    let last;
-    opts.items.forEach((node, i) => {
-      let rowNode = _babelRuntimeHelpersExtends({
-        level: 0,
-        key: 'row-' + i,
-        type: 'row',
-        value: undefined,
-        hasChildNodes: true,
-        childNodes: [...node.childNodes],
-        rendered: undefined,
-        textValue: undefined
-      }, node, {
-        index: i
-      });
-
-      if (last) {
-        last.nextKey = rowNode.key;
-        rowNode.prevKey = last.key;
-      } else {
-        rowNode.prevKey = null;
-      }
-
-      this.rows.push(rowNode);
-      visit(rowNode);
-      last = rowNode;
-    });
-
-    if (last) {
-      last.nextKey = null;
-    }
-  }
-
-  *[$b9f358a1a5a44d4c3a26859$var$_Symbol$iterator]() {
-    yield* [...this.rows];
-  }
-
-  get size() {
-    return [...this.rows].length;
-  }
-
-  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() {
-    var _;
-
-    return (_ = [...this.rows][0]) == null ? void 0 : _.key;
-  }
-
-  getLastKey() {
-    var _rows;
-
-    let rows = [...this.rows];
-    return (_rows = rows[rows.length - 1]) == null ? void 0 : _rows.key;
-  }
-
-  getItem(key) {
-    return this.keyMap.get(key);
-  }
-
-}
-
-exports.GridCollection = GridCollection;
 //# sourceMappingURL=main.js.map