@performant-software/geospatial 3.1.28-beta.0 → 3.1.29

package/dist/index.es558.js

@@ -0,0 +1,178 @@
+const B = [
+  Int8Array,
+  Uint8Array,
+  Uint8ClampedArray,
+  Int16Array,
+  Uint16Array,
+  Int32Array,
+  Uint32Array,
+  Float32Array,
+  Float64Array
+], T = 1, U = 8, o = new Uint32Array(96);
+class D {
+  /**
+   * Creates an index from raw `ArrayBuffer` data.
+   * @param {ArrayBufferLike} data
+   */
+  static from(t) {
+    if (!t || t.byteLength === void 0 || t.buffer)
+      throw new Error("Data must be an instance of ArrayBuffer or SharedArrayBuffer.");
+    const [e, n] = new Uint8Array(t, 0, 2);
+    if (e !== 219)
+      throw new Error("Data does not appear to be in a KDBush format.");
+    const s = n >> 4;
+    if (s !== T)
+      throw new Error(`Got v${s} data when expected v${T}.`);
+    const r = B[n & 15];
+    if (!r)
+      throw new Error("Unrecognized array type.");
+    const [h] = new Uint16Array(t, 2, 1), [y] = new Uint32Array(t, 4, 1);
+    return new D(y, h, r, void 0, t);
+  }
+  /**
+   * Creates an index that will hold a given number of items.
+   * @param {number} numItems
+   * @param {number} [nodeSize=64] Size of the KD-tree node (64 by default).
+   * @param {TypedArrayConstructor} [ArrayType=Float64Array] The array type used for coordinates storage (`Float64Array` by default).
+   * @param {ArrayBufferConstructor | SharedArrayBufferConstructor} [ArrayBufferType=ArrayBuffer] The array buffer type used for storage (`ArrayBuffer` by default).
+   * @param {ArrayBufferLike} [data] (For internal use only)
+   */
+  constructor(t, e = 64, n = Float64Array, s = ArrayBuffer, r) {
+    if (isNaN(t) || t < 0) throw new Error(`Unexpected numItems value: ${t}.`);
+    this.numItems = +t, this.nodeSize = Math.min(Math.max(+e, 2), 65535), this.ArrayType = n, this.IndexArrayType = t < 65536 ? Uint16Array : Uint32Array;
+    const h = B.indexOf(this.ArrayType), y = t * 2 * this.ArrayType.BYTES_PER_ELEMENT, i = t * this.IndexArrayType.BYTES_PER_ELEMENT, a = (8 - i % 8) % 8;
+    if (h < 0)
+      throw new Error(`Unexpected typed array class: ${n}.`);
+    if (r)
+      this.data = r, this.ids = new this.IndexArrayType(r, U, t), this.coords = new n(r, U + i + a, t * 2), this._pos = t * 2, this._finished = !0;
+    else {
+      const f = this.data = new s(U + y + i + a);
+      this.ids = new this.IndexArrayType(f, U, t), this.coords = new n(f, U + i + a, t * 2), this._pos = 0, this._finished = !1, new Uint8Array(f, 0, 2).set([219, (T << 4) + h]), new Uint16Array(f, 2, 1)[0] = e, new Uint32Array(f, 4, 1)[0] = t;
+    }
+  }
+  /**
+   * Add a point to the index.
+   * @param {number} x
+   * @param {number} y
+   * @returns {number} An incremental index associated with the added item (starting from `0`).
+   */
+  add(t, e) {
+    const n = this._pos >> 1;
+    return this.ids[n] = n, this.coords[this._pos++] = t, this.coords[this._pos++] = e, n;
+  }
+  /**
+   * Perform indexing of the added points.
+   */
+  finish() {
+    const t = this._pos >> 1;
+    if (t !== this.numItems)
+      throw new Error(`Added ${t} items when expected ${this.numItems}.`);
+    return M(this.ids, this.coords, this.nodeSize, 0, this.numItems - 1, 0), this._finished = !0, this;
+  }
+  /**
+   * Search the index for items within a given bounding box.
+   * @param {number} minX
+   * @param {number} minY
+   * @param {number} maxX
+   * @param {number} maxY
+   * @returns {number[]} An array of indices correponding to the found items.
+   */
+  range(t, e, n, s) {
+    if (!this._finished) throw new Error("Data not yet indexed - call index.finish().");
+    const { ids: r, coords: h, nodeSize: y } = this;
+    o[0] = 0, o[1] = r.length - 1, o[2] = 0;
+    let i = 3;
+    const a = [];
+    for (; i > 0; ) {
+      const f = o[--i], A = o[--i], w = o[--i];
+      if (A - w <= y) {
+        for (let u = w; u <= A; u++) {
+          const E = h[2 * u], S = h[2 * u + 1];
+          E >= t && E <= n && S >= e && S <= s && a.push(r[u]);
+        }
+        continue;
+      }
+      const d = w + A >> 1, p = h[2 * d], l = h[2 * d + 1];
+      p >= t && p <= n && l >= e && l <= s && a.push(r[d]), (f === 0 ? t <= p : e <= l) && (o[i++] = w, o[i++] = d - 1, o[i++] = 1 - f), (f === 0 ? n >= p : s >= l) && (o[i++] = d + 1, o[i++] = A, o[i++] = 1 - f);
+    }
+    return a;
+  }
+  /**
+   * Search the index for items within a given radius.
+   * @param {number} qx
+   * @param {number} qy
+   * @param {number} r Query radius.
+   * @returns {number[]} An array of indices correponding to the found items.
+   */
+  within(t, e, n) {
+    const s = (
+      /** @type {number[]} */
+      []
+    );
+    return this.withinInto(t, e, n, s), s;
+  }
+  /**
+   * Search the index for items within a given radius, writing matching ids into `out`
+   * via indexed assignment (`out[i] = id`). Accepts any indexed-writable container —
+   * a typed array sized to the expected upper bound (allocation-free, fast) or a plain
+   * `Array` (which will grow as needed). Returns the number of matches written.
+   * @param {number} qx
+   * @param {number} qy
+   * @param {number} r Query radius.
+   * @param {number[] | TypedArray} out Container to write matching ids into.
+   * @returns {number} The number of matches written to `out`.
+   */
+  withinInto(t, e, n, s) {
+    if (!this._finished) throw new Error("Data not yet indexed - call index.finish().");
+    const { ids: r, coords: h, nodeSize: y } = this;
+    o[0] = 0, o[1] = r.length - 1, o[2] = 0;
+    let i = 3, a = 0;
+    const f = n * n;
+    for (; i > 0; ) {
+      const A = o[--i], w = o[--i], d = o[--i];
+      if (w - d <= y) {
+        for (let E = d; E <= w; E++)
+          v(h[2 * E], h[2 * E + 1], t, e) <= f && (s[a++] = r[E]);
+        continue;
+      }
+      const p = d + w >> 1, l = h[2 * p], u = h[2 * p + 1];
+      v(l, u, t, e) <= f && (s[a++] = r[p]), (A === 0 ? t - n <= l : e - n <= u) && (o[i++] = d, o[i++] = p - 1, o[i++] = 1 - A), (A === 0 ? t + n >= l : e + n >= u) && (o[i++] = p + 1, o[i++] = w, o[i++] = 1 - A);
+    }
+    return a;
+  }
+}
+function M(c, t, e, n, s, r) {
+  if (s - n <= e) return;
+  const h = n + s >> 1;
+  I(c, t, h, n, s, r), M(c, t, e, n, h - 1, 1 - r), M(c, t, e, h + 1, s, 1 - r);
+}
+function I(c, t, e, n, s, r) {
+  for (; s > n; ) {
+    if (s - n > 600) {
+      const a = s - n + 1, f = e - n + 1, A = Math.log(a), w = 0.5 * Math.exp(2 * A / 3), d = 0.5 * Math.sqrt(A * w * (a - w) / a) * (f - a / 2 < 0 ? -1 : 1), p = Math.max(n, Math.floor(e - f * w / a + d)), l = Math.min(s, Math.floor(e + (a - f) * w / a + d));
+      I(c, t, e, p, l, r);
+    }
+    const h = t[2 * e + r];
+    let y = n, i = s;
+    for (_(c, t, n, e), t[2 * s + r] > h && _(c, t, n, s); y < i; ) {
+      for (_(c, t, y, i), y++, i--; t[2 * y + r] < h; ) y++;
+      for (; t[2 * i + r] > h; ) i--;
+    }
+    t[2 * n + r] === h ? _(c, t, n, i) : (i++, _(c, t, i, s)), i <= e && (n = i + 1), e <= i && (s = i - 1);
+  }
+}
+function _(c, t, e, n) {
+  x(c, e, n), x(t, 2 * e, 2 * n), x(t, 2 * e + 1, 2 * n + 1);
+}
+function x(c, t, e) {
+  const n = c[t];
+  c[t] = c[e], c[e] = n;
+}
+function v(c, t, e, n) {
+  const s = c - e, r = t - n;
+  return s * s + r * r;
+}
+export {
+  D as default
+};
+//# sourceMappingURL=index.es558.js.map

