mirage2d 1.1.2 → 1.1.4

package/dist/js/_quickselect@1.1.1@quickselect/_quickselect@1.1.1@quickselect.8afce154.js

@@ -1 +0,0 @@
-

package/dist/js/_quickselect@2.0.0@quickselect/_quickselect@2.0.0@quickselect.9f5c1e48.js

@@ -1,51 +0,0 @@
-function quickselect(arr, k, left, right, compare) {
-  quickselectStep(arr, k, left || 0, right || arr.length - 1, compare || defaultCompare);
-}
-function quickselectStep(arr, k, left, right, compare) {
-  while (right > left) {
-    if (right - left > 600) {
-      var n = right - left + 1;
-      var m = k - left + 1;
-      var z = Math.log(n);
-      var s = 0.5 * Math.exp(2 * z / 3);
-      var sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);
-      var newLeft = Math.max(left, Math.floor(k - m * s / n + sd));
-      var newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));
-      quickselectStep(arr, k, newLeft, newRight, compare);
-    }
-    var t = arr[k];
-    var i = left;
-    var j = right;
-    swap(arr, left, k);
-    if (compare(arr[right], t) > 0)
-      swap(arr, left, right);
-    while (i < j) {
-      swap(arr, i, j);
-      i++;
-      j--;
-      while (compare(arr[i], t) < 0)
-        i++;
-      while (compare(arr[j], t) > 0)
-        j--;
-    }
-    if (compare(arr[left], t) === 0)
-      swap(arr, left, j);
-    else {
-      j++;
-      swap(arr, j, right);
-    }
-    if (j <= k)
-      left = j + 1;
-    if (k <= j)
-      right = j - 1;
-  }
-}
-function swap(arr, i, j) {
-  var tmp = arr[i];
-  arr[i] = arr[j];
-  arr[j] = tmp;
-}
-function defaultCompare(a, b) {
-  return a < b ? -1 : a > b ? 1 : 0;
-}
-export { quickselect as q };

package/dist/js/_raf@3.4.1@raf/_raf@3.4.1@raf.ac0d6c66.js

@@ -1,60 +0,0 @@
-import { c as commonjsGlobal } from "../_@turf_bbox@6.5.0@@turf/_@turf_bbox@6.5.0@@turf.4c59feee.js";
-import { p as performanceNow } from "../_performance-now@2.1.0@performance-now/_performance-now@2.1.0@performance-now.a51379c2.js";
-var _raf_3_4_1_raf = { exports: {} };
-var now = performanceNow.exports, root = typeof window === "undefined" ? commonjsGlobal : window, vendors = ["moz", "webkit"], suffix = "AnimationFrame", raf = root["request" + suffix], caf = root["cancel" + suffix] || root["cancelRequest" + suffix];
-for (var i = 0; !raf && i < vendors.length; i++) {
-  raf = root[vendors[i] + "Request" + suffix];
-  caf = root[vendors[i] + "Cancel" + suffix] || root[vendors[i] + "CancelRequest" + suffix];
-}
-if (!raf || !caf) {
-  var last = 0, id = 0, queue = [], frameDuration = 1e3 / 60;
-  raf = function(callback) {
-    if (queue.length === 0) {
-      var _now = now(), next = Math.max(0, frameDuration - (_now - last));
-      last = next + _now;
-      setTimeout(function() {
-        var cp = queue.slice(0);
-        queue.length = 0;
-        for (var i = 0; i < cp.length; i++) {
-          if (!cp[i].cancelled) {
-            try {
-              cp[i].callback(last);
-            } catch (e) {
-              setTimeout(function() {
-                throw e;
-              }, 0);
-            }
-          }
-        }
-      }, Math.round(next));
-    }
-    queue.push({
-      handle: ++id,
-      callback,
-      cancelled: false
-    });
-    return id;
-  };
-  caf = function(handle) {
-    for (var i = 0; i < queue.length; i++) {
-      if (queue[i].handle === handle) {
-        queue[i].cancelled = true;
-      }
-    }
-  };
-}
-_raf_3_4_1_raf.exports = function(fn) {
-  return raf.call(root, fn);
-};
-_raf_3_4_1_raf.exports.cancel = function() {
-  caf.apply(root, arguments);
-};
-_raf_3_4_1_raf.exports.polyfill = function(object) {
-  if (!object) {
-    object = root;
-  }
-  object.requestAnimationFrame = raf;
-  object.cancelAnimationFrame = caf;
-};
-var requestAnimationFrame = _raf_3_4_1_raf.exports;
-export { requestAnimationFrame as r };

