@react-stately/virtualizer 3.0.0-nightly-641446f65-240905

package/dist/Rect.main.js

@@ -0,0 +1,130 @@
+var $f89f15d7f52bce29$exports = require("./Point.main.js");
+
+
+function $parcel$export(e, n, v, s) {
+  Object.defineProperty(e, n, {get: v, set: s, enumerable: true, configurable: true});
+}
+
+$parcel$export(module.exports, "Rect", () => $41b7691783731623$export$c79fc6492f3af13d);
+/*
+ * 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 $41b7691783731623$export$c79fc6492f3af13d {
+    /**
+   * The maximum x-coordinate in the rectangle.
+   */ get maxX() {
+        return this.x + this.width;
+    }
+    /**
+   * The maximum y-coordinate in the rectangle.
+   */ get maxY() {
+        return this.y + this.height;
+    }
+    /**
+   * The area of the rectangle.
+   */ get area() {
+        return this.width * this.height;
+    }
+    /**
+   * The top left corner of the rectangle.
+   */ get topLeft() {
+        return new (0, $f89f15d7f52bce29$exports.Point)(this.x, this.y);
+    }
+    /**
+   * The top right corner of the rectangle.
+   */ get topRight() {
+        return new (0, $f89f15d7f52bce29$exports.Point)(this.maxX, this.y);
+    }
+    /**
+   * The bottom left corner of the rectangle.
+   */ get bottomLeft() {
+        return new (0, $f89f15d7f52bce29$exports.Point)(this.x, this.maxY);
+    }
+    /**
+   * The bottom right corner of the rectangle.
+   */ get bottomRight() {
+        return new (0, $f89f15d7f52bce29$exports.Point)(this.maxX, this.maxY);
+    }
+    /**
+   * Returns whether this rectangle intersects another rectangle.
+   * @param rect - The rectangle to check.
+   */ intersects(rect) {
+        return this.x <= rect.x + rect.width && rect.x <= this.x + this.width && this.y <= rect.y + rect.height && rect.y <= this.y + this.height;
+    }
+    /**
+   * Returns whether this rectangle fully contains another rectangle.
+   * @param rect - The rectangle to check.
+   */ containsRect(rect) {
+        return this.x <= rect.x && this.y <= rect.y && this.maxX >= rect.maxX && this.maxY >= rect.maxY;
+    }
+    /**
+   * Returns whether the rectangle contains the given point.
+   * @param point - The point to check.
+   */ containsPoint(point) {
+        return this.x <= point.x && this.y <= point.y && this.maxX >= point.x && this.maxY >= point.y;
+    }
+    /**
+   * Returns the first corner of this rectangle (from top to bottom, left to right)
+   * that is contained in the given rectangle, or null of the rectangles do not intersect.
+   * @param rect - The rectangle to check.
+   */ getCornerInRect(rect) {
+        for (let key of [
+            'topLeft',
+            'topRight',
+            'bottomLeft',
+            'bottomRight'
+        ]){
+            if (rect.containsPoint(this[key])) return key;
+        }
+        return null;
+    }
+    equals(rect) {
+        return rect.x === this.x && rect.y === this.y && rect.width === this.width && rect.height === this.height;
+    }
+    pointEquals(point) {
+        return this.x === point.x && this.y === point.y;
+    }
+    sizeEquals(size) {
+        return this.width === size.width && this.height === size.height;
+    }
+    /**
+   * Returns the union of this Rect and another.
+   */ union(other) {
+        let x = Math.min(this.x, other.x);
+        let y = Math.min(this.y, other.y);
+        let width = Math.max(this.maxX, other.maxX) - x;
+        let height = Math.max(this.maxY, other.maxY) - y;
+        return new $41b7691783731623$export$c79fc6492f3af13d(x, y, width, height);
+    }
+    /**
+   * Returns the intersection of this Rect with another.
+   * If the rectangles do not intersect, an all zero Rect is returned.
+   */ intersection(other) {
+        if (!this.intersects(other)) return new $41b7691783731623$export$c79fc6492f3af13d(0, 0, 0, 0);
+        let x = Math.max(this.x, other.x);
+        let y = Math.max(this.y, other.y);
+        return new $41b7691783731623$export$c79fc6492f3af13d(x, y, Math.min(this.maxX, other.maxX) - x, Math.min(this.maxY, other.maxY) - y);
+    }
+    /**
+   * Returns a copy of this rectangle.
+   */ copy() {
+        return new $41b7691783731623$export$c79fc6492f3af13d(this.x, this.y, this.width, this.height);
+    }
+    constructor(x = 0, y = 0, width = 0, height = 0){
+        this.x = x;
+        this.y = y;
+        this.width = width;
+        this.height = height;
+    }
+}
+
+
+//# sourceMappingURL=Rect.main.js.map

package/dist/Rect.main.js.map

