@react-stately/virtualizer 3.6.9-nightly.4555 → 3.6.9-nightly.4558

package/dist/OverscanManager.module.js

@@ -0,0 +1,82 @@
+import {Point as $3041db3296945e6e$export$baf26146a414f24a} from "./Point.module.js";
+import {Rect as $60423f92c7f9ad87$export$c79fc6492f3af13d} from "./Rect.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 $364191b3decf3697$var$RollingAverage {
+    addSample(sample) {
+        this.count++;
+        this.value += (sample - this.value) / this.count;
+    }
+    constructor(){
+        this.count = 0;
+        this.value = 0;
+    }
+}
+class $364191b3decf3697$export$4455ee6afb38dcbb {
+    setVisibleRect(rect) {
+        let time = performance.now() - this.startTime;
+        if (time < 500) {
+            this.averageTime.addSample(time);
+            if (rect.x !== this.visibleRect.x && time > 0) this.velocity.x = (rect.x - this.visibleRect.x) / time;
+            if (rect.y !== this.visibleRect.y && time > 0) this.velocity.y = (rect.y - this.visibleRect.y) / time;
+        }
+        this.startTime = performance.now();
+        this.visibleRect = rect;
+    }
+    collectMetrics() {
+        let time = performance.now() - this.startTime;
+        if (time < 500) this.averagePerf.addSample(time);
+        if (this.visibleRect.height > 0) {
+            let o = Math.abs(this.velocity.y * (this.averageTime.value + this.averagePerf.value));
+            this.overscanY.addSample(o);
+        }
+        if (this.visibleRect.width > 0) {
+            let o = Math.abs(this.velocity.x * (this.averageTime.value + this.averagePerf.value));
+            this.overscanX.addSample(o);
+        }
+    }
+    getOverscannedRect() {
+        let overscanned = this.visibleRect.copy();
+        let overscanY = Math.round(Math.min(this.visibleRect.height * 2, this.overscanY.value) / 100) * 100;
+        if (this.velocity.y > 0) {
+            overscanned.y -= overscanY * 0.2;
+            overscanned.height += overscanY + overscanY * 0.2;
+        } else {
+            overscanned.y -= overscanY;
+            overscanned.height += overscanY + overscanY * 0.2;
+        }
+        let overscanX = Math.round(Math.min(this.visibleRect.width * 2, this.overscanX.value) / 100) * 100;
+        if (this.velocity.x > 0) {
+            overscanned.x -= overscanX * 0.2;
+            overscanned.width += overscanX + overscanX * 0.2;
+        } else {
+            overscanned.x -= overscanX;
+            overscanned.width += overscanX + overscanX * 0.2;
+        }
+        return overscanned;
+    }
+    constructor(){
+        this.startTime = 0;
+        this.averagePerf = new $364191b3decf3697$var$RollingAverage();
+        this.averageTime = new $364191b3decf3697$var$RollingAverage();
+        this.velocity = new (0, $3041db3296945e6e$export$baf26146a414f24a)(5, 5);
+        this.overscanX = new $364191b3decf3697$var$RollingAverage();
+        this.overscanY = new $364191b3decf3697$var$RollingAverage();
+        this.visibleRect = new (0, $60423f92c7f9ad87$export$c79fc6492f3af13d)();
+    }
+}
+
+
+export {$364191b3decf3697$export$4455ee6afb38dcbb as OverscanManager};
+//# sourceMappingURL=OverscanManager.module.js.map

package/dist/OverscanManager.module.js.map

