@performant-software/geospatial 3.1.25-beta.1 → 3.1.25-beta.2

package/dist/index.es332.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es332.js","sources":["../../../node_modules/lodash-es/isEqual.js"],"sourcesContent":["import baseIsEqual from './_baseIsEqual.js';\n\n/**\n * Performs a deep comparison between two values to determine if they are\n * equivalent.\n *\n * **Note:** This method supports comparing arrays, array buffers, booleans,\n * date objects, error objects, maps, numbers, `Object` objects, regexes,\n * sets, strings, symbols, and typed arrays. `Object` objects are compared\n * by their own, not inherited, enumerable properties. Functions and DOM\n * nodes are compared by strict equality, i.e. `===`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.isEqual(object, other);\n * // => true\n *\n * object === other;\n * // => false\n */\nfunction isEqual(value, other) {\n  return baseIsEqual(value, other);\n}\n\nexport default isEqual;\n"],"names":["isEqual","value","other","baseIsEqual"],"mappings":";AA8BA,SAASA,EAAQC,GAAOC,GAAO;AAC7B,SAAOC,EAAYF,GAAOC,CAAK;AACjC;","x_google_ignoreList":[0]}

package/dist/index.es333.js

@@ -0,0 +1,69 @@
+import { isEqualArray as m } from "./index.es216.js";
+function p(r, n, a = 0) {
+  if (r <= 0 || n <= 0)
+    throw new Error("Empty ArrayMatrix not supported");
+  const o = new Array(r);
+  for (let s = 0; s < r; s++) {
+    const c = new Array(n);
+    for (let e = 0; e < n; e++)
+      c[e] = a;
+    o[s] = c;
+  }
+  return o;
+}
+function y(r) {
+  return [r.length, r[0].length];
+}
+function v(r) {
+  const n = r.length, a = new Array(n);
+  for (let o = 0; o < n; o++)
+    a[o] = r[o].slice();
+  return a;
+}
+function x(r, n, a, o) {
+  const s = y(o), c = v(r);
+  for (let e = 0; e < s[0]; e++)
+    for (let u = 0; u < s[1]; u++)
+      c[n + e][a + u] = o[e][u];
+  return c;
+}
+function E(r) {
+  const n = r.length, a = r[0].length, o = new Array(a);
+  for (let s = 0; s < a; s++) {
+    const c = new Array(n);
+    for (let e = 0; e < n; e++)
+      c[e] = r[e][s];
+    o[s] = c;
+  }
+  return o;
+}
+function C(r, n = 0) {
+  const a = y(r), o = r.map((t) => t.map((l) => y(l))), s = o.map((t) => t.map((l) => l[0])), c = E(s), e = c[0];
+  if (!c.every((t) => m(t, c[0])))
+    throw new Error("The blocks, by block column, must have the same sequence of rows.");
+  const u = [];
+  let i = 0;
+  e.forEach((t) => {
+    u.push(i), i = i + t;
+  });
+  const h = i, w = o.map((t) => t.map((l) => l[1])), A = w[0];
+  if (!w.every((t) => m(t, A)))
+    throw new Error("The blocks, by block row, must have the same sequence of columns.");
+  i = 0, w[0].forEach((t) => {
+    i = i + t;
+  });
+  let f = p(h, i, n);
+  for (let t = 0; t < a[0]; t++)
+    for (let l = 0; l < a[1]; l++)
+      f = x(f, u[t], u[l], r[t][l]);
+  return f;
+}
+export {
+  y as arrayMatrixSize,
+  p as newArrayMatrix,
+  C as newBlockArrayMatrix,
+  x as pasteArrayMatrix,
+  v as shallowCopyArrayMatrix,
+  E as transposeArrayMatrix
+};
+//# sourceMappingURL=index.es333.js.map

package/dist/index.es333.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es333.js","sources":["../../../node_modules/@allmaps/stdlib/dist/matrix.js"],"sourcesContent":["import { isEqualArray } from './main.js';\n/**\n * Create and fill a ArrayMatrix: an Arrays of Arrays, that can later be loaded as a ml-matrix Matrix\n */\nexport function newArrayMatrix(rows, cols, value = 0) {\n    if (rows <= 0 || cols <= 0) {\n        throw new Error('Empty ArrayMatrix not supported');\n    }\n    const result = new Array(rows);\n    for (let i = 0; i < rows; i++) {\n        const row = new Array(cols);\n        for (let j = 0; j < cols; j++) {\n            row[j] = value;\n        }\n        result[i] = row;\n    }\n    return result;\n}\nexport function arrayMatrixSize(arrayMatrix) {\n    return [arrayMatrix.length, arrayMatrix[0].length];\n}\nexport function arrayMatrixSizeSafer(arrayMatrix) {\n    if (arrayMatrix.length === 0) {\n        throw new Error('ArrayMatrix may not be empty, but rows are empty');\n    }\n    const rowLengths = arrayMatrix.map((row) => row.length);\n    if (rowLengths.some((rowLength) => rowLength === 0)) {\n        throw new Error('ArrayMatrix may not be empty, but at least one row is empty');\n    }\n    if (!rowLengths.every((rowLength) => rowLength === rowLengths[0])) {\n        throw new Error('Rows of unequal length');\n    }\n    const rows = arrayMatrix.length;\n    const cols = rowLengths[0];\n    return [rows, cols];\n}\nexport function shallowCopyArrayMatrix(arrayMatrix) {\n    const rows = arrayMatrix.length;\n    const result = new Array(rows);\n    for (let i = 0; i < rows; i++) {\n        result[i] = arrayMatrix[i].slice();\n    }\n    return result;\n}\n// Slice specific rows and columns of an arrayMatrix.\n// Just like slice, this returns a copy!\nexport function sliceArrayMatrix(arrayMatrix, rowsStart, colsStart, rowsEnd, colsEnd) {\n    return arrayMatrix\n        .slice(rowsStart, rowsEnd)\n        .map((row) => row.slice(colsStart, colsEnd));\n}\n// Get a submatrix at specified rows and columns.\n// This is more flexible the the range, like in sliceArrayMatrix.\nexport function subArrayMatrix(arrayMatrix, rows, cols) {\n    const size = [rows.length, cols.length];\n    const result = newArrayMatrix(...size);\n    for (let i = 0; i < size[0]; i++) {\n        for (let j = 0; j < size[1]; j++) {\n            result[i][j] = arrayMatrix[rows[i]][cols[j]];\n        }\n    }\n    return result;\n}\n// Pointwise multiplication. For Matrix multiplication, see ml-matrix\nexport function multiplyArrayMatrix(arrayMatrix, factor) {\n    const size = arrayMatrixSize(arrayMatrix);\n    const result = newArrayMatrix(...size);\n    for (let i = 0; i < size[0]; i++) {\n        for (let j = 0; j < size[1]; j++) {\n            result[i][j] = factor * arrayMatrix[i][j];\n        }\n    }\n    return result;\n}\n// Pastes a arrayMatrix inside an arrayMatrix at a specific location.\n// Returns a copy with the pasted subArray.\nexport function pasteArrayMatrix(arrayMatrix, rowsStart, colsStart, subArrayMatrix) {\n    const subSize = arrayMatrixSize(subArrayMatrix);\n    const result = shallowCopyArrayMatrix(arrayMatrix);\n    for (let i = 0; i < subSize[0]; i++) {\n        for (let j = 0; j < subSize[1]; j++) {\n            result[rowsStart + i][colsStart + j] = subArrayMatrix[i][j];\n        }\n    }\n    return result;\n}\nexport function transposeArrayMatrix(arrayMatrix) {\n    const rows = arrayMatrix.length;\n    const cols = arrayMatrix[0].length;\n    const result = new Array(cols);\n    for (let j = 0; j < cols; j++) {\n        const newRow = new Array(rows);\n        for (let i = 0; i < rows; i++) {\n            newRow[i] = arrayMatrix[i][j];\n        }\n        result[j] = newRow;\n    }\n    return result;\n}\nexport function newBlockArrayMatrix(blocks, emptyValue = 0) {\n    const size = arrayMatrixSize(blocks);\n    const sizesArrayMatrix = blocks.map((row) => row.map((block) => arrayMatrixSize(block)));\n    const rowsArrayMatrix = sizesArrayMatrix.map((row) => row.map((dims) => dims[0]));\n    const transposedRowsArrayMatrix = transposeArrayMatrix(rowsArrayMatrix);\n    const rowsArray = transposedRowsArrayMatrix[0];\n    if (!transposedRowsArrayMatrix.every((array) => isEqualArray(array, transposedRowsArrayMatrix[0]))) {\n        throw new Error('The blocks, by block column, must have the same sequence of rows.');\n    }\n    const rowsTrailingCumulativeArray = [];\n    let sum = 0;\n    rowsArray.forEach((e) => {\n        rowsTrailingCumulativeArray.push(sum);\n        sum = sum + e;\n    });\n    const rowsCumulative = sum;\n    const colsArrayMatrix = sizesArrayMatrix.map((row) => row.map((dims) => dims[1]));\n    const colsArray = colsArrayMatrix[0];\n    if (!colsArrayMatrix.every((array) => isEqualArray(array, colsArray))) {\n        throw new Error('The blocks, by block row, must have the same sequence of columns.');\n    }\n    const colsTrailingCumulativeArray = [];\n    sum = 0;\n    colsArrayMatrix[0].forEach((e) => {\n        colsTrailingCumulativeArray.push(sum);\n        sum = sum + e;\n    });\n    const colsCumulative = sum;\n    let result = newArrayMatrix(rowsCumulative, colsCumulative, emptyValue);\n    for (let i = 0; i < size[0]; i++) {\n        for (let j = 0; j < size[1]; j++) {\n            result = pasteArrayMatrix(result, rowsTrailingCumulativeArray[i], rowsTrailingCumulativeArray[j], blocks[i][j]);\n        }\n    }\n    return result;\n}\n"],"names":["newArrayMatrix","rows","cols","value","result","i","row","j","arrayMatrixSize","arrayMatrix","shallowCopyArrayMatrix","pasteArrayMatrix","rowsStart","colsStart","subArrayMatrix","subSize","transposeArrayMatrix","newRow","newBlockArrayMatrix","blocks","emptyValue","size","sizesArrayMatrix","block","rowsArrayMatrix","dims","transposedRowsArrayMatrix","rowsArray","array","isEqualArray","rowsTrailingCumulativeArray","sum","e","rowsCumulative","colsArrayMatrix","colsArray"],"mappings":";AAIO,SAASA,EAAeC,GAAMC,GAAMC,IAAQ,GAAG;AAClD,MAAIF,KAAQ,KAAKC,KAAQ;AACrB,UAAM,IAAI,MAAM,iCAAiC;AAErD,QAAME,IAAS,IAAI,MAAMH,CAAI;AAC7B,WAASI,IAAI,GAAGA,IAAIJ,GAAMI,KAAK;AAC3B,UAAMC,IAAM,IAAI,MAAMJ,CAAI;AAC1B,aAASK,IAAI,GAAGA,IAAIL,GAAMK;AACtB,MAAAD,EAAIC,CAAC,IAAIJ;AAEb,IAAAC,EAAOC,CAAC,IAAIC;AAAA,EAChB;AACA,SAAOF;AACX;AACO,SAASI,EAAgBC,GAAa;AACzC,SAAO,CAACA,EAAY,QAAQA,EAAY,CAAC,EAAE,MAAM;AACrD;AAgBO,SAASC,EAAuBD,GAAa;AAChD,QAAMR,IAAOQ,EAAY,QACnBL,IAAS,IAAI,MAAMH,CAAI;AAC7B,WAASI,IAAI,GAAGA,IAAIJ,GAAMI;AACtB,IAAAD,EAAOC,CAAC,IAAII,EAAYJ,CAAC,EAAE,MAAA;AAE/B,SAAOD;AACX;AAiCO,SAASO,EAAiBF,GAAaG,GAAWC,GAAWC,GAAgB;AAChF,QAAMC,IAAUP,EAAgBM,CAAc,GACxCV,IAASM,EAAuBD,CAAW;AACjD,WAASJ,IAAI,GAAGA,IAAIU,EAAQ,CAAC,GAAGV;AAC5B,aAASE,IAAI,GAAGA,IAAIQ,EAAQ,CAAC,GAAGR;AAC5B,MAAAH,EAAOQ,IAAYP,CAAC,EAAEQ,IAAYN,CAAC,IAAIO,EAAeT,CAAC,EAAEE,CAAC;AAGlE,SAAOH;AACX;AACO,SAASY,EAAqBP,GAAa;AAC9C,QAAMR,IAAOQ,EAAY,QACnBP,IAAOO,EAAY,CAAC,EAAE,QACtBL,IAAS,IAAI,MAAMF,CAAI;AAC7B,WAASK,IAAI,GAAGA,IAAIL,GAAMK,KAAK;AAC3B,UAAMU,IAAS,IAAI,MAAMhB,CAAI;AAC7B,aAASI,IAAI,GAAGA,IAAIJ,GAAMI;AACtB,MAAAY,EAAOZ,CAAC,IAAII,EAAYJ,CAAC,EAAEE,CAAC;AAEhC,IAAAH,EAAOG,CAAC,IAAIU;AAAA,EAChB;AACA,SAAOb;AACX;AACO,SAASc,EAAoBC,GAAQC,IAAa,GAAG;AACxD,QAAMC,IAAOb,EAAgBW,CAAM,GAC7BG,IAAmBH,EAAO,IAAI,CAACb,MAAQA,EAAI,IAAI,CAACiB,MAAUf,EAAgBe,CAAK,CAAC,CAAC,GACjFC,IAAkBF,EAAiB,IAAI,CAAChB,MAAQA,EAAI,IAAI,CAACmB,MAASA,EAAK,CAAC,CAAC,CAAC,GAC1EC,IAA4BV,EAAqBQ,CAAe,GAChEG,IAAYD,EAA0B,CAAC;AAC7C,MAAI,CAACA,EAA0B,MAAM,CAACE,MAAUC,EAAaD,GAAOF,EAA0B,CAAC,CAAC,CAAC;AAC7F,UAAM,IAAI,MAAM,mEAAmE;AAEvF,QAAMI,IAA8B,CAAA;AACpC,MAAIC,IAAM;AACV,EAAAJ,EAAU,QAAQ,CAACK,MAAM;AACrB,IAAAF,EAA4B,KAAKC,CAAG,GACpCA,IAAMA,IAAMC;AAAA,EAChB,CAAC;AACD,QAAMC,IAAiBF,GACjBG,IAAkBZ,EAAiB,IAAI,CAAChB,MAAQA,EAAI,IAAI,CAACmB,MAASA,EAAK,CAAC,CAAC,CAAC,GAC1EU,IAAYD,EAAgB,CAAC;AACnC,MAAI,CAACA,EAAgB,MAAM,CAACN,MAAUC,EAAaD,GAAOO,CAAS,CAAC;AAChE,UAAM,IAAI,MAAM,mEAAmE;AAGvF,EAAAJ,IAAM,GACNG,EAAgB,CAAC,EAAE,QAAQ,CAACF,MAAM;AAE9B,IAAAD,IAAMA,IAAMC;AAAA,EAChB,CAAC;AAED,MAAI5B,IAASJ,EAAeiC,GADLF,GACqCX,CAAU;AACtE,WAASf,IAAI,GAAGA,IAAIgB,EAAK,CAAC,GAAGhB;AACzB,aAASE,IAAI,GAAGA,IAAIc,EAAK,CAAC,GAAGd;AACzB,MAAAH,IAASO,EAAiBP,GAAQ0B,EAA4BzB,CAAC,GAAGyB,EAA4BvB,CAAC,GAAGY,EAAOd,CAAC,EAAEE,CAAC,CAAC;AAGtH,SAAOH;AACX;","x_google_ignoreList":[0]}