@@ -0,0 +1 @@
+{"mappings":";;;;;;;;AAAA;;;;;;;;;;CAUC;AAUM,MAAM;IAoBX;;GAEC,GACD,IAAI,OAAe;QACjB,OAAO,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK;IAC5B;IAEA;;GAEC,GACD,IAAI,OAAe;QACjB,OAAO,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM;IAC7B;IAEA;;GAEC,GACD,IAAI,OAAe;QACjB,OAAO,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM;IACjC;IAEA;;GAEC,GACD,IAAI,UAAiB;QACnB,OAAO,IAAI,CAAA,GAAA,+BAAI,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACjC;IAEA;;GAEC,GACD,IAAI,WAAkB;QACpB,OAAO,IAAI,CAAA,GAAA,+BAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACpC;IAEA;;GAEC,GACD,IAAI,aAAoB;QACtB,OAAO,IAAI,CAAA,GAAA,+BAAI,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI;IACpC;IAEA;;GAEC,GACD,IAAI,cAAqB;QACvB,OAAO,IAAI,CAAA,GAAA,+BAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI;IACvC;IAEA;;;GAGC,GACD,WAAW,IAAU,EAAW;QAC9B,OAAO,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,KAAK,KAAK,IAC7B,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,IAC7B,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,KAAK,MAAM,IAC9B,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM;IACvC;IAEA;;;GAGC,GACD,aAAa,IAAU,EAAW;QAChC,OAAO,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAChB,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAChB,IAAI,CAAC,IAAI,IAAI,KAAK,IAAI,IACtB,IAAI,CAAC,IAAI,IAAI,KAAK,IAAI;IAC/B;IAEA;;;GAGC,GACD,cAAc,KAAY,EAAW;QACnC,OAAO,IAAI,CAAC,CAAC,IAAI,MAAM,CAAC,IACjB,IAAI,CAAC,CAAC,IAAI,MAAM,CAAC,IACjB,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC,IACpB,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC;IAC7B;IAEA;;;;GAIC,GACD,gBAAgB,IAAU,EAAqB;QAC7C,KAAK,IAAI,OAAO;YAAC;YAAW;YAAY;YAAc;SAAc,CAAE;YACpE,IAAI,KAAK,aAAa,CAAC,IAAI,CAAC,IAAI,GAC9B,OAAO;QAEX;QAEA,OAAO;IACT;IAEA,OAAO,IAAU,EAAE;QACjB,OAAO,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC,IACjB,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC,IACjB,KAAK,KAAK,KAAK,IAAI,CAAC,KAAK,IACzB,KAAK,MAAM,KAAK,IAAI,CAAC,MAAM;IACpC;IAEA,YAAY,KAAmB,EAAE;QAC/B,OAAO,IAAI,CAAC,CAAC,KAAK,MAAM,CAAC,IAClB,IAAI,CAAC,CAAC,KAAK,MAAM,CAAC;IAC3B;IAEA,WAAW,IAAiB,EAAE;QAC5B,OAAO,IAAI,CAAC,KAAK,KAAK,KAAK,KAAK,IACzB,IAAI,CAAC,MAAM,KAAK,KAAK,MAAM;IACpC;IAEA;;GAEC,GACD,MAAM,KAAW,EAAE;QACjB,IAAI,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC;QAChC,IAAI,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC;QAChC,IAAI,QAAQ,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,IAAI,IAAI;QAC9C,IAAI,SAAS,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,IAAI,IAAI;QAC/C,OAAO,IAAI,0CAAK,GAAG,GAAG,OAAO;IAC/B;IAEA;;;GAGC,GACD,aAAa,KAAW,EAAQ;QAC9B,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,QACnB,OAAO,IAAI,0CAAK,GAAG,GAAG,GAAG;QAG3B,IAAI,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC;QAChC,IAAI,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC;QAChC,OAAO,IAAI,0CACT,GACA,GACA,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,IAAI,IAAI,GAClC,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,IAAI,IAAI;IAEtC;IAEA;;GAEC,GACD,OAAa;QACX,OAAO,IAAI,0CAAK,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM;IACzD;IA5JA,YAAY,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,QAAQ,CAAC,EAAE,SAAS,CAAC,CAAE;QAC/C,IAAI,CAAC,CAAC,GAAG;QACT,IAAI,CAAC,CAAC,GAAG;QACT,IAAI,CAAC,KAAK,GAAG;QACb,IAAI,CAAC,MAAM,GAAG;IAChB;AAwJF","sources":["packages/@react-stately/virtualizer/src/Rect.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 {Point} from './Point';\nimport {Size} from './Size';\n\nexport type RectCorner = 'topLeft' | 'topRight' | 'bottomLeft' | 'bottomRight';\n\n/**\n * Represents a rectangle.\n */\nexport class Rect {\n  /** The x-coordinate of the rectangle. */\n  x: number;\n\n  /** The y-coordinate of the rectangle. */\n  y: number;\n\n  /** The width of the rectangle. */\n  width: number;\n\n  /** The height of the rectangle. */\n  height: number;\n\n  constructor(x = 0, y = 0, width = 0, height = 0) {\n    this.x = x;\n    this.y = y;\n    this.width = width;\n    this.height = height;\n  }\n\n  /**\n   * The maximum x-coordinate in the rectangle.\n   */\n  get maxX(): number {\n    return this.x + this.width;\n  }\n\n  /**\n   * The maximum y-coordinate in the rectangle.\n   */\n  get maxY(): number {\n    return this.y + this.height;\n  }\n\n  /**\n   * The area of the rectangle.\n   */\n  get area(): number {\n    return this.width * this.height;\n  }\n\n  /**\n   * The top left corner of the rectangle.\n   */\n  get topLeft(): Point {\n    return new Point(this.x, this.y);\n  }\n\n  /**\n   * The top right corner of the rectangle.\n   */\n  get topRight(): Point {\n    return new Point(this.maxX, this.y);\n  }\n\n  /**\n   * The bottom left corner of the rectangle.\n   */\n  get bottomLeft(): Point {\n    return new Point(this.x, this.maxY);\n  }\n\n  /**\n   * The bottom right corner of the rectangle.\n   */\n  get bottomRight(): Point {\n    return new Point(this.maxX, this.maxY);\n  }\n\n  /**\n   * Returns whether this rectangle intersects another rectangle.\n   * @param rect - The rectangle to check.\n   */\n  intersects(rect: Rect): boolean {\n    return this.x <= rect.x + rect.width\n        && rect.x <= this.x + this.width\n        && this.y <= rect.y + rect.height\n        && rect.y <= this.y + this.height;\n  }\n\n  /**\n   * Returns whether this rectangle fully contains another rectangle.\n   * @param rect - The rectangle to check.\n   */\n  containsRect(rect: Rect): boolean {\n    return this.x <= rect.x\n        && this.y <= rect.y\n        && this.maxX >= rect.maxX\n        && this.maxY >= rect.maxY;\n  }\n\n  /**\n   * Returns whether the rectangle contains the given point.\n   * @param point - The point to check.\n   */\n  containsPoint(point: Point): boolean {\n    return this.x <= point.x\n        && this.y <= point.y\n        && this.maxX >= point.x\n        && this.maxY >= point.y;\n  }\n\n  /**\n   * Returns the first corner of this rectangle (from top to bottom, left to right)\n   * that is contained in the given rectangle, or null of the rectangles do not intersect.\n   * @param rect - The rectangle to check.\n   */\n  getCornerInRect(rect: Rect): RectCorner | null {\n    for (let key of ['topLeft', 'topRight', 'bottomLeft', 'bottomRight']) {\n      if (rect.containsPoint(this[key])) {\n        return key as RectCorner;\n      }\n    }\n\n    return null;\n  }\n\n  equals(rect: Rect) {\n    return rect.x === this.x\n        && rect.y === this.y\n        && rect.width === this.width\n        && rect.height === this.height;\n  }\n\n  pointEquals(point: Point | Rect) {\n    return this.x === point.x\n        && this.y === point.y;\n  }\n\n  sizeEquals(size: Size | Rect) {\n    return this.width === size.width\n        && this.height === size.height;\n  }\n\n  /**\n   * Returns the union of this Rect and another.\n   */\n  union(other: Rect) {\n    let x = Math.min(this.x, other.x);\n    let y = Math.min(this.y, other.y);\n    let width = Math.max(this.maxX, other.maxX) - x;\n    let height = Math.max(this.maxY, other.maxY) - y;\n    return new Rect(x, y, width, height);\n  }\n\n  /**\n   * Returns the intersection of this Rect with another.\n   * If the rectangles do not intersect, an all zero Rect is returned.\n   */\n  intersection(other: Rect): Rect {\n    if (!this.intersects(other)) {\n      return new Rect(0, 0, 0, 0);\n    }\n\n    let x = Math.max(this.x, other.x);\n    let y = Math.max(this.y, other.y);\n    return new Rect(\n      x,\n      y,\n      Math.min(this.maxX, other.maxX) - x,\n      Math.min(this.maxY, other.maxY) - y\n    );\n  }\n\n  /**\n   * Returns a copy of this rectangle.\n   */\n  copy(): Rect {\n    return new Rect(this.x, this.y, this.width, this.height);\n  }\n}\n"],"names":[],"version":3,"file":"Rect.main.js.map"}