@@ -0,0 +1 @@
+{"mappings":";;;AAAA;;;;;;;;;;CAUC;;AAKD,MAAM;IAIJ,UAAU,MAAc,EAAE;QACxB,IAAI,CAAC,KAAK;QACV,IAAI,CAAC,KAAK,IAAI,AAAC,CAAA,SAAS,IAAI,CAAC,KAAK,AAAD,IAAK,IAAI,CAAC,KAAK;IAClD;;aANQ,QAAgB;aACxB,QAAgB;;AAMlB;AAEO,MAAM;IASX,eAAe,IAAU,EAAE;QACzB,IAAI,OAAO,YAAY,GAAG,KAAK,IAAI,CAAC,SAAS;QAC7C,IAAI,OAAO,KAAK;YACd,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC;YAE3B,IAAI,KAAK,CAAC,KAAK,IAAI,CAAC,WAAW,CAAC,CAAC,IAAI,OAAO,GAC1C,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,AAAC,CAAA,KAAK,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,AAAD,IAAK;YAGpD,IAAI,KAAK,CAAC,KAAK,IAAI,CAAC,WAAW,CAAC,CAAC,IAAI,OAAO,GAC1C,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,AAAC,CAAA,KAAK,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,AAAD,IAAK;QAEtD;QAEA,IAAI,CAAC,SAAS,GAAG,YAAY,GAAG;QAChC,IAAI,CAAC,WAAW,GAAG;IACrB;IAEA,iBAAiB;QACf,IAAI,OAAO,YAAY,GAAG,KAAK,IAAI,CAAC,SAAS;QAC7C,IAAI,OAAO,KACT,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC;QAG7B,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,GAAG;YAC/B,IAAI,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAI,CAAA,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,AAAD;YAClF,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC;QAC3B;QAEA,IAAI,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,GAAG;YAC9B,IAAI,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAI,CAAA,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,AAAD;YAClF,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC;QAC3B;IACF;IAEA,qBAAqB;QACnB,IAAI,cAAc,IAAI,CAAC,WAAW,CAAC,IAAI;QAEvC,IAAI,YAAY,KAAK,KAAK,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,OAAO;QAChG,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,GAAG;YACvB,YAAY,CAAC,IAAI,YAAY;YAC7B,YAAY,MAAM,IAAI,YAAY,YAAY;QAChD,OAAO;YACL,YAAY,CAAC,IAAI;YACjB,YAAY,MAAM,IAAI,YAAY,YAAY;QAChD;QAEA,IAAI,YAAY,KAAK,KAAK,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,OAAO;QAC/F,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,GAAG;YACvB,YAAY,CAAC,IAAI,YAAY;YAC7B,YAAY,KAAK,IAAI,YAAY,YAAY;QAC/C,OAAO;YACL,YAAY,CAAC,IAAI;YACjB,YAAY,KAAK,IAAI,YAAY,YAAY;QAC/C;QAEA,OAAO;IACT;;aAjEQ,YAAY;aACZ,cAAc,IAAI;aAClB,cAAc,IAAI;aAClB,WAAW,IAAI,CAAA,GAAA,yCAAI,EAAE,GAAG;aACxB,YAAY,IAAI;aAChB,YAAY,IAAI;aAChB,cAAc,IAAI,CAAA,GAAA,yCAAG;;AA4D/B","sources":["packages/@react-stately/virtualizer/src/OverscanManager.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 {Rect} from './Rect';\n\nclass RollingAverage {\n  private count: number = 0;\n  value: number = 0;\n  \n  addSample(sample: number) {\n    this.count++;\n    this.value += (sample - this.value) / this.count;\n  }\n}\n\nexport class OverscanManager {\n  private startTime = 0;\n  private averagePerf = new RollingAverage();\n  private averageTime = new RollingAverage();\n  private velocity = new Point(5, 5);\n  private overscanX = new RollingAverage();\n  private overscanY = new RollingAverage();\n  private visibleRect = new Rect();\n  \n  setVisibleRect(rect: Rect) {\n    let time = performance.now() - this.startTime;\n    if (time < 500) {\n      this.averageTime.addSample(time);\n\n      if (rect.x !== this.visibleRect.x && time > 0) {\n        this.velocity.x = (rect.x - this.visibleRect.x) / time;\n      }\n\n      if (rect.y !== this.visibleRect.y && time > 0) {\n        this.velocity.y = (rect.y - this.visibleRect.y) / time;\n      }\n    }\n\n    this.startTime = performance.now();\n    this.visibleRect = rect;\n  }\n\n  collectMetrics() {\n    let time = performance.now() - this.startTime;\n    if (time < 500) {\n      this.averagePerf.addSample(time);\n    }\n\n    if (this.visibleRect.height > 0) {\n      let o = Math.abs(this.velocity.y * (this.averageTime.value + this.averagePerf.value));  \n      this.overscanY.addSample(o);\n    }\n\n    if (this.visibleRect.width > 0) {\n      let o = Math.abs(this.velocity.x * (this.averageTime.value + this.averagePerf.value));  \n      this.overscanX.addSample(o);\n    }\n  }\n\n  getOverscannedRect() {\n    let overscanned = this.visibleRect.copy();\n\n    let overscanY = Math.round(Math.min(this.visibleRect.height * 2, this.overscanY.value) / 100) * 100;\n    if (this.velocity.y > 0) {\n      overscanned.y -= overscanY * 0.2;\n      overscanned.height += overscanY + overscanY * 0.2;\n    } else {\n      overscanned.y -= overscanY;\n      overscanned.height += overscanY + overscanY * 0.2;\n    }\n\n    let overscanX = Math.round(Math.min(this.visibleRect.width * 2, this.overscanX.value) / 100) * 100;\n    if (this.velocity.x > 0) {\n      overscanned.x -= overscanX * 0.2;\n      overscanned.width += overscanX + overscanX * 0.2;\n    } else {\n      overscanned.x -= overscanX;\n      overscanned.width += overscanX + overscanX * 0.2;\n    }\n\n    return overscanned;\n  }\n}\n"],"names":[],"version":3,"file":"OverscanManager.module.js.map"}