package/dist/index.es558.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es558.js","sources":["../../../node_modules/@allmaps/triangulate/node_modules/kdbush/index.js"],"sourcesContent":["\nconst ARRAY_TYPES = [\n    Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array,\n    Int32Array, Uint32Array, Float32Array, Float64Array\n];\n\n/** @typedef {Int8ArrayConstructor | Uint8ArrayConstructor | Uint8ClampedArrayConstructor | Int16ArrayConstructor | Uint16ArrayConstructor | Int32ArrayConstructor | Uint32ArrayConstructor | Float32ArrayConstructor | Float64ArrayConstructor} TypedArrayConstructor */\n/** @typedef {Int8Array | Uint8Array | Uint8ClampedArray | Int16Array | Uint16Array | Int32Array | Uint32Array | Float32Array | Float64Array} TypedArray */\n\nconst VERSION = 1; // serialized format version\nconst HEADER_SIZE = 8;\n\n// Shared scratch stack for iterative DFS in range/within. Sized for the worst case:\n// 3 ints per frame * (treeHeight + 1), with treeHeight ≤ ceil(log2(2^32 / 3)) ≈ 31.\nconst STACK = new Uint32Array(96);\n\nexport default class KDBush {\n\n    /**\n     * Creates an index from raw `ArrayBuffer` data.\n     * @param {ArrayBufferLike} data\n     */\n    static from(data) {\n        // @ts-expect-error duck typing array buffers\n        if (!data || data.byteLength === undefined || data.buffer) {\n            throw new Error('Data must be an instance of ArrayBuffer or SharedArrayBuffer.');\n        }\n        const [magic, versionAndType] = new Uint8Array(data, 0, 2);\n        if (magic !== 0xdb) {\n            throw new Error('Data does not appear to be in a KDBush format.');\n        }\n        const version = versionAndType >> 4;\n        if (version !== VERSION) {\n            throw new Error(`Got v${version} data when expected v${VERSION}.`);\n        }\n        const ArrayType = ARRAY_TYPES[versionAndType & 0x0f];\n        if (!ArrayType) {\n            throw new Error('Unrecognized array type.');\n        }\n        const [nodeSize] = new Uint16Array(data, 2, 1);\n        const [numItems] = new Uint32Array(data, 4, 1);\n\n        return new KDBush(numItems, nodeSize, ArrayType, undefined, data);\n    }\n\n    /**\n     * Creates an index that will hold a given number of items.\n     * @param {number} numItems\n     * @param {number} [nodeSize=64] Size of the KD-tree node (64 by default).\n     * @param {TypedArrayConstructor} [ArrayType=Float64Array] The array type used for coordinates storage (`Float64Array` by default).\n     * @param {ArrayBufferConstructor | SharedArrayBufferConstructor} [ArrayBufferType=ArrayBuffer] The array buffer type used for storage (`ArrayBuffer` by default).\n     * @param {ArrayBufferLike} [data] (For internal use only)\n     */\n    constructor(numItems, nodeSize = 64, ArrayType = Float64Array, ArrayBufferType = ArrayBuffer, data) {\n        if (isNaN(numItems) || numItems < 0) throw new Error(`Unexpected numItems value: ${numItems}.`);\n\n        this.numItems = +numItems;\n        this.nodeSize = Math.min(Math.max(+nodeSize, 2), 65535);\n        this.ArrayType = ArrayType;\n        this.IndexArrayType = numItems < 65536 ? Uint16Array : Uint32Array;\n\n        const arrayTypeIndex = ARRAY_TYPES.indexOf(this.ArrayType);\n        const coordsByteSize = numItems * 2 * this.ArrayType.BYTES_PER_ELEMENT;\n        const idsByteSize = numItems * this.IndexArrayType.BYTES_PER_ELEMENT;\n        const padCoords = (8 - idsByteSize % 8) % 8;\n\n        if (arrayTypeIndex < 0) {\n            throw new Error(`Unexpected typed array class: ${ArrayType}.`);\n        }\n\n        if (data) { // reconstruct an index from a buffer\n            this.data = data;\n            // @ts-expect-error TS can't handle SharedArrayBuffer overloads\n            this.ids = new this.IndexArrayType(data, HEADER_SIZE, numItems);\n            // @ts-expect-error TS can't handle SharedArrayBuffer overloads\n            this.coords = new ArrayType(data, HEADER_SIZE + idsByteSize + padCoords, numItems * 2);\n            this._pos = numItems * 2;\n            this._finished = true;\n\n        } else { // initialize a new index\n            const data = this.data = new ArrayBufferType(HEADER_SIZE + coordsByteSize + idsByteSize + padCoords);\n            // @ts-expect-error TS can't handle SharedArrayBuffer overloads\n            this.ids = new this.IndexArrayType(data, HEADER_SIZE, numItems);\n            // @ts-expect-error TS can't handle SharedArrayBuffer overloads\n            this.coords = new ArrayType(data, HEADER_SIZE + idsByteSize + padCoords, numItems * 2);\n            this._pos = 0;\n            this._finished = false;\n\n            // set header\n            new Uint8Array(data, 0, 2).set([0xdb, (VERSION << 4) + arrayTypeIndex]);\n            new Uint16Array(data, 2, 1)[0] = nodeSize;\n            new Uint32Array(data, 4, 1)[0] = numItems;\n        }\n    }\n\n    /**\n     * Add a point to the index.\n     * @param {number} x\n     * @param {number} y\n     * @returns {number} An incremental index associated with the added item (starting from `0`).\n     */\n    add(x, y) {\n        const index = this._pos >> 1;\n        this.ids[index] = index;\n        this.coords[this._pos++] = x;\n        this.coords[this._pos++] = y;\n        return index;\n    }\n\n    /**\n     * Perform indexing of the added points.\n     */\n    finish() {\n        const numAdded = this._pos >> 1;\n        if (numAdded !== this.numItems) {\n            throw new Error(`Added ${numAdded} items when expected ${this.numItems}.`);\n        }\n        // kd-sort both arrays for efficient search\n        sort(this.ids, this.coords, this.nodeSize, 0, this.numItems - 1, 0);\n\n        this._finished = true;\n        return this;\n    }\n\n    /**\n     * Search the index for items within a given bounding box.\n     * @param {number} minX\n     * @param {number} minY\n     * @param {number} maxX\n     * @param {number} maxY\n     * @returns {number[]} An array of indices correponding to the found items.\n     */\n    range(minX, minY, maxX, maxY) {\n        if (!this._finished) throw new Error('Data not yet indexed - call index.finish().');\n\n        const {ids, coords, nodeSize} = this;\n        STACK[0] = 0;\n        STACK[1] = ids.length - 1;\n        STACK[2] = 0;\n        let sp = 3;\n        const result = [];\n\n        // recursively search for items in range in the kd-sorted arrays\n        while (sp > 0) {\n            const axis = STACK[--sp];\n            const right = STACK[--sp];\n            const left = STACK[--sp];\n\n            // if we reached \"tree node\", search linearly\n            if (right - left <= nodeSize) {\n                for (let i = left; i <= right; i++) {\n                    const x = coords[2 * i];\n                    const y = coords[2 * i + 1];\n                    if (x >= minX && x <= maxX && y >= minY && y <= maxY) result.push(ids[i]);\n                }\n                continue;\n            }\n\n            // otherwise find the middle index\n            const m = (left + right) >> 1;\n\n            // include the middle item if it's in range\n            const x = coords[2 * m];\n            const y = coords[2 * m + 1];\n            if (x >= minX && x <= maxX && y >= minY && y <= maxY) result.push(ids[m]);\n\n            // queue search in halves that intersect the query\n            if (axis === 0 ? minX <= x : minY <= y) {\n                STACK[sp++] = left;\n                STACK[sp++] = m - 1;\n                STACK[sp++] = 1 - axis;\n            }\n            if (axis === 0 ? maxX >= x : maxY >= y) {\n                STACK[sp++] = m + 1;\n                STACK[sp++] = right;\n                STACK[sp++] = 1 - axis;\n            }\n        }\n\n        return result;\n    }\n\n    /**\n     * Search the index for items within a given radius.\n     * @param {number} qx\n     * @param {number} qy\n     * @param {number} r Query radius.\n     * @returns {number[]} An array of indices correponding to the found items.\n     */\n    within(qx, qy, r) {\n        const result = /** @type {number[]} */ ([]);\n        this.withinInto(qx, qy, r, result);\n        return result;\n    }\n\n    /**\n     * Search the index for items within a given radius, writing matching ids into `out`\n     * via indexed assignment (`out[i] = id`). Accepts any indexed-writable container —\n     * a typed array sized to the expected upper bound (allocation-free, fast) or a plain\n     * `Array` (which will grow as needed). Returns the number of matches written.\n     * @param {number} qx\n     * @param {number} qy\n     * @param {number} r Query radius.\n     * @param {number[] | TypedArray} out Container to write matching ids into.\n     * @returns {number} The number of matches written to `out`.\n     */\n    withinInto(qx, qy, r, out) {\n        if (!this._finished) throw new Error('Data not yet indexed - call index.finish().');\n\n        const {ids, coords, nodeSize} = this;\n        STACK[0] = 0;\n        STACK[1] = ids.length - 1;\n        STACK[2] = 0;\n        let sp = 3;\n        let count = 0;\n        const r2 = r * r;\n\n        // recursively search for items within radius in the kd-sorted arrays\n        while (sp > 0) {\n            const axis = STACK[--sp];\n            const right = STACK[--sp];\n            const left = STACK[--sp];\n\n            // if we reached \"tree node\", search linearly\n            if (right - left <= nodeSize) {\n                for (let i = left; i <= right; i++) {\n                    if (sqDist(coords[2 * i], coords[2 * i + 1], qx, qy) <= r2) out[count++] = ids[i];\n                }\n                continue;\n            }\n\n            // otherwise find the middle index\n            const m = (left + right) >> 1;\n\n            // include the middle item if it's in range\n            const x = coords[2 * m];\n            const y = coords[2 * m + 1];\n            if (sqDist(x, y, qx, qy) <= r2) out[count++] = ids[m];\n\n            // queue search in halves that intersect the query\n            if (axis === 0 ? qx - r <= x : qy - r <= y) {\n                STACK[sp++] = left;\n                STACK[sp++] = m - 1;\n                STACK[sp++] = 1 - axis;\n            }\n            if (axis === 0 ? qx + r >= x : qy + r >= y) {\n                STACK[sp++] = m + 1;\n                STACK[sp++] = right;\n                STACK[sp++] = 1 - axis;\n            }\n        }\n\n        return count;\n    }\n}\n\n/**\n * @param {Uint16Array | Uint32Array} ids\n * @param {TypedArray} coords\n * @param {number} nodeSize\n * @param {number} left\n * @param {number} right\n * @param {number} axis\n */\nfunction sort(ids, coords, nodeSize, left, right, axis) {\n    if (right - left <= nodeSize) return;\n\n    const m = (left + right) >> 1; // middle index\n\n    // sort ids and coords around the middle index so that the halves lie\n    // either left/right or top/bottom correspondingly (taking turns)\n    select(ids, coords, m, left, right, axis);\n\n    // recursively kd-sort first half and second half on the opposite axis\n    sort(ids, coords, nodeSize, left, m - 1, 1 - axis);\n    sort(ids, coords, nodeSize, m + 1, right, 1 - axis);\n}\n\n/**\n * Custom Floyd-Rivest selection algorithm: sort ids and coords so that\n * [left..k-1] items are smaller than k-th item (on either x or y axis)\n * @param {Uint16Array | Uint32Array} ids\n * @param {TypedArray} coords\n * @param {number} k\n * @param {number} left\n * @param {number} right\n * @param {number} axis\n */\nfunction select(ids, coords, k, left, right, axis) {\n\n    while (right > left) {\n        if (right - left > 600) {\n            const n = right - left + 1;\n            const m = k - left + 1;\n            const z = Math.log(n);\n            const s = 0.5 * Math.exp(2 * z / 3);\n            const sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);\n            const newLeft = Math.max(left, Math.floor(k - m * s / n + sd));\n            const newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));\n            select(ids, coords, k, newLeft, newRight, axis);\n        }\n\n        const t = coords[2 * k + axis];\n        let i = left;\n        let j = right;\n\n        swapItem(ids, coords, left, k);\n        if (coords[2 * right + axis] > t) swapItem(ids, coords, left, right);\n\n        while (i < j) {\n            swapItem(ids, coords, i, j);\n            i++;\n            j--;\n            while (coords[2 * i + axis] < t) i++;\n            while (coords[2 * j + axis] > t) j--;\n        }\n\n        if (coords[2 * left + axis] === t) swapItem(ids, coords, left, j);\n        else {\n            j++;\n            swapItem(ids, coords, j, right);\n        }\n\n        if (j <= k) left = j + 1;\n        if (k <= j) right = j - 1;\n    }\n}\n\n/**\n * @param {Uint16Array | Uint32Array} ids\n * @param {TypedArray} coords\n * @param {number} i\n * @param {number} j\n */\nfunction swapItem(ids, coords, i, j) {\n    swap(ids, i, j);\n    swap(coords, 2 * i, 2 * j);\n    swap(coords, 2 * i + 1, 2 * j + 1);\n}\n\n/**\n * @param {TypedArray} arr\n * @param {number} i\n * @param {number} j\n */\nfunction swap(arr, i, j) {\n    const tmp = arr[i];\n    arr[i] = arr[j];\n    arr[j] = tmp;\n}\n\n/**\n * @param {number} ax\n * @param {number} ay\n * @param {number} bx\n * @param {number} by\n */\nfunction sqDist(ax, ay, bx, by) {\n    const dx = ax - bx;\n    const dy = ay - by;\n    return dx * dx + dy * dy;\n}\n"],"names":["ARRAY_TYPES","VERSION","HEADER_SIZE","STACK","KDBush","data","magic","versionAndType","version","ArrayType","nodeSize","numItems","ArrayBufferType","arrayTypeIndex","coordsByteSize","idsByteSize","padCoords","x","y","index","numAdded","sort","minX","minY","maxX","maxY","ids","coords","sp","result","axis","right","left","i","m","qx","qy","r","out","count","r2","sqDist","select","k","n","z","s","sd","newLeft","newRight","t","j","swapItem","swap","arr","tmp","ax","ay","bx","by","dx","dy"],"mappings":"AACA,MAAMA,IAAc;AAAA,EAChB;AAAA,EAAW;AAAA,EAAY;AAAA,EAAmB;AAAA,EAAY;AAAA,EACtD;AAAA,EAAY;AAAA,EAAa;AAAA,EAAc;AAC3C,GAKMC,IAAU,GACVC,IAAc,GAIdC,IAAQ,IAAI,YAAY,EAAE;AAEhC,MAAqBC,EAAO;AAAA;AAAA;AAAA;AAAA;AAAA,EAMxB,OAAO,KAAKC,GAAM;AAEd,QAAI,CAACA,KAAQA,EAAK,eAAe,UAAaA,EAAK;AAC/C,YAAM,IAAI,MAAM,+DAA+D;AAEnF,UAAM,CAACC,GAAOC,CAAc,IAAI,IAAI,WAAWF,GAAM,GAAG,CAAC;AACzD,QAAIC,MAAU;AACV,YAAM,IAAI,MAAM,gDAAgD;AAEpE,UAAME,IAAUD,KAAkB;AAClC,QAAIC,MAAYP;AACZ,YAAM,IAAI,MAAM,QAAQO,CAAO,wBAAwBP,CAAO,GAAG;AAErE,UAAMQ,IAAYT,EAAYO,IAAiB,EAAI;AACnD,QAAI,CAACE;AACD,YAAM,IAAI,MAAM,0BAA0B;AAE9C,UAAM,CAACC,CAAQ,IAAI,IAAI,YAAYL,GAAM,GAAG,CAAC,GACvC,CAACM,CAAQ,IAAI,IAAI,YAAYN,GAAM,GAAG,CAAC;AAE7C,WAAO,IAAID,EAAOO,GAAUD,GAAUD,GAAW,QAAWJ,CAAI;AAAA,EACpE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,YAAYM,GAAUD,IAAW,IAAID,IAAY,cAAcG,IAAkB,aAAaP,GAAM;AAChG,QAAI,MAAMM,CAAQ,KAAKA,IAAW,SAAS,IAAI,MAAM,8BAA8BA,CAAQ,GAAG;AAE9F,SAAK,WAAW,CAACA,GACjB,KAAK,WAAW,KAAK,IAAI,KAAK,IAAI,CAACD,GAAU,CAAC,GAAG,KAAK,GACtD,KAAK,YAAYD,GACjB,KAAK,iBAAiBE,IAAW,QAAQ,cAAc;AAEvD,UAAME,IAAiBb,EAAY,QAAQ,KAAK,SAAS,GACnDc,IAAiBH,IAAW,IAAI,KAAK,UAAU,mBAC/CI,IAAcJ,IAAW,KAAK,eAAe,mBAC7CK,KAAa,IAAID,IAAc,KAAK;AAE1C,QAAIF,IAAiB;AACjB,YAAM,IAAI,MAAM,iCAAiCJ,CAAS,GAAG;AAGjE,QAAIJ;AACA,WAAK,OAAOA,GAEZ,KAAK,MAAM,IAAI,KAAK,eAAeA,GAAMH,GAAaS,CAAQ,GAE9D,KAAK,SAAS,IAAIF,EAAUJ,GAAMH,IAAca,IAAcC,GAAWL,IAAW,CAAC,GACrF,KAAK,OAAOA,IAAW,GACvB,KAAK,YAAY;AAAA,SAEd;AACH,YAAMN,IAAO,KAAK,OAAO,IAAIO,EAAgBV,IAAcY,IAAiBC,IAAcC,CAAS;AAEnG,WAAK,MAAM,IAAI,KAAK,eAAeX,GAAMH,GAAaS,CAAQ,GAE9D,KAAK,SAAS,IAAIF,EAAUJ,GAAMH,IAAca,IAAcC,GAAWL,IAAW,CAAC,GACrF,KAAK,OAAO,GACZ,KAAK,YAAY,IAGjB,IAAI,WAAWN,GAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAOJ,KAAW,KAAKY,CAAc,CAAC,GACtE,IAAI,YAAYR,GAAM,GAAG,CAAC,EAAE,CAAC,IAAIK,GACjC,IAAI,YAAYL,GAAM,GAAG,CAAC,EAAE,CAAC,IAAIM;AAAA,IACrC;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAIM,GAAGC,GAAG;AACN,UAAMC,IAAQ,KAAK,QAAQ;AAC3B,gBAAK,IAAIA,CAAK,IAAIA,GAClB,KAAK,OAAO,KAAK,MAAM,IAAIF,GAC3B,KAAK,OAAO,KAAK,MAAM,IAAIC,GACpBC;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS;AACL,UAAMC,IAAW,KAAK,QAAQ;AAC9B,QAAIA,MAAa,KAAK;AAClB,YAAM,IAAI,MAAM,SAASA,CAAQ,wBAAwB,KAAK,QAAQ,GAAG;AAG7E,WAAAC,EAAK,KAAK,KAAK,KAAK,QAAQ,KAAK,UAAU,GAAG,KAAK,WAAW,GAAG,CAAC,GAElE,KAAK,YAAY,IACV;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAMC,GAAMC,GAAMC,GAAMC,GAAM;AAC1B,QAAI,CAAC,KAAK,UAAW,OAAM,IAAI,MAAM,6CAA6C;AAElF,UAAM,EAAC,KAAAC,GAAK,QAAAC,GAAQ,UAAAjB,EAAA,IAAY;AAChC,IAAAP,EAAM,CAAC,IAAI,GACXA,EAAM,CAAC,IAAIuB,EAAI,SAAS,GACxBvB,EAAM,CAAC,IAAI;AACX,QAAIyB,IAAK;AACT,UAAMC,IAAS,CAAA;AAGf,WAAOD,IAAK,KAAG;AACX,YAAME,IAAO3B,EAAM,EAAEyB,CAAE,GACjBG,IAAQ5B,EAAM,EAAEyB,CAAE,GAClBI,IAAO7B,EAAM,EAAEyB,CAAE;AAGvB,UAAIG,IAAQC,KAAQtB,GAAU;AAC1B,iBAASuB,IAAID,GAAMC,KAAKF,GAAOE,KAAK;AAChC,gBAAMhB,IAAIU,EAAO,IAAIM,CAAC,GAChBf,IAAIS,EAAO,IAAIM,IAAI,CAAC;AAC1B,UAAIhB,KAAKK,KAAQL,KAAKO,KAAQN,KAAKK,KAAQL,KAAKO,KAAMI,EAAO,KAAKH,EAAIO,CAAC,CAAC;AAAA,QAC5E;AACA;AAAA,MACJ;AAGA,YAAMC,IAAKF,IAAOD,KAAU,GAGtBd,IAAIU,EAAO,IAAIO,CAAC,GAChBhB,IAAIS,EAAO,IAAIO,IAAI,CAAC;AAC1B,MAAIjB,KAAKK,KAAQL,KAAKO,KAAQN,KAAKK,KAAQL,KAAKO,KAAMI,EAAO,KAAKH,EAAIQ,CAAC,CAAC,IAGpEJ,MAAS,IAAIR,KAAQL,IAAIM,KAAQL,OACjCf,EAAMyB,GAAI,IAAII,GACd7B,EAAMyB,GAAI,IAAIM,IAAI,GAClB/B,EAAMyB,GAAI,IAAI,IAAIE,KAElBA,MAAS,IAAIN,KAAQP,IAAIQ,KAAQP,OACjCf,EAAMyB,GAAI,IAAIM,IAAI,GAClB/B,EAAMyB,GAAI,IAAIG,GACd5B,EAAMyB,GAAI,IAAI,IAAIE;AAAA,IAE1B;AAEA,WAAOD;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAOM,GAAIC,GAAIC,GAAG;AACd,UAAMR;AAAA;AAAA,MAAkC,CAAA;AAAA;AACxC,gBAAK,WAAWM,GAAIC,GAAIC,GAAGR,CAAM,GAC1BA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,WAAWM,GAAIC,GAAIC,GAAGC,GAAK;AACvB,QAAI,CAAC,KAAK,UAAW,OAAM,IAAI,MAAM,6CAA6C;AAElF,UAAM,EAAC,KAAAZ,GAAK,QAAAC,GAAQ,UAAAjB,EAAA,IAAY;AAChC,IAAAP,EAAM,CAAC,IAAI,GACXA,EAAM,CAAC,IAAIuB,EAAI,SAAS,GACxBvB,EAAM,CAAC,IAAI;AACX,QAAIyB,IAAK,GACLW,IAAQ;AACZ,UAAMC,IAAKH,IAAIA;AAGf,WAAOT,IAAK,KAAG;AACX,YAAME,IAAO3B,EAAM,EAAEyB,CAAE,GACjBG,IAAQ5B,EAAM,EAAEyB,CAAE,GAClBI,IAAO7B,EAAM,EAAEyB,CAAE;AAGvB,UAAIG,IAAQC,KAAQtB,GAAU;AAC1B,iBAASuB,IAAID,GAAMC,KAAKF,GAAOE;AAC3B,UAAIQ,EAAOd,EAAO,IAAIM,CAAC,GAAGN,EAAO,IAAIM,IAAI,CAAC,GAAGE,GAAIC,CAAE,KAAKI,QAAQD,GAAO,IAAIb,EAAIO,CAAC;AAEpF;AAAA,MACJ;AAGA,YAAMC,IAAKF,IAAOD,KAAU,GAGtBd,IAAIU,EAAO,IAAIO,CAAC,GAChBhB,IAAIS,EAAO,IAAIO,IAAI,CAAC;AAC1B,MAAIO,EAAOxB,GAAGC,GAAGiB,GAAIC,CAAE,KAAKI,MAAIF,EAAIC,GAAO,IAAIb,EAAIQ,CAAC,KAGhDJ,MAAS,IAAIK,IAAKE,KAAKpB,IAAImB,IAAKC,KAAKnB,OACrCf,EAAMyB,GAAI,IAAII,GACd7B,EAAMyB,GAAI,IAAIM,IAAI,GAClB/B,EAAMyB,GAAI,IAAI,IAAIE,KAElBA,MAAS,IAAIK,IAAKE,KAAKpB,IAAImB,IAAKC,KAAKnB,OACrCf,EAAMyB,GAAI,IAAIM,IAAI,GAClB/B,EAAMyB,GAAI,IAAIG,GACd5B,EAAMyB,GAAI,IAAI,IAAIE;AAAA,IAE1B;AAEA,WAAOS;AAAA,EACX;AACJ;AAUA,SAASlB,EAAKK,GAAKC,GAAQjB,GAAUsB,GAAMD,GAAOD,GAAM;AACpD,MAAIC,IAAQC,KAAQtB,EAAU;AAE9B,QAAMwB,IAAKF,IAAOD,KAAU;AAI5B,EAAAW,EAAOhB,GAAKC,GAAQO,GAAGF,GAAMD,GAAOD,CAAI,GAGxCT,EAAKK,GAAKC,GAAQjB,GAAUsB,GAAME,IAAI,GAAG,IAAIJ,CAAI,GACjDT,EAAKK,GAAKC,GAAQjB,GAAUwB,IAAI,GAAGH,GAAO,IAAID,CAAI;AACtD;AAYA,SAASY,EAAOhB,GAAKC,GAAQgB,GAAGX,GAAMD,GAAOD,GAAM;AAE/C,SAAOC,IAAQC,KAAM;AACjB,QAAID,IAAQC,IAAO,KAAK;AACpB,YAAMY,IAAIb,IAAQC,IAAO,GACnBE,IAAIS,IAAIX,IAAO,GACfa,IAAI,KAAK,IAAID,CAAC,GACdE,IAAI,MAAM,KAAK,IAAI,IAAID,IAAI,CAAC,GAC5BE,IAAK,MAAM,KAAK,KAAKF,IAAIC,KAAKF,IAAIE,KAAKF,CAAC,KAAKV,IAAIU,IAAI,IAAI,IAAI,KAAK,IAClEI,IAAU,KAAK,IAAIhB,GAAM,KAAK,MAAMW,IAAIT,IAAIY,IAAIF,IAAIG,CAAE,CAAC,GACvDE,IAAW,KAAK,IAAIlB,GAAO,KAAK,MAAMY,KAAKC,IAAIV,KAAKY,IAAIF,IAAIG,CAAE,CAAC;AACrE,MAAAL,EAAOhB,GAAKC,GAAQgB,GAAGK,GAASC,GAAUnB,CAAI;AAAA,IAClD;AAEA,UAAMoB,IAAIvB,EAAO,IAAIgB,IAAIb,CAAI;AAC7B,QAAIG,IAAID,GACJmB,IAAIpB;AAKR,SAHAqB,EAAS1B,GAAKC,GAAQK,GAAMW,CAAC,GACzBhB,EAAO,IAAII,IAAQD,CAAI,IAAIoB,KAAGE,EAAS1B,GAAKC,GAAQK,GAAMD,CAAK,GAE5DE,IAAIkB,KAAG;AAIV,WAHAC,EAAS1B,GAAKC,GAAQM,GAAGkB,CAAC,GAC1BlB,KACAkB,KACOxB,EAAO,IAAIM,IAAIH,CAAI,IAAIoB,IAAG,CAAAjB;AACjC,aAAON,EAAO,IAAIwB,IAAIrB,CAAI,IAAIoB,IAAG,CAAAC;AAAA,IACrC;AAEA,IAAIxB,EAAO,IAAIK,IAAOF,CAAI,MAAMoB,IAAGE,EAAS1B,GAAKC,GAAQK,GAAMmB,CAAC,KAE5DA,KACAC,EAAS1B,GAAKC,GAAQwB,GAAGpB,CAAK,IAG9BoB,KAAKR,MAAGX,IAAOmB,IAAI,IACnBR,KAAKQ,MAAGpB,IAAQoB,IAAI;AAAA,EAC5B;AACJ;AAQA,SAASC,EAAS1B,GAAKC,GAAQM,GAAGkB,GAAG;AACjC,EAAAE,EAAK3B,GAAKO,GAAGkB,CAAC,GACdE,EAAK1B,GAAQ,IAAIM,GAAG,IAAIkB,CAAC,GACzBE,EAAK1B,GAAQ,IAAIM,IAAI,GAAG,IAAIkB,IAAI,CAAC;AACrC;AAOA,SAASE,EAAKC,GAAKrB,GAAGkB,GAAG;AACrB,QAAMI,IAAMD,EAAIrB,CAAC;AACjB,EAAAqB,EAAIrB,CAAC,IAAIqB,EAAIH,CAAC,GACdG,EAAIH,CAAC,IAAII;AACb;AAQA,SAASd,EAAOe,GAAIC,GAAIC,GAAIC,GAAI;AAC5B,QAAMC,IAAKJ,IAAKE,GACVG,IAAKJ,IAAKE;AAChB,SAAOC,IAAKA,IAAKC,IAAKA;AAC1B;","x_google_ignoreList":[0]}