package/dist/Rect.mjs

@@ -0,0 +1,125 @@
+import {Point as $3041db3296945e6e$export$baf26146a414f24a} from "./Point.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.
+ */ 
+class $60423f92c7f9ad87$export$c79fc6492f3af13d {
+    /**
+   * The maximum x-coordinate in the rectangle.
+   */ get maxX() {
+        return this.x + this.width;
+    }
+    /**
+   * The maximum y-coordinate in the rectangle.
+   */ get maxY() {
+        return this.y + this.height;
+    }
+    /**
+   * The area of the rectangle.
+   */ get area() {
+        return this.width * this.height;
+    }
+    /**
+   * The top left corner of the rectangle.
+   */ get topLeft() {
+        return new (0, $3041db3296945e6e$export$baf26146a414f24a)(this.x, this.y);
+    }
+    /**
+   * The top right corner of the rectangle.
+   */ get topRight() {
+        return new (0, $3041db3296945e6e$export$baf26146a414f24a)(this.maxX, this.y);
+    }
+    /**
+   * The bottom left corner of the rectangle.
+   */ get bottomLeft() {
+        return new (0, $3041db3296945e6e$export$baf26146a414f24a)(this.x, this.maxY);
+    }
+    /**
+   * The bottom right corner of the rectangle.
+   */ get bottomRight() {
+        return new (0, $3041db3296945e6e$export$baf26146a414f24a)(this.maxX, this.maxY);
+    }
+    /**
+   * Returns whether this rectangle intersects another rectangle.
+   * @param rect - The rectangle to check.
+   */ intersects(rect) {
+        return this.x <= rect.x + rect.width && rect.x <= this.x + this.width && this.y <= rect.y + rect.height && rect.y <= this.y + this.height;
+    }
+    /**
+   * Returns whether this rectangle fully contains another rectangle.
+   * @param rect - The rectangle to check.
+   */ containsRect(rect) {
+        return this.x <= rect.x && this.y <= rect.y && this.maxX >= rect.maxX && this.maxY >= rect.maxY;
+    }
+    /**
+   * Returns whether the rectangle contains the given point.
+   * @param point - The point to check.
+   */ containsPoint(point) {
+        return this.x <= point.x && this.y <= point.y && this.maxX >= point.x && this.maxY >= point.y;
+    }
+    /**
+   * Returns the first corner of this rectangle (from top to bottom, left to right)
+   * that is contained in the given rectangle, or null of the rectangles do not intersect.
+   * @param rect - The rectangle to check.
+   */ getCornerInRect(rect) {
+        for (let key of [
+            'topLeft',
+            'topRight',
+            'bottomLeft',
+            'bottomRight'
+        ]){
+            if (rect.containsPoint(this[key])) return key;
+        }
+        return null;
+    }
+    equals(rect) {
+        return rect.x === this.x && rect.y === this.y && rect.width === this.width && rect.height === this.height;
+    }
+    pointEquals(point) {
+        return this.x === point.x && this.y === point.y;
+    }
+    sizeEquals(size) {
+        return this.width === size.width && this.height === size.height;
+    }
+    /**
+   * Returns the union of this Rect and another.
+   */ union(other) {
+        let x = Math.min(this.x, other.x);
+        let y = Math.min(this.y, other.y);
+        let width = Math.max(this.maxX, other.maxX) - x;
+        let height = Math.max(this.maxY, other.maxY) - y;
+        return new $60423f92c7f9ad87$export$c79fc6492f3af13d(x, y, width, height);
+    }
+    /**
+   * Returns the intersection of this Rect with another.
+   * If the rectangles do not intersect, an all zero Rect is returned.
+   */ intersection(other) {
+        if (!this.intersects(other)) return new $60423f92c7f9ad87$export$c79fc6492f3af13d(0, 0, 0, 0);
+        let x = Math.max(this.x, other.x);
+        let y = Math.max(this.y, other.y);
+        return new $60423f92c7f9ad87$export$c79fc6492f3af13d(x, y, Math.min(this.maxX, other.maxX) - x, Math.min(this.maxY, other.maxY) - y);
+    }
+    /**
+   * Returns a copy of this rectangle.
+   */ copy() {
+        return new $60423f92c7f9ad87$export$c79fc6492f3af13d(this.x, this.y, this.width, this.height);
+    }
+    constructor(x = 0, y = 0, width = 0, height = 0){
+        this.x = x;
+        this.y = y;
+        this.width = width;
+        this.height = height;
+    }
+}
+
+
+export {$60423f92c7f9ad87$export$c79fc6492f3af13d as Rect};
+//# sourceMappingURL=Rect.module.js.map