package/dist/index.es334.js

@@ -0,0 +1,164 @@
+import { parse as u } from "./index.es335.js";
+function p(t) {
+  return t.type === "circle";
+}
+function a(t) {
+  return t.type === "line";
+}
+function f(t) {
+  return t.type === "polyline";
+}
+function d(t) {
+  return t.type === "rect";
+}
+function y(t) {
+  return t.type === "polygon";
+}
+function* x(t) {
+  function* n(r) {
+    if ("children" in r)
+      for (const e of r.children)
+        typeof e != "string" && (yield* n(e));
+    yield r;
+  }
+  const o = u(t);
+  for (const r of n(o))
+    if ("tagName" in r && r.tagName !== "svg" && r.tagName !== "g") {
+      const e = S(r);
+      e && (yield e);
+    }
+}
+function S(t) {
+  const n = t?.tagName?.toLowerCase();
+  if (n === "circle")
+    return {
+      type: "circle",
+      coordinates: [
+        i(t, "cx"),
+        i(t, "cy")
+      ]
+    };
+  if (n === "line")
+    return {
+      type: "line",
+      coordinates: [
+        [i(t, "x1"), i(t, "y1")],
+        [i(t, "x2"), i(t, "y2")]
+      ]
+    };
+  if (n === "polyline")
+    return {
+      type: "polyline",
+      coordinates: c(t)
+    };
+  if (n === "polygon")
+    return {
+      type: "polygon",
+      coordinates: c(t)
+    };
+  if (n === "rect")
+    return {
+      type: "rect",
+      coordinates: [
+        [i(t, "x"), i(t, "y")],
+        [
+          i(t, "x") + i(t, "width"),
+          i(t, "y")
+        ],
+        [
+          i(t, "x") + i(t, "width"),
+          i(t, "y") + i(t, "height")
+        ],
+        [
+          i(t, "x"),
+          i(t, "y") + i(t, "height")
+        ],
+        [i(t, "x"), i(t, "y")]
+      ]
+    };
+  throw new Error(`Unsupported SVG element: ${n}`);
+}
+function i(t, n) {
+  const o = t?.properties?.[n];
+  return Number(o) || 0;
+}
+function c(t) {
+  const n = t?.properties?.points;
+  return n ? String(n).trim().split(/\s+/).map((o) => {
+    const r = o.split(",").map((e) => Number(e));
+    return [r[0], r[1]];
+  }) : [];
+}
+function l(t) {
+  return t.map((n) => n.join(",")).join(" ");
+}
+function g(t) {
+  return `<svg xmlns="http://www.w3.org/2000/svg">
+  ${t.map(h).join(`
+`)}
+</svg>`;
+}
+function h(t) {
+  if (t.type === "circle")
+    return s("circle", {
+      ...t.attributes,
+      cx: t.coordinates[0],
+      cy: t.coordinates[1]
+    });
+  if (t.type === "line")
+    return s("line", {
+      ...t.attributes,
+      x1: t.coordinates[0][0],
+      y1: t.coordinates[0][1],
+      x2: t.coordinates[1][0],
+      y2: t.coordinates[1][1]
+    });
+  if (t.type === "polyline")
+    return s("polyline", {
+      ...t.attributes,
+      points: l(t.coordinates)
+    });
+  if (t.type === "polygon")
+    return s("polygon", {
+      ...t.attributes,
+      points: l(t.coordinates)
+    });
+  if (t.type === "rect")
+    return s("rect", {
+      ...t.attributes,
+      x: t.coordinates[0][0],
+      y: t.coordinates[0][1],
+      width: t.coordinates[1][0] - t.coordinates[0][0],
+      height: t.coordinates[2][1] - t.coordinates[0][1]
+    });
+  throw new Error("Unknown SVG element");
+}
+function s(t, n) {
+  const o = Object.entries(n).map(([r, e]) => `${r}="${e}"`);
+  return `<${t} ${o.join(" ")} />`;
+}
+function N(t) {
+  if (p(t))
+    return t.coordinates;
+  if (a(t))
+    return t.coordinates;
+  if (f(t))
+    return t.coordinates;
+  if (d(t))
+    return [t.coordinates];
+  if (y(t))
+    return [t.coordinates];
+  throw new Error("Unsupported SVG geometry");
+}
+export {
+  p as isSvgCircle,
+  a as isSvgLine,
+  f as isSvgPolyLine,
+  y as isSvgPolygon,
+  d as isSvgRect,
+  x as stringToSvgGeometriesGenerator,
+  g as svgGeometriesToSvgString,
+  N as svgGeometryToGeometry,
+  h as svgGeometryToString
+};
+//# sourceMappingURL=index.es334.js.map