package/dist/index.es559.js

@@ -0,0 +1,24 @@
+import { epsilon as k, vec as J, estimate as S, resulterrbound as T, splitter as f, sum as K } from "./index.es611.js";
+const U = (3 + 16 * k) * k, V = (2 + 12 * k) * k, W = (9 + 64 * k) * k * k, G = J(4), L = J(8), N = J(12), O = J(16), h = J(4);
+function X(q, z, E, F, j, A, H) {
+  let p, C, m, M, t, n, e, s, r, c, o, i, u, l, a, d, w, b;
+  const _ = q - j, v = E - j, B = z - A, D = F - A;
+  l = _ * D, n = f * _, e = n - (n - _), s = _ - e, n = f * D, r = n - (n - D), c = D - r, a = s * c - (l - e * r - s * r - e * c), d = B * v, n = f * B, e = n - (n - B), s = B - e, n = f * v, r = n - (n - v), c = v - r, w = s * c - (d - e * r - s * r - e * c), o = a - w, t = a - o, G[0] = a - (o + t) + (t - w), i = l + o, t = i - l, u = l - (i - t) + (o - t), o = u - d, t = u - o, G[1] = u - (o + t) + (t - d), b = i + o, t = b - i, G[2] = i - (b - t) + (o - t), G[3] = b;
+  let g = S(4, G), I = V * H;
+  if (g >= I || -g >= I || (t = q - _, p = q - (_ + t) + (t - j), t = E - v, m = E - (v + t) + (t - j), t = z - B, C = z - (B + t) + (t - A), t = F - D, M = F - (D + t) + (t - A), p === 0 && C === 0 && m === 0 && M === 0) || (I = W * H + T * Math.abs(g), g += _ * M + D * p - (B * m + v * C), g >= I || -g >= I)) return g;
+  l = p * D, n = f * p, e = n - (n - p), s = p - e, n = f * D, r = n - (n - D), c = D - r, a = s * c - (l - e * r - s * r - e * c), d = C * v, n = f * C, e = n - (n - C), s = C - e, n = f * v, r = n - (n - v), c = v - r, w = s * c - (d - e * r - s * r - e * c), o = a - w, t = a - o, h[0] = a - (o + t) + (t - w), i = l + o, t = i - l, u = l - (i - t) + (o - t), o = u - d, t = u - o, h[1] = u - (o + t) + (t - d), b = i + o, t = b - i, h[2] = i - (b - t) + (o - t), h[3] = b;
+  const P = K(4, G, 4, h, L);
+  l = _ * M, n = f * _, e = n - (n - _), s = _ - e, n = f * M, r = n - (n - M), c = M - r, a = s * c - (l - e * r - s * r - e * c), d = B * m, n = f * B, e = n - (n - B), s = B - e, n = f * m, r = n - (n - m), c = m - r, w = s * c - (d - e * r - s * r - e * c), o = a - w, t = a - o, h[0] = a - (o + t) + (t - w), i = l + o, t = i - l, u = l - (i - t) + (o - t), o = u - d, t = u - o, h[1] = u - (o + t) + (t - d), b = i + o, t = b - i, h[2] = i - (b - t) + (o - t), h[3] = b;
+  const Q = K(P, L, 4, h, N);
+  l = p * M, n = f * p, e = n - (n - p), s = p - e, n = f * M, r = n - (n - M), c = M - r, a = s * c - (l - e * r - s * r - e * c), d = C * m, n = f * C, e = n - (n - C), s = C - e, n = f * m, r = n - (n - m), c = m - r, w = s * c - (d - e * r - s * r - e * c), o = a - w, t = a - o, h[0] = a - (o + t) + (t - w), i = l + o, t = i - l, u = l - (i - t) + (o - t), o = u - d, t = u - o, h[1] = u - (o + t) + (t - d), b = i + o, t = b - i, h[2] = i - (b - t) + (o - t), h[3] = b;
+  const R = K(Q, N, 4, h, O);
+  return O[R - 1];
+}
+function Z(q, z, E, F, j, A) {
+  const H = (z - A) * (E - j), p = (q - j) * (F - A), C = H - p, m = Math.abs(H + p);
+  return Math.abs(C) >= U * m ? C : -X(q, z, E, F, j, A, m);
+}
+export {
+  Z as orient2d
+};
+//# sourceMappingURL=index.es559.js.map