package/dist/Rect.module.js

@@ -0,0 +1,125 @@
+import {Point as $3041db3296945e6e$export$baf26146a414f24a} from "./Point.module.js";
+
+/*
+ * 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 $60423f92c7f9ad87$export$c79fc6492f3af13d {
+    /**
+   * The maximum x-coordinate in the rectangle.
+   */ get maxX() {
+        return this.x + this.width;
+    }
+    /**
+   * The maximum y-coordinate in the rectangle.
+   */ get maxY() {
+        return this.y + this.height;
+    }
+    /**
+   * The area of the rectangle.
+   */ get area() {
+        return this.width * this.height;
+    }
+    /**
+   * The top left corner of the rectangle.
+   */ get topLeft() {
+        return new (0, $3041db3296945e6e$export$baf26146a414f24a)(this.x, this.y);
+    }
+    /**
+   * The top right corner of the rectangle.
+   */ get topRight() {
+        return new (0, $3041db3296945e6e$export$baf26146a414f24a)(this.maxX, this.y);
+    }
+    /**
+   * The bottom left corner of the rectangle.
+   */ get bottomLeft() {
+        return new (0, $3041db3296945e6e$export$baf26146a414f24a)(this.x, this.maxY);
+    }
+    /**
+   * The bottom right corner of the rectangle.
+   */ get bottomRight() {
+        return new (0, $3041db3296945e6e$export$baf26146a414f24a)(this.maxX, this.maxY);
+    }
+    /**
+   * Returns whether this rectangle intersects another rectangle.
+   * @param rect - The rectangle to check.
+   */ intersects(rect) {
+        return this.x <= rect.x + rect.width && rect.x <= this.x + this.width && this.y <= rect.y + rect.height && rect.y <= this.y + this.height;
+    }
+    /**
+   * Returns whether this rectangle fully contains another rectangle.
+   * @param rect - The rectangle to check.
+   */ containsRect(rect) {
+        return this.x <= rect.x && this.y <= rect.y && this.maxX >= rect.maxX && this.maxY >= rect.maxY;
+    }
+    /**
+   * Returns whether the rectangle contains the given point.
+   * @param point - The point to check.
+   */ containsPoint(point) {
+        return this.x <= point.x && this.y <= point.y && this.maxX >= point.x && this.maxY >= point.y;
+    }
+    /**
+   * Returns the first corner of this rectangle (from top to bottom, left to right)
+   * that is contained in the given rectangle, or null of the rectangles do not intersect.
+   * @param rect - The rectangle to check.
+   */ getCornerInRect(rect) {
+        for (let key of [
+            'topLeft',
+            'topRight',
+            'bottomLeft',
+            'bottomRight'
+        ]){
+            if (rect.containsPoint(this[key])) return key;
+        }
+        return null;
+    }
+    equals(rect) {
+        return rect.x === this.x && rect.y === this.y && rect.width === this.width && rect.height === this.height;
+    }
+    pointEquals(point) {
+        return this.x === point.x && this.y === point.y;
+    }
+    sizeEquals(size) {
+        return this.width === size.width && this.height === size.height;
+    }
+    /**
+   * Returns the union of this Rect and another.
+   */ union(other) {
+        let x = Math.min(this.x, other.x);
+        let y = Math.min(this.y, other.y);
+        let width = Math.max(this.maxX, other.maxX) - x;
+        let height = Math.max(this.maxY, other.maxY) - y;
+        return new $60423f92c7f9ad87$export$c79fc6492f3af13d(x, y, width, height);
+    }
+    /**
+   * Returns the intersection of this Rect with another.
+   * If the rectangles do not intersect, an all zero Rect is returned.
+   */ intersection(other) {
+        if (!this.intersects(other)) return new $60423f92c7f9ad87$export$c79fc6492f3af13d(0, 0, 0, 0);
+        let x = Math.max(this.x, other.x);
+        let y = Math.max(this.y, other.y);
+        return new $60423f92c7f9ad87$export$c79fc6492f3af13d(x, y, Math.min(this.maxX, other.maxX) - x, Math.min(this.maxY, other.maxY) - y);
+    }
+    /**
+   * Returns a copy of this rectangle.
+   */ copy() {
+        return new $60423f92c7f9ad87$export$c79fc6492f3af13d(this.x, this.y, this.width, this.height);
+    }
+    constructor(x = 0, y = 0, width = 0, height = 0){
+        this.x = x;
+        this.y = y;
+        this.width = width;
+        this.height = height;
+    }
+}
+
+
+export {$60423f92c7f9ad87$export$c79fc6492f3af13d as Rect};
+//# sourceMappingURL=Rect.module.js.map

package/dist/Rect.module.js.map