package/dist/index.es334.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es334.js","sources":["../../../node_modules/@allmaps/stdlib/dist/svg.js"],"sourcesContent":["/* eslint-disable @typescript-eslint/no-explicit-any */\nimport { parse } from 'svg-parser';\n// Assert\nexport function isSvgCircle(input) {\n    return input.type === 'circle';\n}\nexport function isSvgLine(input) {\n    return input.type === 'line';\n}\nexport function isSvgPolyLine(input) {\n    return input.type === 'polyline';\n}\nexport function isSvgRect(input) {\n    return input.type === 'rect';\n}\nexport function isSvgPolygon(input) {\n    return input.type === 'polygon';\n}\n// Read from string\nexport function* stringToSvgGeometriesGenerator(svg) {\n    function* helper(node) {\n        if ('children' in node) {\n            for (const childNode of node.children) {\n                if (typeof childNode !== 'string') {\n                    yield* helper(childNode);\n                }\n            }\n        }\n        yield node;\n    }\n    const parsedSvg = parse(svg);\n    for (const node of helper(parsedSvg)) {\n        if ('tagName' in node) {\n            if (node.tagName !== 'svg' && node.tagName !== 'g') {\n                const geometry = getNodeSvgGeometry(node);\n                if (geometry) {\n                    yield geometry;\n                }\n            }\n        }\n    }\n}\nfunction getNodeSvgGeometry(node) {\n    const tag = node?.tagName?.toLowerCase();\n    if (tag === 'circle') {\n        return {\n            type: 'circle',\n            coordinates: [\n                getNodeNumberProperty(node, 'cx'),\n                getNodeNumberProperty(node, 'cy')\n            ]\n        };\n    }\n    else if (tag === 'line') {\n        return {\n            type: 'line',\n            coordinates: [\n                [getNodeNumberProperty(node, 'x1'), getNodeNumberProperty(node, 'y1')],\n                [getNodeNumberProperty(node, 'x2'), getNodeNumberProperty(node, 'y2')]\n            ]\n        };\n    }\n    else if (tag === 'polyline') {\n        return {\n            type: 'polyline',\n            coordinates: getNodePoints(node)\n        };\n    }\n    else if (tag === 'polygon') {\n        return {\n            type: 'polygon',\n            coordinates: getNodePoints(node)\n        };\n    }\n    else if (tag === 'rect') {\n        return {\n            type: 'rect',\n            coordinates: [\n                [getNodeNumberProperty(node, 'x'), getNodeNumberProperty(node, 'y')],\n                [\n                    getNodeNumberProperty(node, 'x') +\n                        getNodeNumberProperty(node, 'width'),\n                    getNodeNumberProperty(node, 'y')\n                ],\n                [\n                    getNodeNumberProperty(node, 'x') +\n                        getNodeNumberProperty(node, 'width'),\n                    getNodeNumberProperty(node, 'y') +\n                        getNodeNumberProperty(node, 'height')\n                ],\n                [\n                    getNodeNumberProperty(node, 'x'),\n                    getNodeNumberProperty(node, 'y') +\n                        getNodeNumberProperty(node, 'height')\n                ],\n                [getNodeNumberProperty(node, 'x'), getNodeNumberProperty(node, 'y')]\n            ]\n        };\n    }\n    else {\n        throw new Error(`Unsupported SVG element: ${tag}`);\n    }\n}\nfunction getNodeNumberProperty(node, prop) {\n    const value = node?.properties?.[prop];\n    return Number(value) || 0;\n}\nfunction getNodePoints(node) {\n    const points = node?.properties?.points;\n    if (points) {\n        return String(points)\n            .trim()\n            .split(/\\s+/)\n            .map((coordStr) => {\n            const coord = coordStr.split(',').map((numberStr) => Number(numberStr));\n            return [coord[0], coord[1]];\n        });\n    }\n    return [];\n}\nfunction pointsToString(coordinates) {\n    return coordinates.map((coordinate) => coordinate.join(',')).join(' ');\n}\n// Convert to String\nexport function svgGeometriesToSvgString(geometries) {\n    return `<svg xmlns=\"http://www.w3.org/2000/svg\">\n  ${geometries.map(svgGeometryToString).join('\\n')}\n</svg>`;\n}\nexport function svgGeometryToString(geometry) {\n    if (geometry.type === 'circle') {\n        return elementToString('circle', {\n            ...geometry.attributes,\n            cx: geometry.coordinates[0],\n            cy: geometry.coordinates[1]\n        });\n    }\n    else if (geometry.type === 'line') {\n        return elementToString('line', {\n            ...geometry.attributes,\n            x1: geometry.coordinates[0][0],\n            y1: geometry.coordinates[0][1],\n            x2: geometry.coordinates[1][0],\n            y2: geometry.coordinates[1][1]\n        });\n    }\n    else if (geometry.type === 'polyline') {\n        return elementToString('polyline', {\n            ...geometry.attributes,\n            points: pointsToString(geometry.coordinates)\n        });\n    }\n    else if (geometry.type === 'polygon') {\n        return elementToString('polygon', {\n            ...geometry.attributes,\n            points: pointsToString(geometry.coordinates)\n        });\n    }\n    else if (geometry.type === 'rect') {\n        return elementToString('rect', {\n            ...geometry.attributes,\n            x: geometry.coordinates[0][0],\n            y: geometry.coordinates[0][1],\n            width: geometry.coordinates[1][0] - geometry.coordinates[0][0],\n            height: geometry.coordinates[2][1] - geometry.coordinates[0][1]\n        });\n    }\n    else {\n        throw new Error('Unknown SVG element');\n    }\n}\nfunction elementToString(tag, attributes) {\n    const attributeStrings = Object.entries(attributes).map(([key, value]) => `${key}=\"${value}\"`);\n    return `<${tag} ${attributeStrings.join(' ')} />`;\n}\nexport function mapToResourceMaskSvgPolygon(map) {\n    return {\n        type: 'polygon',\n        attributes: {\n            'data-image-id': encodeURIComponent(map.resource.id)\n        },\n        coordinates: map.resourceMask\n    };\n}\n/**\n * Convert a SVG Geometry to Geometry\n *\n * Note: Multi-geometries are not supported\n *\n * @param svgGeometry - SVG Geometry\n * @returns Geometry\n */\nexport function svgGeometryToGeometry(svgGeometry) {\n    if (isSvgCircle(svgGeometry)) {\n        return svgGeometry.coordinates;\n    }\n    else if (isSvgLine(svgGeometry)) {\n        return svgGeometry.coordinates;\n    }\n    else if (isSvgPolyLine(svgGeometry)) {\n        return svgGeometry.coordinates;\n    }\n    else if (isSvgRect(svgGeometry)) {\n        return [svgGeometry.coordinates];\n    }\n    else if (isSvgPolygon(svgGeometry)) {\n        return [svgGeometry.coordinates];\n    }\n    else {\n        throw new Error(`Unsupported SVG geometry`);\n    }\n}\n"],"names":["isSvgCircle","input","isSvgLine","isSvgPolyLine","isSvgRect","isSvgPolygon","stringToSvgGeometriesGenerator","svg","helper","node","childNode","parsedSvg","parse","geometry","getNodeSvgGeometry","tag","getNodeNumberProperty","getNodePoints","prop","value","points","coordStr","coord","numberStr","pointsToString","coordinates","coordinate","svgGeometriesToSvgString","geometries","svgGeometryToString","elementToString","attributes","attributeStrings","key","svgGeometryToGeometry","svgGeometry"],"mappings":";AAGO,SAASA,EAAYC,GAAO;AAC/B,SAAOA,EAAM,SAAS;AAC1B;AACO,SAASC,EAAUD,GAAO;AAC7B,SAAOA,EAAM,SAAS;AAC1B;AACO,SAASE,EAAcF,GAAO;AACjC,SAAOA,EAAM,SAAS;AAC1B;AACO,SAASG,EAAUH,GAAO;AAC7B,SAAOA,EAAM,SAAS;AAC1B;AACO,SAASI,EAAaJ,GAAO;AAChC,SAAOA,EAAM,SAAS;AAC1B;AAEO,UAAUK,EAA+BC,GAAK;AACjD,YAAUC,EAAOC,GAAM;AACnB,QAAI,cAAcA;AACd,iBAAWC,KAAaD,EAAK;AACzB,QAAI,OAAOC,KAAc,aACrB,OAAOF,EAAOE,CAAS;AAInC,UAAMD;AAAA,EACV;AACA,QAAME,IAAYC,EAAML,CAAG;AAC3B,aAAWE,KAAQD,EAAOG,CAAS;AAC/B,QAAI,aAAaF,KACTA,EAAK,YAAY,SAASA,EAAK,YAAY,KAAK;AAChD,YAAMI,IAAWC,EAAmBL,CAAI;AACxC,MAAII,MACA,MAAMA;AAAA,IAEd;AAGZ;AACA,SAASC,EAAmBL,GAAM;AAC9B,QAAMM,IAAMN,GAAM,SAAS,YAAA;AAC3B,MAAIM,MAAQ;AACR,WAAO;AAAA,MACH,MAAM;AAAA,MACN,aAAa;AAAA,QACTC,EAAsBP,GAAM,IAAI;AAAA,QAChCO,EAAsBP,GAAM,IAAI;AAAA,MAAA;AAAA,IACpC;AAER,MACSM,MAAQ;AACb,WAAO;AAAA,MACH,MAAM;AAAA,MACN,aAAa;AAAA,QACT,CAACC,EAAsBP,GAAM,IAAI,GAAGO,EAAsBP,GAAM,IAAI,CAAC;AAAA,QACrE,CAACO,EAAsBP,GAAM,IAAI,GAAGO,EAAsBP,GAAM,IAAI,CAAC;AAAA,MAAA;AAAA,IACzE;AAER,MACSM,MAAQ;AACb,WAAO;AAAA,MACH,MAAM;AAAA,MACN,aAAaE,EAAcR,CAAI;AAAA,IAAA;AAEvC,MACSM,MAAQ;AACb,WAAO;AAAA,MACH,MAAM;AAAA,MACN,aAAaE,EAAcR,CAAI;AAAA,IAAA;AAEvC,MACSM,MAAQ;AACb,WAAO;AAAA,MACH,MAAM;AAAA,MACN,aAAa;AAAA,QACT,CAACC,EAAsBP,GAAM,GAAG,GAAGO,EAAsBP,GAAM,GAAG,CAAC;AAAA,QACnE;AAAA,UACIO,EAAsBP,GAAM,GAAG,IAC3BO,EAAsBP,GAAM,OAAO;AAAA,UACvCO,EAAsBP,GAAM,GAAG;AAAA,QAAA;AAAA,QAEnC;AAAA,UACIO,EAAsBP,GAAM,GAAG,IAC3BO,EAAsBP,GAAM,OAAO;AAAA,UACvCO,EAAsBP,GAAM,GAAG,IAC3BO,EAAsBP,GAAM,QAAQ;AAAA,QAAA;AAAA,QAE5C;AAAA,UACIO,EAAsBP,GAAM,GAAG;AAAA,UAC/BO,EAAsBP,GAAM,GAAG,IAC3BO,EAAsBP,GAAM,QAAQ;AAAA,QAAA;AAAA,QAE5C,CAACO,EAAsBP,GAAM,GAAG,GAAGO,EAAsBP,GAAM,GAAG,CAAC;AAAA,MAAA;AAAA,IACvE;AAIJ,QAAM,IAAI,MAAM,4BAA4BM,CAAG,EAAE;AAEzD;AACA,SAASC,EAAsBP,GAAMS,GAAM;AACvC,QAAMC,IAAQV,GAAM,aAAaS,CAAI;AACrC,SAAO,OAAOC,CAAK,KAAK;AAC5B;AACA,SAASF,EAAcR,GAAM;AACzB,QAAMW,IAASX,GAAM,YAAY;AACjC,SAAIW,IACO,OAAOA,CAAM,EACf,KAAA,EACA,MAAM,KAAK,EACX,IAAI,CAACC,MAAa;AACnB,UAAMC,IAAQD,EAAS,MAAM,GAAG,EAAE,IAAI,CAACE,MAAc,OAAOA,CAAS,CAAC;AACtE,WAAO,CAACD,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,EAC9B,CAAC,IAEE,CAAA;AACX;AACA,SAASE,EAAeC,GAAa;AACjC,SAAOA,EAAY,IAAI,CAACC,MAAeA,EAAW,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG;AACzE;AAEO,SAASC,EAAyBC,GAAY;AACjD,SAAO;AAAA,IACPA,EAAW,IAAIC,CAAmB,EAAE,KAAK;AAAA,CAAI,CAAC;AAAA;AAElD;AACO,SAASA,EAAoBhB,GAAU;AAC1C,MAAIA,EAAS,SAAS;AAClB,WAAOiB,EAAgB,UAAU;AAAA,MAC7B,GAAGjB,EAAS;AAAA,MACZ,IAAIA,EAAS,YAAY,CAAC;AAAA,MAC1B,IAAIA,EAAS,YAAY,CAAC;AAAA,IAAA,CAC7B;AACL,MACSA,EAAS,SAAS;AACvB,WAAOiB,EAAgB,QAAQ;AAAA,MAC3B,GAAGjB,EAAS;AAAA,MACZ,IAAIA,EAAS,YAAY,CAAC,EAAE,CAAC;AAAA,MAC7B,IAAIA,EAAS,YAAY,CAAC,EAAE,CAAC;AAAA,MAC7B,IAAIA,EAAS,YAAY,CAAC,EAAE,CAAC;AAAA,MAC7B,IAAIA,EAAS,YAAY,CAAC,EAAE,CAAC;AAAA,IAAA,CAChC;AACL,MACSA,EAAS,SAAS;AACvB,WAAOiB,EAAgB,YAAY;AAAA,MAC/B,GAAGjB,EAAS;AAAA,MACZ,QAAQW,EAAeX,EAAS,WAAW;AAAA,IAAA,CAC9C;AACL,MACSA,EAAS,SAAS;AACvB,WAAOiB,EAAgB,WAAW;AAAA,MAC9B,GAAGjB,EAAS;AAAA,MACZ,QAAQW,EAAeX,EAAS,WAAW;AAAA,IAAA,CAC9C;AACL,MACSA,EAAS,SAAS;AACvB,WAAOiB,EAAgB,QAAQ;AAAA,MAC3B,GAAGjB,EAAS;AAAA,MACZ,GAAGA,EAAS,YAAY,CAAC,EAAE,CAAC;AAAA,MAC5B,GAAGA,EAAS,YAAY,CAAC,EAAE,CAAC;AAAA,MAC5B,OAAOA,EAAS,YAAY,CAAC,EAAE,CAAC,IAAIA,EAAS,YAAY,CAAC,EAAE,CAAC;AAAA,MAC7D,QAAQA,EAAS,YAAY,CAAC,EAAE,CAAC,IAAIA,EAAS,YAAY,CAAC,EAAE,CAAC;AAAA,IAAA,CACjE;AAGD,QAAM,IAAI,MAAM,qBAAqB;AAE7C;AACA,SAASiB,EAAgBf,GAAKgB,GAAY;AACtC,QAAMC,IAAmB,OAAO,QAAQD,CAAU,EAAE,IAAI,CAAC,CAACE,GAAKd,CAAK,MAAM,GAAGc,CAAG,KAAKd,CAAK,GAAG;AAC7F,SAAO,IAAIJ,CAAG,IAAIiB,EAAiB,KAAK,GAAG,CAAC;AAChD;AAkBO,SAASE,EAAsBC,GAAa;AAC/C,MAAInC,EAAYmC,CAAW;AACvB,WAAOA,EAAY;AACvB,MACSjC,EAAUiC,CAAW;AAC1B,WAAOA,EAAY;AACvB,MACShC,EAAcgC,CAAW;AAC9B,WAAOA,EAAY;AACvB,MACS/B,EAAU+B,CAAW;AAC1B,WAAO,CAACA,EAAY,WAAW;AACnC,MACS9B,EAAa8B,CAAW;AAC7B,WAAO,CAACA,EAAY,WAAW;AAG/B,QAAM,IAAI,MAAM,0BAA0B;AAElD;","x_google_ignoreList":[0]}