package/dist/js/_rbush@2.0.2@rbush/_rbush@2.0.2@rbush.7149e620.js

@@ -1 +0,0 @@
-

package/dist/js/_rbush@3.0.1@rbush/_rbush@3.0.1@rbush.57d33d95.js

@@ -1,402 +0,0 @@
-import { g as getAugmentedNamespace } from "../_@turf_bbox@6.5.0@@turf/_@turf_bbox@6.5.0@@turf.4c59feee.js";
-import { q as quickselect } from "../_quickselect@2.0.0@quickselect/_quickselect@2.0.0@quickselect.9f5c1e48.js";
-class RBush {
-  constructor(maxEntries = 9) {
-    this._maxEntries = Math.max(4, maxEntries);
-    this._minEntries = Math.max(2, Math.ceil(this._maxEntries * 0.4));
-    this.clear();
-  }
-  all() {
-    return this._all(this.data, []);
-  }
-  search(bbox) {
-    let node = this.data;
-    const result = [];
-    if (!intersects(bbox, node))
-      return result;
-    const toBBox = this.toBBox;
-    const nodesToSearch = [];
-    while (node) {
-      for (let i = 0; i < node.children.length; i++) {
-        const child = node.children[i];
-        const childBBox = node.leaf ? toBBox(child) : child;
-        if (intersects(bbox, childBBox)) {
-          if (node.leaf)
-            result.push(child);
-          else if (contains(bbox, childBBox))
-            this._all(child, result);
-          else
-            nodesToSearch.push(child);
-        }
-      }
-      node = nodesToSearch.pop();
-    }
-    return result;
-  }
-  collides(bbox) {
-    let node = this.data;
-    if (!intersects(bbox, node))
-      return false;
-    const nodesToSearch = [];
-    while (node) {
-      for (let i = 0; i < node.children.length; i++) {
-        const child = node.children[i];
-        const childBBox = node.leaf ? this.toBBox(child) : child;
-        if (intersects(bbox, childBBox)) {
-          if (node.leaf || contains(bbox, childBBox))
-            return true;
-          nodesToSearch.push(child);
-        }
-      }
-      node = nodesToSearch.pop();
-    }
-    return false;
-  }
-  load(data) {
-    if (!(data && data.length))
-      return this;
-    if (data.length < this._minEntries) {
-      for (let i = 0; i < data.length; i++) {
-        this.insert(data[i]);
-      }
-      return this;
-    }
-    let node = this._build(data.slice(), 0, data.length - 1, 0);
-    if (!this.data.children.length) {
-      this.data = node;
-    } else if (this.data.height === node.height) {
-      this._splitRoot(this.data, node);
-    } else {
-      if (this.data.height < node.height) {
-        const tmpNode = this.data;
-        this.data = node;
-        node = tmpNode;
-      }
-      this._insert(node, this.data.height - node.height - 1, true);
-    }
-    return this;
-  }
-  insert(item) {
-    if (item)
-      this._insert(item, this.data.height - 1);
-    return this;
-  }
-  clear() {
-    this.data = createNode([]);
-    return this;
-  }
-  remove(item, equalsFn) {
-    if (!item)
-      return this;
-    let node = this.data;
-    const bbox = this.toBBox(item);
-    const path = [];
-    const indexes = [];
-    let i, parent, goingUp;
-    while (node || path.length) {
-      if (!node) {
-        node = path.pop();
-        parent = path[path.length - 1];
-        i = indexes.pop();
-        goingUp = true;
-      }
-      if (node.leaf) {
-        const index = findItem(item, node.children, equalsFn);
-        if (index !== -1) {
-          node.children.splice(index, 1);
-          path.push(node);
-          this._condense(path);
-          return this;
-        }
-      }
-      if (!goingUp && !node.leaf && contains(node, bbox)) {
-        path.push(node);
-        indexes.push(i);
-        i = 0;
-        parent = node;
-        node = node.children[0];
-      } else if (parent) {
-        i++;
-        node = parent.children[i];
-        goingUp = false;
-      } else
-        node = null;
-    }
-    return this;
-  }
-  toBBox(item) {
-    return item;
-  }
-  compareMinX(a, b) {
-    return a.minX - b.minX;
-  }
-  compareMinY(a, b) {
-    return a.minY - b.minY;
-  }
-  toJSON() {
-    return this.data;
-  }
-  fromJSON(data) {
-    this.data = data;
-    return this;
-  }
-  _all(node, result) {
-    const nodesToSearch = [];
-    while (node) {
-      if (node.leaf)
-        result.push(...node.children);
-      else
-        nodesToSearch.push(...node.children);
-      node = nodesToSearch.pop();
-    }
-    return result;
-  }
-  _build(items, left, right, height) {
-    const N = right - left + 1;
-    let M = this._maxEntries;
-    let node;
-    if (N <= M) {
-      node = createNode(items.slice(left, right + 1));
-      calcBBox(node, this.toBBox);
-      return node;
-    }
-    if (!height) {
-      height = Math.ceil(Math.log(N) / Math.log(M));
-      M = Math.ceil(N / Math.pow(M, height - 1));
-    }
-    node = createNode([]);
-    node.leaf = false;
-    node.height = height;
-    const N2 = Math.ceil(N / M);
-    const N1 = N2 * Math.ceil(Math.sqrt(M));
-    multiSelect(items, left, right, N1, this.compareMinX);
-    for (let i = left; i <= right; i += N1) {
-      const right2 = Math.min(i + N1 - 1, right);
-      multiSelect(items, i, right2, N2, this.compareMinY);
-      for (let j = i; j <= right2; j += N2) {
-        const right3 = Math.min(j + N2 - 1, right2);
-        node.children.push(this._build(items, j, right3, height - 1));
-      }
-    }
-    calcBBox(node, this.toBBox);
-    return node;
-  }
-  _chooseSubtree(bbox, node, level, path) {
-    while (true) {
-      path.push(node);
-      if (node.leaf || path.length - 1 === level)
-        break;
-      let minArea = Infinity;
-      let minEnlargement = Infinity;
-      let targetNode;
-      for (let i = 0; i < node.children.length; i++) {
-        const child = node.children[i];
-        const area = bboxArea(child);
-        const enlargement = enlargedArea(bbox, child) - area;
-        if (enlargement < minEnlargement) {
-          minEnlargement = enlargement;
-          minArea = area < minArea ? area : minArea;
-          targetNode = child;
-        } else if (enlargement === minEnlargement) {
-          if (area < minArea) {
-            minArea = area;
-            targetNode = child;
-          }
-        }
-      }
-      node = targetNode || node.children[0];
-    }
-    return node;
-  }
-  _insert(item, level, isNode) {
-    const bbox = isNode ? item : this.toBBox(item);
-    const insertPath = [];
-    const node = this._chooseSubtree(bbox, this.data, level, insertPath);
-    node.children.push(item);
-    extend(node, bbox);
-    while (level >= 0) {
-      if (insertPath[level].children.length > this._maxEntries) {
-        this._split(insertPath, level);
-        level--;
-      } else
-        break;
-    }
-    this._adjustParentBBoxes(bbox, insertPath, level);
-  }
-  _split(insertPath, level) {
-    const node = insertPath[level];
-    const M = node.children.length;
-    const m = this._minEntries;
-    this._chooseSplitAxis(node, m, M);
-    const splitIndex = this._chooseSplitIndex(node, m, M);
-    const newNode = createNode(node.children.splice(splitIndex, node.children.length - splitIndex));
-    newNode.height = node.height;
-    newNode.leaf = node.leaf;
-    calcBBox(node, this.toBBox);
-    calcBBox(newNode, this.toBBox);
-    if (level)
-      insertPath[level - 1].children.push(newNode);
-    else
-      this._splitRoot(node, newNode);
-  }
-  _splitRoot(node, newNode) {
-    this.data = createNode([node, newNode]);
-    this.data.height = node.height + 1;
-    this.data.leaf = false;
-    calcBBox(this.data, this.toBBox);
-  }
-  _chooseSplitIndex(node, m, M) {
-    let index;
-    let minOverlap = Infinity;
-    let minArea = Infinity;
-    for (let i = m; i <= M - m; i++) {
-      const bbox1 = distBBox(node, 0, i, this.toBBox);
-      const bbox2 = distBBox(node, i, M, this.toBBox);
-      const overlap = intersectionArea(bbox1, bbox2);
-      const area = bboxArea(bbox1) + bboxArea(bbox2);
-      if (overlap < minOverlap) {
-        minOverlap = overlap;
-        index = i;
-        minArea = area < minArea ? area : minArea;
-      } else if (overlap === minOverlap) {
-        if (area < minArea) {
-          minArea = area;
-          index = i;
-        }
-      }
-    }
-    return index || M - m;
-  }
-  _chooseSplitAxis(node, m, M) {
-    const compareMinX = node.leaf ? this.compareMinX : compareNodeMinX;
-    const compareMinY = node.leaf ? this.compareMinY : compareNodeMinY;
-    const xMargin = this._allDistMargin(node, m, M, compareMinX);
-    const yMargin = this._allDistMargin(node, m, M, compareMinY);
-    if (xMargin < yMargin)
-      node.children.sort(compareMinX);
-  }
-  _allDistMargin(node, m, M, compare) {
-    node.children.sort(compare);
-    const toBBox = this.toBBox;
-    const leftBBox = distBBox(node, 0, m, toBBox);
-    const rightBBox = distBBox(node, M - m, M, toBBox);
-    let margin = bboxMargin(leftBBox) + bboxMargin(rightBBox);
-    for (let i = m; i < M - m; i++) {
-      const child = node.children[i];
-      extend(leftBBox, node.leaf ? toBBox(child) : child);
-      margin += bboxMargin(leftBBox);
-    }
-    for (let i = M - m - 1; i >= m; i--) {
-      const child = node.children[i];
-      extend(rightBBox, node.leaf ? toBBox(child) : child);
-      margin += bboxMargin(rightBBox);
-    }
-    return margin;
-  }
-  _adjustParentBBoxes(bbox, path, level) {
-    for (let i = level; i >= 0; i--) {
-      extend(path[i], bbox);
-    }
-  }
-  _condense(path) {
-    for (let i = path.length - 1, siblings; i >= 0; i--) {
-      if (path[i].children.length === 0) {
-        if (i > 0) {
-          siblings = path[i - 1].children;
-          siblings.splice(siblings.indexOf(path[i]), 1);
-        } else
-          this.clear();
-      } else
-        calcBBox(path[i], this.toBBox);
-    }
-  }
-}
-function findItem(item, items, equalsFn) {
-  if (!equalsFn)
-    return items.indexOf(item);
-  for (let i = 0; i < items.length; i++) {
-    if (equalsFn(item, items[i]))
-      return i;
-  }
-  return -1;
-}
-function calcBBox(node, toBBox) {
-  distBBox(node, 0, node.children.length, toBBox, node);
-}
-function distBBox(node, k, p, toBBox, destNode) {
-  if (!destNode)
-    destNode = createNode(null);
-  destNode.minX = Infinity;
-  destNode.minY = Infinity;
-  destNode.maxX = -Infinity;
-  destNode.maxY = -Infinity;
-  for (let i = k; i < p; i++) {
-    const child = node.children[i];
-    extend(destNode, node.leaf ? toBBox(child) : child);
-  }
-  return destNode;
-}
-function extend(a, b) {
-  a.minX = Math.min(a.minX, b.minX);
-  a.minY = Math.min(a.minY, b.minY);
-  a.maxX = Math.max(a.maxX, b.maxX);
-  a.maxY = Math.max(a.maxY, b.maxY);
-  return a;
-}
-function compareNodeMinX(a, b) {
-  return a.minX - b.minX;
-}
-function compareNodeMinY(a, b) {
-  return a.minY - b.minY;
-}
-function bboxArea(a) {
-  return (a.maxX - a.minX) * (a.maxY - a.minY);
-}
-function bboxMargin(a) {
-  return a.maxX - a.minX + (a.maxY - a.minY);
-}
-function enlargedArea(a, b) {
-  return (Math.max(b.maxX, a.maxX) - Math.min(b.minX, a.minX)) * (Math.max(b.maxY, a.maxY) - Math.min(b.minY, a.minY));
-}
-function intersectionArea(a, b) {
-  const minX = Math.max(a.minX, b.minX);
-  const minY = Math.max(a.minY, b.minY);
-  const maxX = Math.min(a.maxX, b.maxX);
-  const maxY = Math.min(a.maxY, b.maxY);
-  return Math.max(0, maxX - minX) * Math.max(0, maxY - minY);
-}
-function contains(a, b) {
-  return a.minX <= b.minX && a.minY <= b.minY && b.maxX <= a.maxX && b.maxY <= a.maxY;
-}
-function intersects(a, b) {
-  return b.minX <= a.maxX && b.minY <= a.maxY && b.maxX >= a.minX && b.maxY >= a.minY;
-}
-function createNode(children) {
-  return {
-    children,
-    height: 1,
-    leaf: true,
-    minX: Infinity,
-    minY: Infinity,
-    maxX: -Infinity,
-    maxY: -Infinity
-  };
-}
-function multiSelect(arr, left, right, n, compare) {
-  const stack = [left, right];
-  while (stack.length) {
-    right = stack.pop();
-    left = stack.pop();
-    if (right - left <= n)
-      continue;
-    const mid = left + Math.ceil((right - left) / n / 2) * n;
-    quickselect(arr, mid, left, right, compare);
-    stack.push(left, mid, mid, right);
-  }
-}
-var _rbush_3_0_1_rbush = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
-  __proto__: null,
-  "default": RBush
-}, Symbol.toStringTag, { value: "Module" }));
-var require$$0 = /* @__PURE__ */ getAugmentedNamespace(_rbush_3_0_1_rbush);
-export { RBush as R, require$$0 as r };