@@ -0,0 +1 @@
+{"mappings":";;AAAA;;;;;;;;;;CAUC;AAUM,MAAM;IAoBX;;GAEC,GACD,IAAI,OAAe;QACjB,OAAO,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK;IAC5B;IAEA;;GAEC,GACD,IAAI,OAAe;QACjB,OAAO,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM;IAC7B;IAEA;;GAEC,GACD,IAAI,OAAe;QACjB,OAAO,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM;IACjC;IAEA;;GAEC,GACD,IAAI,UAAiB;QACnB,OAAO,IAAI,CAAA,GAAA,yCAAI,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACjC;IAEA;;GAEC,GACD,IAAI,WAAkB;QACpB,OAAO,IAAI,CAAA,GAAA,yCAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACpC;IAEA;;GAEC,GACD,IAAI,aAAoB;QACtB,OAAO,IAAI,CAAA,GAAA,yCAAI,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI;IACpC;IAEA;;GAEC,GACD,IAAI,cAAqB;QACvB,OAAO,IAAI,CAAA,GAAA,yCAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI;IACvC;IAEA;;;GAGC,GACD,WAAW,IAAU,EAAW;QAC9B,OAAO,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,KAAK,KAAK,IAC7B,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,IAC7B,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,KAAK,MAAM,IAC9B,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM;IACvC;IAEA;;;GAGC,GACD,aAAa,IAAU,EAAW;QAChC,OAAO,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAChB,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAChB,IAAI,CAAC,IAAI,IAAI,KAAK,IAAI,IACtB,IAAI,CAAC,IAAI,IAAI,KAAK,IAAI;IAC/B;IAEA;;;GAGC,GACD,cAAc,KAAY,EAAW;QACnC,OAAO,IAAI,CAAC,CAAC,IAAI,MAAM,CAAC,IACjB,IAAI,CAAC,CAAC,IAAI,MAAM,CAAC,IACjB,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC,IACpB,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC;IAC7B;IAEA;;;;GAIC,GACD,gBAAgB,IAAU,EAAqB;QAC7C,KAAK,IAAI,OAAO;YAAC;YAAW;YAAY;YAAc;SAAc,CAAE;YACpE,IAAI,KAAK,aAAa,CAAC,IAAI,CAAC,IAAI,GAC9B,OAAO;QAEX;QAEA,OAAO;IACT;IAEA,OAAO,IAAU,EAAE;QACjB,OAAO,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC,IACjB,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC,IACjB,KAAK,KAAK,KAAK,IAAI,CAAC,KAAK,IACzB,KAAK,MAAM,KAAK,IAAI,CAAC,MAAM;IACpC;IAEA,YAAY,KAAmB,EAAE;QAC/B,OAAO,IAAI,CAAC,CAAC,KAAK,MAAM,CAAC,IAClB,IAAI,CAAC,CAAC,KAAK,MAAM,CAAC;IAC3B;IAEA,WAAW,IAAiB,EAAE;QAC5B,OAAO,IAAI,CAAC,KAAK,KAAK,KAAK,KAAK,IACzB,IAAI,CAAC,MAAM,KAAK,KAAK,MAAM;IACpC;IAEA;;GAEC,GACD,MAAM,KAAW,EAAE;QACjB,IAAI,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC;QAChC,IAAI,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC;QAChC,IAAI,QAAQ,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,IAAI,IAAI;QAC9C,IAAI,SAAS,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,IAAI,IAAI;QAC/C,OAAO,IAAI,0CAAK,GAAG,GAAG,OAAO;IAC/B;IAEA;;;GAGC,GACD,aAAa,KAAW,EAAQ;QAC9B,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,QACnB,OAAO,IAAI,0CAAK,GAAG,GAAG,GAAG;QAG3B,IAAI,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC;QAChC,IAAI,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC;QAChC,OAAO,IAAI,0CACT,GACA,GACA,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,IAAI,IAAI,GAClC,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,IAAI,IAAI;IAEtC;IAEA;;GAEC,GACD,OAAa;QACX,OAAO,IAAI,0CAAK,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM;IACzD;IA5JA,YAAY,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,QAAQ,CAAC,EAAE,SAAS,CAAC,CAAE;QAC/C,IAAI,CAAC,CAAC,GAAG;QACT,IAAI,CAAC,CAAC,GAAG;QACT,IAAI,CAAC,KAAK,GAAG;QACb,IAAI,CAAC,MAAM,GAAG;IAChB;AAwJF","sources":["packages/@react-stately/virtualizer/src/Rect.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 {Point} from './Point';\nimport {Size} from './Size';\n\nexport type RectCorner = 'topLeft' | 'topRight' | 'bottomLeft' | 'bottomRight';\n\n/**\n * Represents a rectangle.\n */\nexport class Rect {\n  /** The x-coordinate of the rectangle. */\n  x: number;\n\n  /** The y-coordinate of the rectangle. */\n  y: number;\n\n  /** The width of the rectangle. */\n  width: number;\n\n  /** The height of the rectangle. */\n  height: number;\n\n  constructor(x = 0, y = 0, width = 0, height = 0) {\n    this.x = x;\n    this.y = y;\n    this.width = width;\n    this.height = height;\n  }\n\n  /**\n   * The maximum x-coordinate in the rectangle.\n   */\n  get maxX(): number {\n    return this.x + this.width;\n  }\n\n  /**\n   * The maximum y-coordinate in the rectangle.\n   */\n  get maxY(): number {\n    return this.y + this.height;\n  }\n\n  /**\n   * The area of the rectangle.\n   */\n  get area(): number {\n    return this.width * this.height;\n  }\n\n  /**\n   * The top left corner of the rectangle.\n   */\n  get topLeft(): Point {\n    return new Point(this.x, this.y);\n  }\n\n  /**\n   * The top right corner of the rectangle.\n   */\n  get topRight(): Point {\n    return new Point(this.maxX, this.y);\n  }\n\n  /**\n   * The bottom left corner of the rectangle.\n   */\n  get bottomLeft(): Point {\n    return new Point(this.x, this.maxY);\n  }\n\n  /**\n   * The bottom right corner of the rectangle.\n   */\n  get bottomRight(): Point {\n    return new Point(this.maxX, this.maxY);\n  }\n\n  /**\n   * Returns whether this rectangle intersects another rectangle.\n   * @param rect - The rectangle to check.\n   */\n  intersects(rect: Rect): boolean {\n    return this.x <= rect.x + rect.width\n        && rect.x <= this.x + this.width\n        && this.y <= rect.y + rect.height\n        && rect.y <= this.y + this.height;\n  }\n\n  /**\n   * Returns whether this rectangle fully contains another rectangle.\n   * @param rect - The rectangle to check.\n   */\n  containsRect(rect: Rect): boolean {\n    return this.x <= rect.x\n        && this.y <= rect.y\n        && this.maxX >= rect.maxX\n        && this.maxY >= rect.maxY;\n  }\n\n  /**\n   * Returns whether the rectangle contains the given point.\n   * @param point - The point to check.\n   */\n  containsPoint(point: Point): boolean {\n    return this.x <= point.x\n        && this.y <= point.y\n        && this.maxX >= point.x\n        && this.maxY >= point.y;\n  }\n\n  /**\n   * Returns the first corner of this rectangle (from top to bottom, left to right)\n   * that is contained in the given rectangle, or null of the rectangles do not intersect.\n   * @param rect - The rectangle to check.\n   */\n  getCornerInRect(rect: Rect): RectCorner | null {\n    for (let key of ['topLeft', 'topRight', 'bottomLeft', 'bottomRight']) {\n      if (rect.containsPoint(this[key])) {\n        return key as RectCorner;\n      }\n    }\n\n    return null;\n  }\n\n  equals(rect: Rect) {\n    return rect.x === this.x\n        && rect.y === this.y\n        && rect.width === this.width\n        && rect.height === this.height;\n  }\n\n  pointEquals(point: Point | Rect) {\n    return this.x === point.x\n        && this.y === point.y;\n  }\n\n  sizeEquals(size: Size | Rect) {\n    return this.width === size.width\n        && this.height === size.height;\n  }\n\n  /**\n   * Returns the union of this Rect and another.\n   */\n  union(other: Rect) {\n    let x = Math.min(this.x, other.x);\n    let y = Math.min(this.y, other.y);\n    let width = Math.max(this.maxX, other.maxX) - x;\n    let height = Math.max(this.maxY, other.maxY) - y;\n    return new Rect(x, y, width, height);\n  }\n\n  /**\n   * Returns the intersection of this Rect with another.\n   * If the rectangles do not intersect, an all zero Rect is returned.\n   */\n  intersection(other: Rect): Rect {\n    if (!this.intersects(other)) {\n      return new Rect(0, 0, 0, 0);\n    }\n\n    let x = Math.max(this.x, other.x);\n    let y = Math.max(this.y, other.y);\n    return new Rect(\n      x,\n      y,\n      Math.min(this.maxX, other.maxX) - x,\n      Math.min(this.maxY, other.maxY) - y\n    );\n  }\n\n  /**\n   * Returns a copy of this rectangle.\n   */\n  copy(): Rect {\n    return new Rect(this.x, this.y, this.width, this.height);\n  }\n}\n"],"names":[],"version":3,"file":"Rect.module.js.map"}