package/dist/index.es335.js

@@ -0,0 +1,142 @@
+function S(e, v) {
+  v === void 0 && (v = {});
+  var l = v.offsetLine || 0, o = v.offsetColumn || 0, d = e.split(`
+`), m = 0, u = d.map(function(r, p) {
+    var f = m + r.length + 1, c = { start: m, end: f, line: p };
+    return m = f, c;
+  }), s = 0;
+  function g(r, p) {
+    return r.start <= p && p < r.end;
+  }
+  function b(r, p) {
+    return { line: l + r.line, column: o + p - r.start, character: p };
+  }
+  function N(r, p) {
+    typeof r == "string" && (r = e.indexOf(r, p || 0));
+    for (var f = u[s], c = r >= f.end ? 1 : -1; f; ) {
+      if (g(f, r))
+        return b(f, r);
+      s += c, f = u[s];
+    }
+  }
+  return N;
+}
+function U(e, v, l) {
+  return S(e, l)(v, l);
+}
+var L = /[a-zA-Z0-9:_-]/, y = /[\s\t\r\n]/, R = /['"]/;
+function T(e, v) {
+  for (var l = ""; v--; )
+    l += e;
+  return l;
+}
+function $(e) {
+  var v = "", l = [], o = s, d = null, m = null;
+  function u(n) {
+    var a = U(e, t), i = a.line, h = a.column, w = e.slice(0, t), A = /(^|\n).*$/.exec(w)[0].replace(/\t/g, "  "), V = e.slice(t), q = /.*(\n|$)/.exec(V)[0], O = "" + A + q + `
+` + T(" ", A.length) + "^";
+    throw new Error(
+      n + " (" + i + ":" + h + `). If this is valid SVG, it's probably a bug in svg-parser. Please raise an issue at https://github.com/Rich-Harris/svg-parser/issues – thanks!
+
+` + O
+    );
+  }
+  function s() {
+    for (; t < e.length && e[t] !== "<" || !L.test(e[t + 1]); )
+      v += e[t++];
+    return g();
+  }
+  function g() {
+    for (var n = ""; t < e.length && e[t] !== "<"; )
+      n += e[t++];
+    return /\S/.test(n) && d.children.push({ type: "text", value: n }), e[t] === "<" ? b : g;
+  }
+  function b() {
+    var n = e[t];
+    if (n === "?")
+      return g;
+    if (n === "!") {
+      if (e.slice(t + 1, t + 3) === "--")
+        return N;
+      if (e.slice(t + 1, t + 8) === "[CDATA[")
+        return r;
+      if (/doctype/i.test(e.slice(t + 1, t + 8)))
+        return g;
+    }
+    if (n === "/")
+      return p;
+    var a = f(), i = {
+      type: "element",
+      tagName: a,
+      properties: {},
+      children: []
+    };
+    d ? d.children.push(i) : m = i;
+    for (var h; t < e.length && (h = c()); )
+      i.properties[h.name] = h.value;
+    var w = !1;
+    return e[t] === "/" && (t += 1, w = !0), e[t] !== ">" && u("Expected >"), w || (d = i, l.push(i)), g;
+  }
+  function N() {
+    var n = e.indexOf("-->", t);
+    return ~n || u("expected -->"), t = n + 2, g;
+  }
+  function r() {
+    var n = e.indexOf("]]>", t);
+    return ~n || u("expected ]]>"), d.children.push(e.slice(t + 7, n)), t = n + 2, g;
+  }
+  function p() {
+    var n = f();
+    return n || u("Expected tag name"), n !== d.tagName && u("Expected closing tag </" + n + "> to match opening tag <" + d.tagName + ">"), x(), e[t] !== ">" && u("Expected >"), l.pop(), d = l[l.length - 1], g;
+  }
+  function f() {
+    for (var n = ""; t < e.length && L.test(e[t]); )
+      n += e[t++];
+    return n;
+  }
+  function c() {
+    if (!y.test(e[t]))
+      return null;
+    x();
+    var n = f();
+    if (!n)
+      return null;
+    var a = !0;
+    return x(), e[t] === "=" && (t += 1, x(), a = C(), !isNaN(a) && a.trim() !== "" && (a = +a)), { name: n, value: a };
+  }
+  function C() {
+    return R.test(e[t]) ? k() : E();
+  }
+  function E() {
+    var n = "";
+    do {
+      var a = e[t];
+      if (a === " " || a === ">" || a === "/")
+        return n;
+      n += a, t += 1;
+    } while (t < e.length);
+    return n;
+  }
+  function k() {
+    for (var n = e[t++], a = "", i = !1; t < e.length; ) {
+      var h = e[t++];
+      if (h === n && !i)
+        return a;
+      h === "\\" && !i && (i = !0), a += i ? "\\" + h : h, i = !1;
+    }
+  }
+  function x() {
+    for (; t < e.length && y.test(e[t]); )
+      t += 1;
+  }
+  for (var t = s.length; t < e.length; )
+    o || u("Unexpected character"), o = o(), t += 1;
+  return o !== g && u("Unexpected end of input"), m.tagName === "svg" && (m.metadata = v), {
+    type: "root",
+    children: [m]
+  };
+}
+export {
+  $ as parse
+};
+//# sourceMappingURL=index.es335.js.map

package/dist/index.es335.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es335.js","sources":["../../../node_modules/svg-parser/dist/svg-parser.esm.js"],"sourcesContent":["function getLocator(source, options) {\n    if (options === void 0) { options = {}; }\n    var offsetLine = options.offsetLine || 0;\n    var offsetColumn = options.offsetColumn || 0;\n    var originalLines = source.split('\\n');\n    var start = 0;\n    var lineRanges = originalLines.map(function (line, i) {\n        var end = start + line.length + 1;\n        var range = { start: start, end: end, line: i };\n        start = end;\n        return range;\n    });\n    var i = 0;\n    function rangeContains(range, index) {\n        return range.start <= index && index < range.end;\n    }\n    function getLocation(range, index) {\n        return { line: offsetLine + range.line, column: offsetColumn + index - range.start, character: index };\n    }\n    function locate(search, startIndex) {\n        if (typeof search === 'string') {\n            search = source.indexOf(search, startIndex || 0);\n        }\n        var range = lineRanges[i];\n        var d = search >= range.end ? 1 : -1;\n        while (range) {\n            if (rangeContains(range, search))\n                return getLocation(range, search);\n            i += d;\n            range = lineRanges[i];\n        }\n    }\n    return locate;\n}\nfunction locate(source, search, options) {\n    if (typeof options === 'number') {\n        throw new Error('locate takes a { startIndex, offsetLine, offsetColumn } object as the third argument');\n    }\n    return getLocator(source, options)(search, options && options.startIndex);\n}\n\nvar validNameCharacters = /[a-zA-Z0-9:_-]/;\nvar whitespace = /[\\s\\t\\r\\n]/;\nvar quotemark = /['\"]/;\n\nfunction repeat(str, i) {\n\tvar result = '';\n\twhile (i--) { result += str; }\n\treturn result;\n}\n\nfunction parse(source) {\n\tvar header = '';\n\tvar stack = [];\n\n\tvar state = metadata;\n\tvar currentElement = null;\n\tvar root = null;\n\n\tfunction error(message) {\n\t\tvar ref = locate(source, i);\n\t\tvar line = ref.line;\n\t\tvar column = ref.column;\n\t\tvar before = source.slice(0, i);\n\t\tvar beforeLine = /(^|\\n).*$/.exec(before)[0].replace(/\\t/g, '  ');\n\t\tvar after = source.slice(i);\n\t\tvar afterLine = /.*(\\n|$)/.exec(after)[0];\n\n\t\tvar snippet = \"\" + beforeLine + afterLine + \"\\n\" + (repeat(' ', beforeLine.length)) + \"^\";\n\n\t\tthrow new Error(\n\t\t\t(message + \" (\" + line + \":\" + column + \"). If this is valid SVG, it's probably a bug in svg-parser. Please raise an issue at https://github.com/Rich-Harris/svg-parser/issues – thanks!\\n\\n\" + snippet)\n\t\t);\n\t}\n\n\tfunction metadata() {\n\t\twhile ((i < source.length && source[i] !== '<') || !validNameCharacters.test(source[i + 1])) {\n\t\t\theader += source[i++];\n\t\t}\n\n\t\treturn neutral();\n\t}\n\n\tfunction neutral() {\n\t\tvar text = '';\n\t\twhile (i < source.length && source[i] !== '<') { text += source[i++]; }\n\n\t\tif (/\\S/.test(text)) {\n\t\t\tcurrentElement.children.push({ type: 'text', value: text });\n\t\t}\n\n\t\tif (source[i] === '<') {\n\t\t\treturn tag;\n\t\t}\n\n\t\treturn neutral;\n\t}\n\n\tfunction tag() {\n\t\tvar char = source[i];\n\n\t\tif (char === '?') { return neutral; } // <?xml...\n\n\t\tif (char === '!') {\n\t\t\tif (source.slice(i + 1, i + 3) === '--') { return comment; }\n\t\t\tif (source.slice(i + 1, i + 8) === '[CDATA[') { return cdata; }\n\t\t\tif (/doctype/i.test(source.slice(i + 1, i + 8))) { return neutral; }\n\t\t}\n\n\t\tif (char === '/') { return closingTag; }\n\n\t\tvar tagName = getName();\n\n\t\tvar element = {\n\t\t\ttype: 'element',\n\t\t\ttagName: tagName,\n\t\t\tproperties: {},\n\t\t\tchildren: []\n\t\t};\n\n\t\tif (currentElement) {\n\t\t\tcurrentElement.children.push(element);\n\t\t} else {\n\t\t\troot = element;\n\t\t}\n\n\t\tvar attribute;\n\t\twhile (i < source.length && (attribute = getAttribute())) {\n\t\t\telement.properties[attribute.name] = attribute.value;\n\t\t}\n\n\t\tvar selfClosing = false;\n\n\t\tif (source[i] === '/') {\n\t\t\ti += 1;\n\t\t\tselfClosing = true;\n\t\t}\n\n\t\tif (source[i] !== '>') {\n\t\t\terror('Expected >');\n\t\t}\n\n\t\tif (!selfClosing) {\n\t\t\tcurrentElement = element;\n\t\t\tstack.push(element);\n\t\t}\n\n\t\treturn neutral;\n\t}\n\n\tfunction comment() {\n\t\tvar index = source.indexOf('-->', i);\n\t\tif (!~index) { error('expected -->'); }\n\n\t\ti = index + 2;\n\t\treturn neutral;\n\t}\n\n\tfunction cdata() {\n\t\tvar index = source.indexOf(']]>', i);\n\t\tif (!~index) { error('expected ]]>'); }\n\n\t\tcurrentElement.children.push(source.slice(i + 7, index));\n\n\t\ti = index + 2;\n\t\treturn neutral;\n\t}\n\n\tfunction closingTag() {\n\t\tvar tagName = getName();\n\n\t\tif (!tagName) { error('Expected tag name'); }\n\n\t\tif (tagName !== currentElement.tagName) {\n\t\t\terror((\"Expected closing tag </\" + tagName + \"> to match opening tag <\" + (currentElement.tagName) + \">\"));\n\t\t}\n\n\t\tallowSpaces();\n\n\t\tif (source[i] !== '>') {\n\t\t\terror('Expected >');\n\t\t}\n\n\t\tstack.pop();\n\t\tcurrentElement = stack[stack.length - 1];\n\n\t\treturn neutral;\n\t}\n\n\tfunction getName() {\n\t\tvar name = '';\n\t\twhile (i < source.length && validNameCharacters.test(source[i])) { name += source[i++]; }\n\n\t\treturn name;\n\t}\n\n\tfunction getAttribute() {\n\t\tif (!whitespace.test(source[i])) { return null; }\n\t\tallowSpaces();\n\n\t\tvar name = getName();\n\t\tif (!name) { return null; }\n\n\t\tvar value = true;\n\n\t\tallowSpaces();\n\t\tif (source[i] === '=') {\n\t\t\ti += 1;\n\t\t\tallowSpaces();\n\n\t\t\tvalue = getAttributeValue();\n\t\t\tif (!isNaN(value) && value.trim() !== '') { value = +value; } // TODO whitelist numeric attributes?\n\t\t}\n\n\t\treturn { name: name, value: value };\n\t}\n\n\tfunction getAttributeValue() {\n\t\treturn quotemark.test(source[i]) ? getQuotedAttributeValue() : getUnquotedAttributeValue();\n\t}\n\n\tfunction getUnquotedAttributeValue() {\n\t\tvar value = '';\n\t\tdo {\n\t\t\tvar char = source[i];\n\t\t\tif (char === ' ' || char === '>' || char === '/') {\n\t\t\t\treturn value;\n\t\t\t}\n\n\t\t\tvalue += char;\n\t\t\ti += 1;\n\t\t} while (i < source.length);\n\n\t\treturn value;\n\t}\n\n\tfunction getQuotedAttributeValue() {\n\t\tvar quotemark = source[i++];\n\n\t\tvar value = '';\n\t\tvar escaped = false;\n\n\t\twhile (i < source.length) {\n\t\t\tvar char = source[i++];\n\t\t\tif (char === quotemark && !escaped) {\n\t\t\t\treturn value;\n\t\t\t}\n\n\t\t\tif (char === '\\\\' && !escaped) {\n\t\t\t\tescaped = true;\n\t\t\t}\n\n\t\t\tvalue += escaped ? (\"\\\\\" + char) : char;\n\t\t\tescaped = false;\n\t\t}\n\t}\n\n\tfunction allowSpaces() {\n\t\twhile (i < source.length && whitespace.test(source[i])) { i += 1; }\n\t}\n\n\tvar i = metadata.length;\n\twhile (i < source.length) {\n\t\tif (!state) { error('Unexpected character'); }\n\t\tstate = state();\n\t\ti += 1;\n\t}\n\n\tif (state !== neutral) {\n\t\terror('Unexpected end of input');\n\t}\n\n\tif (root.tagName === 'svg') { root.metadata = header; }\n\treturn {\n\t\ttype: 'root',\n\t\tchildren: [root]\n\t};\n}\n\nexport { parse };\n//# sourceMappingURL=svg-parser.esm.js.map\n"],"names":["getLocator","source","options","offsetLine","offsetColumn","originalLines","start","lineRanges","line","i","end","range","rangeContains","index","getLocation","locate","search","startIndex","d","validNameCharacters","whitespace","quotemark","repeat","str","result","parse","header","stack","state","metadata","currentElement","root","error","message","ref","column","before","beforeLine","after","afterLine","snippet","neutral","text","tag","char","comment","cdata","closingTag","tagName","getName","element","attribute","getAttribute","selfClosing","allowSpaces","name","value","getAttributeValue","getQuotedAttributeValue","getUnquotedAttributeValue","escaped"],"mappings":"AAAA,SAASA,EAAWC,GAAQC,GAAS;AACjC,EAAIA,MAAY,WAAUA,IAAU,CAAA;AACpC,MAAIC,IAAaD,EAAQ,cAAc,GACnCE,IAAeF,EAAQ,gBAAgB,GACvCG,IAAgBJ,EAAO,MAAM;AAAA,CAAI,GACjCK,IAAQ,GACRC,IAAaF,EAAc,IAAI,SAAUG,GAAMC,GAAG;AAClD,QAAIC,IAAMJ,IAAQE,EAAK,SAAS,GAC5BG,IAAQ,EAAE,OAAAL,GAAc,KAAAI,GAAU,MAAMD,EAAAA;AAC5C,WAAAH,IAAQI,GACDC;AAAA,EACX,CAAC,GACGF,IAAI;AACR,WAASG,EAAcD,GAAOE,GAAO;AACjC,WAAOF,EAAM,SAASE,KAASA,IAAQF,EAAM;AAAA,EACjD;AACA,WAASG,EAAYH,GAAOE,GAAO;AAC/B,WAAO,EAAE,MAAMV,IAAaQ,EAAM,MAAM,QAAQP,IAAeS,IAAQF,EAAM,OAAO,WAAWE,EAAA;AAAA,EACnG;AACA,WAASE,EAAOC,GAAQC,GAAY;AAChC,IAAI,OAAOD,KAAW,aAClBA,IAASf,EAAO,QAAQe,GAAQC,KAAc,CAAC;AAInD,aAFIN,IAAQJ,EAAWE,CAAC,GACpBS,IAAIF,KAAUL,EAAM,MAAM,IAAI,IAC3BA,KAAO;AACV,UAAIC,EAAcD,GAAOK,CAAM;AAC3B,eAAOF,EAAYH,GAAOK,CAAM;AACpC,MAAAP,KAAKS,GACLP,IAAQJ,EAAWE,CAAC;AAAA,IACxB;AAAA,EACJ;AACA,SAAOM;AACX;AACA,SAASA,EAAOd,GAAQe,GAAQd,GAAS;AAIrC,SAAOF,EAAWC,GAAQC,CAAO,EAAEc,GAAQd,CAA6B;AAC5E;AAEA,IAAIiB,IAAsB,kBACtBC,IAAa,cACbC,IAAY;AAEhB,SAASC,EAAOC,GAAKd,GAAG;AAEvB,WADIe,IAAS,IACNf;AAAO,IAAAe,KAAUD;AACxB,SAAOC;AACR;AAEA,SAASC,EAAMxB,GAAQ;AACtB,MAAIyB,IAAS,IACTC,IAAQ,CAAA,GAERC,IAAQC,GACRC,IAAiB,MACjBC,IAAO;AAEX,WAASC,EAAMC,GAAS;AACvB,QAAIC,IAAMnB,EAAOd,GAAQQ,CAAC,GACtBD,IAAO0B,EAAI,MACXC,IAASD,EAAI,QACbE,IAASnC,EAAO,MAAM,GAAGQ,CAAC,GAC1B4B,IAAa,YAAY,KAAKD,CAAM,EAAE,CAAC,EAAE,QAAQ,OAAO,IAAI,GAC5DE,IAAQrC,EAAO,MAAMQ,CAAC,GACtB8B,IAAY,WAAW,KAAKD,CAAK,EAAE,CAAC,GAEpCE,IAAU,KAAKH,IAAaE,IAAY;AAAA,IAAQjB,EAAO,KAAKe,EAAW,MAAM,IAAK;AAEtF,UAAM,IAAI;AAAA,MACRJ,IAAU,OAAOzB,IAAO,MAAM2B,IAAS;AAAA;AAAA,IAAwJK;AAAA,IAAA;AAAA,EAElM;AAEA,WAASX,IAAW;AACnB,WAAQpB,IAAIR,EAAO,UAAUA,EAAOQ,CAAC,MAAM,OAAQ,CAACU,EAAoB,KAAKlB,EAAOQ,IAAI,CAAC,CAAC;AACzF,MAAAiB,KAAUzB,EAAOQ,GAAG;AAGrB,WAAOgC,EAAA;AAAA,EACR;AAEA,WAASA,IAAU;AAElB,aADIC,IAAO,IACJjC,IAAIR,EAAO,UAAUA,EAAOQ,CAAC,MAAM;AAAO,MAAAiC,KAAQzC,EAAOQ,GAAG;AAMnE,WAJI,KAAK,KAAKiC,CAAI,KACjBZ,EAAe,SAAS,KAAK,EAAE,MAAM,QAAQ,OAAOY,GAAM,GAGvDzC,EAAOQ,CAAC,MAAM,MACVkC,IAGDF;AAAA,EACR;AAEA,WAASE,IAAM;AACd,QAAIC,IAAO3C,EAAOQ,CAAC;AAEnB,QAAImC,MAAS;AAAO,aAAOH;AAE3B,QAAIG,MAAS,KAAK;AACjB,UAAI3C,EAAO,MAAMQ,IAAI,GAAGA,IAAI,CAAC,MAAM;AAAQ,eAAOoC;AAClD,UAAI5C,EAAO,MAAMQ,IAAI,GAAGA,IAAI,CAAC,MAAM;AAAa,eAAOqC;AACvD,UAAI,WAAW,KAAK7C,EAAO,MAAMQ,IAAI,GAAGA,IAAI,CAAC,CAAC;AAAK,eAAOgC;AAAA,IAC3D;AAEA,QAAIG,MAAS;AAAO,aAAOG;AAE3B,QAAIC,IAAUC,EAAA,GAEVC,IAAU;AAAA,MACb,MAAM;AAAA,MACN,SAAAF;AAAA,MACA,YAAY,CAAA;AAAA,MACZ,UAAU,CAAA;AAAA,IAAC;AAGZ,IAAIlB,IACHA,EAAe,SAAS,KAAKoB,CAAO,IAEpCnB,IAAOmB;AAIR,aADIC,GACG1C,IAAIR,EAAO,WAAWkD,IAAYC;AACxC,MAAAF,EAAQ,WAAWC,EAAU,IAAI,IAAIA,EAAU;AAGhD,QAAIE,IAAc;AAElB,WAAIpD,EAAOQ,CAAC,MAAM,QACjBA,KAAK,GACL4C,IAAc,KAGXpD,EAAOQ,CAAC,MAAM,OACjBuB,EAAM,YAAY,GAGdqB,MACJvB,IAAiBoB,GACjBvB,EAAM,KAAKuB,CAAO,IAGZT;AAAA,EACR;AAEA,WAASI,IAAU;AAClB,QAAIhC,IAAQZ,EAAO,QAAQ,OAAOQ,CAAC;AACnC,WAAK,CAACI,KAASmB,EAAM,cAAc,GAEnCvB,IAAII,IAAQ,GACL4B;AAAA,EACR;AAEA,WAASK,IAAQ;AAChB,QAAIjC,IAAQZ,EAAO,QAAQ,OAAOQ,CAAC;AACnC,WAAK,CAACI,KAASmB,EAAM,cAAc,GAEnCF,EAAe,SAAS,KAAK7B,EAAO,MAAMQ,IAAI,GAAGI,CAAK,CAAC,GAEvDJ,IAAII,IAAQ,GACL4B;AAAA,EACR;AAEA,WAASM,IAAa;AACrB,QAAIC,IAAUC,EAAA;AAEd,WAAKD,KAAWhB,EAAM,mBAAmB,GAErCgB,MAAYlB,EAAe,WAC9BE,EAAO,4BAA4BgB,IAAU,6BAA8BlB,EAAe,UAAW,GAAI,GAG1GwB,EAAA,GAEIrD,EAAOQ,CAAC,MAAM,OACjBuB,EAAM,YAAY,GAGnBL,EAAM,IAAA,GACNG,IAAiBH,EAAMA,EAAM,SAAS,CAAC,GAEhCc;AAAA,EACR;AAEA,WAASQ,IAAU;AAElB,aADIM,IAAO,IACJ9C,IAAIR,EAAO,UAAUkB,EAAoB,KAAKlB,EAAOQ,CAAC,CAAC;AAAK,MAAA8C,KAAQtD,EAAOQ,GAAG;AAErF,WAAO8C;AAAA,EACR;AAEA,WAASH,IAAe;AACvB,QAAI,CAAChC,EAAW,KAAKnB,EAAOQ,CAAC,CAAC;AAAK,aAAO;AAC1C,IAAA6C,EAAA;AAEA,QAAIC,IAAON,EAAA;AACX,QAAI,CAACM;AAAQ,aAAO;AAEpB,QAAIC,IAAQ;AAEZ,WAAAF,EAAA,GACIrD,EAAOQ,CAAC,MAAM,QACjBA,KAAK,GACL6C,EAAA,GAEAE,IAAQC,EAAA,GACJ,CAAC,MAAMD,CAAK,KAAKA,EAAM,KAAA,MAAW,OAAMA,IAAQ,CAACA,KAG/C,EAAE,MAAAD,GAAY,OAAAC,EAAA;AAAA,EACtB;AAEA,WAASC,IAAoB;AAC5B,WAAOpC,EAAU,KAAKpB,EAAOQ,CAAC,CAAC,IAAIiD,EAAA,IAA4BC,EAAA;AAAA,EAChE;AAEA,WAASA,IAA4B;AACpC,QAAIH,IAAQ;AACZ,OAAG;AACF,UAAIZ,IAAO3C,EAAOQ,CAAC;AACnB,UAAImC,MAAS,OAAOA,MAAS,OAAOA,MAAS;AAC5C,eAAOY;AAGR,MAAAA,KAASZ,GACTnC,KAAK;AAAA,IACN,SAASA,IAAIR,EAAO;AAEpB,WAAOuD;AAAA,EACR;AAEA,WAASE,IAA0B;AAMlC,aALIrC,IAAYpB,EAAOQ,GAAG,GAEtB+C,IAAQ,IACRI,IAAU,IAEPnD,IAAIR,EAAO,UAAQ;AACzB,UAAI2C,IAAO3C,EAAOQ,GAAG;AACrB,UAAImC,MAASvB,KAAa,CAACuC;AAC1B,eAAOJ;AAGR,MAAIZ,MAAS,QAAQ,CAACgB,MACrBA,IAAU,KAGXJ,KAASI,IAAW,OAAOhB,IAAQA,GACnCgB,IAAU;AAAA,IACX;AAAA,EACD;AAEA,WAASN,IAAc;AACtB,WAAO7C,IAAIR,EAAO,UAAUmB,EAAW,KAAKnB,EAAOQ,CAAC,CAAC;AAAK,MAAAA,KAAK;AAAA,EAChE;AAGA,WADIA,IAAIoB,EAAS,QACVpB,IAAIR,EAAO;AACjB,IAAK2B,KAASI,EAAM,sBAAsB,GAC1CJ,IAAQA,EAAA,GACRnB,KAAK;AAGN,SAAImB,MAAUa,KACbT,EAAM,yBAAyB,GAG5BD,EAAK,YAAY,UAASA,EAAK,WAAWL,IACvC;AAAA,IACN,MAAM;AAAA,IACN,UAAU,CAACK,CAAI;AAAA,EAAA;AAEjB;","x_google_ignoreList":[0]}

package/dist/index.es336.js

@@ -0,0 +1,31 @@
+const a = 11102230246251565e-32, p = 134217729, Q = (3 + 8 * a) * a;
+function b(f, s, d, o, x) {
+  let e, t, r, l, i = s[0], n = o[0], u = 0, c = 0;
+  n > i == n > -i ? (e = i, i = s[++u]) : (e = n, n = o[++c]);
+  let w = 0;
+  if (u < f && c < d)
+    for (n > i == n > -i ? (t = i + e, r = e - (t - i), i = s[++u]) : (t = n + e, r = e - (t - n), n = o[++c]), e = t, r !== 0 && (x[w++] = r); u < f && c < d; )
+      n > i == n > -i ? (t = e + i, l = t - e, r = e - (t - l) + (i - l), i = s[++u]) : (t = e + n, l = t - e, r = e - (t - l) + (n - l), n = o[++c]), e = t, r !== 0 && (x[w++] = r);
+  for (; u < f; )
+    t = e + i, l = t - e, r = e - (t - l) + (i - l), i = s[++u], e = t, r !== 0 && (x[w++] = r);
+  for (; c < d; )
+    t = e + n, l = t - e, r = e - (t - l) + (n - l), n = o[++c], e = t, r !== 0 && (x[w++] = r);
+  return (e !== 0 || w === 0) && (x[w++] = e), w;
+}
+function h(f, s) {
+  let d = s[0];
+  for (let o = 1; o < f; o++) d += s[o];
+  return d;
+}
+function m(f) {
+  return new Float64Array(f);
+}
+export {
+  a as epsilon,
+  h as estimate,
+  Q as resulterrbound,
+  p as splitter,
+  b as sum,
+  m as vec
+};
+//# sourceMappingURL=index.es336.js.map

package/dist/index.es336.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es336.js","sources":["../../../node_modules/robust-predicates/esm/util.js"],"sourcesContent":["export const epsilon = 1.1102230246251565e-16;\nexport const splitter = 134217729;\nexport const resulterrbound = (3 + 8 * epsilon) * epsilon;\n\n// fast_expansion_sum_zeroelim routine from oritinal code\nexport function sum(elen, e, flen, f, h) {\n    let Q, Qnew, hh, bvirt;\n    let enow = e[0];\n    let fnow = f[0];\n    let eindex = 0;\n    let findex = 0;\n    if ((fnow > enow) === (fnow > -enow)) {\n        Q = enow;\n        enow = e[++eindex];\n    } else {\n        Q = fnow;\n        fnow = f[++findex];\n    }\n    let hindex = 0;\n    if (eindex < elen && findex < flen) {\n        if ((fnow > enow) === (fnow > -enow)) {\n            Qnew = enow + Q;\n            hh = Q - (Qnew - enow);\n            enow = e[++eindex];\n        } else {\n            Qnew = fnow + Q;\n            hh = Q - (Qnew - fnow);\n            fnow = f[++findex];\n        }\n        Q = Qnew;\n        if (hh !== 0) {\n            h[hindex++] = hh;\n        }\n        while (eindex < elen && findex < flen) {\n            if ((fnow > enow) === (fnow > -enow)) {\n                Qnew = Q + enow;\n                bvirt = Qnew - Q;\n                hh = Q - (Qnew - bvirt) + (enow - bvirt);\n                enow = e[++eindex];\n            } else {\n                Qnew = Q + fnow;\n                bvirt = Qnew - Q;\n                hh = Q - (Qnew - bvirt) + (fnow - bvirt);\n                fnow = f[++findex];\n            }\n            Q = Qnew;\n            if (hh !== 0) {\n                h[hindex++] = hh;\n            }\n        }\n    }\n    while (eindex < elen) {\n        Qnew = Q + enow;\n        bvirt = Qnew - Q;\n        hh = Q - (Qnew - bvirt) + (enow - bvirt);\n        enow = e[++eindex];\n        Q = Qnew;\n        if (hh !== 0) {\n            h[hindex++] = hh;\n        }\n    }\n    while (findex < flen) {\n        Qnew = Q + fnow;\n        bvirt = Qnew - Q;\n        hh = Q - (Qnew - bvirt) + (fnow - bvirt);\n        fnow = f[++findex];\n        Q = Qnew;\n        if (hh !== 0) {\n            h[hindex++] = hh;\n        }\n    }\n    if (Q !== 0 || hindex === 0) {\n        h[hindex++] = Q;\n    }\n    return hindex;\n}\n\nexport function sum_three(alen, a, blen, b, clen, c, tmp, out) {\n    return sum(sum(alen, a, blen, b, tmp), tmp, clen, c, out);\n}\n\n// scale_expansion_zeroelim routine from oritinal code\nexport function scale(elen, e, b, h) {\n    let Q, sum, hh, product1, product0;\n    let bvirt, c, ahi, alo, bhi, blo;\n\n    c = splitter * b;\n    bhi = c - (c - b);\n    blo = b - bhi;\n    let enow = e[0];\n    Q = enow * b;\n    c = splitter * enow;\n    ahi = c - (c - enow);\n    alo = enow - ahi;\n    hh = alo * blo - (Q - ahi * bhi - alo * bhi - ahi * blo);\n    let hindex = 0;\n    if (hh !== 0) {\n        h[hindex++] = hh;\n    }\n    for (let i = 1; i < elen; i++) {\n        enow = e[i];\n        product1 = enow * b;\n        c = splitter * enow;\n        ahi = c - (c - enow);\n        alo = enow - ahi;\n        product0 = alo * blo - (product1 - ahi * bhi - alo * bhi - ahi * blo);\n        sum = Q + product0;\n        bvirt = sum - Q;\n        hh = Q - (sum - bvirt) + (product0 - bvirt);\n        if (hh !== 0) {\n            h[hindex++] = hh;\n        }\n        Q = product1 + sum;\n        hh = sum - (Q - product1);\n        if (hh !== 0) {\n            h[hindex++] = hh;\n        }\n    }\n    if (Q !== 0 || hindex === 0) {\n        h[hindex++] = Q;\n    }\n    return hindex;\n}\n\nexport function negate(elen, e) {\n    for (let i = 0; i < elen; i++) e[i] = -e[i];\n    return elen;\n}\n\nexport function estimate(elen, e) {\n    let Q = e[0];\n    for (let i = 1; i < elen; i++) Q += e[i];\n    return Q;\n}\n\nexport function vec(n) {\n    return new Float64Array(n);\n}\n"],"names":["epsilon","splitter","resulterrbound","sum","elen","e","flen","f","h","Q","Qnew","hh","bvirt","enow","fnow","eindex","findex","hindex","estimate","i","vec","n"],"mappings":"AAAO,MAAMA,IAAU,uBACVC,IAAW,WACXC,KAAkB,IAAI,IAAIF,KAAWA;AAG3C,SAASG,EAAIC,GAAMC,GAAGC,GAAMC,GAAGC,GAAG;AACrC,MAAIC,GAAGC,GAAMC,GAAIC,GACbC,IAAOR,EAAE,CAAC,GACVS,IAAOP,EAAE,CAAC,GACVQ,IAAS,GACTC,IAAS;AACb,EAAKF,IAAOD,KAAWC,IAAO,CAACD,KAC3BJ,IAAII,GACJA,IAAOR,EAAE,EAAEU,CAAM,MAEjBN,IAAIK,GACJA,IAAOP,EAAE,EAAES,CAAM;AAErB,MAAIC,IAAS;AACb,MAAIF,IAASX,KAAQY,IAASV;AAc1B,SAbKQ,IAAOD,KAAWC,IAAO,CAACD,KAC3BH,IAAOG,IAAOJ,GACdE,IAAKF,KAAKC,IAAOG,IACjBA,IAAOR,EAAE,EAAEU,CAAM,MAEjBL,IAAOI,IAAOL,GACdE,IAAKF,KAAKC,IAAOI,IACjBA,IAAOP,EAAE,EAAES,CAAM,IAErBP,IAAIC,GACAC,MAAO,MACPH,EAAES,GAAQ,IAAIN,IAEXI,IAASX,KAAQY,IAASV;AAC7B,MAAKQ,IAAOD,KAAWC,IAAO,CAACD,KAC3BH,IAAOD,IAAII,GACXD,IAAQF,IAAOD,GACfE,IAAKF,KAAKC,IAAOE,MAAUC,IAAOD,IAClCC,IAAOR,EAAE,EAAEU,CAAM,MAEjBL,IAAOD,IAAIK,GACXF,IAAQF,IAAOD,GACfE,IAAKF,KAAKC,IAAOE,MAAUE,IAAOF,IAClCE,IAAOP,EAAE,EAAES,CAAM,IAErBP,IAAIC,GACAC,MAAO,MACPH,EAAES,GAAQ,IAAIN;AAI1B,SAAOI,IAASX;AACZ,IAAAM,IAAOD,IAAII,GACXD,IAAQF,IAAOD,GACfE,IAAKF,KAAKC,IAAOE,MAAUC,IAAOD,IAClCC,IAAOR,EAAE,EAAEU,CAAM,GACjBN,IAAIC,GACAC,MAAO,MACPH,EAAES,GAAQ,IAAIN;AAGtB,SAAOK,IAASV;AACZ,IAAAI,IAAOD,IAAIK,GACXF,IAAQF,IAAOD,GACfE,IAAKF,KAAKC,IAAOE,MAAUE,IAAOF,IAClCE,IAAOP,EAAE,EAAES,CAAM,GACjBP,IAAIC,GACAC,MAAO,MACPH,EAAES,GAAQ,IAAIN;AAGtB,UAAIF,MAAM,KAAKQ,MAAW,OACtBT,EAAES,GAAQ,IAAIR,IAEXQ;AACX;AAsDO,SAASC,EAASd,GAAMC,GAAG;AAC9B,MAAII,IAAIJ,EAAE,CAAC;AACX,WAASc,IAAI,GAAGA,IAAIf,GAAMe,IAAK,CAAAV,KAAKJ,EAAEc,CAAC;AACvC,SAAOV;AACX;AAEO,SAASW,EAAIC,GAAG;AACnB,SAAO,IAAI,aAAaA,CAAC;AAC7B;","x_google_ignoreList":[0]}

package/dist/index.es337.js

@@ -0,0 +1,6 @@
+function o() {
+}
+export {
+  o as default
+};
+//# sourceMappingURL=index.es337.js.map

package/dist/index.es337.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es337.js","sources":["../../../node_modules/d3-geo/src/noop.js"],"sourcesContent":["export default function noop() {}\n"],"names":["noop"],"mappings":"AAAA,SAAwBA,IAAO;AAAC;","x_google_ignoreList":[0]}

package/dist/index.es338.js

@@ -0,0 +1,8 @@
+import { abs as n, epsilon as r } from "./index.es283.js";
+function i(o, t) {
+  return n(o[0] - t[0]) < r && n(o[1] - t[1]) < r;
+}
+export {
+  i as default
+};
+//# sourceMappingURL=index.es338.js.map

package/dist/index.es338.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es338.js","sources":["../../../node_modules/d3-geo/src/pointEqual.js"],"sourcesContent":["import {abs, epsilon} from \"./math\";\n\nexport default function(a, b) {\n  return abs(a[0] - b[0]) < epsilon && abs(a[1] - b[1]) < epsilon;\n}\n"],"names":["pointEqual","a","b","abs","epsilon"],"mappings":";AAEA,SAAAA,EAAwBC,GAAGC,GAAG;AAC5B,SAAOC,EAAIF,EAAE,CAAC,IAAIC,EAAE,CAAC,CAAC,IAAIE,KAAWD,EAAIF,EAAE,CAAC,IAAIC,EAAE,CAAC,CAAC,IAAIE;AAC1D;","x_google_ignoreList":[0]}

