@milaboratories/miplots4 1.0.157 → 1.0.159

package/dist/node_modules/.pnpm/debug@2.6.9/node_modules/debug/src/debug.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"debug.js","sources":["../../../../../../../../../node_modules/.pnpm/debug@2.6.9/node_modules/debug/src/debug.js"],"sourcesContent":["\n/**\n * This is the common logic for both the Node.js and web browser\n * implementations of `debug()`.\n *\n * Expose `debug()` as the module.\n */\n\nexports = module.exports = createDebug.debug = createDebug['default'] = createDebug;\nexports.coerce = coerce;\nexports.disable = disable;\nexports.enable = enable;\nexports.enabled = enabled;\nexports.humanize = require('ms');\n\n/**\n * The currently active debug mode names, and names to skip.\n */\n\nexports.names = [];\nexports.skips = [];\n\n/**\n * Map of special \"%n\" handling functions, for the debug \"format\" argument.\n *\n * Valid key names are a single, lower or upper-case letter, i.e. \"n\" and \"N\".\n */\n\nexports.formatters = {};\n\n/**\n * Previous log timestamp.\n */\n\nvar prevTime;\n\n/**\n * Select a color.\n * @param {String} namespace\n * @return {Number}\n * @api private\n */\n\nfunction selectColor(namespace) {\n  var hash = 0, i;\n\n  for (i in namespace) {\n    hash  = ((hash << 5) - hash) + namespace.charCodeAt(i);\n    hash |= 0; // Convert to 32bit integer\n  }\n\n  return exports.colors[Math.abs(hash) % exports.colors.length];\n}\n\n/**\n * Create a debugger with the given `namespace`.\n *\n * @param {String} namespace\n * @return {Function}\n * @api public\n */\n\nfunction createDebug(namespace) {\n\n  function debug() {\n    // disabled?\n    if (!debug.enabled) return;\n\n    var self = debug;\n\n    // set `diff` timestamp\n    var curr = +new Date();\n    var ms = curr - (prevTime || curr);\n    self.diff = ms;\n    self.prev = prevTime;\n    self.curr = curr;\n    prevTime = curr;\n\n    // turn the `arguments` into a proper Array\n    var args = new Array(arguments.length);\n    for (var i = 0; i < args.length; i++) {\n      args[i] = arguments[i];\n    }\n\n    args[0] = exports.coerce(args[0]);\n\n    if ('string' !== typeof args[0]) {\n      // anything else let's inspect with %O\n      args.unshift('%O');\n    }\n\n    // apply any `formatters` transformations\n    var index = 0;\n    args[0] = args[0].replace(/%([a-zA-Z%])/g, function(match, format) {\n      // if we encounter an escaped % then don't increase the array index\n      if (match === '%%') return match;\n      index++;\n      var formatter = exports.formatters[format];\n      if ('function' === typeof formatter) {\n        var val = args[index];\n        match = formatter.call(self, val);\n\n        // now we need to remove `args[index]` since it's inlined in the `format`\n        args.splice(index, 1);\n        index--;\n      }\n      return match;\n    });\n\n    // apply env-specific formatting (colors, etc.)\n    exports.formatArgs.call(self, args);\n\n    var logFn = debug.log || exports.log || console.log.bind(console);\n    logFn.apply(self, args);\n  }\n\n  debug.namespace = namespace;\n  debug.enabled = exports.enabled(namespace);\n  debug.useColors = exports.useColors();\n  debug.color = selectColor(namespace);\n\n  // env-specific initialization logic for debug instances\n  if ('function' === typeof exports.init) {\n    exports.init(debug);\n  }\n\n  return debug;\n}\n\n/**\n * Enables a debug mode by namespaces. This can include modes\n * separated by a colon and wildcards.\n *\n * @param {String} namespaces\n * @api public\n */\n\nfunction enable(namespaces) {\n  exports.save(namespaces);\n\n  exports.names = [];\n  exports.skips = [];\n\n  var split = (typeof namespaces === 'string' ? namespaces : '').split(/[\\s,]+/);\n  var len = split.length;\n\n  for (var i = 0; i < len; i++) {\n    if (!split[i]) continue; // ignore empty strings\n    namespaces = split[i].replace(/\\*/g, '.*?');\n    if (namespaces[0] === '-') {\n      exports.skips.push(new RegExp('^' + namespaces.substr(1) + '$'));\n    } else {\n      exports.names.push(new RegExp('^' + namespaces + '$'));\n    }\n  }\n}\n\n/**\n * Disable debug output.\n *\n * @api public\n */\n\nfunction disable() {\n  exports.enable('');\n}\n\n/**\n * Returns true if the given mode name is enabled, false otherwise.\n *\n * @param {String} name\n * @return {Boolean}\n * @api public\n */\n\nfunction enabled(name) {\n  var i, len;\n  for (i = 0, len = exports.skips.length; i < len; i++) {\n    if (exports.skips[i].test(name)) {\n      return false;\n    }\n  }\n  for (i = 0, len = exports.names.length; i < len; i++) {\n    if (exports.names[i].test(name)) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/**\n * Coerce `val`.\n *\n * @param {Mixed} val\n * @return {Mixed}\n * @api private\n */\n\nfunction coerce(val) {\n  if (val instanceof Error) return val.stack || val.message;\n  return val;\n}\n"],"names":["exports","module","createDebug","coerce","disable","enable","enabled","require$$0","prevTime","selectColor","namespace","hash","debug","self","curr","ms","args","i","index","match","format","formatter","val","logFn","namespaces","split","len","name"],"mappings":";;;;;AAQA,IAAAA,IAAUC,EAAA,UAAiBC,EAAY,QAAQA,EAAY,UAAaA,GACxEF,EAAA,SAAiBG,GACjBH,EAAA,UAAkBI,GAClBJ,EAAA,SAAiBK,GACjBL,EAAA,UAAkBM,GAClBN,EAAA,WAAmBO,EAAA,GAMnBP,EAAA,QAAgB,CAAA,GAChBA,EAAA,QAAgB,CAAA,GAQhBA,EAAA,aAAqB,CAAA;AAMrB,QAAIQ;AASJ,aAASC,EAAYC,GAAW;AAC9B,UAAIC,IAAO,GAAG;AAEd,WAAK,KAAKD;AACR,QAAAC,KAAUA,KAAQ,KAAKA,IAAQD,EAAU,WAAW,CAAC,GACrDC,KAAQ;AAGV,aAAOX,EAAQ,OAAO,KAAK,IAAIW,CAAI,IAAIX,EAAQ,OAAO,MAAM;AAAA,IAC9D;AAUA,aAASE,EAAYQ,GAAW;AAE9B,eAASE,IAAQ;AAEf,YAAKA,EAAM,SAEX;AAAA,cAAIC,IAAOD,GAGPE,IAAO,CAAC,oBAAI,KAAI,GAChBC,IAAKD,KAAQN,KAAYM;AAC7B,UAAAD,EAAK,OAAOE,GACZF,EAAK,OAAOL,GACZK,EAAK,OAAOC,GACZN,IAAWM;AAIX,mBADIE,IAAO,IAAI,MAAM,UAAU,MAAM,GAC5BC,IAAI,GAAGA,IAAID,EAAK,QAAQC;AAC/B,YAAAD,EAAKC,CAAC,IAAI,UAAUA,CAAC;AAGvB,UAAAD,EAAK,CAAC,IAAIhB,EAAQ,OAAOgB,EAAK,CAAC,CAAC,GAEf,OAAOA,EAAK,CAAC,KAA1B,YAEFA,EAAK,QAAQ,IAAI;AAInB,cAAIE,IAAQ;AACZ,UAAAF,EAAK,CAAC,IAAIA,EAAK,CAAC,EAAE,QAAQ,iBAAiB,SAASG,GAAOC,GAAQ;AAEjE,gBAAID,MAAU,KAAM,QAAOA;AAC3B,YAAAD;AACA,gBAAIG,IAAYrB,EAAQ,WAAWoB,CAAM;AACzC,gBAAmB,OAAOC,KAAtB,YAAiC;AACnC,kBAAIC,IAAMN,EAAKE,CAAK;AACpB,cAAAC,IAAQE,EAAU,KAAKR,GAAMS,CAAG,GAGhCN,EAAK,OAAOE,GAAO,CAAC,GACpBA;AAAA,YACR;AACM,mBAAOC;AAAA,UACb,CAAK,GAGDnB,EAAQ,WAAW,KAAKa,GAAMG,CAAI;AAElC,cAAIO,IAAQX,EAAM,OAAOZ,EAAQ,OAAO,QAAQ,IAAI,KAAK,OAAO;AAChE,UAAAuB,EAAM,MAAMV,GAAMG,CAAI;AAAA;AAAA,MAC1B;AAEE,aAAAJ,EAAM,YAAYF,GAClBE,EAAM,UAAUZ,EAAQ,QAAQU,CAAS,GACzCE,EAAM,YAAYZ,EAAQ,UAAS,GACnCY,EAAM,QAAQH,EAAYC,CAAS,GAGhB,OAAOV,EAAQ,QAA9B,cACFA,EAAQ,KAAKY,CAAK,GAGbA;AAAA,IACT;AAUA,aAASP,EAAOmB,GAAY;AAC1B,MAAAxB,EAAQ,KAAKwB,CAAU,GAEvBxB,UAAgB,CAAA,GAChBA,UAAgB,CAAA;AAKhB,eAHIyB,KAAS,OAAOD,KAAe,WAAWA,IAAa,IAAI,MAAM,QAAQ,GACzEE,IAAMD,EAAM,QAEPR,IAAI,GAAGA,IAAIS,GAAKT;AACvB,QAAKQ,EAAMR,CAAC,MACZO,IAAaC,EAAMR,CAAC,EAAE,QAAQ,OAAO,KAAK,GACtCO,EAAW,CAAC,MAAM,MACpBxB,EAAQ,MAAM,KAAK,IAAI,OAAO,MAAMwB,EAAW,OAAO,CAAC,IAAI,GAAG,CAAC,IAE/DxB,EAAQ,MAAM,KAAK,IAAI,OAAO,MAAMwB,IAAa,GAAG,CAAC;AAAA,IAG3D;AAQA,aAASpB,IAAU;AACjB,MAAAJ,EAAQ,OAAO,EAAE;AAAA,IACnB;AAUA,aAASM,EAAQqB,GAAM;AACrB,UAAIV,GAAGS;AACP,WAAKT,IAAI,GAAGS,IAAM1B,EAAQ,MAAM,QAAQiB,IAAIS,GAAKT;AAC/C,YAAIjB,EAAQ,MAAMiB,CAAC,EAAE,KAAKU,CAAI;AAC5B,iBAAO;AAGX,WAAKV,IAAI,GAAGS,IAAM1B,EAAQ,MAAM,QAAQiB,IAAIS,GAAKT;AAC/C,YAAIjB,EAAQ,MAAMiB,CAAC,EAAE,KAAKU,CAAI;AAC5B,iBAAO;AAGX,aAAO;AAAA,IACT;AAUA,aAASxB,EAAOmB,GAAK;AACnB,aAAIA,aAAe,QAAcA,EAAI,SAASA,EAAI,UAC3CA;AAAA,IACT;AAAA;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/internmap@2.0.3/node_modules/internmap/src/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../node_modules/.pnpm/internmap@2.0.3/node_modules/internmap/src/index.js"],"sourcesContent":["export class InternMap extends Map {\n  constructor(entries, key = keyof) {\n    super();\n    Object.defineProperties(this, {_intern: {value: new Map()}, _key: {value: key}});\n    if (entries != null) for (const [key, value] of entries) this.set(key, value);\n  }\n  get(key) {\n    return super.get(intern_get(this, key));\n  }\n  has(key) {\n    return super.has(intern_get(this, key));\n  }\n  set(key, value) {\n    return super.set(intern_set(this, key), value);\n  }\n  delete(key) {\n    return super.delete(intern_delete(this, key));\n  }\n}\n\nexport class InternSet extends Set {\n  constructor(values, key = keyof) {\n    super();\n    Object.defineProperties(this, {_intern: {value: new Map()}, _key: {value: key}});\n    if (values != null) for (const value of values) this.add(value);\n  }\n  has(value) {\n    return super.has(intern_get(this, value));\n  }\n  add(value) {\n    return super.add(intern_set(this, value));\n  }\n  delete(value) {\n    return super.delete(intern_delete(this, value));\n  }\n}\n\nfunction intern_get({_intern, _key}, value) {\n  const key = _key(value);\n  return _intern.has(key) ? _intern.get(key) : value;\n}\n\nfunction intern_set({_intern, _key}, value) {\n  const key = _key(value);\n  if (_intern.has(key)) return _intern.get(key);\n  _intern.set(key, value);\n  return value;\n}\n\nfunction intern_delete({_intern, _key}, value) {\n  const key = _key(value);\n  if (_intern.has(key)) {\n    value = _intern.get(key);\n    _intern.delete(key);\n  }\n  return value;\n}\n\nfunction keyof(value) {\n  return value !== null && typeof value === \"object\" ? value.valueOf() : value;\n}\n"],"names":["InternMap","entries","key","keyof","value","intern_get","intern_set","intern_delete","_intern","_key"],"mappings":"AAAO,MAAMA,UAAkB,IAAI;AAAA,EACjC,YAAYC,GAASC,IAAMC,GAAO;AAGhC,QAFA,MAAK,GACL,OAAO,iBAAiB,MAAM,EAAC,SAAS,EAAC,OAAO,oBAAI,IAAG,EAAE,GAAG,MAAM,EAAC,OAAOD,EAAG,EAAC,CAAC,GAC3ED,KAAW,KAAM,YAAW,CAACC,GAAKE,CAAK,KAAKH,EAAS,MAAK,IAAIC,GAAKE,CAAK;AAAA,EAC9E;AAAA,EACA,IAAIF,GAAK;AACP,WAAO,MAAM,IAAIG,EAAW,MAAMH,CAAG,CAAC;AAAA,EACxC;AAAA,EACA,IAAIA,GAAK;AACP,WAAO,MAAM,IAAIG,EAAW,MAAMH,CAAG,CAAC;AAAA,EACxC;AAAA,EACA,IAAIA,GAAKE,GAAO;AACd,WAAO,MAAM,IAAIE,EAAW,MAAMJ,CAAG,GAAGE,CAAK;AAAA,EAC/C;AAAA,EACA,OAAOF,GAAK;AACV,WAAO,MAAM,OAAOK,EAAc,MAAML,CAAG,CAAC;AAAA,EAC9C;AACF;AAmBA,SAASG,EAAW,EAAC,SAAAG,GAAS,MAAAC,EAAI,GAAGL,GAAO;AAC1C,QAAMF,IAAMO,EAAKL,CAAK;AACtB,SAAOI,EAAQ,IAAIN,CAAG,IAAIM,EAAQ,IAAIN,CAAG,IAAIE;AAC/C;AAEA,SAASE,EAAW,EAAC,SAAAE,GAAS,MAAAC,EAAI,GAAGL,GAAO;AAC1C,QAAMF,IAAMO,EAAKL,CAAK;AACtB,SAAII,EAAQ,IAAIN,CAAG,IAAUM,EAAQ,IAAIN,CAAG,KAC5CM,EAAQ,IAAIN,GAAKE,CAAK,GACfA;AACT;AAEA,SAASG,EAAc,EAAC,SAAAC,GAAS,MAAAC,EAAI,GAAGL,GAAO;AAC7C,QAAMF,IAAMO,EAAKL,CAAK;AACtB,SAAII,EAAQ,IAAIN,CAAG,MACjBE,IAAQI,EAAQ,IAAIN,CAAG,GACvBM,EAAQ,OAAON,CAAG,IAEbE;AACT;AAEA,SAASD,EAAMC,GAAO;AACpB,SAAOA,MAAU,QAAQ,OAAOA,KAAU,WAAWA,EAAM,QAAO,IAAKA;AACzE;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/kdbush@4.0.2/node_modules/kdbush/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../node_modules/.pnpm/kdbush@4.0.2/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,EAAG,OAAM,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;AAGjE,IAAIJ,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;AAAA,EAE9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAIK,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,UAAAhB,EAAQ,IAAI,MAC1BiB,IAAQ,CAAC,GAAGF,EAAI,SAAS,GAAG,CAAC,GAC7BG,IAAS,CAAA;AAGf,WAAOD,EAAM,UAAQ;AACjB,YAAME,IAAOF,EAAM,IAAG,KAAM,GACtBG,IAAQH,EAAM,IAAG,KAAM,GACvBI,IAAOJ,EAAM,IAAG,KAAM;AAG5B,UAAIG,IAAQC,KAAQrB,GAAU;AAC1B,iBAASsB,IAAID,GAAMC,KAAKF,GAAOE,KAAK;AAChC,gBAAM,IAAIN,EAAO,IAAIM,CAAC,GAChBf,IAAIS,EAAO,IAAIM,IAAI,CAAC;AAC1B,UAAI,KAAKX,KAAQ,KAAKE,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,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;AAAA,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,EAAQ,IAAI,MAC1BiB,IAAQ,CAAC,GAAGF,EAAI,SAAS,GAAG,CAAC,GAC7BG,IAAS,CAAA,GACTS,IAAKD,IAAIA;AAGf,WAAOT,EAAM,UAAQ;AACjB,YAAME,IAAOF,EAAM,IAAG,KAAM,GACtBG,IAAQH,EAAM,IAAG,KAAM,GACvBI,IAAOJ,EAAM,IAAG,KAAM;AAG5B,UAAIG,IAAQC,KAAQrB,GAAU;AAC1B,iBAASsB,IAAID,GAAMC,KAAKF,GAAOE;AAC3B,UAAIM,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;AAC1B,MAAIK,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;AAAA,EACX;AACJ;AAUA,SAASR,EAAKK,GAAKC,GAAQhB,GAAUqB,GAAMD,GAAOD,GAAM;AACpD,MAAIC,IAAQC,KAAQrB,EAAU;AAE9B,QAAMuB,IAAKF,IAAOD,KAAU;AAI5B,EAAAS,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;AACrE,MAAAL,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,IAAG,CAAAf;AACjC,aAAON,EAAO,IAAIsB,IAAInB,CAAI,IAAIkB,IAAG,CAAAC;AAAA,IACrC;AAEA,IAAItB,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;AACjC,EAAAE,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;AACjB,EAAAmB,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]}