package/dist/ReusableView.main.js

@@ -0,0 +1,56 @@
+
+function $parcel$export(e, n, v, s) {
+  Object.defineProperty(e, n, {get: v, set: s, enumerable: true, configurable: true});
+}
+
+$parcel$export(module.exports, "ReusableView", () => $197a1781bd47f5b9$export$1a5223887c560441);
+/*
+ * 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.
+ */ let $197a1781bd47f5b9$var$KEY = 0;
+class $197a1781bd47f5b9$export$1a5223887c560441 {
+    /**
+   * Prepares the view for reuse. Called just before the view is removed from the DOM.
+   */ prepareForReuse() {
+        this.content = null;
+        this.rendered = null;
+        this.layoutInfo = null;
+    }
+    getReusableView(reuseType) {
+        // Reusable view queue should be FIFO so that DOM order remains consistent during scrolling.
+        // For example, cells within a row should remain in the same order even if the row changes contents.
+        // The cells within a row are removed from their parent in order. If the row is reused, the cells
+        // should be reused in the new row in the same order they were before.
+        let reusable = this.reusableViews.get(reuseType);
+        let view = (reusable === null || reusable === void 0 ? void 0 : reusable.length) > 0 ? reusable.shift() : new $197a1781bd47f5b9$export$1a5223887c560441(this.virtualizer);
+        view.viewType = reuseType;
+        view.parent = this;
+        return view;
+    }
+    reuseChild(child) {
+        child.prepareForReuse();
+        let reusable = this.reusableViews.get(child.viewType);
+        if (!reusable) {
+            reusable = [];
+            this.reusableViews.set(child.viewType, reusable);
+        }
+        reusable.push(child);
+    }
+    constructor(virtualizer){
+        this.virtualizer = virtualizer;
+        this.key = ++$197a1781bd47f5b9$var$KEY;
+        this.parent = null;
+        this.children = new Set();
+        this.reusableViews = new Map();
+    }
+}
+
+
+//# sourceMappingURL=ReusableView.main.js.map

package/dist/ReusableView.main.js.map

@@ -0,0 +1 @@
+{"mappings":";;;;;;AAAA;;;;;;;;;;CAUC,GAMD,IAAI,4BAAM;AAMH,MAAM;IA2BX;;GAEC,GACD,kBAAkB;QAChB,IAAI,CAAC,OAAO,GAAG;QACf,IAAI,CAAC,QAAQ,GAAG;QAChB,IAAI,CAAC,UAAU,GAAG;IACpB;IAEA,gBAAgB,SAAiB,EAAE;QACjC,4FAA4F;QAC5F,oGAAoG;QACpG,iGAAiG;QACjG,sEAAsE;QACtE,IAAI,WAAW,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC;QACtC,IAAI,OAAO,CAAA,qBAAA,+BAAA,SAAU,MAAM,IAAG,IAC1B,SAAS,KAAK,KACd,IAAI,0CAAmB,IAAI,CAAC,WAAW;QAE3C,KAAK,QAAQ,GAAG;QAChB,KAAK,MAAM,GAAG,IAAI;QAClB,OAAO;IACT;IAEA,WAAW,KAAyB,EAAE;QACpC,MAAM,eAAe;QACrB,IAAI,WAAW,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,QAAQ;QACpD,IAAI,CAAC,UAAU;YACb,WAAW,EAAE;YACb,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,QAAQ,EAAE;QACzC;QACA,SAAS,IAAI,CAAC;IAChB;IAxCA,YAAY,WAA8B,CAAE;QAC1C,IAAI,CAAC,WAAW,GAAG;QACnB,IAAI,CAAC,GAAG,GAAG,EAAE;QACb,IAAI,CAAC,MAAM,GAAG;QACd,IAAI,CAAC,QAAQ,GAAG,IAAI;QACpB,IAAI,CAAC,aAAa,GAAG,IAAI;IAC3B;AAmCF","sources":["packages/@react-stately/virtualizer/src/ReusableView.ts"],"sourcesContent":["/*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */\n\nimport {Key} from '@react-types/shared';\nimport {LayoutInfo} from './LayoutInfo';\nimport {Virtualizer} from './Virtualizer';\n\nlet KEY = 0;\n\n/**\n * [Virtualizer]{@link Virtualizer} creates instances of the [ReusableView]{@link ReusableView} class to\n * represent views currently being displayed.\n */\nexport class ReusableView<T extends object, V> {\n  /** The Virtualizer this view is a part of. */\n  virtualizer: Virtualizer<T, V>;\n\n  /** The LayoutInfo this view is currently representing. */\n  layoutInfo: LayoutInfo | null;\n\n  /** The content currently being displayed by this view, set by the virtualizer. */\n  content: T;\n\n  rendered: V;\n\n  viewType: string;\n  key: Key;\n\n  parent: ReusableView<T, V> | null;\n  children: Set<ReusableView<T, V>>;\n  reusableViews: Map<string, ReusableView<T, V>[]>;\n\n  constructor(virtualizer: Virtualizer<T, V>) {\n    this.virtualizer = virtualizer;\n    this.key = ++KEY;\n    this.parent = null;\n    this.children = new Set();\n    this.reusableViews = new Map();\n  }\n\n  /**\n   * Prepares the view for reuse. Called just before the view is removed from the DOM.\n   */\n  prepareForReuse() {\n    this.content = null;\n    this.rendered = null;\n    this.layoutInfo = null;\n  }\n\n  getReusableView(reuseType: string) {\n    // Reusable view queue should be FIFO so that DOM order remains consistent during scrolling.\n    // For example, cells within a row should remain in the same order even if the row changes contents.\n    // The cells within a row are removed from their parent in order. If the row is reused, the cells\n    // should be reused in the new row in the same order they were before.\n    let reusable = this.reusableViews.get(reuseType);\n    let view = reusable?.length > 0\n      ? reusable.shift()\n      : new ReusableView<T, V>(this.virtualizer);\n\n    view.viewType = reuseType;\n    view.parent = this;\n    return view;\n  }\n\n  reuseChild(child: ReusableView<T, V>) {\n    child.prepareForReuse();\n    let reusable = this.reusableViews.get(child.viewType);\n    if (!reusable) {\n      reusable = [];\n      this.reusableViews.set(child.viewType, reusable);\n    }\n    reusable.push(child);\n  }\n}\n"],"names":[],"version":3,"file":"ReusableView.main.js.map"}