package/dist/index.es339.js

@@ -0,0 +1,73 @@
+import A from "./index.es285.js";
+import D from "./index.es287.js";
+import { halfPi as S, epsilon as R } from "./index.es283.js";
+import F from "./index.es203.js";
+import "./index.es202.js";
+import G from "./index.es288.js";
+function T(e, p, m, v) {
+  return function(g, n) {
+    var d = p(n), j = g.invert(v[0], v[1]), h = A(), c = p(h), l = !1, a, f, u, r = {
+      point: y,
+      lineStart: x,
+      lineEnd: s,
+      polygonStart: function() {
+        r.point = B, r.lineStart = w, r.lineEnd = z, f = [], a = [];
+      },
+      polygonEnd: function() {
+        r.point = y, r.lineStart = x, r.lineEnd = s, f = G(f);
+        var o = F(a, j);
+        f.length ? (l || (n.polygonStart(), l = !0), D(f, J, o, m, n)) : o && (l || (n.polygonStart(), l = !0), n.lineStart(), m(null, null, 1, n), n.lineEnd()), l && (n.polygonEnd(), l = !1), f = a = null;
+      },
+      sphere: function() {
+        n.polygonStart(), n.lineStart(), m(null, null, 1, n), n.lineEnd(), n.polygonEnd();
+      }
+    };
+    function y(o, t) {
+      var i = g(o, t);
+      e(o = i[0], t = i[1]) && n.point(o, t);
+    }
+    function q(o, t) {
+      var i = g(o, t);
+      d.point(i[0], i[1]);
+    }
+    function x() {
+      r.point = q, d.lineStart();
+    }
+    function s() {
+      r.point = y, d.lineEnd();
+    }
+    function B(o, t) {
+      u.push([o, t]);
+      var i = g(o, t);
+      c.point(i[0], i[1]);
+    }
+    function w() {
+      c.lineStart(), u = [];
+    }
+    function z() {
+      B(u[0][0], u[0][1]), c.lineEnd();
+      var o = c.clean(), t = h.result(), i, I = t.length, P, E, C;
+      if (u.pop(), a.push(u), u = null, !!I) {
+        if (o & 1) {
+          if (E = t[0], (P = E.length - 1) > 0) {
+            for (l || (n.polygonStart(), l = !0), n.lineStart(), i = 0; i < P; ++i) n.point((C = E[i])[0], C[1]);
+            n.lineEnd();
+          }
+          return;
+        }
+        I > 1 && o & 2 && t.push(t.pop().concat(t.shift())), f.push(t.filter(H));
+      }
+    }
+    return r;
+  };
+}
+function H(e) {
+  return e.length > 1;
+}
+function J(e, p) {
+  return ((e = e.x)[0] < 0 ? e[1] - S - R : S - e[1]) - ((p = p.x)[0] < 0 ? p[1] - S - R : S - p[1]);
+}
+export {
+  T as default
+};
+//# sourceMappingURL=index.es339.js.map

