@milaboratories/graph-maker 1.1.138 → 1.1.140

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/kdbush/index.js

@@ -0,0 +1,148 @@
+const I = [
+  Int8Array,
+  Uint8Array,
+  Uint8ClampedArray,
+  Int16Array,
+  Uint16Array,
+  Int32Array,
+  Uint32Array,
+  Float32Array,
+  Float64Array
+], m = 1, l = 8;
+class B {
+  /**
+   * Creates an index from raw `ArrayBuffer` data.
+   * @param {ArrayBuffer} data
+   */
+  static from(r) {
+    if (!(r instanceof ArrayBuffer))
+      throw new Error("Data must be an instance of ArrayBuffer.");
+    const [e, t] = new Uint8Array(r, 0, 2);
+    if (e !== 219)
+      throw new Error("Data does not appear to be in a KDBush format.");
+    const s = t >> 4;
+    if (s !== m)
+      throw new Error(`Got v${s} data when expected v${m}.`);
+    const i = I[t & 15];
+    if (!i)
+      throw new Error("Unrecognized array type.");
+    const [h] = new Uint16Array(r, 2, 1), [n] = new Uint32Array(r, 4, 1);
+    return new B(n, h, i, r);
+  }
+  /**
+   * 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 {ArrayBuffer} [data] (For internal use only)
+   */
+  constructor(r, e = 64, t = Float64Array, s) {
+    if (isNaN(r) || r < 0) throw new Error(`Unpexpected numItems value: ${r}.`);
+    this.numItems = +r, this.nodeSize = Math.min(Math.max(+e, 2), 65535), this.ArrayType = t, this.IndexArrayType = r < 65536 ? Uint16Array : Uint32Array;
+    const i = I.indexOf(this.ArrayType), h = r * 2 * this.ArrayType.BYTES_PER_ELEMENT, n = r * this.IndexArrayType.BYTES_PER_ELEMENT, o = (8 - n % 8) % 8;
+    if (i < 0)
+      throw new Error(`Unexpected typed array class: ${t}.`);
+    s && s instanceof ArrayBuffer ? (this.data = s, this.ids = new this.IndexArrayType(this.data, l, r), this.coords = new this.ArrayType(this.data, l + n + o, r * 2), this._pos = r * 2, this._finished = !0) : (this.data = new ArrayBuffer(l + h + n + o), this.ids = new this.IndexArrayType(this.data, l, r), this.coords = new this.ArrayType(this.data, l + n + o, r * 2), this._pos = 0, this._finished = !1, new Uint8Array(this.data, 0, 2).set([219, (m << 4) + i]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = r);
+  }
+  /**
+   * 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(r, e) {
+    const t = this._pos >> 1;
+    return this.ids[t] = t, this.coords[this._pos++] = r, this.coords[this._pos++] = e, t;
+  }
+  /**
+   * Perform indexing of the added points.
+   */
+  finish() {
+    const r = this._pos >> 1;
+    if (r !== this.numItems)
+      throw new Error(`Added ${r} items when expected ${this.numItems}.`);
+    return U(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(r, e, t, s) {
+    if (!this._finished) throw new Error("Data not yet indexed - call index.finish().");
+    const { ids: i, coords: h, nodeSize: n } = this, o = [0, i.length - 1, 0], d = [];
+    for (; o.length; ) {
+      const c = o.pop() || 0, u = o.pop() || 0, p = o.pop() || 0;
+      if (u - p <= n) {
+        for (let y = p; y <= u; y++) {
+          const _ = h[2 * y], T = h[2 * y + 1];
+          _ >= r && _ <= t && T >= e && T <= s && d.push(i[y]);
+        }
+        continue;
+      }
+      const f = p + u >> 1, w = h[2 * f], A = h[2 * f + 1];
+      w >= r && w <= t && A >= e && A <= s && d.push(i[f]), (c === 0 ? r <= w : e <= A) && (o.push(p), o.push(f - 1), o.push(1 - c)), (c === 0 ? t >= w : s >= A) && (o.push(f + 1), o.push(u), o.push(1 - c));
+    }
+    return d;
+  }
+  /**
+   * 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(r, e, t) {
+    if (!this._finished) throw new Error("Data not yet indexed - call index.finish().");
+    const { ids: s, coords: i, nodeSize: h } = this, n = [0, s.length - 1, 0], o = [], d = t * t;
+    for (; n.length; ) {
+      const c = n.pop() || 0, u = n.pop() || 0, p = n.pop() || 0;
+      if (u - p <= h) {
+        for (let y = p; y <= u; y++)
+          M(i[2 * y], i[2 * y + 1], r, e) <= d && o.push(s[y]);
+        continue;
+      }
+      const f = p + u >> 1, w = i[2 * f], A = i[2 * f + 1];
+      M(w, A, r, e) <= d && o.push(s[f]), (c === 0 ? r - t <= w : e - t <= A) && (n.push(p), n.push(f - 1), n.push(1 - c)), (c === 0 ? r + t >= w : e + t >= A) && (n.push(f + 1), n.push(u), n.push(1 - c));
+    }
+    return o;
+  }
+}
+function U(a, r, e, t, s, i) {
+  if (s - t <= e) return;
+  const h = t + s >> 1;
+  g(a, r, h, t, s, i), U(a, r, e, t, h - 1, 1 - i), U(a, r, e, h + 1, s, 1 - i);
+}
+function g(a, r, e, t, s, i) {
+  for (; s > t; ) {
+    if (s - t > 600) {
+      const d = s - t + 1, c = e - t + 1, u = Math.log(d), p = 0.5 * Math.exp(2 * u / 3), f = 0.5 * Math.sqrt(u * p * (d - p) / d) * (c - d / 2 < 0 ? -1 : 1), w = Math.max(t, Math.floor(e - c * p / d + f)), A = Math.min(s, Math.floor(e + (d - c) * p / d + f));
+      g(a, r, e, w, A, i);
+    }
+    const h = r[2 * e + i];
+    let n = t, o = s;
+    for (E(a, r, t, e), r[2 * s + i] > h && E(a, r, t, s); n < o; ) {
+      for (E(a, r, n, o), n++, o--; r[2 * n + i] < h; ) n++;
+      for (; r[2 * o + i] > h; ) o--;
+    }
+    r[2 * t + i] === h ? E(a, r, t, o) : (o++, E(a, r, o, s)), o <= e && (t = o + 1), e <= o && (s = o - 1);
+  }
+}
+function E(a, r, e, t) {
+  x(a, e, t), x(r, 2 * e, 2 * t), x(r, 2 * e + 1, 2 * t + 1);
+}
+function x(a, r, e) {
+  const t = a[r];
+  a[r] = a[e], a[e] = t;
+}
+function M(a, r, e, t) {
+  const s = a - e, i = r - t;
+  return s * s + i * i;
+}
+export {
+  B as default
+};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/kdbush/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../node_modules/@milaboratories/miplots4/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\nconst VERSION = 1; // serialized format version\nconst HEADER_SIZE = 8;\n\nexport default class KDBush {\n\n    /**\n     * Creates an index from raw `ArrayBuffer` data.\n     * @param {ArrayBuffer} data\n     */\n    static from(data) {\n        if (!(data instanceof ArrayBuffer)) {\n            throw new Error('Data must be an instance of ArrayBuffer.');\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, 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 {ArrayBuffer} [data] (For internal use only)\n     */\n    constructor(numItems, nodeSize = 64, ArrayType = Float64Array, data) {\n        if (isNaN(numItems) || numItems < 0) throw new Error(`Unpexpected 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 && (data instanceof ArrayBuffer)) { // reconstruct an index from a buffer\n            this.data = data;\n            this.ids = new this.IndexArrayType(this.data, HEADER_SIZE, numItems);\n            this.coords = new this.ArrayType(this.data, HEADER_SIZE + idsByteSize + padCoords, numItems * 2);\n            this._pos = numItems * 2;\n            this._finished = true;\n        } else { // initialize a new index\n            this.data = new ArrayBuffer(HEADER_SIZE + coordsByteSize + idsByteSize + padCoords);\n            this.ids = new this.IndexArrayType(this.data, HEADER_SIZE, numItems);\n            this.coords = new this.ArrayType(this.data, HEADER_SIZE + idsByteSize + padCoords, numItems * 2);\n            this._pos = 0;\n            this._finished = false;\n\n            // set header\n            new Uint8Array(this.data, 0, 2).set([0xdb, (VERSION << 4) + arrayTypeIndex]);\n            new Uint16Array(this.data, 2, 1)[0] = nodeSize;\n            new Uint32Array(this.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        const stack = [0, ids.length - 1, 0];\n        const result = [];\n\n        // recursively search for items in range in the kd-sorted arrays\n        while (stack.length) {\n            const axis = stack.pop() || 0;\n            const right = stack.pop() || 0;\n            const left = stack.pop() || 0;\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.push(left);\n                stack.push(m - 1);\n                stack.push(1 - axis);\n            }\n            if (axis === 0 ? maxX >= x : maxY >= y) {\n                stack.push(m + 1);\n                stack.push(right);\n                stack.push(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        if (!this._finished) throw new Error('Data not yet indexed - call index.finish().');\n\n        const {ids, coords, nodeSize} = this;\n        const stack = [0, ids.length - 1, 0];\n        const result = [];\n        const r2 = r * r;\n\n        // recursively search for items within radius in the kd-sorted arrays\n        while (stack.length) {\n            const axis = stack.pop() || 0;\n            const right = stack.pop() || 0;\n            const left = stack.pop() || 0;\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) 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 (sqDist(x, y, qx, qy) <= r2) result.push(ids[m]);\n\n            // queue search in halves that intersect the query\n            if (axis === 0 ? qx - r <= x : qy - r <= y) {\n                stack.push(left);\n                stack.push(m - 1);\n                stack.push(1 - axis);\n            }\n            if (axis === 0 ? qx + r >= x : qy + r >= y) {\n                stack.push(m + 1);\n                stack.push(right);\n                stack.push(1 - axis);\n            }\n        }\n\n        return result;\n    }\n}\n\n/**\n * @param {Uint16Array | Uint32Array} ids\n * @param {InstanceType<TypedArrayConstructor>} 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 {InstanceType<TypedArrayConstructor>} 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 {InstanceType<TypedArrayConstructor>} 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 {InstanceType<TypedArrayConstructor>} 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","KDBush","data","magic","versionAndType","version","ArrayType","nodeSize","numItems","arrayTypeIndex","coordsByteSize","idsByteSize","padCoords","x","y","index","numAdded","sort","minX","minY","maxX","maxY","ids","coords","stack","result","axis","right","left","i","m","qx","qy","r","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,GAIMC,IAAU,GACVC,IAAc;AAEL,MAAMC,EAAO;AAAA;AAAA;AAAA;AAAA;AAAA,EAMxB,OAAO,KAAKC,GAAM;AACd,QAAI,EAAEA,aAAgB;AAClB,YAAM,IAAI,MAAM,0CAA0C;AAE9D,UAAM,CAACC,GAAOC,CAAc,IAAI,IAAI,WAAWF,GAAM,GAAG,CAAC;AACzD,QAAIC,MAAU;AACV,YAAM,IAAI,MAAM,gDAAgD;AAEpE,UAAME,IAAUD,KAAkB;AAClC,QAAIC,MAAYN;AACZ,YAAM,IAAI,MAAM,QAAQM,CAAO,wBAAwBN,CAAO,GAAG;AAErE,UAAMO,IAAYR,EAAYM,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,GAAWJ,CAAI;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,YAAYM,GAAUD,IAAW,IAAID,IAAY,cAAcJ,GAAM;AACjE,QAAI,MAAMM,CAAQ,KAAKA,IAAW,SAAS,IAAI,MAAM,+BAA+BA,CAAQ,GAAG;AAE/F,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,UAAMC,IAAiBX,EAAY,QAAQ,KAAK,SAAS,GACnDY,IAAiBF,IAAW,IAAI,KAAK,UAAU,mBAC/CG,IAAcH,IAAW,KAAK,eAAe,mBAC7CI,KAAa,IAAID,IAAc,KAAK;AAE1C,QAAIF,IAAiB;AACjB,YAAM,IAAI,MAAM,iCAAiCH,CAAS,GAAG;AAG7DJ,IAAAA,KAASA,aAAgB,eACzB,KAAK,OAAOA,GACZ,KAAK,MAAM,IAAI,KAAK,eAAe,KAAK,MAAMF,GAAaQ,CAAQ,GACnE,KAAK,SAAS,IAAI,KAAK,UAAU,KAAK,MAAMR,IAAcW,IAAcC,GAAWJ,IAAW,CAAC,GAC/F,KAAK,OAAOA,IAAW,GACvB,KAAK,YAAY,OAEjB,KAAK,OAAO,IAAI,YAAYR,IAAcU,IAAiBC,IAAcC,CAAS,GAClF,KAAK,MAAM,IAAI,KAAK,eAAe,KAAK,MAAMZ,GAAaQ,CAAQ,GACnE,KAAK,SAAS,IAAI,KAAK,UAAU,KAAK,MAAMR,IAAcW,IAAcC,GAAWJ,IAAW,CAAC,GAC/F,KAAK,OAAO,GACZ,KAAK,YAAY,IAGjB,IAAI,WAAW,KAAK,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAOT,KAAW,KAAKU,CAAc,CAAC,GAC3E,IAAI,YAAY,KAAK,MAAM,GAAG,CAAC,EAAE,CAAC,IAAIF,GACtC,IAAI,YAAY,KAAK,MAAM,GAAG,CAAC,EAAE,CAAC,IAAIC;AAAAA,EAE9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAIK,GAAGC,GAAG;AACN,UAAMC,IAAQ,KAAK,QAAQ;AAC3B,WAAA,KAAK,IAAIA,CAAK,IAAIA,GAClB,KAAK,OAAO,KAAK,MAAM,IAAIF,GAC3B,KAAK,OAAO,KAAK,MAAM,IAAIC,GACpBC;AAAAA,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,UAAAhB,MAAY,MAC1BiB,IAAQ,CAAC,GAAGF,EAAI,SAAS,GAAG,CAAC,GAC7BG,IAAS,CAAA;AAGf,WAAOD,EAAM,UAAQ;AACjB,YAAME,IAAOF,EAAM,IAAA,KAAS,GACtBG,IAAQH,EAAM,IAAA,KAAS,GACvBI,IAAOJ,EAAM,SAAS;AAG5B,UAAIG,IAAQC,KAAQrB,GAAU;AAC1B,iBAASsB,IAAID,GAAMC,KAAKF,GAAOE,KAAK;AAChC,gBAAMhB,IAAIU,EAAO,IAAIM,CAAC,GAChBf,IAAIS,EAAO,IAAIM,IAAI,CAAC;AACtB,UAAAhB,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;AACtBjB,MAAAA,KAAKK,KAAQL,KAAKO,KAAQN,KAAKK,KAAQL,KAAKO,KAAMI,EAAO,KAAKH,EAAIQ,CAAC,CAAC,IAGpEJ,MAAS,IAAIR,KAAQL,IAAIM,KAAQL,OACjCU,EAAM,KAAKI,CAAI,GACfJ,EAAM,KAAKM,IAAI,CAAC,GAChBN,EAAM,KAAK,IAAIE,CAAI,KAEnBA,MAAS,IAAIN,KAAQP,IAAIQ,KAAQP,OACjCU,EAAM,KAAKM,IAAI,CAAC,GAChBN,EAAM,KAAKG,CAAK,GAChBH,EAAM,KAAK,IAAIE,CAAI;AAAA,IAE3B;AAEA,WAAOD;AAAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAOM,GAAIC,GAAIC,GAAG;AACd,QAAI,CAAC,KAAK,UAAW,OAAM,IAAI,MAAM,6CAA6C;AAElF,UAAM,EAAC,KAAAX,GAAK,QAAAC,GAAQ,UAAAhB,MAAY,MAC1BiB,IAAQ,CAAC,GAAGF,EAAI,SAAS,GAAG,CAAC,GAC7BG,IAAS,CAAA,GACTS,IAAKD,IAAIA;AAGf,WAAOT,EAAM,UAAQ;AACjB,YAAME,IAAOF,EAAM,IAAA,KAAS,GACtBG,IAAQH,EAAM,IAAA,KAAS,GACvBI,IAAOJ,EAAM,SAAS;AAG5B,UAAIG,IAAQC,KAAQrB,GAAU;AAC1B,iBAASsB,IAAID,GAAMC,KAAKF,GAAOE;AACvBM,UAAAA,EAAOZ,EAAO,IAAIM,CAAC,GAAGN,EAAO,IAAIM,IAAI,CAAC,GAAGE,GAAIC,CAAE,KAAKE,KAAIT,EAAO,KAAKH,EAAIO,CAAC,CAAC;AAElF;AAAA,MACJ;AAGA,YAAMC,IAAKF,IAAOD,KAAU,GAGtBd,IAAIU,EAAO,IAAIO,CAAC,GAChBhB,IAAIS,EAAO,IAAIO,IAAI,CAAC;AACtBK,MAAAA,EAAOtB,GAAGC,GAAGiB,GAAIC,CAAE,KAAKE,KAAIT,EAAO,KAAKH,EAAIQ,CAAC,CAAC,IAG9CJ,MAAS,IAAIK,IAAKE,KAAKpB,IAAImB,IAAKC,KAAKnB,OACrCU,EAAM,KAAKI,CAAI,GACfJ,EAAM,KAAKM,IAAI,CAAC,GAChBN,EAAM,KAAK,IAAIE,CAAI,KAEnBA,MAAS,IAAIK,IAAKE,KAAKpB,IAAImB,IAAKC,KAAKnB,OACrCU,EAAM,KAAKM,IAAI,CAAC,GAChBN,EAAM,KAAKG,CAAK,GAChBH,EAAM,KAAK,IAAIE,CAAI;AAAA,IAE3B;AAEA,WAAOD;AAAAA,EACX;AACJ;AAUA,SAASR,EAAKK,GAAKC,GAAQhB,GAAUqB,GAAMD,GAAOD,GAAM;AACpD,MAAIC,IAAQC,KAAQrB,EAAU;AAE9B,QAAMuB,IAAKF,IAAOD,KAAU;AAI5BS,EAAAA,EAAOd,GAAKC,GAAQO,GAAGF,GAAMD,GAAOD,CAAI,GAGxCT,EAAKK,GAAKC,GAAQhB,GAAUqB,GAAME,IAAI,GAAG,IAAIJ,CAAI,GACjDT,EAAKK,GAAKC,GAAQhB,GAAUuB,IAAI,GAAGH,GAAO,IAAID,CAAI;AACtD;AAYA,SAASU,EAAOd,GAAKC,GAAQc,GAAGT,GAAMD,GAAOD,GAAM;AAE/C,SAAOC,IAAQC,KAAM;AACjB,QAAID,IAAQC,IAAO,KAAK;AACpB,YAAMU,IAAIX,IAAQC,IAAO,GACnBE,IAAIO,IAAIT,IAAO,GACfW,IAAI,KAAK,IAAID,CAAC,GACdE,IAAI,MAAM,KAAK,IAAI,IAAID,IAAI,CAAC,GAC5BE,IAAK,MAAM,KAAK,KAAKF,IAAIC,KAAKF,IAAIE,KAAKF,CAAC,KAAKR,IAAIQ,IAAI,IAAI,IAAI,KAAK,IAClEI,IAAU,KAAK,IAAId,GAAM,KAAK,MAAMS,IAAIP,IAAIU,IAAIF,IAAIG,CAAE,CAAC,GACvDE,IAAW,KAAK,IAAIhB,GAAO,KAAK,MAAMU,KAAKC,IAAIR,KAAKU,IAAIF,IAAIG,CAAE,CAAC;AACrEL,MAAAA,EAAOd,GAAKC,GAAQc,GAAGK,GAASC,GAAUjB,CAAI;AAAA,IAClD;AAEA,UAAMkB,IAAIrB,EAAO,IAAIc,IAAIX,CAAI;AAC7B,QAAIG,IAAID,GACJiB,IAAIlB;AAKR,SAHAmB,EAASxB,GAAKC,GAAQK,GAAMS,CAAC,GACzBd,EAAO,IAAII,IAAQD,CAAI,IAAIkB,KAAGE,EAASxB,GAAKC,GAAQK,GAAMD,CAAK,GAE5DE,IAAIgB,KAAG;AAIV,WAHAC,EAASxB,GAAKC,GAAQM,GAAGgB,CAAC,GAC1BhB,KACAgB,KACOtB,EAAO,IAAIM,IAAIH,CAAI,IAAIkB,IAAGf,CAAAA;AACjC,aAAON,EAAO,IAAIsB,IAAInB,CAAI,IAAIkB,IAAGC,CAAAA;AAAAA,IACrC;AAEItB,IAAAA,EAAO,IAAIK,IAAOF,CAAI,MAAMkB,IAAGE,EAASxB,GAAKC,GAAQK,GAAMiB,CAAC,KAE5DA,KACAC,EAASxB,GAAKC,GAAQsB,GAAGlB,CAAK,IAG9BkB,KAAKR,MAAGT,IAAOiB,IAAI,IACnBR,KAAKQ,MAAGlB,IAAQkB,IAAI;AAAA,EAC5B;AACJ;AAQA,SAASC,EAASxB,GAAKC,GAAQM,GAAGgB,GAAG;AACjCE,EAAAA,EAAKzB,GAAKO,GAAGgB,CAAC,GACdE,EAAKxB,GAAQ,IAAIM,GAAG,IAAIgB,CAAC,GACzBE,EAAKxB,GAAQ,IAAIM,IAAI,GAAG,IAAIgB,IAAI,CAAC;AACrC;AAOA,SAASE,EAAKC,GAAKnB,GAAGgB,GAAG;AACrB,QAAMI,IAAMD,EAAInB,CAAC;AACjBmB,EAAAA,EAAInB,CAAC,IAAImB,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]}