package/dist/ReusableView.mjs

@@ -0,0 +1,51 @@
+/*
+ * 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.
+ */ let $ad1d98aa8f0c31b4$var$KEY = 0;
+class $ad1d98aa8f0c31b4$export$1a5223887c560441 {
+    /**
+   * Prepares the view for reuse. Called just before the view is removed from the DOM.
+   */ prepareForReuse() {
+        this.content = null;
+        this.rendered = null;
+        this.layoutInfo = null;
+    }
+    getReusableView(reuseType) {
+        // Reusable view queue should be FIFO so that DOM order remains consistent during scrolling.
+        // For example, cells within a row should remain in the same order even if the row changes contents.
+        // The cells within a row are removed from their parent in order. If the row is reused, the cells
+        // should be reused in the new row in the same order they were before.
+        let reusable = this.reusableViews.get(reuseType);
+        let view = (reusable === null || reusable === void 0 ? void 0 : reusable.length) > 0 ? reusable.shift() : new $ad1d98aa8f0c31b4$export$1a5223887c560441(this.virtualizer);
+        view.viewType = reuseType;
+        view.parent = this;
+        return view;
+    }
+    reuseChild(child) {
+        child.prepareForReuse();
+        let reusable = this.reusableViews.get(child.viewType);
+        if (!reusable) {
+            reusable = [];
+            this.reusableViews.set(child.viewType, reusable);
+        }
+        reusable.push(child);
+    }
+    constructor(virtualizer){
+        this.virtualizer = virtualizer;
+        this.key = ++$ad1d98aa8f0c31b4$var$KEY;
+        this.parent = null;
+        this.children = new Set();
+        this.reusableViews = new Map();
+    }
+}
+
+
+export {$ad1d98aa8f0c31b4$export$1a5223887c560441 as ReusableView};
+//# sourceMappingURL=ReusableView.module.js.map

package/dist/ReusableView.module.js

@@ -0,0 +1,51 @@
+/*
+ * 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.
+ */ let $ad1d98aa8f0c31b4$var$KEY = 0;
+class $ad1d98aa8f0c31b4$export$1a5223887c560441 {
+    /**
+   * Prepares the view for reuse. Called just before the view is removed from the DOM.
+   */ prepareForReuse() {
+        this.content = null;
+        this.rendered = null;
+        this.layoutInfo = null;
+    }
+    getReusableView(reuseType) {
+        // Reusable view queue should be FIFO so that DOM order remains consistent during scrolling.
+        // For example, cells within a row should remain in the same order even if the row changes contents.
+        // The cells within a row are removed from their parent in order. If the row is reused, the cells
+        // should be reused in the new row in the same order they were before.
+        let reusable = this.reusableViews.get(reuseType);
+        let view = (reusable === null || reusable === void 0 ? void 0 : reusable.length) > 0 ? reusable.shift() : new $ad1d98aa8f0c31b4$export$1a5223887c560441(this.virtualizer);
+        view.viewType = reuseType;
+        view.parent = this;
+        return view;
+    }
+    reuseChild(child) {
+        child.prepareForReuse();
+        let reusable = this.reusableViews.get(child.viewType);
+        if (!reusable) {
+            reusable = [];
+            this.reusableViews.set(child.viewType, reusable);
+        }
+        reusable.push(child);
+    }
+    constructor(virtualizer){
+        this.virtualizer = virtualizer;
+        this.key = ++$ad1d98aa8f0c31b4$var$KEY;
+        this.parent = null;
+        this.children = new Set();
+        this.reusableViews = new Map();
+    }
+}
+
+
+export {$ad1d98aa8f0c31b4$export$1a5223887c560441 as ReusableView};
+//# sourceMappingURL=ReusableView.module.js.map

package/dist/ReusableView.module.js.map