package/dist/index.es339.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es339.js","sources":["../../../node_modules/d3-geo/src/clip/index.js"],"sourcesContent":["import clipBuffer from \"./buffer\";\nimport clipPolygon from \"./polygon\";\nimport {epsilon, halfPi} from \"../math\";\nimport polygonContains from \"../polygonContains\";\nimport {merge} from \"d3-array\";\n\nexport default function(pointVisible, clipLine, interpolate, start) {\n  return function(rotate, sink) {\n    var line = clipLine(sink),\n        rotatedStart = rotate.invert(start[0], start[1]),\n        ringBuffer = clipBuffer(),\n        ringSink = clipLine(ringBuffer),\n        polygonStarted = false,\n        polygon,\n        segments,\n        ring;\n\n    var clip = {\n      point: point,\n      lineStart: lineStart,\n      lineEnd: lineEnd,\n      polygonStart: function() {\n        clip.point = pointRing;\n        clip.lineStart = ringStart;\n        clip.lineEnd = ringEnd;\n        segments = [];\n        polygon = [];\n      },\n      polygonEnd: function() {\n        clip.point = point;\n        clip.lineStart = lineStart;\n        clip.lineEnd = lineEnd;\n        segments = merge(segments);\n        var startInside = polygonContains(polygon, rotatedStart);\n        if (segments.length) {\n          if (!polygonStarted) sink.polygonStart(), polygonStarted = true;\n          clipPolygon(segments, compareIntersection, startInside, interpolate, sink);\n        } else if (startInside) {\n          if (!polygonStarted) sink.polygonStart(), polygonStarted = true;\n          sink.lineStart();\n          interpolate(null, null, 1, sink);\n          sink.lineEnd();\n        }\n        if (polygonStarted) sink.polygonEnd(), polygonStarted = false;\n        segments = polygon = null;\n      },\n      sphere: function() {\n        sink.polygonStart();\n        sink.lineStart();\n        interpolate(null, null, 1, sink);\n        sink.lineEnd();\n        sink.polygonEnd();\n      }\n    };\n\n    function point(lambda, phi) {\n      var point = rotate(lambda, phi);\n      if (pointVisible(lambda = point[0], phi = point[1])) sink.point(lambda, phi);\n    }\n\n    function pointLine(lambda, phi) {\n      var point = rotate(lambda, phi);\n      line.point(point[0], point[1]);\n    }\n\n    function lineStart() {\n      clip.point = pointLine;\n      line.lineStart();\n    }\n\n    function lineEnd() {\n      clip.point = point;\n      line.lineEnd();\n    }\n\n    function pointRing(lambda, phi) {\n      ring.push([lambda, phi]);\n      var point = rotate(lambda, phi);\n      ringSink.point(point[0], point[1]);\n    }\n\n    function ringStart() {\n      ringSink.lineStart();\n      ring = [];\n    }\n\n    function ringEnd() {\n      pointRing(ring[0][0], ring[0][1]);\n      ringSink.lineEnd();\n\n      var clean = ringSink.clean(),\n          ringSegments = ringBuffer.result(),\n          i, n = ringSegments.length, m,\n          segment,\n          point;\n\n      ring.pop();\n      polygon.push(ring);\n      ring = null;\n\n      if (!n) return;\n\n      // No intersections.\n      if (clean & 1) {\n        segment = ringSegments[0];\n        if ((m = segment.length - 1) > 0) {\n          if (!polygonStarted) sink.polygonStart(), polygonStarted = true;\n          sink.lineStart();\n          for (i = 0; i < m; ++i) sink.point((point = segment[i])[0], point[1]);\n          sink.lineEnd();\n        }\n        return;\n      }\n\n      // Rejoin connected segments.\n      // TODO reuse ringBuffer.rejoin()?\n      if (n > 1 && clean & 2) ringSegments.push(ringSegments.pop().concat(ringSegments.shift()));\n\n      segments.push(ringSegments.filter(validSegment));\n    }\n\n    return clip;\n  };\n}\n\nfunction validSegment(segment) {\n  return segment.length > 1;\n}\n\n// Intersections are sorted along the clip edge. For both antimeridian cutting\n// and circle clipping, the same comparison is used.\nfunction compareIntersection(a, b) {\n  return ((a = a.x)[0] < 0 ? a[1] - halfPi - epsilon : halfPi - a[1])\n       - ((b = b.x)[0] < 0 ? b[1] - halfPi - epsilon : halfPi - b[1]);\n}\n"],"names":["clip","pointVisible","clipLine","interpolate","start","rotate","sink","line","rotatedStart","ringBuffer","clipBuffer","ringSink","polygonStarted","polygon","segments","ring","point","lineStart","lineEnd","pointRing","ringStart","ringEnd","merge","startInside","polygonContains","clipPolygon","compareIntersection","lambda","phi","pointLine","clean","ringSegments","n","m","segment","validSegment","a","b","halfPi","epsilon"],"mappings":";;;;;;AAMA,SAAAA,EAAwBC,GAAcC,GAAUC,GAAaC,GAAO;AAClE,SAAO,SAASC,GAAQC,GAAM;AAC5B,QAAIC,IAAOL,EAASI,CAAI,GACpBE,IAAeH,EAAO,OAAOD,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC,GAC/CK,IAAaC,KACbC,IAAWT,EAASO,CAAU,GAC9BG,IAAiB,IACjBC,GACAC,GACAC,GAEAf,IAAO;AAAA,MACT,OAAAgB;AAAA,MACA,WAAAC;AAAA,MACA,SAAAC;AAAA,MACA,cAAc,WAAW;AACvB,QAAAlB,EAAK,QAAQmB,GACbnB,EAAK,YAAYoB,GACjBpB,EAAK,UAAUqB,GACfP,IAAW,CAAA,GACXD,IAAU,CAAA;AAAA,MACZ;AAAA,MACA,YAAY,WAAW;AACrB,QAAAb,EAAK,QAAQgB,GACbhB,EAAK,YAAYiB,GACjBjB,EAAK,UAAUkB,GACfJ,IAAWQ,EAAMR,CAAQ;AACzB,YAAIS,IAAcC,EAAgBX,GAASL,CAAY;AACvD,QAAIM,EAAS,UACNF,MAAgBN,EAAK,aAAA,GAAgBM,IAAiB,KAC3Da,EAAYX,GAAUY,GAAqBH,GAAapB,GAAaG,CAAI,KAChEiB,MACJX,MAAgBN,EAAK,aAAA,GAAgBM,IAAiB,KAC3DN,EAAK,UAAA,GACLH,EAAY,MAAM,MAAM,GAAGG,CAAI,GAC/BA,EAAK,QAAA,IAEHM,MAAgBN,EAAK,WAAA,GAAcM,IAAiB,KACxDE,IAAWD,IAAU;AAAA,MACvB;AAAA,MACA,QAAQ,WAAW;AACjB,QAAAP,EAAK,aAAA,GACLA,EAAK,UAAA,GACLH,EAAY,MAAM,MAAM,GAAGG,CAAI,GAC/BA,EAAK,QAAA,GACLA,EAAK,WAAA;AAAA,MACP;AAAA,IAAA;AAGF,aAASU,EAAMW,GAAQC,GAAK;AAC1B,UAAIZ,IAAQX,EAAOsB,GAAQC,CAAG;AAC9B,MAAI3B,EAAa0B,IAASX,EAAM,CAAC,GAAGY,IAAMZ,EAAM,CAAC,CAAC,KAAGV,EAAK,MAAMqB,GAAQC,CAAG;AAAA,IAC7E;AAEA,aAASC,EAAUF,GAAQC,GAAK;AAC9B,UAAIZ,IAAQX,EAAOsB,GAAQC,CAAG;AAC9B,MAAArB,EAAK,MAAMS,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,IAC/B;AAEA,aAASC,IAAY;AACnB,MAAAjB,EAAK,QAAQ6B,GACbtB,EAAK,UAAA;AAAA,IACP;AAEA,aAASW,IAAU;AACjB,MAAAlB,EAAK,QAAQgB,GACbT,EAAK,QAAA;AAAA,IACP;AAEA,aAASY,EAAUQ,GAAQC,GAAK;AAC9B,MAAAb,EAAK,KAAK,CAACY,GAAQC,CAAG,CAAC;AACvB,UAAIZ,IAAQX,EAAOsB,GAAQC,CAAG;AAC9B,MAAAjB,EAAS,MAAMK,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,IACnC;AAEA,aAASI,IAAY;AACnB,MAAAT,EAAS,UAAA,GACTI,IAAO,CAAA;AAAA,IACT;AAEA,aAASM,IAAU;AACjB,MAAAF,EAAUJ,EAAK,CAAC,EAAE,CAAC,GAAGA,EAAK,CAAC,EAAE,CAAC,CAAC,GAChCJ,EAAS,QAAA;AAET,UAAImB,IAAQnB,EAAS,MAAA,GACjBoB,IAAetB,EAAW,OAAA,GAC1B,GAAGuB,IAAID,EAAa,QAAQE,GAC5BC,GACAlB;AAMJ,UAJAD,EAAK,IAAA,GACLF,EAAQ,KAAKE,CAAI,GACjBA,IAAO,MAEH,EAACiB,GAGL;AAAA,YAAIF,IAAQ,GAAG;AAEb,cADAI,IAAUH,EAAa,CAAC,IACnBE,IAAIC,EAAQ,SAAS,KAAK,GAAG;AAGhC,iBAFKtB,MAAgBN,EAAK,aAAA,GAAgBM,IAAiB,KAC3DN,EAAK,UAAA,GACA,IAAI,GAAG,IAAI2B,GAAG,EAAE,EAAG,CAAA3B,EAAK,OAAOU,IAAQkB,EAAQ,CAAC,GAAG,CAAC,GAAGlB,EAAM,CAAC,CAAC;AACpE,YAAAV,EAAK,QAAA;AAAA,UACP;AACA;AAAA,QACF;AAIA,QAAI0B,IAAI,KAAKF,IAAQ,KAAGC,EAAa,KAAKA,EAAa,IAAA,EAAM,OAAOA,EAAa,MAAA,CAAO,CAAC,GAEzFjB,EAAS,KAAKiB,EAAa,OAAOI,CAAY,CAAC;AAAA;AAAA,IACjD;AAEA,WAAOnC;AAAA,EACT;AACF;AAEA,SAASmC,EAAaD,GAAS;AAC7B,SAAOA,EAAQ,SAAS;AAC1B;AAIA,SAASR,EAAoBU,GAAGC,GAAG;AACjC,WAASD,IAAIA,EAAE,GAAG,CAAC,IAAI,IAAIA,EAAE,CAAC,IAAIE,IAASC,IAAUD,IAASF,EAAE,CAAC,OACxDC,IAAIA,EAAE,GAAG,CAAC,IAAI,IAAIA,EAAE,CAAC,IAAIC,IAASC,IAAUD,IAASD,EAAE,CAAC;AACnE;","x_google_ignoreList":[0]}