package/dist/Point.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, "Point", () => $f89f15d7f52bce29$export$baf26146a414f24a);
+/*
+ * 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 $f89f15d7f52bce29$export$baf26146a414f24a {
+    /**
+   * Returns a copy of this point.
+   */ copy() {
+        return new $f89f15d7f52bce29$export$baf26146a414f24a(this.x, this.y);
+    }
+    /**
+   * Checks if two points are equal.
+   */ equals(point) {
+        return this.x === point.x && this.y === point.y;
+    }
+    /**
+   * Returns true if this point is the origin.
+   */ isOrigin() {
+        return this.x === 0 && this.y === 0;
+    }
+    constructor(x = 0, y = 0){
+        this.x = x;
+        this.y = y;
+    }
+}
+
+
+//# sourceMappingURL=Point.main.js.map

package/dist/Point.main.js.map

@@ -0,0 +1 @@
+{"mappings":";;;;;;AAAA;;;;;;;;;;CAUC,GAEM,MAAM;IAYX;;GAEC,GACD,OAAc;QACZ,OAAO,IAAI,0CAAM,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACjC;IAEA;;GAEC,GACD,OAAO,KAAY,EAAW;QAC5B,OAAO,IAAI,CAAC,CAAC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,MAAM,CAAC;IACjD;IAEA;;GAEC,GACD,WAAoB;QAClB,OAAO,IAAI,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC,KAAK;IACpC;IAxBA,YAAY,IAAI,CAAC,EAAE,IAAI,CAAC,CAAE;QACxB,IAAI,CAAC,CAAC,GAAG;QACT,IAAI,CAAC,CAAC,GAAG;IACX;AAsBF","sources":["packages/@react-stately/virtualizer/src/Point.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 Point {\n  /** The x-coordinate of the point. */\n  x: number;\n\n  /** The y-coordinate of the point. */\n  y: number;\n\n  constructor(x = 0, y = 0) {\n    this.x = x;\n    this.y = y;\n  }\n\n  /**\n   * Returns a copy of this point.\n   */\n  copy(): Point {\n    return new Point(this.x, this.y);\n  }\n\n  /**\n   * Checks if two points are equal.\n   */\n  equals(point: Point): boolean {\n    return this.x === point.x && this.y === point.y;\n  }\n\n  /**\n   * Returns true if this point is the origin.\n   */\n  isOrigin(): boolean {\n    return this.x === 0 && this.y === 0;\n  }\n}\n"],"names":[],"version":3,"file":"Point.main.js.map"}