@@ -0,0 +1 @@
+{"mappings":"AAAA;;;;;;;;;;CAUC,GAMD,IAAI,4BAAM;AAMH,MAAM;IA2BX;;GAEC,GACD,kBAAkB;QAChB,IAAI,CAAC,OAAO,GAAG;QACf,IAAI,CAAC,QAAQ,GAAG;QAChB,IAAI,CAAC,UAAU,GAAG;IACpB;IAEA,gBAAgB,SAAiB,EAAE;QACjC,4FAA4F;QAC5F,oGAAoG;QACpG,iGAAiG;QACjG,sEAAsE;QACtE,IAAI,WAAW,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC;QACtC,IAAI,OAAO,CAAA,qBAAA,+BAAA,SAAU,MAAM,IAAG,IAC1B,SAAS,KAAK,KACd,IAAI,0CAAmB,IAAI,CAAC,WAAW;QAE3C,KAAK,QAAQ,GAAG;QAChB,KAAK,MAAM,GAAG,IAAI;QAClB,OAAO;IACT;IAEA,WAAW,KAAyB,EAAE;QACpC,MAAM,eAAe;QACrB,IAAI,WAAW,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,QAAQ;QACpD,IAAI,CAAC,UAAU;YACb,WAAW,EAAE;YACb,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,QAAQ,EAAE;QACzC;QACA,SAAS,IAAI,CAAC;IAChB;IAxCA,YAAY,WAA8B,CAAE;QAC1C,IAAI,CAAC,WAAW,GAAG;QACnB,IAAI,CAAC,GAAG,GAAG,EAAE;QACb,IAAI,CAAC,MAAM,GAAG;QACd,IAAI,CAAC,QAAQ,GAAG,IAAI;QACpB,IAAI,CAAC,aAAa,GAAG,IAAI;IAC3B;AAmCF","sources":["packages/@react-stately/virtualizer/src/ReusableView.ts"],"sourcesContent":["/*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */\n\nimport {Key} from '@react-types/shared';\nimport {LayoutInfo} from './LayoutInfo';\nimport {Virtualizer} from './Virtualizer';\n\nlet KEY = 0;\n\n/**\n * [Virtualizer]{@link Virtualizer} creates instances of the [ReusableView]{@link ReusableView} class to\n * represent views currently being displayed.\n */\nexport class ReusableView<T extends object, V> {\n  /** The Virtualizer this view is a part of. */\n  virtualizer: Virtualizer<T, V>;\n\n  /** The LayoutInfo this view is currently representing. */\n  layoutInfo: LayoutInfo | null;\n\n  /** The content currently being displayed by this view, set by the virtualizer. */\n  content: T;\n\n  rendered: V;\n\n  viewType: string;\n  key: Key;\n\n  parent: ReusableView<T, V> | null;\n  children: Set<ReusableView<T, V>>;\n  reusableViews: Map<string, ReusableView<T, V>[]>;\n\n  constructor(virtualizer: Virtualizer<T, V>) {\n    this.virtualizer = virtualizer;\n    this.key = ++KEY;\n    this.parent = null;\n    this.children = new Set();\n    this.reusableViews = new Map();\n  }\n\n  /**\n   * Prepares the view for reuse. Called just before the view is removed from the DOM.\n   */\n  prepareForReuse() {\n    this.content = null;\n    this.rendered = null;\n    this.layoutInfo = null;\n  }\n\n  getReusableView(reuseType: string) {\n    // Reusable view queue should be FIFO so that DOM order remains consistent during scrolling.\n    // For example, cells within a row should remain in the same order even if the row changes contents.\n    // The cells within a row are removed from their parent in order. If the row is reused, the cells\n    // should be reused in the new row in the same order they were before.\n    let reusable = this.reusableViews.get(reuseType);\n    let view = reusable?.length > 0\n      ? reusable.shift()\n      : new ReusableView<T, V>(this.virtualizer);\n\n    view.viewType = reuseType;\n    view.parent = this;\n    return view;\n  }\n\n  reuseChild(child: ReusableView<T, V>) {\n    child.prepareForReuse();\n    let reusable = this.reusableViews.get(child.viewType);\n    if (!reusable) {\n      reusable = [];\n      this.reusableViews.set(child.viewType, reusable);\n    }\n    reusable.push(child);\n  }\n}\n"],"names":[],"version":3,"file":"ReusableView.module.js.map"}

package/dist/Size.main.js

@@ -0,0 +1,40 @@
+
+function $parcel$export(e, n, v, s) {
+  Object.defineProperty(e, n, {get: v, set: s, enumerable: true, configurable: true});
+}
+
+$parcel$export(module.exports, "Size", () => $064492b79924894c$export$cb6da89c6af1a8ec);
+/*
+ * 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 $064492b79924894c$export$cb6da89c6af1a8ec {
+    /**
+   * Returns a copy of this size.
+   */ copy() {
+        return new $064492b79924894c$export$cb6da89c6af1a8ec(this.width, this.height);
+    }
+    /**
+   * Returns whether this size is equal to another one.
+   */ equals(other) {
+        return this.width === other.width && this.height === other.height;
+    }
+    /**
+   * The total area of the Size.
+   */ get area() {
+        return this.width * this.height;
+    }
+    constructor(width = 0, height = 0){
+        this.width = width;
+        this.height = height;
+    }
+}
+
+
+//# sourceMappingURL=Size.main.js.map

package/dist/Size.main.js.map

@@ -0,0 +1 @@
+{"mappings":";;;;;;AAAA;;;;;;;;;;CAUC,GAEM,MAAM;IASX;;GAEC,GACD,OAAa;QACX,OAAO,IAAI,0CAAK,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM;IACzC;IAEA;;GAEC,GACD,OAAO,KAAW,EAAW;QAC3B,OAAO,IAAI,CAAC,KAAK,KAAK,MAAM,KAAK,IAC1B,IAAI,CAAC,MAAM,KAAK,MAAM,MAAM;IACrC;IAEA;;GAEC,GACD,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM;IACjC;IAzBA,YAAY,QAAQ,CAAC,EAAE,SAAS,CAAC,CAAE;QACjC,IAAI,CAAC,KAAK,GAAG;QACb,IAAI,CAAC,MAAM,GAAG;IAChB;AAuBF","sources":["packages/@react-stately/virtualizer/src/Size.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 class Size {\n  width: number;\n  height: number;\n\n  constructor(width = 0, height = 0) {\n    this.width = width;\n    this.height = height;\n  }\n\n  /**\n   * Returns a copy of this size.\n   */\n  copy(): Size {\n    return new Size(this.width, this.height);\n  }\n\n  /**\n   * Returns whether this size is equal to another one.\n   */\n  equals(other: Size): boolean {\n    return this.width === other.width\n        && this.height === other.height;\n  }\n\n  /**\n   * The total area of the Size.\n   */\n  get area() {\n    return this.width * this.height;\n  }\n}\n"],"names":[],"version":3,"file":"Size.main.js.map"}