package/dist/index.es340.js

@@ -0,0 +1,19 @@
+import r from "./index.es337.js";
+var o = 1 / 0, f = o, t = -o, a = t, d = {
+  point: u,
+  lineStart: r,
+  lineEnd: r,
+  polygonStart: r,
+  polygonEnd: r,
+  result: function() {
+    var n = [[o, f], [t, a]];
+    return t = a = -(f = o = 1 / 0), n;
+  }
+};
+function u(n, i) {
+  n < o && (o = n), n > t && (t = n), i < f && (f = i), i > a && (a = i);
+}
+export {
+  d as default
+};
+//# sourceMappingURL=index.es340.js.map

package/dist/index.es340.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es340.js","sources":["../../../node_modules/d3-geo/src/path/bounds.js"],"sourcesContent":["import noop from \"../noop\";\n\nvar x0 = Infinity,\n    y0 = x0,\n    x1 = -x0,\n    y1 = x1;\n\nvar boundsStream = {\n  point: boundsPoint,\n  lineStart: noop,\n  lineEnd: noop,\n  polygonStart: noop,\n  polygonEnd: noop,\n  result: function() {\n    var bounds = [[x0, y0], [x1, y1]];\n    x1 = y1 = -(y0 = x0 = Infinity);\n    return bounds;\n  }\n};\n\nfunction boundsPoint(x, y) {\n  if (x < x0) x0 = x;\n  if (x > x1) x1 = x;\n  if (y < y0) y0 = y;\n  if (y > y1) y1 = y;\n}\n\nexport default boundsStream;\n"],"names":["x0","y0","x1","y1","boundsStream","boundsPoint","noop","bounds","x","y"],"mappings":";AAEA,IAAIA,IAAK,OACLC,IAAKD,GACLE,IAAK,CAACF,GACNG,IAAKD,GAELE,IAAe;AAAA,EACjB,OAAOC;AAAA,EACP,WAAWC;AAAA,EACX,SAASA;AAAA,EACT,cAAcA;AAAA,EACd,YAAYA;AAAA,EACZ,QAAQ,WAAW;AACjB,QAAIC,IAAS,CAAC,CAACP,GAAIC,CAAE,GAAG,CAACC,GAAIC,CAAE,CAAC;AAChC,WAAAD,IAAKC,IAAK,EAAEF,IAAKD,IAAK,QACfO;AAAA,EACT;AACF;AAEA,SAASF,EAAYG,GAAGC,GAAG;AACzB,EAAID,IAAIR,MAAIA,IAAKQ,IACbA,IAAIN,MAAIA,IAAKM,IACbC,IAAIR,MAAIA,IAAKQ,IACbA,IAAIN,MAAIA,IAAKM;AACnB;","x_google_ignoreList":[0]}