package/dist/Point.mjs

@@ -0,0 +1,35 @@
+/*
+ * 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 $3041db3296945e6e$export$baf26146a414f24a {
+    /**
+   * Returns a copy of this point.
+   */ copy() {
+        return new $3041db3296945e6e$export$baf26146a414f24a(this.x, this.y);
+    }
+    /**
+   * Checks if two points are equal.
+   */ equals(point) {
+        return this.x === point.x && this.y === point.y;
+    }
+    /**
+   * Returns true if this point is the origin.
+   */ isOrigin() {
+        return this.x === 0 && this.y === 0;
+    }
+    constructor(x = 0, y = 0){
+        this.x = x;
+        this.y = y;
+    }
+}
+
+
+export {$3041db3296945e6e$export$baf26146a414f24a as Point};
+//# sourceMappingURL=Point.mjs.map

package/dist/Point.module.js

@@ -0,0 +1,35 @@
+/*
+ * 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 $3041db3296945e6e$export$baf26146a414f24a {
+    /**
+   * Returns a copy of this point.
+   */ copy() {
+        return new $3041db3296945e6e$export$baf26146a414f24a(this.x, this.y);
+    }
+    /**
+   * Checks if two points are equal.
+   */ equals(point) {
+        return this.x === point.x && this.y === point.y;
+    }
+    /**
+   * Returns true if this point is the origin.
+   */ isOrigin() {
+        return this.x === 0 && this.y === 0;
+    }
+    constructor(x = 0, y = 0){
+        this.x = x;
+        this.y = y;
+    }
+}
+
+
+export {$3041db3296945e6e$export$baf26146a414f24a as Point};
+//# sourceMappingURL=Point.module.js.map

package/dist/Point.module.js.map

@@ -0,0 +1 @@
+{"mappings":"AAAA;;;;;;;;;;CAUC,GAEM,MAAM;IAYX;;GAEC,GACD,OAAc;QACZ,OAAO,IAAI,0CAAM,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACjC;IAEA;;GAEC,GACD,OAAO,KAAY,EAAW;QAC5B,OAAO,IAAI,CAAC,CAAC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,MAAM,CAAC;IACjD;IAEA;;GAEC,GACD,WAAoB;QAClB,OAAO,IAAI,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC,KAAK;IACpC;IAxBA,YAAY,IAAI,CAAC,EAAE,IAAI,CAAC,CAAE;QACxB,IAAI,CAAC,CAAC,GAAG;QACT,IAAI,CAAC,CAAC,GAAG;IACX;AAsBF","sources":["packages/@react-stately/virtualizer/src/Point.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 Point {\n  /** The x-coordinate of the point. */\n  x: number;\n\n  /** The y-coordinate of the point. */\n  y: number;\n\n  constructor(x = 0, y = 0) {\n    this.x = x;\n    this.y = y;\n  }\n\n  /**\n   * Returns a copy of this point.\n   */\n  copy(): Point {\n    return new Point(this.x, this.y);\n  }\n\n  /**\n   * Checks if two points are equal.\n   */\n  equals(point: Point): boolean {\n    return this.x === point.x && this.y === point.y;\n  }\n\n  /**\n   * Returns true if this point is the origin.\n   */\n  isOrigin(): boolean {\n    return this.x === 0 && this.y === 0;\n  }\n}\n"],"names":[],"version":3,"file":"Point.module.js.map"}

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.mjs.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"}