package/dist/index.es559.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es559.js","sources":["../../../node_modules/@kninnug/constrainautor/node_modules/robust-predicates/esm/orient2d.js"],"sourcesContent":["import {epsilon, splitter, resulterrbound, estimate, vec, sum} from './util.js';\n\nconst ccwerrboundA = (3 + 16 * epsilon) * epsilon;\nconst ccwerrboundB = (2 + 12 * epsilon) * epsilon;\nconst ccwerrboundC = (9 + 64 * epsilon) * epsilon * epsilon;\n\nconst B = vec(4);\nconst C1 = vec(8);\nconst C2 = vec(12);\nconst D = vec(16);\nconst u = vec(4);\n\nfunction orient2dadapt(ax, ay, bx, by, cx, cy, detsum) {\n    let acxtail, acytail, bcxtail, bcytail;\n    let bvirt, c, ahi, alo, bhi, blo, _i, _j, _0, s1, s0, t1, t0, u3;\n\n    const acx = ax - cx;\n    const bcx = bx - cx;\n    const acy = ay - cy;\n    const bcy = by - cy;\n\n    s1 = acx * bcy;\n    c = splitter * acx;\n    ahi = c - (c - acx);\n    alo = acx - ahi;\n    c = splitter * bcy;\n    bhi = c - (c - bcy);\n    blo = bcy - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = acy * bcx;\n    c = splitter * acy;\n    ahi = c - (c - acy);\n    alo = acy - ahi;\n    c = splitter * bcx;\n    bhi = c - (c - bcx);\n    blo = bcx - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    B[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    B[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    B[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    B[3] = u3;\n\n    let det = estimate(4, B);\n    let errbound = ccwerrboundB * detsum;\n    if (det >= errbound || -det >= errbound) {\n        return det;\n    }\n\n    bvirt = ax - acx;\n    acxtail = ax - (acx + bvirt) + (bvirt - cx);\n    bvirt = bx - bcx;\n    bcxtail = bx - (bcx + bvirt) + (bvirt - cx);\n    bvirt = ay - acy;\n    acytail = ay - (acy + bvirt) + (bvirt - cy);\n    bvirt = by - bcy;\n    bcytail = by - (bcy + bvirt) + (bvirt - cy);\n\n    if (acxtail === 0 && acytail === 0 && bcxtail === 0 && bcytail === 0) {\n        return det;\n    }\n\n    errbound = ccwerrboundC * detsum + resulterrbound * Math.abs(det);\n    det += (acx * bcytail + bcy * acxtail) - (acy * bcxtail + bcx * acytail);\n    if (det >= errbound || -det >= errbound) return det;\n\n    s1 = acxtail * bcy;\n    c = splitter * acxtail;\n    ahi = c - (c - acxtail);\n    alo = acxtail - ahi;\n    c = splitter * bcy;\n    bhi = c - (c - bcy);\n    blo = bcy - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = acytail * bcx;\n    c = splitter * acytail;\n    ahi = c - (c - acytail);\n    alo = acytail - ahi;\n    c = splitter * bcx;\n    bhi = c - (c - bcx);\n    blo = bcx - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    u[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    u[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    u[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    u[3] = u3;\n    const C1len = sum(4, B, 4, u, C1);\n\n    s1 = acx * bcytail;\n    c = splitter * acx;\n    ahi = c - (c - acx);\n    alo = acx - ahi;\n    c = splitter * bcytail;\n    bhi = c - (c - bcytail);\n    blo = bcytail - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = acy * bcxtail;\n    c = splitter * acy;\n    ahi = c - (c - acy);\n    alo = acy - ahi;\n    c = splitter * bcxtail;\n    bhi = c - (c - bcxtail);\n    blo = bcxtail - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    u[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    u[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    u[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    u[3] = u3;\n    const C2len = sum(C1len, C1, 4, u, C2);\n\n    s1 = acxtail * bcytail;\n    c = splitter * acxtail;\n    ahi = c - (c - acxtail);\n    alo = acxtail - ahi;\n    c = splitter * bcytail;\n    bhi = c - (c - bcytail);\n    blo = bcytail - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = acytail * bcxtail;\n    c = splitter * acytail;\n    ahi = c - (c - acytail);\n    alo = acytail - ahi;\n    c = splitter * bcxtail;\n    bhi = c - (c - bcxtail);\n    blo = bcxtail - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    u[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    u[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    u[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    u[3] = u3;\n    const Dlen = sum(C2len, C2, 4, u, D);\n\n    return D[Dlen - 1];\n}\n\nexport function orient2d(ax, ay, bx, by, cx, cy) {\n    const detleft = (ay - cy) * (bx - cx);\n    const detright = (ax - cx) * (by - cy);\n    const det = detleft - detright;\n\n    const detsum = Math.abs(detleft + detright);\n    if (Math.abs(det) >= ccwerrboundA * detsum) return det;\n\n    return -orient2dadapt(ax, ay, bx, by, cx, cy, detsum);\n}\n\nexport function orient2dfast(ax, ay, bx, by, cx, cy) {\n    return (ay - cy) * (bx - cx) - (ax - cx) * (by - cy);\n}\n"],"names":["ccwerrboundA","epsilon","ccwerrboundB","ccwerrboundC","B","vec","C1","C2","D","u","orient2dadapt","ax","ay","bx","by","cx","cy","detsum","acxtail","acytail","bcxtail","bcytail","bvirt","c","ahi","alo","bhi","blo","_i","_j","_0","s1","s0","t1","t0","u3","acx","bcx","acy","bcy","splitter","det","estimate","errbound","resulterrbound","C1len","sum","C2len","Dlen","orient2d","detleft","detright"],"mappings":";AAEA,MAAMA,KAAgB,IAAI,KAAKC,KAAWA,GACpCC,KAAgB,IAAI,KAAKD,KAAWA,GACpCE,KAAgB,IAAI,KAAKF,KAAWA,IAAUA,GAE9CG,IAAIC,EAAI,CAAC,GACTC,IAAKD,EAAI,CAAC,GACVE,IAAKF,EAAI,EAAE,GACXG,IAAIH,EAAI,EAAE,GACVI,IAAIJ,EAAI,CAAC;AAEf,SAASK,EAAcC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAQ;AACnD,MAAIC,GAASC,GAASC,GAASC,GAC3BC,GAAOC,GAAGC,GAAKC,GAAKC,GAAKC,GAAKC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC;AAE9D,QAAMC,IAAMzB,IAAKI,GACXsB,IAAMxB,IAAKE,GACXuB,IAAM1B,IAAKI,GACXuB,IAAMzB,IAAKE;AAEjB,EAAAe,IAAKK,IAAMG,GACXhB,IAAIiB,IAAWJ,GACfZ,IAAMD,KAAKA,IAAIa,IACfX,IAAMW,IAAMZ,GACZD,IAAIiB,IAAWD,GACfb,IAAMH,KAAKA,IAAIgB,IACfZ,IAAMY,IAAMb,GACZM,IAAKP,IAAME,KAAOI,IAAKP,IAAME,IAAMD,IAAMC,IAAMF,IAAMG,IACrDM,IAAKK,IAAMD,GACXd,IAAIiB,IAAWF,GACfd,IAAMD,KAAKA,IAAIe,IACfb,IAAMa,IAAMd,GACZD,IAAIiB,IAAWH,GACfX,IAAMH,KAAKA,IAAIc,IACfV,IAAMU,IAAMX,GACZQ,IAAKT,IAAME,KAAOM,IAAKT,IAAME,IAAMD,IAAMC,IAAMF,IAAMG,IACrDC,IAAKI,IAAKE,GACVZ,IAAQU,IAAKJ,GACbxB,EAAE,CAAC,IAAI4B,KAAMJ,IAAKN,MAAUA,IAAQY,IACpCL,IAAKE,IAAKH,GACVN,IAAQO,IAAKE,GACbD,IAAKC,KAAMF,IAAKP,MAAUM,IAAKN,IAC/BM,IAAKE,IAAKG,GACVX,IAAQQ,IAAKF,GACbxB,EAAE,CAAC,IAAI0B,KAAMF,IAAKN,MAAUA,IAAQW,IACpCE,IAAKN,IAAKD,GACVN,IAAQa,IAAKN,GACbzB,EAAE,CAAC,IAAIyB,KAAMM,IAAKb,MAAUM,IAAKN,IACjClB,EAAE,CAAC,IAAI+B;AAEP,MAAIM,IAAMC,EAAS,GAAGtC,CAAC,GACnBuC,IAAWzC,IAAee;AAoB9B,MAnBIwB,KAAOE,KAAY,CAACF,KAAOE,MAI/BrB,IAAQX,IAAKyB,GACblB,IAAUP,KAAMyB,IAAMd,MAAUA,IAAQP,IACxCO,IAAQT,IAAKwB,GACbjB,IAAUP,KAAMwB,IAAMf,MAAUA,IAAQP,IACxCO,IAAQV,IAAK0B,GACbnB,IAAUP,KAAM0B,IAAMhB,MAAUA,IAAQN,IACxCM,IAAQR,IAAKyB,GACblB,IAAUP,KAAMyB,IAAMjB,MAAUA,IAAQN,IAEpCE,MAAY,KAAKC,MAAY,KAAKC,MAAY,KAAKC,MAAY,OAInEsB,IAAWxC,IAAec,IAAS2B,IAAiB,KAAK,IAAIH,CAAG,GAChEA,KAAQL,IAAMf,IAAUkB,IAAMrB,KAAYoB,IAAMlB,IAAUiB,IAAMlB,IAC5DsB,KAAOE,KAAY,CAACF,KAAOE,GAAU,QAAOF;AAEhD,EAAAV,IAAKb,IAAUqB,GACfhB,IAAIiB,IAAWtB,GACfM,IAAMD,KAAKA,IAAIL,IACfO,IAAMP,IAAUM,GAChBD,IAAIiB,IAAWD,GACfb,IAAMH,KAAKA,IAAIgB,IACfZ,IAAMY,IAAMb,GACZM,IAAKP,IAAME,KAAOI,IAAKP,IAAME,IAAMD,IAAMC,IAAMF,IAAMG,IACrDM,IAAKd,IAAUkB,GACfd,IAAIiB,IAAWrB,GACfK,IAAMD,KAAKA,IAAIJ,IACfM,IAAMN,IAAUK,GAChBD,IAAIiB,IAAWH,GACfX,IAAMH,KAAKA,IAAIc,IACfV,IAAMU,IAAMX,GACZQ,IAAKT,IAAME,KAAOM,IAAKT,IAAME,IAAMD,IAAMC,IAAMF,IAAMG,IACrDC,IAAKI,IAAKE,GACVZ,IAAQU,IAAKJ,GACbnB,EAAE,CAAC,IAAIuB,KAAMJ,IAAKN,MAAUA,IAAQY,IACpCL,IAAKE,IAAKH,GACVN,IAAQO,IAAKE,GACbD,IAAKC,KAAMF,IAAKP,MAAUM,IAAKN,IAC/BM,IAAKE,IAAKG,GACVX,IAAQQ,IAAKF,GACbnB,EAAE,CAAC,IAAIqB,KAAMF,IAAKN,MAAUA,IAAQW,IACpCE,IAAKN,IAAKD,GACVN,IAAQa,IAAKN,GACbpB,EAAE,CAAC,IAAIoB,KAAMM,IAAKb,MAAUM,IAAKN,IACjCb,EAAE,CAAC,IAAI0B;AACP,QAAMU,IAAQC,EAAI,GAAG1C,GAAG,GAAGK,GAAGH,CAAE;AAEhC,EAAAyB,IAAKK,IAAMf,GACXE,IAAIiB,IAAWJ,GACfZ,IAAMD,KAAKA,IAAIa,IACfX,IAAMW,IAAMZ,GACZD,IAAIiB,IAAWnB,GACfK,IAAMH,KAAKA,IAAIF,IACfM,IAAMN,IAAUK,GAChBM,IAAKP,IAAME,KAAOI,IAAKP,IAAME,IAAMD,IAAMC,IAAMF,IAAMG,IACrDM,IAAKK,IAAMlB,GACXG,IAAIiB,IAAWF,GACfd,IAAMD,KAAKA,IAAIe,IACfb,IAAMa,IAAMd,GACZD,IAAIiB,IAAWpB,GACfM,IAAMH,KAAKA,IAAIH,IACfO,IAAMP,IAAUM,GAChBQ,IAAKT,IAAME,KAAOM,IAAKT,IAAME,IAAMD,IAAMC,IAAMF,IAAMG,IACrDC,IAAKI,IAAKE,GACVZ,IAAQU,IAAKJ,GACbnB,EAAE,CAAC,IAAIuB,KAAMJ,IAAKN,MAAUA,IAAQY,IACpCL,IAAKE,IAAKH,GACVN,IAAQO,IAAKE,GACbD,IAAKC,KAAMF,IAAKP,MAAUM,IAAKN,IAC/BM,IAAKE,IAAKG,GACVX,IAAQQ,IAAKF,GACbnB,EAAE,CAAC,IAAIqB,KAAMF,IAAKN,MAAUA,IAAQW,IACpCE,IAAKN,IAAKD,GACVN,IAAQa,IAAKN,GACbpB,EAAE,CAAC,IAAIoB,KAAMM,IAAKb,MAAUM,IAAKN,IACjCb,EAAE,CAAC,IAAI0B;AACP,QAAMY,IAAQD,EAAID,GAAOvC,GAAI,GAAGG,GAAGF,CAAE;AAErC,EAAAwB,IAAKb,IAAUG,GACfE,IAAIiB,IAAWtB,GACfM,IAAMD,KAAKA,IAAIL,IACfO,IAAMP,IAAUM,GAChBD,IAAIiB,IAAWnB,GACfK,IAAMH,KAAKA,IAAIF,IACfM,IAAMN,IAAUK,GAChBM,IAAKP,IAAME,KAAOI,IAAKP,IAAME,IAAMD,IAAMC,IAAMF,IAAMG,IACrDM,IAAKd,IAAUC,GACfG,IAAIiB,IAAWrB,GACfK,IAAMD,KAAKA,IAAIJ,IACfM,IAAMN,IAAUK,GAChBD,IAAIiB,IAAWpB,GACfM,IAAMH,KAAKA,IAAIH,IACfO,IAAMP,IAAUM,GAChBQ,IAAKT,IAAME,KAAOM,IAAKT,IAAME,IAAMD,IAAMC,IAAMF,IAAMG,IACrDC,IAAKI,IAAKE,GACVZ,IAAQU,IAAKJ,GACbnB,EAAE,CAAC,IAAIuB,KAAMJ,IAAKN,MAAUA,IAAQY,IACpCL,IAAKE,IAAKH,GACVN,IAAQO,IAAKE,GACbD,IAAKC,KAAMF,IAAKP,MAAUM,IAAKN,IAC/BM,IAAKE,IAAKG,GACVX,IAAQQ,IAAKF,GACbnB,EAAE,CAAC,IAAIqB,KAAMF,IAAKN,MAAUA,IAAQW,IACpCE,IAAKN,IAAKD,GACVN,IAAQa,IAAKN,GACbpB,EAAE,CAAC,IAAIoB,KAAMM,IAAKb,MAAUM,IAAKN,IACjCb,EAAE,CAAC,IAAI0B;AACP,QAAMa,IAAOF,EAAIC,GAAOxC,GAAI,GAAGE,GAAGD,CAAC;AAEnC,SAAOA,EAAEwC,IAAO,CAAC;AACrB;AAEO,SAASC,EAAStC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAI;AAC7C,QAAMkC,KAAWtC,IAAKI,MAAOH,IAAKE,IAC5BoC,KAAYxC,IAAKI,MAAOD,IAAKE,IAC7ByB,IAAMS,IAAUC,GAEhBlC,IAAS,KAAK,IAAIiC,IAAUC,CAAQ;AAC1C,SAAI,KAAK,IAAIV,CAAG,KAAKzC,IAAeiB,IAAewB,IAE5C,CAAC/B,EAAcC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,CAAM;AACxD;","x_google_ignoreList":[0]}

package/dist/index.es56.js

@@ -1,8 +1,8 @@
 import u from "./index.es94.js";
 import l from "./index.es38.js";
 import t from "./index.es161.js";
-import s from "./index.es229.js";
-import d from "./index.es228.js";
+import s from "./index.es246.js";
+import d from "./index.es245.js";
 const k = u(function(f, r, m) {
   var e, n;
   return l(r) ? n = r : (r = d(r), e = r.slice(0, -1), r = r[r.length - 1]), t(f, function(i) {

package/dist/index.es560.js

@@ -0,0 +1,241 @@
+import { vec as G, splitter as M, sum as O, scale as o, estimate as Jt, resulterrbound as Kt, sum_three as Q, epsilon as _t } from "./index.es611.js";
+const Lt = (10 + 96 * _t) * _t, Nt = (4 + 48 * _t) * _t, Ot = (44 + 576 * _t) * _t * _t, st = G(4), ot = G(4), et = G(4), W = G(4), X = G(4), Y = G(4), L = G(4), N = G(4), zt = G(8), Dt = G(8), Et = G(8), Ft = G(8), Gt = G(8), Ht = G(8), kt = G(8), qt = G(8), wt = G(8), rt = G(4), dt = G(4), ut = G(4), f = G(8), m = G(16), E = G(16), F = G(16), D = G(32), it = G(32), H = G(48), P = G(64);
+let At = G(1152), It = G(1152);
+function I(T, $, tt) {
+  T = O(T, At, $, tt, It);
+  const nt = At;
+  return At = It, It = nt, T;
+}
+function Pt(T, $, tt, nt, ht, Mt, R, S, at) {
+  let h, x, y, v, A, j, B, mt, pt, xt, yt, vt, jt, lt, ct, bt, ft, Ct, gt, U, V, t, n, s, e, i, b, c, a, r, l, d, u, p, _;
+  const C = T - R, g = tt - R, k = ht - R, w = $ - S, q = nt - S, z = Mt - S;
+  l = g * z, n = M * g, s = n - (n - g), e = g - s, n = M * z, i = n - (n - z), b = z - i, d = e * b - (l - s * i - e * i - s * b), u = k * q, n = M * k, s = n - (n - k), e = k - s, n = M * q, i = n - (n - q), b = q - i, p = e * b - (u - s * i - e * i - s * b), c = d - p, t = d - c, st[0] = d - (c + t) + (t - p), a = l + c, t = a - l, r = l - (a - t) + (c - t), c = r - u, t = r - c, st[1] = r - (c + t) + (t - u), _ = a + c, t = _ - a, st[2] = a - (_ - t) + (c - t), st[3] = _, l = k * w, n = M * k, s = n - (n - k), e = k - s, n = M * w, i = n - (n - w), b = w - i, d = e * b - (l - s * i - e * i - s * b), u = C * z, n = M * C, s = n - (n - C), e = C - s, n = M * z, i = n - (n - z), b = z - i, p = e * b - (u - s * i - e * i - s * b), c = d - p, t = d - c, ot[0] = d - (c + t) + (t - p), a = l + c, t = a - l, r = l - (a - t) + (c - t), c = r - u, t = r - c, ot[1] = r - (c + t) + (t - u), _ = a + c, t = _ - a, ot[2] = a - (_ - t) + (c - t), ot[3] = _, l = C * q, n = M * C, s = n - (n - C), e = C - s, n = M * q, i = n - (n - q), b = q - i, d = e * b - (l - s * i - e * i - s * b), u = g * w, n = M * g, s = n - (n - g), e = g - s, n = M * w, i = n - (n - w), b = w - i, p = e * b - (u - s * i - e * i - s * b), c = d - p, t = d - c, et[0] = d - (c + t) + (t - p), a = l + c, t = a - l, r = l - (a - t) + (c - t), c = r - u, t = r - c, et[1] = r - (c + t) + (t - u), _ = a + c, t = _ - a, et[2] = a - (_ - t) + (c - t), et[3] = _, h = O(
+    O(
+      O(
+        o(o(4, st, C, f), f, C, m),
+        m,
+        o(o(4, st, w, f), f, w, E),
+        E,
+        D
+      ),
+      D,
+      O(
+        o(o(4, ot, g, f), f, g, m),
+        m,
+        o(o(4, ot, q, f), f, q, E),
+        E,
+        it
+      ),
+      it,
+      P
+    ),
+    P,
+    O(
+      o(o(4, et, k, f), f, k, m),
+      m,
+      o(o(4, et, z, f), f, z, E),
+      E,
+      D
+    ),
+    D,
+    At
+  );
+  let Z = Jt(h, At), Bt = Nt * at;
+  if (Z >= Bt || -Z >= Bt || (t = T - C, x = T - (C + t) + (t - R), t = $ - w, A = $ - (w + t) + (t - S), t = tt - g, y = tt - (g + t) + (t - R), t = nt - q, j = nt - (q + t) + (t - S), t = ht - k, v = ht - (k + t) + (t - R), t = Mt - z, B = Mt - (z + t) + (t - S), x === 0 && y === 0 && v === 0 && A === 0 && j === 0 && B === 0) || (Bt = Ot * at + Kt * Math.abs(Z), Z += (C * C + w * w) * (g * B + z * y - (q * v + k * j)) + 2 * (C * x + w * A) * (g * z - q * k) + ((g * g + q * q) * (k * A + w * v - (z * x + C * B)) + 2 * (g * y + q * j) * (k * w - z * C)) + ((k * k + z * z) * (C * j + q * x - (w * y + g * A)) + 2 * (k * v + z * B) * (C * q - w * g)), Z >= Bt || -Z >= Bt))
+    return Z;
+  if ((y !== 0 || j !== 0 || v !== 0 || B !== 0) && (l = C * C, n = M * C, s = n - (n - C), e = C - s, d = e * e - (l - s * s - (s + s) * e), u = w * w, n = M * w, s = n - (n - w), e = w - s, p = e * e - (u - s * s - (s + s) * e), c = d + p, t = c - d, W[0] = d - (c - t) + (p - t), a = l + c, t = a - l, r = l - (a - t) + (c - t), c = r + u, t = c - r, W[1] = r - (c - t) + (u - t), _ = a + c, t = _ - a, W[2] = a - (_ - t) + (c - t), W[3] = _), (v !== 0 || B !== 0 || x !== 0 || A !== 0) && (l = g * g, n = M * g, s = n - (n - g), e = g - s, d = e * e - (l - s * s - (s + s) * e), u = q * q, n = M * q, s = n - (n - q), e = q - s, p = e * e - (u - s * s - (s + s) * e), c = d + p, t = c - d, X[0] = d - (c - t) + (p - t), a = l + c, t = a - l, r = l - (a - t) + (c - t), c = r + u, t = c - r, X[1] = r - (c - t) + (u - t), _ = a + c, t = _ - a, X[2] = a - (_ - t) + (c - t), X[3] = _), (x !== 0 || A !== 0 || y !== 0 || j !== 0) && (l = k * k, n = M * k, s = n - (n - k), e = k - s, d = e * e - (l - s * s - (s + s) * e), u = z * z, n = M * z, s = n - (n - z), e = z - s, p = e * e - (u - s * s - (s + s) * e), c = d + p, t = c - d, Y[0] = d - (c - t) + (p - t), a = l + c, t = a - l, r = l - (a - t) + (c - t), c = r + u, t = c - r, Y[1] = r - (c - t) + (u - t), _ = a + c, t = _ - a, Y[2] = a - (_ - t) + (c - t), Y[3] = _), x !== 0 && (mt = o(4, st, x, zt), h = I(h, Q(
+    o(mt, zt, 2 * C, m),
+    m,
+    o(o(4, Y, x, f), f, q, E),
+    E,
+    o(o(4, X, x, f), f, -z, F),
+    F,
+    D,
+    H
+  ), H)), A !== 0 && (pt = o(4, st, A, Dt), h = I(h, Q(
+    o(pt, Dt, 2 * w, m),
+    m,
+    o(o(4, X, A, f), f, k, E),
+    E,
+    o(o(4, Y, A, f), f, -g, F),
+    F,
+    D,
+    H
+  ), H)), y !== 0 && (xt = o(4, ot, y, Et), h = I(h, Q(
+    o(xt, Et, 2 * g, m),
+    m,
+    o(o(4, W, y, f), f, z, E),
+    E,
+    o(o(4, Y, y, f), f, -w, F),
+    F,
+    D,
+    H
+  ), H)), j !== 0 && (yt = o(4, ot, j, Ft), h = I(h, Q(
+    o(yt, Ft, 2 * q, m),
+    m,
+    o(o(4, Y, j, f), f, C, E),
+    E,
+    o(o(4, W, j, f), f, -k, F),
+    F,
+    D,
+    H
+  ), H)), v !== 0 && (vt = o(4, et, v, Gt), h = I(h, Q(
+    o(vt, Gt, 2 * k, m),
+    m,
+    o(o(4, X, v, f), f, w, E),
+    E,
+    o(o(4, W, v, f), f, -q, F),
+    F,
+    D,
+    H
+  ), H)), B !== 0 && (jt = o(4, et, B, Ht), h = I(h, Q(
+    o(jt, Ht, 2 * z, m),
+    m,
+    o(o(4, W, B, f), f, g, E),
+    E,
+    o(o(4, X, B, f), f, -C, F),
+    F,
+    D,
+    H
+  ), H)), x !== 0 || A !== 0) {
+    if (y !== 0 || j !== 0 || v !== 0 || B !== 0 ? (l = y * z, n = M * y, s = n - (n - y), e = y - s, n = M * z, i = n - (n - z), b = z - i, d = e * b - (l - s * i - e * i - s * b), u = g * B, n = M * g, s = n - (n - g), e = g - s, n = M * B, i = n - (n - B), b = B - i, p = e * b - (u - s * i - e * i - s * b), c = d + p, t = c - d, L[0] = d - (c - t) + (p - t), a = l + c, t = a - l, r = l - (a - t) + (c - t), c = r + u, t = c - r, L[1] = r - (c - t) + (u - t), _ = a + c, t = _ - a, L[2] = a - (_ - t) + (c - t), L[3] = _, l = v * -q, n = M * v, s = n - (n - v), e = v - s, n = M * -q, i = n - (n - -q), b = -q - i, d = e * b - (l - s * i - e * i - s * b), u = k * -j, n = M * k, s = n - (n - k), e = k - s, n = M * -j, i = n - (n - -j), b = -j - i, p = e * b - (u - s * i - e * i - s * b), c = d + p, t = c - d, N[0] = d - (c - t) + (p - t), a = l + c, t = a - l, r = l - (a - t) + (c - t), c = r + u, t = c - r, N[1] = r - (c - t) + (u - t), _ = a + c, t = _ - a, N[2] = a - (_ - t) + (c - t), N[3] = _, ct = O(4, L, 4, N, qt), l = y * B, n = M * y, s = n - (n - y), e = y - s, n = M * B, i = n - (n - B), b = B - i, d = e * b - (l - s * i - e * i - s * b), u = v * j, n = M * v, s = n - (n - v), e = v - s, n = M * j, i = n - (n - j), b = j - i, p = e * b - (u - s * i - e * i - s * b), c = d - p, t = d - c, dt[0] = d - (c + t) + (t - p), a = l + c, t = a - l, r = l - (a - t) + (c - t), c = r - u, t = r - c, dt[1] = r - (c + t) + (t - u), _ = a + c, t = _ - a, dt[2] = a - (_ - t) + (c - t), dt[3] = _, Ct = 4) : (qt[0] = 0, ct = 1, dt[0] = 0, Ct = 1), x !== 0) {
+      const J = o(ct, qt, x, F);
+      h = I(h, O(
+        o(mt, zt, x, m),
+        m,
+        o(J, F, 2 * C, D),
+        D,
+        H
+      ), H);
+      const K = o(Ct, dt, x, f);
+      h = I(h, Q(
+        o(K, f, 2 * C, m),
+        m,
+        o(K, f, x, E),
+        E,
+        o(J, F, x, D),
+        D,
+        it,
+        P
+      ), P), j !== 0 && (h = I(h, o(o(4, Y, x, f), f, j, m), m)), B !== 0 && (h = I(h, o(o(4, X, -x, f), f, B, m), m));
+    }
+    if (A !== 0) {
+      const J = o(ct, qt, A, F);
+      h = I(h, O(
+        o(pt, Dt, A, m),
+        m,
+        o(J, F, 2 * w, D),
+        D,
+        H
+      ), H);
+      const K = o(Ct, dt, A, f);
+      h = I(h, Q(
+        o(K, f, 2 * w, m),
+        m,
+        o(K, f, A, E),
+        E,
+        o(J, F, A, D),
+        D,
+        it,
+        P
+      ), P);
+    }
+  }
+  if (y !== 0 || j !== 0) {
+    if (v !== 0 || B !== 0 || x !== 0 || A !== 0 ? (l = v * w, n = M * v, s = n - (n - v), e = v - s, n = M * w, i = n - (n - w), b = w - i, d = e * b - (l - s * i - e * i - s * b), u = k * A, n = M * k, s = n - (n - k), e = k - s, n = M * A, i = n - (n - A), b = A - i, p = e * b - (u - s * i - e * i - s * b), c = d + p, t = c - d, L[0] = d - (c - t) + (p - t), a = l + c, t = a - l, r = l - (a - t) + (c - t), c = r + u, t = c - r, L[1] = r - (c - t) + (u - t), _ = a + c, t = _ - a, L[2] = a - (_ - t) + (c - t), L[3] = _, U = -z, V = -B, l = x * U, n = M * x, s = n - (n - x), e = x - s, n = M * U, i = n - (n - U), b = U - i, d = e * b - (l - s * i - e * i - s * b), u = C * V, n = M * C, s = n - (n - C), e = C - s, n = M * V, i = n - (n - V), b = V - i, p = e * b - (u - s * i - e * i - s * b), c = d + p, t = c - d, N[0] = d - (c - t) + (p - t), a = l + c, t = a - l, r = l - (a - t) + (c - t), c = r + u, t = c - r, N[1] = r - (c - t) + (u - t), _ = a + c, t = _ - a, N[2] = a - (_ - t) + (c - t), N[3] = _, bt = O(4, L, 4, N, wt), l = v * A, n = M * v, s = n - (n - v), e = v - s, n = M * A, i = n - (n - A), b = A - i, d = e * b - (l - s * i - e * i - s * b), u = x * B, n = M * x, s = n - (n - x), e = x - s, n = M * B, i = n - (n - B), b = B - i, p = e * b - (u - s * i - e * i - s * b), c = d - p, t = d - c, ut[0] = d - (c + t) + (t - p), a = l + c, t = a - l, r = l - (a - t) + (c - t), c = r - u, t = r - c, ut[1] = r - (c + t) + (t - u), _ = a + c, t = _ - a, ut[2] = a - (_ - t) + (c - t), ut[3] = _, gt = 4) : (wt[0] = 0, bt = 1, ut[0] = 0, gt = 1), y !== 0) {
+      const J = o(bt, wt, y, F);
+      h = I(h, O(
+        o(xt, Et, y, m),
+        m,
+        o(J, F, 2 * g, D),
+        D,
+        H
+      ), H);
+      const K = o(gt, ut, y, f);
+      h = I(h, Q(
+        o(K, f, 2 * g, m),
+        m,
+        o(K, f, y, E),
+        E,
+        o(J, F, y, D),
+        D,
+        it,
+        P
+      ), P), B !== 0 && (h = I(h, o(o(4, W, y, f), f, B, m), m)), A !== 0 && (h = I(h, o(o(4, Y, -y, f), f, A, m), m));
+    }
+    if (j !== 0) {
+      const J = o(bt, wt, j, F);
+      h = I(h, O(
+        o(yt, Ft, j, m),
+        m,
+        o(J, F, 2 * q, D),
+        D,
+        H
+      ), H);
+      const K = o(gt, ut, j, f);
+      h = I(h, Q(
+        o(K, f, 2 * q, m),
+        m,
+        o(K, f, j, E),
+        E,
+        o(J, F, j, D),
+        D,
+        it,
+        P
+      ), P);
+    }
+  }
+  if (v !== 0 || B !== 0) {
+    if (x !== 0 || A !== 0 || y !== 0 || j !== 0 ? (l = x * q, n = M * x, s = n - (n - x), e = x - s, n = M * q, i = n - (n - q), b = q - i, d = e * b - (l - s * i - e * i - s * b), u = C * j, n = M * C, s = n - (n - C), e = C - s, n = M * j, i = n - (n - j), b = j - i, p = e * b - (u - s * i - e * i - s * b), c = d + p, t = c - d, L[0] = d - (c - t) + (p - t), a = l + c, t = a - l, r = l - (a - t) + (c - t), c = r + u, t = c - r, L[1] = r - (c - t) + (u - t), _ = a + c, t = _ - a, L[2] = a - (_ - t) + (c - t), L[3] = _, U = -w, V = -A, l = y * U, n = M * y, s = n - (n - y), e = y - s, n = M * U, i = n - (n - U), b = U - i, d = e * b - (l - s * i - e * i - s * b), u = g * V, n = M * g, s = n - (n - g), e = g - s, n = M * V, i = n - (n - V), b = V - i, p = e * b - (u - s * i - e * i - s * b), c = d + p, t = c - d, N[0] = d - (c - t) + (p - t), a = l + c, t = a - l, r = l - (a - t) + (c - t), c = r + u, t = c - r, N[1] = r - (c - t) + (u - t), _ = a + c, t = _ - a, N[2] = a - (_ - t) + (c - t), N[3] = _, lt = O(4, L, 4, N, kt), l = x * j, n = M * x, s = n - (n - x), e = x - s, n = M * j, i = n - (n - j), b = j - i, d = e * b - (l - s * i - e * i - s * b), u = y * A, n = M * y, s = n - (n - y), e = y - s, n = M * A, i = n - (n - A), b = A - i, p = e * b - (u - s * i - e * i - s * b), c = d - p, t = d - c, rt[0] = d - (c + t) + (t - p), a = l + c, t = a - l, r = l - (a - t) + (c - t), c = r - u, t = r - c, rt[1] = r - (c + t) + (t - u), _ = a + c, t = _ - a, rt[2] = a - (_ - t) + (c - t), rt[3] = _, ft = 4) : (kt[0] = 0, lt = 1, rt[0] = 0, ft = 1), v !== 0) {
+      const J = o(lt, kt, v, F);
+      h = I(h, O(
+        o(vt, Gt, v, m),
+        m,
+        o(J, F, 2 * k, D),
+        D,
+        H
+      ), H);
+      const K = o(ft, rt, v, f);
+      h = I(h, Q(
+        o(K, f, 2 * k, m),
+        m,
+        o(K, f, v, E),
+        E,
+        o(J, F, v, D),
+        D,
+        it,
+        P
+      ), P), A !== 0 && (h = I(h, o(o(4, X, v, f), f, A, m), m)), j !== 0 && (h = I(h, o(o(4, W, -v, f), f, j, m), m));
+    }
+    if (B !== 0) {
+      const J = o(lt, kt, B, F);
+      h = I(h, O(
+        o(jt, Ht, B, m),
+        m,
+        o(J, F, 2 * z, D),
+        D,
+        H
+      ), H);
+      const K = o(ft, rt, B, f);
+      h = I(h, Q(
+        o(K, f, 2 * z, m),
+        m,
+        o(K, f, B, E),
+        E,
+        o(J, F, B, D),
+        D,
+        it,
+        P
+      ), P);
+    }
+  }
+  return At[h - 1];
+}
+function Rt(T, $, tt, nt, ht, Mt, R, S) {
+  const at = T - R, h = tt - R, x = ht - R, y = $ - S, v = nt - S, A = Mt - S, j = h * A, B = x * v, mt = at * at + y * y, pt = x * y, xt = at * A, yt = h * h + v * v, vt = at * v, jt = h * y, lt = x * x + A * A, ct = mt * (j - B) + yt * (pt - xt) + lt * (vt - jt), bt = (Math.abs(j) + Math.abs(B)) * mt + (Math.abs(pt) + Math.abs(xt)) * yt + (Math.abs(vt) + Math.abs(jt)) * lt, ft = Lt * bt;
+  return ct > ft || -ct > ft ? ct : Pt(T, $, tt, nt, ht, Mt, R, S, bt);
+}
+export {
+  Rt as incircle
+};
+//# sourceMappingURL=index.es560.js.map