package/dist/js/_regexp.prototype.flags@1.4.3@regexp.prototype.flags/_regexp.prototype.flags@1.4.3@regexp.prototype.flags.8b6921c6.js

@@ -1,102 +0,0 @@
-import { _ as _defineProperties_1_1_4_defineProperties } from "../_define-properties@1.1.4@define-properties/_define-properties@1.1.4@define-properties.647c3367.js";
-import { _ as _callBind_1_0_2_callBind } from "../_call-bind@1.0.2@call-bind/_call-bind@1.0.2@call-bind.3811d387.js";
-import { _ as _functionsHaveNames_1_2_3_functionsHaveNames } from "../_functions-have-names@1.2.3@functions-have-names/_functions-have-names@1.2.3@functions-have-names.7def2408.js";
-var implementation$2 = { exports: {} };
-(function(module) {
-  var functionsHaveConfigurableNames = _functionsHaveNames_1_2_3_functionsHaveNames.functionsHaveConfigurableNames();
-  var $Object = Object;
-  var $TypeError = TypeError;
-  module.exports = function flags() {
-    if (this != null && this !== $Object(this)) {
-      throw new $TypeError("RegExp.prototype.flags getter called on non-object");
-    }
-    var result = "";
-    if (this.hasIndices) {
-      result += "d";
-    }
-    if (this.global) {
-      result += "g";
-    }
-    if (this.ignoreCase) {
-      result += "i";
-    }
-    if (this.multiline) {
-      result += "m";
-    }
-    if (this.dotAll) {
-      result += "s";
-    }
-    if (this.unicode) {
-      result += "u";
-    }
-    if (this.sticky) {
-      result += "y";
-    }
-    return result;
-  };
-  if (functionsHaveConfigurableNames && Object.defineProperty) {
-    Object.defineProperty(module.exports, "name", { value: "get flags" });
-  }
-})(implementation$2);
-var implementation$1 = implementation$2.exports;
-var supportsDescriptors$1 = _defineProperties_1_1_4_defineProperties.supportsDescriptors;
-var $gOPD = Object.getOwnPropertyDescriptor;
-var polyfill = function getPolyfill() {
-  if (supportsDescriptors$1 && /a/mig.flags === "gim") {
-    var descriptor = $gOPD(RegExp.prototype, "flags");
-    if (descriptor && typeof descriptor.get === "function" && typeof RegExp.prototype.dotAll === "boolean" && typeof RegExp.prototype.hasIndices === "boolean") {
-      var calls = "";
-      var o = {};
-      Object.defineProperty(o, "hasIndices", {
-        get: function() {
-          calls += "d";
-        }
-      });
-      Object.defineProperty(o, "sticky", {
-        get: function() {
-          calls += "y";
-        }
-      });
-      if (calls === "dy") {
-        return descriptor.get;
-      }
-    }
-  }
-  return implementation$1;
-};
-var supportsDescriptors = _defineProperties_1_1_4_defineProperties.supportsDescriptors;
-var getPolyfill$1 = polyfill;
-var gOPD = Object.getOwnPropertyDescriptor;
-var defineProperty = Object.defineProperty;
-var TypeErr = TypeError;
-var getProto = Object.getPrototypeOf;
-var regex = /a/;
-var shim$1 = function shimFlags() {
-  if (!supportsDescriptors || !getProto) {
-    throw new TypeErr("RegExp.prototype.flags requires a true ES5 environment that supports property descriptors");
-  }
-  var polyfill2 = getPolyfill$1();
-  var proto = getProto(regex);
-  var descriptor = gOPD(proto, "flags");
-  if (!descriptor || descriptor.get !== polyfill2) {
-    defineProperty(proto, "flags", {
-      configurable: true,
-      enumerable: false,
-      get: polyfill2
-    });
-  }
-  return polyfill2;
-};
-var define = _defineProperties_1_1_4_defineProperties;
-var callBind = _callBind_1_0_2_callBind.exports;
-var implementation = implementation$2.exports;
-var getPolyfill2 = polyfill;
-var shim = shim$1;
-var flagsBound = callBind(getPolyfill2());
-define(flagsBound, {
-  getPolyfill: getPolyfill2,
-  implementation,
-  shim
-});
-var _regexp_prototype_flags_1_4_3_regexp_prototype_flags = flagsBound;
-export { _regexp_prototype_flags_1_4_3_regexp_prototype_flags as _ };