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

package/dist/index.es215.js

@@ -1,168 +1,34 @@
-import Y from "./index.es329.js";
-import { rotateArray as l } from "./index.es216.js";
-import { isGeojsonGeometry as M, geojsonGeometryToPoints as d } from "./index.es330.js";
-import { isGeometry as R, geometryToPoints as w, midPoint as S, rotatePoints as I, rotatePoint as y, distance as f, isEqualPointArray as a } from "./index.es275.js";
-function v(n) {
-  let t = Number.POSITIVE_INFINITY, o = Number.NEGATIVE_INFINITY;
-  for (const r of n)
-    t === void 0 ? r >= r && (t = o = r) : (t > r && (t = r), o < r && (o = r));
-  return [t, o];
-}
-function E(n) {
-  let t;
-  if (R(n))
-    t = w(n);
-  else if (M(n))
-    t = d(n);
-  else
-    throw new Error("Unsupported Geometry");
-  const o = t.map((u) => u[0]), r = t.map((u) => u[1]), [c, e] = v(o), [s, i] = v(r);
-  return [c, s, e, i];
-}
-function V(n, t) {
-  let o;
-  if (R(n))
-    o = w(n);
-  else if (M(n))
-    o = d(n);
-  else
-    throw new Error("Unsupported Geometry");
-  const r = S(...o), c = I(o, t, r), e = E(c), s = G(e), i = p(e), u = y(s, -t, r), h = T(i, u), B = m(h), N = I(B, -t, u);
-  return { center: u, size: i, bbox: h, rectangle: B, rotatedRectangle: N };
-}
-function _(...n) {
-  if (n.length !== 0)
-    return [
-      Math.min(...n.map((t) => t[0])),
-      Math.min(...n.map((t) => t[1])),
-      Math.max(...n.map((t) => t[2])),
-      Math.max(...n.map((t) => t[3]))
-    ];
-}
-function C(n, t) {
-  const o = n[2] >= t[0] && t[2] >= n[0], r = n[3] >= t[1] && t[3] >= n[1];
-  return o && r;
-}
-function k(n, t) {
-  const o = Math.max(n[0], t[0]), r = Math.min(n[2], t[2]), c = Math.max(n[1], t[1]), e = Math.min(n[3], t[3]);
-  if (o < r && c < e)
-    return [o, c, r, e];
-}
-function L(n, t) {
-  return C([n[0], n[1], n[0], n[1]], t);
-}
-function X(n) {
-  const t = m(E(n));
-  return a(t, n) || a(t, l(n, 1)) || a(t, l(n, 2)) || a(t, l(n, 3));
-}
-function D(n) {
-  return n.length == 1 && X(n[0]);
-}
-function q(n, t, o) {
-  return o === void 0 && (o = t), [n[0] - t, n[1] - o, n[2] + t, n[3] + o];
-}
-function J(n, t) {
-  if (!t || t === 1)
-    return n;
-  const o = p(n);
-  return q(n, ...o.map((r) => r * (t - 1) / 2));
-}
-function m(n) {
-  return [
-    [n[0], n[1]],
-    [n[2], n[1]],
-    [n[2], n[3]],
-    [n[0], n[3]]
-  ];
-}
-function K(n) {
-  return [m(n)];
-}
-function Q(n) {
-  return [
-    [n[0], n[1]],
-    [n[2], n[3]]
-  ];
-}
-function G(n) {
-  return [(n[0] + n[2]) / 2, (n[1] + n[3]) / 2];
-}
-function p(n) {
-  return [n[2] - n[0], n[3] - n[1]];
-}
-function P(n) {
-  return [
-    0.5 * (f(n[0], n[1]) + f(n[2], n[3])),
-    0.5 * (f(n[1], n[2]) + f(n[3], n[0]))
-  ];
-}
-function W(n) {
-  if (n.length !== 0)
-    return Y(n);
-}
-function A(n, t, o) {
-  if (o === "contain")
-    return n[0] / n[1] >= t[0] / t[1] ? n[0] / t[0] : n[1] / t[1];
-  if (o === "cover")
-    return n[0] / n[1] >= t[0] / t[1] ? n[1] / t[1] : n[0] / t[0];
-  if (!o || o == "equal")
-    return Math.sqrt(n[0] * n[1] / (t[0] * t[1]));
-  throw new Error("Unknown fit");
-}
-function Z(n, t) {
-  const o = G(n);
-  let r = p(n);
-  return r = O(r, t), T(r, o);
-}
-function O(n, t) {
-  return [n[0] * t, n[1] * t];
-}
-function $(n) {
-  return n[0] * n[1];
-}
-function g(n) {
-  return [n[0] / 2, n[1] / 2];
-}
-function T(n, t) {
-  return t ? [
-    t[0] - n[0] / 2,
-    t[1] - n[1] / 2,
-    t[0] + n[0] / 2,
-    t[1] + n[1] / 2
-  ] : [0, 0, ...n];
-}
-function x(n, t) {
-  return m(T(n, t));
-}
-function z(n, t, o) {
-  return A(P(n), P(t), o);
+function i(e, r) {
+  const t = Array.isArray(e) ? e[0] : e ? e.x : 0, s = Array.isArray(e) ? e[1] : e ? e.y : 0, n = Array.isArray(r) ? r[0] : r ? r.x : 0, f = Array.isArray(r) ? r[1] : r ? r.y : 0;
+  return t === n && s === f;
+}
+function y(e, r) {
+  if (e === r)
+    return !0;
+  if (!e || !r)
+    return !1;
+  if (Array.isArray(e)) {
+    if (!Array.isArray(r) || e.length !== r.length)
+      return !1;
+    for (let t = 0; t < e.length; t++)
+      if (!y(e[t], r[t]))
+        return !1;
+    return !0;
+  } else if (Array.isArray(r))
+    return !1;
+  if (typeof e == "object" && typeof r == "object") {
+    const t = Object.keys(e), s = Object.keys(r);
+    if (t.length !== s.length)
+      return !1;
+    for (const n of t)
+      if (!r.hasOwnProperty(n) || !y(e[n], r[n]))
+        return !1;
+    return !0;
+  }
+  return !1;
 }
 export {
-  G as bboxToCenter,
-  Q as bboxToLine,
-  K as bboxToPolygon,
-  m as bboxToRectangle,
-  p as bboxToSize,
-  q as bufferBbox,
-  J as bufferBboxByRatio,
-  _ as combineBboxes,
-  E as computeBbox,
-  v as computeMinMax,
-  V as computeRotatedBboxProperties,
-  W as convexHull,
-  C as doBboxesIntersect,
-  k as intersectBboxes,
-  L as pointInBbox,
-  D as polygonIsBboxRectangle,
-  P as rectangleToSize,
-  z as rectanglesToScale,
-  X as ringIsBboxRectangle,
-  Z as scaleBbox,
-  O as scaleSize,
-  T as sizeToBbox,
-  g as sizeToCenter,
-  x as sizeToRectangle,
-  $ as sizeToResolution,
-  A as sizesToScale
+  i as arePointsEqual,
+  y as deepEqual
 };
 //# sourceMappingURL=index.es215.js.map

package/dist/index.es215.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es215.js","sources":["../../../node_modules/@allmaps/stdlib/dist/bbox.js"],"sourcesContent":["import monotoneChainConvexHull from 'monotone-chain-convex-hull';\nimport { rotateArray } from './main.js';\nimport { isGeojsonGeometry, geojsonGeometryToPoints } from './geojson.js';\nimport { distance, isGeometry, geometryToPoints, rotatePoints, rotatePoint, midPoint, isEqualPointArray } from './geometry.js';\nexport const MIN_POINT_LNG_LAT_PROJECTION = [-180, -90];\nexport const MAX_POINT_LNG_LAT_PROJECTION = [180, 90];\nexport const MIN_POINT_WEBMERCATOR_PROJECTION = [\n    -20037508.34, -20048966.1\n];\nexport const MAX_POINT_WEBMERCATOR_PROJECTION = [\n    20037508.34, 20048966.1\n];\n// Compute\nexport function computeMinMax(values) {\n    let min = Number.POSITIVE_INFINITY;\n    let max = Number.NEGATIVE_INFINITY;\n    for (const value of values) {\n        if (min === undefined) {\n            if (value >= value)\n                min = max = value;\n        }\n        else {\n            if (min > value)\n                min = value;\n            if (max < value)\n                max = value;\n        }\n    }\n    return [min, max];\n}\nexport function clipValue(value, min, max) {\n    return Math.max(Math.min(value, max), min);\n}\nexport function clipPoint(point, min, max) {\n    return [\n        clipValue(point[0], min[0], max[0]),\n        clipValue(point[1], min[1], max[1])\n    ];\n}\nexport function clipPointLngLatProjection(point) {\n    return clipPoint(point, MIN_POINT_LNG_LAT_PROJECTION, MAX_POINT_LNG_LAT_PROJECTION);\n}\nexport function clipPointWebMercatorProjection(point) {\n    return clipPoint(point, MIN_POINT_WEBMERCATOR_PROJECTION, MAX_POINT_WEBMERCATOR_PROJECTION);\n}\n// Note: bbox order is minX, minY, maxX, maxY\nexport function computeBbox(geometry) {\n    let points;\n    if (isGeometry(geometry)) {\n        points = geometryToPoints(geometry);\n    }\n    else if (isGeojsonGeometry(geometry)) {\n        points = geojsonGeometryToPoints(geometry);\n    }\n    else {\n        throw new Error(`Unsupported Geometry`);\n    }\n    const xs = points.map((point) => point[0]);\n    const ys = points.map((point) => point[1]);\n    const [minX, maxX] = computeMinMax(xs);\n    const [minY, maxY] = computeMinMax(ys);\n    return [minX, minY, maxX, maxY];\n}\n// Takes angle in radians\nexport function computeRotatedBboxProperties(geometry, angle) {\n    let points;\n    if (isGeometry(geometry)) {\n        points = geometryToPoints(geometry);\n    }\n    else if (isGeojsonGeometry(geometry)) {\n        points = geojsonGeometryToPoints(geometry);\n    }\n    else {\n        throw new Error(`Unsupported Geometry`);\n    }\n    // Note: approach similar to Viewport.fromSizeAndProjectedGeoPolygon()\n    // Initially pivot around midpoint\n    const pivot = midPoint(...points);\n    // Rotate points around the pivot and compute bbox and it's center\n    const rotatedPoints = rotatePoints(points, angle, pivot);\n    const rotatedPointsBbox = computeBbox(rotatedPoints);\n    const rotatedPointsBboxCenter = bboxToCenter(rotatedPointsBbox);\n    const size = bboxToSize(rotatedPointsBbox);\n    // Rotate center back around pivot and construct final 'bbox'\n    // (but actually rectangle, since bbox must be horizontal)\n    // around center, using same width and height as rotated bbox\n    const center = rotatePoint(rotatedPointsBboxCenter, -angle, pivot);\n    const bbox = sizeToBbox(size, center);\n    const rectangle = bboxToRectangle(bbox);\n    const rotatedRectangle = rotatePoints(rectangle, -angle, center);\n    return { center, size, bbox, rectangle, rotatedRectangle };\n}\nexport function combineBboxes(...bboxes) {\n    if (bboxes.length === 0) {\n        return undefined;\n    }\n    return [\n        Math.min(...bboxes.map((bbox) => bbox[0])),\n        Math.min(...bboxes.map((bbox) => bbox[1])),\n        Math.max(...bboxes.map((bbox) => bbox[2])),\n        Math.max(...bboxes.map((bbox) => bbox[3]))\n    ];\n}\nexport function doBboxesIntersect(bbox0, bbox1) {\n    const isOverlappingInX = bbox0[2] >= bbox1[0] && bbox1[2] >= bbox0[0];\n    const isOverlappingInY = bbox0[3] >= bbox1[1] && bbox1[3] >= bbox0[1];\n    return isOverlappingInX && isOverlappingInY;\n}\nexport function intersectBboxes(bbox0, bbox1) {\n    const minX = Math.max(bbox0[0], bbox1[0]);\n    const maxX = Math.min(bbox0[2], bbox1[2]);\n    const minY = Math.max(bbox0[1], bbox1[1]);\n    const maxY = Math.min(bbox0[3], bbox1[3]);\n    if (minX < maxX && minY < maxY) {\n        return [minX, minY, maxX, maxY];\n    }\n    else {\n        return undefined;\n    }\n}\nexport function pointInBbox(point, bbox) {\n    return doBboxesIntersect([point[0], point[1], point[0], point[1]], bbox);\n}\nexport function ringIsBboxRectangle(ring) {\n    const rectangle = bboxToRectangle(computeBbox(ring));\n    return (isEqualPointArray(rectangle, ring) ||\n        isEqualPointArray(rectangle, rotateArray(ring, 1)) ||\n        isEqualPointArray(rectangle, rotateArray(ring, 2)) ||\n        isEqualPointArray(rectangle, rotateArray(ring, 3)));\n}\nexport function polygonIsBboxRectangle(polygon) {\n    return polygon.length == 1 && ringIsBboxRectangle(polygon[0]);\n}\nexport function bufferBbox(bbox, dist0, dist1) {\n    if (dist1 === undefined) {\n        dist1 = dist0;\n    }\n    return [bbox[0] - dist0, bbox[1] - dist1, bbox[2] + dist0, bbox[3] + dist1];\n}\n// Ratio 2 adds half the current width (or height) both left and right of the current (width or height)\n// so the total width (or height) goes * 2 and the total surface goes * 4\nexport function bufferBboxByRatio(bbox, ratio) {\n    if (!ratio || ratio === 1) {\n        return bbox;\n    }\n    const size = bboxToSize(bbox);\n    return bufferBbox(bbox, ...size.map((widthOrHeigth) => (widthOrHeigth * (ratio - 1)) / 2));\n}\n// Transform\n// Returns a rectangle with four points, starting from lower left and going anti-clockwise.\nexport function bboxToRectangle(bbox) {\n    return [\n        [bbox[0], bbox[1]],\n        [bbox[2], bbox[1]],\n        [bbox[2], bbox[3]],\n        [bbox[0], bbox[3]]\n    ];\n}\nexport function bboxToPolygon(bbox) {\n    return [bboxToRectangle(bbox)];\n}\nexport function bboxToLine(bbox) {\n    return [\n        [bbox[0], bbox[1]],\n        [bbox[2], bbox[3]]\n    ];\n}\nexport function bboxToDiameter(bbox) {\n    return distance(...bboxToLine(bbox));\n}\nexport function geometryToDiameter(geometry) {\n    return distance(...bboxToLine(computeBbox(geometry)));\n}\nexport function bboxToCenter(bbox) {\n    return [(bbox[0] + bbox[2]) / 2, (bbox[1] + bbox[3]) / 2];\n}\nexport function bboxToSize(bbox) {\n    return [bbox[2] - bbox[0], bbox[3] - bbox[1]];\n}\nexport function bboxToResolution(bbox) {\n    return sizeToResolution(bboxToSize(bbox));\n}\n// Approximate results for quadrilaterals, exact for rectangles (e.g. coming from bboxes).\n// A more precise result would require a minimal-covering-rectangle algorithm\n// Or computing and comparing rectangle surfaces\nexport function rectangleToSize(rectangle) {\n    return [\n        0.5 *\n            (distance(rectangle[0], rectangle[1]) +\n                distance(rectangle[2], rectangle[3])),\n        0.5 *\n            (distance(rectangle[1], rectangle[2]) +\n                distance(rectangle[3], rectangle[0]))\n    ];\n}\n// Convex hull\nexport function convexHull(points) {\n    if (points.length === 0) {\n        return undefined;\n    }\n    return monotoneChainConvexHull(points);\n}\n// Sizes and Scales\n/**\n * Compute a scale from two sizes\n *\n * For unspecified 'fit', the scale is computed based on the surface area derived from the sizes.\n *\n * For specified 'fit':\n *\n * Example for square rectangles bbox0 '*' and bbox1 '.':\n *\n * 'contain' where '*' contains '.'\n * (in the first size0 is relatively wider)\n *\n *                ****\n *                *  *\n *   **....**     ....\n *   * .  . *     .  .\n *   **....**     ....\n *                *  *\n *                ****\n *\n *\n * 'cover' where '*' is covered by '.'\n * (in the first size0 is relatively wider)\n *\n *                ....\n *                .  .\n *   ..****..     ****\n *   . *  * .     *  *\n *   ..****..     ****\n *                .  .\n *                ....\n *\n * 'equal' where '*' is of equal area as '.'\n * (in the first size0 is relatively wider)\n *\n *     ****       ....\n *    .*..*.     *.**.*\n *    .*  *.     *.  .*\n *    .*..*.     *.**.*\n *     ****       ....\n *\n * @export\n * @param size0 - first size\n * @param size1 - second size\n * @param fit - fit\n */\nexport function sizesToScale(size0, size1, fit) {\n    if (fit === 'contain') {\n        return size0[0] / size0[1] >= size1[0] / size1[1] // size0 is relatively wider\n            ? size0[0] / size1[0]\n            : size0[1] / size1[1];\n    }\n    else if (fit === 'cover') {\n        return size0[0] / size0[1] >= size1[0] / size1[1] // size0 is relatively wider\n            ? size0[1] / size1[1]\n            : size0[0] / size1[0];\n    }\n    else if (!fit || fit == 'equal') {\n        return Math.sqrt((size0[0] * size0[1]) / (size1[0] * size1[1]));\n    }\n    else {\n        throw new Error('Unknown fit');\n    }\n}\nexport function scaleBbox(bbox, scale) {\n    const center = bboxToCenter(bbox);\n    let size = bboxToSize(bbox);\n    size = scaleSize(size, scale);\n    return sizeToBbox(size, center);\n}\nexport function scaleSize(size, scale) {\n    return [size[0] * scale, size[1] * scale];\n}\nexport function sizeToResolution(size) {\n    return size[0] * size[1];\n}\nexport function sizeToCenter(size) {\n    return [size[0] / 2, size[1] / 2];\n}\nexport function sizeToBbox(size, center) {\n    // Note: passing no center not the same as passing center [0, 0]\n    if (center) {\n        return [\n            center[0] - size[0] / 2,\n            center[1] - size[1] / 2,\n            center[0] + size[0] / 2,\n            center[1] + size[1] / 2\n        ];\n    }\n    else {\n        return [0, 0, ...size];\n    }\n}\nexport function sizeToRectangle(size, center) {\n    return bboxToRectangle(sizeToBbox(size, center));\n}\nexport function bboxesToScale(bbox0, bbox1, fit) {\n    return sizesToScale(bboxToSize(bbox0), bboxToSize(bbox1), fit);\n}\nexport function rectanglesToScale(rectangle0, rectangle1, fit) {\n    return sizesToScale(rectangleToSize(rectangle0), rectangleToSize(rectangle1), fit);\n}\n"],"names":["computeMinMax","values","min","max","value","computeBbox","geometry","points","isGeometry","geometryToPoints","isGeojsonGeometry","geojsonGeometryToPoints","xs","point","ys","minX","maxX","minY","maxY","computeRotatedBboxProperties","angle","pivot","midPoint","rotatedPoints","rotatePoints","rotatedPointsBbox","rotatedPointsBboxCenter","bboxToCenter","size","bboxToSize","center","rotatePoint","bbox","sizeToBbox","rectangle","bboxToRectangle","rotatedRectangle","combineBboxes","bboxes","doBboxesIntersect","bbox0","bbox1","isOverlappingInX","isOverlappingInY","intersectBboxes","pointInBbox","ringIsBboxRectangle","ring","isEqualPointArray","rotateArray","polygonIsBboxRectangle","polygon","bufferBbox","dist0","dist1","bufferBboxByRatio","ratio","widthOrHeigth","bboxToPolygon","bboxToLine","rectangleToSize","distance","convexHull","monotoneChainConvexHull","sizesToScale","size0","size1","fit","scaleBbox","scale","scaleSize","sizeToResolution","sizeToCenter","sizeToRectangle","rectanglesToScale","rectangle0","rectangle1"],"mappings":";;;;AAaO,SAASA,EAAcC,GAAQ;AAClC,MAAIC,IAAM,OAAO,mBACbC,IAAM,OAAO;AACjB,aAAWC,KAASH;AAChB,IAAIC,MAAQ,SACJE,KAASA,MACTF,IAAMC,IAAMC,MAGZF,IAAME,MACNF,IAAME,IACND,IAAMC,MACND,IAAMC;AAGlB,SAAO,CAACF,GAAKC,CAAG;AACpB;AAiBO,SAASE,EAAYC,GAAU;AAClC,MAAIC;AACJ,MAAIC,EAAWF,CAAQ;AACnB,IAAAC,IAASE,EAAiBH,CAAQ;AAAA,WAE7BI,EAAkBJ,CAAQ;AAC/B,IAAAC,IAASI,EAAwBL,CAAQ;AAAA;AAGzC,UAAM,IAAI,MAAM,sBAAsB;AAE1C,QAAMM,IAAKL,EAAO,IAAI,CAACM,MAAUA,EAAM,CAAC,CAAC,GACnCC,IAAKP,EAAO,IAAI,CAACM,MAAUA,EAAM,CAAC,CAAC,GACnC,CAACE,GAAMC,CAAI,IAAIhB,EAAcY,CAAE,GAC/B,CAACK,GAAMC,CAAI,IAAIlB,EAAcc,CAAE;AACrC,SAAO,CAACC,GAAME,GAAMD,GAAME,CAAI;AAClC;AAEO,SAASC,EAA6Bb,GAAUc,GAAO;AAC1D,MAAIb;AACJ,MAAIC,EAAWF,CAAQ;AACnB,IAAAC,IAASE,EAAiBH,CAAQ;AAAA,WAE7BI,EAAkBJ,CAAQ;AAC/B,IAAAC,IAASI,EAAwBL,CAAQ;AAAA;AAGzC,UAAM,IAAI,MAAM,sBAAsB;AAI1C,QAAMe,IAAQC,EAAS,GAAGf,CAAM,GAE1BgB,IAAgBC,EAAajB,GAAQa,GAAOC,CAAK,GACjDI,IAAoBpB,EAAYkB,CAAa,GAC7CG,IAA0BC,EAAaF,CAAiB,GACxDG,IAAOC,EAAWJ,CAAiB,GAInCK,IAASC,EAAYL,GAAyB,CAACN,GAAOC,CAAK,GAC3DW,IAAOC,EAAWL,GAAME,CAAM,GAC9BI,IAAYC,EAAgBH,CAAI,GAChCI,IAAmBZ,EAAaU,GAAW,CAACd,GAAOU,CAAM;AAC/D,SAAO,EAAE,QAAAA,GAAQ,MAAAF,GAAM,MAAAI,GAAM,WAAAE,GAAW,kBAAAE,EAAA;AAC5C;AACO,SAASC,KAAiBC,GAAQ;AACrC,MAAIA,EAAO,WAAW;AAGtB,WAAO;AAAA,MACH,KAAK,IAAI,GAAGA,EAAO,IAAI,CAACN,MAASA,EAAK,CAAC,CAAC,CAAC;AAAA,MACzC,KAAK,IAAI,GAAGM,EAAO,IAAI,CAACN,MAASA,EAAK,CAAC,CAAC,CAAC;AAAA,MACzC,KAAK,IAAI,GAAGM,EAAO,IAAI,CAACN,MAASA,EAAK,CAAC,CAAC,CAAC;AAAA,MACzC,KAAK,IAAI,GAAGM,EAAO,IAAI,CAACN,MAASA,EAAK,CAAC,CAAC,CAAC;AAAA,IAAA;AAEjD;AACO,SAASO,EAAkBC,GAAOC,GAAO;AAC5C,QAAMC,IAAmBF,EAAM,CAAC,KAAKC,EAAM,CAAC,KAAKA,EAAM,CAAC,KAAKD,EAAM,CAAC,GAC9DG,IAAmBH,EAAM,CAAC,KAAKC,EAAM,CAAC,KAAKA,EAAM,CAAC,KAAKD,EAAM,CAAC;AACpE,SAAOE,KAAoBC;AAC/B;AACO,SAASC,EAAgBJ,GAAOC,GAAO;AAC1C,QAAM1B,IAAO,KAAK,IAAIyB,EAAM,CAAC,GAAGC,EAAM,CAAC,CAAC,GAClCzB,IAAO,KAAK,IAAIwB,EAAM,CAAC,GAAGC,EAAM,CAAC,CAAC,GAClCxB,IAAO,KAAK,IAAIuB,EAAM,CAAC,GAAGC,EAAM,CAAC,CAAC,GAClCvB,IAAO,KAAK,IAAIsB,EAAM,CAAC,GAAGC,EAAM,CAAC,CAAC;AACxC,MAAI1B,IAAOC,KAAQC,IAAOC;AACtB,WAAO,CAACH,GAAME,GAAMD,GAAME,CAAI;AAKtC;AACO,SAAS2B,EAAYhC,GAAOmB,GAAM;AACrC,SAAOO,EAAkB,CAAC1B,EAAM,CAAC,GAAGA,EAAM,CAAC,GAAGA,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC,GAAGmB,CAAI;AAC3E;AACO,SAASc,EAAoBC,GAAM;AACtC,QAAMb,IAAYC,EAAgB9B,EAAY0C,CAAI,CAAC;AACnD,SAAQC,EAAkBd,GAAWa,CAAI,KACrCC,EAAkBd,GAAWe,EAAYF,GAAM,CAAC,CAAC,KACjDC,EAAkBd,GAAWe,EAAYF,GAAM,CAAC,CAAC,KACjDC,EAAkBd,GAAWe,EAAYF,GAAM,CAAC,CAAC;AACzD;AACO,SAASG,EAAuBC,GAAS;AAC5C,SAAOA,EAAQ,UAAU,KAAKL,EAAoBK,EAAQ,CAAC,CAAC;AAChE;AACO,SAASC,EAAWpB,GAAMqB,GAAOC,GAAO;AAC3C,SAAIA,MAAU,WACVA,IAAQD,IAEL,CAACrB,EAAK,CAAC,IAAIqB,GAAOrB,EAAK,CAAC,IAAIsB,GAAOtB,EAAK,CAAC,IAAIqB,GAAOrB,EAAK,CAAC,IAAIsB,CAAK;AAC9E;AAGO,SAASC,EAAkBvB,GAAMwB,GAAO;AAC3C,MAAI,CAACA,KAASA,MAAU;AACpB,WAAOxB;AAEX,QAAMJ,IAAOC,EAAWG,CAAI;AAC5B,SAAOoB,EAAWpB,GAAM,GAAGJ,EAAK,IAAI,CAAC6B,MAAmBA,KAAiBD,IAAQ,KAAM,CAAC,CAAC;AAC7F;AAGO,SAASrB,EAAgBH,GAAM;AAClC,SAAO;AAAA,IACH,CAACA,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,IACjB,CAACA,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,IACjB,CAACA,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,IACjB,CAACA,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,EAAA;AAEzB;AACO,SAAS0B,EAAc1B,GAAM;AAChC,SAAO,CAACG,EAAgBH,CAAI,CAAC;AACjC;AACO,SAAS2B,EAAW3B,GAAM;AAC7B,SAAO;AAAA,IACH,CAACA,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,IACjB,CAACA,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,EAAA;AAEzB;AAOO,SAASL,EAAaK,GAAM;AAC/B,SAAO,EAAEA,EAAK,CAAC,IAAIA,EAAK,CAAC,KAAK,IAAIA,EAAK,CAAC,IAAIA,EAAK,CAAC,KAAK,CAAC;AAC5D;AACO,SAASH,EAAWG,GAAM;AAC7B,SAAO,CAACA,EAAK,CAAC,IAAIA,EAAK,CAAC,GAAGA,EAAK,CAAC,IAAIA,EAAK,CAAC,CAAC;AAChD;AAOO,SAAS4B,EAAgB1B,GAAW;AACvC,SAAO;AAAA,IACH,OACK2B,EAAS3B,EAAU,CAAC,GAAGA,EAAU,CAAC,CAAC,IAChC2B,EAAS3B,EAAU,CAAC,GAAGA,EAAU,CAAC,CAAC;AAAA,IAC3C,OACK2B,EAAS3B,EAAU,CAAC,GAAGA,EAAU,CAAC,CAAC,IAChC2B,EAAS3B,EAAU,CAAC,GAAGA,EAAU,CAAC,CAAC;AAAA,EAAA;AAEnD;AAEO,SAAS4B,EAAWvD,GAAQ;AAC/B,MAAIA,EAAO,WAAW;AAGtB,WAAOwD,EAAwBxD,CAAM;AACzC;AAgDO,SAASyD,EAAaC,GAAOC,GAAOC,GAAK;AAC5C,MAAIA,MAAQ;AACR,WAAOF,EAAM,CAAC,IAAIA,EAAM,CAAC,KAAKC,EAAM,CAAC,IAAIA,EAAM,CAAC,IAC1CD,EAAM,CAAC,IAAIC,EAAM,CAAC,IAClBD,EAAM,CAAC,IAAIC,EAAM,CAAC;AAC5B,MACSC,MAAQ;AACb,WAAOF,EAAM,CAAC,IAAIA,EAAM,CAAC,KAAKC,EAAM,CAAC,IAAIA,EAAM,CAAC,IAC1CD,EAAM,CAAC,IAAIC,EAAM,CAAC,IAClBD,EAAM,CAAC,IAAIC,EAAM,CAAC;AAC5B,MACS,CAACC,KAAOA,KAAO;AACpB,WAAO,KAAK,KAAMF,EAAM,CAAC,IAAIA,EAAM,CAAC,KAAMC,EAAM,CAAC,IAAIA,EAAM,CAAC,EAAE;AAG9D,QAAM,IAAI,MAAM,aAAa;AAErC;AACO,SAASE,EAAUpC,GAAMqC,GAAO;AACnC,QAAMvC,IAASH,EAAaK,CAAI;AAChC,MAAIJ,IAAOC,EAAWG,CAAI;AAC1B,SAAAJ,IAAO0C,EAAU1C,GAAMyC,CAAK,GACrBpC,EAAWL,GAAME,CAAM;AAClC;AACO,SAASwC,EAAU1C,GAAMyC,GAAO;AACnC,SAAO,CAACzC,EAAK,CAAC,IAAIyC,GAAOzC,EAAK,CAAC,IAAIyC,CAAK;AAC5C;AACO,SAASE,EAAiB3C,GAAM;AACnC,SAAOA,EAAK,CAAC,IAAIA,EAAK,CAAC;AAC3B;AACO,SAAS4C,EAAa5C,GAAM;AAC/B,SAAO,CAACA,EAAK,CAAC,IAAI,GAAGA,EAAK,CAAC,IAAI,CAAC;AACpC;AACO,SAASK,EAAWL,GAAME,GAAQ;AAErC,SAAIA,IACO;AAAA,IACHA,EAAO,CAAC,IAAIF,EAAK,CAAC,IAAI;AAAA,IACtBE,EAAO,CAAC,IAAIF,EAAK,CAAC,IAAI;AAAA,IACtBE,EAAO,CAAC,IAAIF,EAAK,CAAC,IAAI;AAAA,IACtBE,EAAO,CAAC,IAAIF,EAAK,CAAC,IAAI;AAAA,EAAA,IAInB,CAAC,GAAG,GAAG,GAAGA,CAAI;AAE7B;AACO,SAAS6C,EAAgB7C,GAAME,GAAQ;AAC1C,SAAOK,EAAgBF,EAAWL,GAAME,CAAM,CAAC;AACnD;AAIO,SAAS4C,EAAkBC,GAAYC,GAAYT,GAAK;AAC3D,SAAOH,EAAaJ,EAAgBe,CAAU,GAAGf,EAAgBgB,CAAU,GAAGT,CAAG;AACrF;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es215.js","sources":["../../../node_modules/@vis.gl/react-maplibre/dist/utils/deep-equal.js"],"sourcesContent":["/**\n * Compare two points\n * @param a\n * @param b\n * @returns true if the points are equal\n */\nexport function arePointsEqual(a, b) {\n    const ax = Array.isArray(a) ? a[0] : a ? a.x : 0;\n    const ay = Array.isArray(a) ? a[1] : a ? a.y : 0;\n    const bx = Array.isArray(b) ? b[0] : b ? b.x : 0;\n    const by = Array.isArray(b) ? b[1] : b ? b.y : 0;\n    return ax === bx && ay === by;\n}\n/* eslint-disable complexity */\n/**\n * Compare any two objects\n * @param a\n * @param b\n * @returns true if the objects are deep equal\n */\nexport function deepEqual(a, b) {\n    if (a === b) {\n        return true;\n    }\n    if (!a || !b) {\n        return false;\n    }\n    if (Array.isArray(a)) {\n        if (!Array.isArray(b) || a.length !== b.length) {\n            return false;\n        }\n        for (let i = 0; i < a.length; i++) {\n            if (!deepEqual(a[i], b[i])) {\n                return false;\n            }\n        }\n        return true;\n    }\n    else if (Array.isArray(b)) {\n        return false;\n    }\n    if (typeof a === 'object' && typeof b === 'object') {\n        const aKeys = Object.keys(a);\n        const bKeys = Object.keys(b);\n        if (aKeys.length !== bKeys.length) {\n            return false;\n        }\n        for (const key of aKeys) {\n            if (!b.hasOwnProperty(key)) {\n                return false;\n            }\n            if (!deepEqual(a[key], b[key])) {\n                return false;\n            }\n        }\n        return true;\n    }\n    return false;\n}\n//# sourceMappingURL=deep-equal.js.map"],"names":["arePointsEqual","a","b","ax","ay","bx","by","deepEqual","i","aKeys","bKeys","key"],"mappings":"AAMO,SAASA,EAAeC,GAAGC,GAAG;AACjC,QAAMC,IAAK,MAAM,QAAQF,CAAC,IAAIA,EAAE,CAAC,IAAIA,IAAIA,EAAE,IAAI,GACzCG,IAAK,MAAM,QAAQH,CAAC,IAAIA,EAAE,CAAC,IAAIA,IAAIA,EAAE,IAAI,GACzCI,IAAK,MAAM,QAAQH,CAAC,IAAIA,EAAE,CAAC,IAAIA,IAAIA,EAAE,IAAI,GACzCI,IAAK,MAAM,QAAQJ,CAAC,IAAIA,EAAE,CAAC,IAAIA,IAAIA,EAAE,IAAI;AAC/C,SAAOC,MAAOE,KAAMD,MAAOE;AAC/B;AAQO,SAASC,EAAUN,GAAGC,GAAG;AAC5B,MAAID,MAAMC;AACN,WAAO;AAEX,MAAI,CAACD,KAAK,CAACC;AACP,WAAO;AAEX,MAAI,MAAM,QAAQD,CAAC,GAAG;AAClB,QAAI,CAAC,MAAM,QAAQC,CAAC,KAAKD,EAAE,WAAWC,EAAE;AACpC,aAAO;AAEX,aAASM,IAAI,GAAGA,IAAIP,EAAE,QAAQO;AAC1B,UAAI,CAACD,EAAUN,EAAEO,CAAC,GAAGN,EAAEM,CAAC,CAAC;AACrB,eAAO;AAGf,WAAO;AAAA,EACX,WACS,MAAM,QAAQN,CAAC;AACpB,WAAO;AAEX,MAAI,OAAOD,KAAM,YAAY,OAAOC,KAAM,UAAU;AAChD,UAAMO,IAAQ,OAAO,KAAKR,CAAC,GACrBS,IAAQ,OAAO,KAAKR,CAAC;AAC3B,QAAIO,EAAM,WAAWC,EAAM;AACvB,aAAO;AAEX,eAAWC,KAAOF;AAId,UAHI,CAACP,EAAE,eAAeS,CAAG,KAGrB,CAACJ,EAAUN,EAAEU,CAAG,GAAGT,EAAES,CAAG,CAAC;AACzB,eAAO;AAGf,WAAO;AAAA,EACX;AACA,SAAO;AACX;","x_google_ignoreList":[0]}

package/dist/index.es216.js

@@ -1,75 +1,17 @@
-import c from "./index.es323.js";
-import s from "./index.es332.js";
-function p(t) {
-  return t * (Math.PI / 180);
-}
-function g(t) {
-  return t * (180 / Math.PI);
-}
-function m(t) {
-  return Math.atan2(t[1][1] - t[0][1], t[1][0] - t[0][0]);
-}
-function M(...t) {
-  if (t.length == 0)
-    throw new Error("Can't compute mean of empty array");
-  return Math.atan2(t.reduce((e, n) => e + Math.sin(n), 0) / t.length, t.reduce((e, n) => e + Math.cos(n), 0) / t.length);
-}
-function d(t, e) {
-  return Array.from({ length: t.length }, (n, r) => t[(r + e) % t.length]);
-}
-function k(t, e, n = (r, o) => r == o) {
-  if (t === e)
-    return !0;
-  if (!t || !e || t.length !== e.length)
-    return !1;
-  for (let r = 0; r < t.length; r++)
-    if (!n(t[r], e[r]))
-      return !1;
-  return !0;
-}
-function w(t, e) {
-  for (let n = 0; n < e.length; n++)
-    if (t.indexOf(e[n]) === -1)
-      return !1;
-  return !0;
-}
-function A(t, e) {
-  return !t || !e || t.size !== e.size ? !1 : [...t].every((n) => e.has(n));
-}
-function E(t, e, n) {
-  const r = {};
-  if (n && n.length === 0)
-    return r;
-  const o = /* @__PURE__ */ new Map();
-  let u = t ? Object.keys(t) : [];
-  n && (u = u.filter((f) => n.includes(f)));
-  const l = e ? Object.keys(e) : [];
-  for (const f of l)
-    Object.prototype.hasOwnProperty.call(e, f) && o.set(f, e[f]);
-  for (const f of u) {
-    if (!Object.prototype.hasOwnProperty.call(t, f))
-      continue;
-    const i = t[f];
-    (!o.has(f) || !s(i, o.get(f))) && (r[f] = i);
-  }
-  return r;
-}
-function q(t, e) {
-  const n = c(t);
-  for (const r of e)
-    delete n[r];
-  return n;
+function c(t, o) {
+  if (t === o)
+    return null;
+  const f = r(t), i = r(o), n = [];
+  for (const s of i)
+    f.has(s) || n.push(s);
+  for (const s of f)
+    i.has(s) || n.push(s);
+  return n.length === 0 ? null : n;
+}
+function r(t) {
+  return new Set(t ? t.trim().split(/\s+/) : []);
 }
 export {
-  m as angle,
-  M as angularMean,
-  p as degreesToRadians,
-  A as equalSet,
-  k as isEqualArray,
-  E as objectDifference,
-  q as omit,
-  g as radiansToDegrees,
-  d as rotateArray,
-  w as subSetArray
+  c as compareClassNames
 };
 //# sourceMappingURL=index.es216.js.map

package/dist/index.es216.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es216.js","sources":["../../../node_modules/@allmaps/stdlib/dist/main.js"],"sourcesContent":["import { isEqual, cloneDeep } from 'lodash-es';\nexport function degreesToRadians(degrees) {\n    return degrees * (Math.PI / 180);\n}\nexport function radiansToDegrees(radians) {\n    return radians * (180 / Math.PI);\n}\n// Returns angle in radians\nexport function angle(line) {\n    return Math.atan2(line[1][1] - line[0][1], line[1][0] - line[0][0]);\n}\n// Takes and returns angle in radians\nexport function angularMean(...angles) {\n    if (angles.length == 0) {\n        throw new Error(\"Can't compute mean of empty array\");\n    }\n    return Math.atan2(angles.reduce((sum, angle) => sum + Math.sin(angle), 0) / angles.length, angles.reduce((sum, angle) => sum + Math.cos(angle), 0) / angles.length);\n}\n// Define vanilla groupBy function, since official one is only baseline 2024\n// See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/groupBy\n// Vanilla code from https://stackoverflow.com/a/62765924/2386673\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nexport function groupBy(arr, key) {\n    return arr.reduce((groups, item) => {\n        ;\n        (groups[key(item)] ||= []).push(item);\n        return groups;\n    }, {});\n}\n// From rotateArray([a, b, c, d], 1) => [b, c, d, a]\nexport function rotateArray(array, offset) {\n    return Array.from({ length: array.length }, (_, i) => array[(i + offset) % array.length]);\n}\nexport function isEqualArray(array0, array1, isEqualObject = (t0, t1) => t0 == t1) {\n    if (array0 === array1)\n        return true;\n    if (!array0 || !array1)\n        return false;\n    if (array0.length !== array1.length) {\n        return false;\n    }\n    for (let i = 0; i < array0.length; i++) {\n        if (!isEqualObject(array0[i], array1[i])) {\n            return false;\n        }\n    }\n    return true;\n}\n// Returns objects in array0 that are not in array1\nexport function arrayDifference(array0, array1, isEqualObject = (t0, t1) => t0 == t1) {\n    const result = [];\n    for (let i = 0; i < array0.length; i++) {\n        let found = false;\n        for (let j = 0; j < array1.length; j++) {\n            if (isEqualObject(array0[i], array1[j])) {\n                found = true;\n                break;\n            }\n        }\n        if (!found) {\n            result.push(array0[i]);\n        }\n    }\n    return result;\n}\nexport function arrayUnique(array, isEqualObject = (t0, t1) => t0 == t1) {\n    const result = [];\n    for (let i = 0; i < array.length; i++) {\n        let found = false;\n        for (let j = 0; j < i; j++) {\n            if (isEqualObject(array[i], array[j])) {\n                found = true;\n                break;\n            }\n        }\n        if (!found) {\n            result.push(array[i]);\n        }\n    }\n    return result;\n}\nexport function arrayRepeated(array, isEqualObject = (t0, t1) => t0 == t1) {\n    const result = [];\n    for (let i = 0; i < array.length; i++) {\n        let found = false;\n        for (let j = 0; j < i; j++) {\n            if (isEqualObject(array[i], array[j])) {\n                found = true;\n                break;\n            }\n        }\n        if (found) {\n            result.push({ item: array[i], index: i });\n        }\n    }\n    return result;\n}\nexport function arrayContains(array, object, isEqualObject = (t0, t1) => t0 == t1) {\n    for (let i = 0; i < array.length; i++) {\n        if (isEqualObject(array[i], object)) {\n            return { item: array[i], index: i };\n        }\n    }\n    return undefined;\n}\n// TODO: replace with Set subset once available\n// Note: this checks equality of the object\n// which is only a good idea for primitive types (string, number), not JSON objects\nexport function subSetArray(arr1, arr2) {\n    for (let i = 0; i < arr2.length; i++) {\n        if (arr1.indexOf(arr2[i]) === -1) {\n            return false;\n        }\n    }\n    return true;\n}\n// TODO: Replace with Set equality once available\n// Note: this checks equality of the object\n// which is only a good idea for primitive types (string, number), not JSON objects\nexport function equalSet(set1, set2) {\n    if (!set1 || !set2) {\n        return false;\n    }\n    if (set1.size !== set2.size) {\n        return false;\n    }\n    return [...set1].every((x) => set2.has(x));\n}\n// Compare two objects, and return an object with all (key, value) pairs from the new object\n// that are (deeply) different from the base object\nexport function objectDifference(newObject, baseObject, objectKeysPossiblyChanged) {\n    const result = {};\n    if (objectKeysPossiblyChanged && objectKeysPossiblyChanged.length === 0) {\n        return result;\n    }\n    const baseEntries = new Map();\n    let newKeys = newObject ? Object.keys(newObject) : [];\n    if (objectKeysPossiblyChanged) {\n        newKeys = newKeys.filter((k) => objectKeysPossiblyChanged.includes(k));\n    }\n    const baseKeys = baseObject ? Object.keys(baseObject) : [];\n    for (const key of baseKeys) {\n        if (Object.prototype.hasOwnProperty.call(baseObject, key)) {\n            baseEntries.set(key, baseObject[key]);\n        }\n    }\n    for (const key of newKeys) {\n        if (!Object.prototype.hasOwnProperty.call(newObject, key))\n            continue;\n        const newVal = newObject[key];\n        if (!baseEntries.has(key) || !isEqual(newVal, baseEntries.get(key))) {\n            result[key] = newVal;\n        }\n    }\n    return result;\n}\n// export function objectOmitDifference(\n//   newObject: object,\n//   baseObject: object\n// ): object {\n//   const keysToOmit = Object.keys(objectDifference(newObject, baseObject))\n//   return pick(newObject, keysToOmit)\n// }\n// Basic omit function as replacement for lodash omit, since it will be removed in v5\n// See: https://github.com/lodash/lodash/issues/2930#issuecomment-272298477\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nexport function omit(object, keys) {\n    const result = cloneDeep(object);\n    for (const key of keys) {\n        delete result[key];\n    }\n    return result;\n}\nexport function isValidHttpUrl(string) {\n    let url;\n    try {\n        url = new URL(string);\n    }\n    catch (_) {\n        return false;\n    }\n    return url.protocol === 'http:' || url.protocol === 'https:';\n}\nexport function camelCaseToWords(string) {\n    const result = string.replace(/([A-Z])/g, ' $1');\n    return result.charAt(0).toUpperCase() + result.slice(1);\n}\n"],"names":["degreesToRadians","degrees","radiansToDegrees","radians","angle","line","angularMean","angles","sum","rotateArray","array","offset","_","i","isEqualArray","array0","array1","isEqualObject","t0","t1","subSetArray","arr1","arr2","equalSet","set1","set2","x","objectDifference","newObject","baseObject","objectKeysPossiblyChanged","result","baseEntries","newKeys","k","baseKeys","key","newVal","isEqual","omit","object","keys","cloneDeep"],"mappings":";;AACO,SAASA,EAAiBC,GAAS;AACtC,SAAOA,KAAW,KAAK,KAAK;AAChC;AACO,SAASC,EAAiBC,GAAS;AACtC,SAAOA,KAAW,MAAM,KAAK;AACjC;AAEO,SAASC,EAAMC,GAAM;AACxB,SAAO,KAAK,MAAMA,EAAK,CAAC,EAAE,CAAC,IAAIA,EAAK,CAAC,EAAE,CAAC,GAAGA,EAAK,CAAC,EAAE,CAAC,IAAIA,EAAK,CAAC,EAAE,CAAC,CAAC;AACtE;AAEO,SAASC,KAAeC,GAAQ;AACnC,MAAIA,EAAO,UAAU;AACjB,UAAM,IAAI,MAAM,mCAAmC;AAEvD,SAAO,KAAK,MAAMA,EAAO,OAAO,CAACC,GAAKJ,MAAUI,IAAM,KAAK,IAAIJ,CAAK,GAAG,CAAC,IAAIG,EAAO,QAAQA,EAAO,OAAO,CAACC,GAAKJ,MAAUI,IAAM,KAAK,IAAIJ,CAAK,GAAG,CAAC,IAAIG,EAAO,MAAM;AACtK;AAaO,SAASE,EAAYC,GAAOC,GAAQ;AACvC,SAAO,MAAM,KAAK,EAAE,QAAQD,EAAM,OAAA,GAAU,CAACE,GAAGC,MAAMH,GAAOG,IAAIF,KAAUD,EAAM,MAAM,CAAC;AAC5F;AACO,SAASI,EAAaC,GAAQC,GAAQC,IAAgB,CAACC,GAAIC,MAAOD,KAAMC,GAAI;AAC/E,MAAIJ,MAAWC;AACX,WAAO;AAGX,MAFI,CAACD,KAAU,CAACC,KAEZD,EAAO,WAAWC,EAAO;AACzB,WAAO;AAEX,WAASH,IAAI,GAAGA,IAAIE,EAAO,QAAQF;AAC/B,QAAI,CAACI,EAAcF,EAAOF,CAAC,GAAGG,EAAOH,CAAC,CAAC;AACnC,aAAO;AAGf,SAAO;AACX;AA6DO,SAASO,EAAYC,GAAMC,GAAM;AACpC,WAAST,IAAI,GAAGA,IAAIS,EAAK,QAAQT;AAC7B,QAAIQ,EAAK,QAAQC,EAAKT,CAAC,CAAC,MAAM;AAC1B,aAAO;AAGf,SAAO;AACX;AAIO,SAASU,EAASC,GAAMC,GAAM;AAIjC,SAHI,CAACD,KAAQ,CAACC,KAGVD,EAAK,SAASC,EAAK,OACZ,KAEJ,CAAC,GAAGD,CAAI,EAAE,MAAM,CAACE,MAAMD,EAAK,IAAIC,CAAC,CAAC;AAC7C;AAGO,SAASC,EAAiBC,GAAWC,GAAYC,GAA2B;AAC/E,QAAMC,IAAS,CAAA;AACf,MAAID,KAA6BA,EAA0B,WAAW;AAClE,WAAOC;AAEX,QAAMC,wBAAkB,IAAA;AACxB,MAAIC,IAAUL,IAAY,OAAO,KAAKA,CAAS,IAAI,CAAA;AACnD,EAAIE,MACAG,IAAUA,EAAQ,OAAO,CAACC,MAAMJ,EAA0B,SAASI,CAAC,CAAC;AAEzE,QAAMC,IAAWN,IAAa,OAAO,KAAKA,CAAU,IAAI,CAAA;AACxD,aAAWO,KAAOD;AACd,IAAI,OAAO,UAAU,eAAe,KAAKN,GAAYO,CAAG,KACpDJ,EAAY,IAAII,GAAKP,EAAWO,CAAG,CAAC;AAG5C,aAAWA,KAAOH,GAAS;AACvB,QAAI,CAAC,OAAO,UAAU,eAAe,KAAKL,GAAWQ,CAAG;AACpD;AACJ,UAAMC,IAAST,EAAUQ,CAAG;AAC5B,KAAI,CAACJ,EAAY,IAAII,CAAG,KAAK,CAACE,EAAQD,GAAQL,EAAY,IAAII,CAAG,CAAC,OAC9DL,EAAOK,CAAG,IAAIC;AAAA,EAEtB;AACA,SAAON;AACX;AAWO,SAASQ,EAAKC,GAAQC,GAAM;AAC/B,QAAMV,IAASW,EAAUF,CAAM;AAC/B,aAAWJ,KAAOK;AACd,WAAOV,EAAOK,CAAG;AAErB,SAAOL;AACX;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es216.js","sources":["../../../node_modules/@vis.gl/react-maplibre/dist/utils/compare-class-names.js"],"sourcesContent":["/** Compare two classNames string and return the difference */\nexport function compareClassNames(prevClassName, nextClassName) {\n    if (prevClassName === nextClassName) {\n        return null;\n    }\n    const prevClassList = getClassList(prevClassName);\n    const nextClassList = getClassList(nextClassName);\n    const diff = [];\n    for (const c of nextClassList) {\n        if (!prevClassList.has(c)) {\n            diff.push(c);\n        }\n    }\n    for (const c of prevClassList) {\n        if (!nextClassList.has(c)) {\n            diff.push(c);\n        }\n    }\n    return diff.length === 0 ? null : diff;\n}\nfunction getClassList(className) {\n    return new Set(className ? className.trim().split(/\\s+/) : []);\n}\n//# sourceMappingURL=compare-class-names.js.map"],"names":["compareClassNames","prevClassName","nextClassName","prevClassList","getClassList","nextClassList","diff","c","className"],"mappings":"AACO,SAASA,EAAkBC,GAAeC,GAAe;AAC5D,MAAID,MAAkBC;AAClB,WAAO;AAEX,QAAMC,IAAgBC,EAAaH,CAAa,GAC1CI,IAAgBD,EAAaF,CAAa,GAC1CI,IAAO,CAAA;AACb,aAAWC,KAAKF;AACZ,IAAKF,EAAc,IAAII,CAAC,KACpBD,EAAK,KAAKC,CAAC;AAGnB,aAAWA,KAAKJ;AACZ,IAAKE,EAAc,IAAIE,CAAC,KACpBD,EAAK,KAAKC,CAAC;AAGnB,SAAOD,EAAK,WAAW,IAAI,OAAOA;AACtC;AACA,SAASF,EAAaI,GAAW;AAC7B,SAAO,IAAI,IAAIA,IAAYA,EAAU,KAAA,EAAO,MAAM,KAAK,IAAI,EAAE;AACjE;","x_google_ignoreList":[0]}

package/dist/index.es217.js

@@ -1,53 +1,8 @@
-function l(n, ...e) {
-  const r = e.length;
-  if (r === 0)
-    return n;
-  if (r === 1) {
-    const t = e[0];
-    return t == null ? n : { ...n, ...t };
-  }
-  let f = !1;
-  for (let t = 0; t < r; t++)
-    if (e[t] != null) {
-      f = !0;
-      break;
-    }
-  return f ? {
-    ...n,
-    ...i(...e)
-  } : n;
-}
-function i(...n) {
-  const e = n.filter((r) => r != null);
-  return e.length === 0 ? {} : e.length === 1 ? e[0] : Object.assign({}, ...e);
-}
-function o(...n) {
-  const e = {};
-  for (let r = 0; r < n.length; r++) {
-    const f = n[r];
-    if (f)
-      for (const t in f) {
-        const u = f[t];
-        u !== void 0 && (e[t] = u);
-      }
-  }
-  return e;
-}
-function c(n, ...e) {
-  return {
-    ...n,
-    ...o(...e)
-  };
-}
-function d(n) {
-  if (n !== void 0)
-    return n.reduce((e, r) => (e[r] = void 0, e), {});
+function e(r, t) {
+  if (!r)
+    throw new Error(t);
 }
 export {
-  l as mergeOptions,
-  c as mergeOptionsUnlessUndefined,
-  i as mergePartialOptions,
-  d as optionKeysToUndefinedOptions,
-  o as removeUndefinedOptions
+  e as default
 };
 //# sourceMappingURL=index.es217.js.map

package/dist/index.es217.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es217.js","sources":["../../../node_modules/@allmaps/stdlib/dist/options.js"],"sourcesContent":["/* eslint-disable @typescript-eslint/no-explicit-any */\nexport function mergeOptions(baseOptions, ...additionalPartialOptions) {\n    // A specific function for merging options:\n    // - Assure the output extends the type of the first element (e.g. default options)\n    // - Speedup: spreading is a little expensive, so it checks if necessary first\n    // (e.g. it was previously executed for every point in transform,\n    // where this was a 50% speed increase when transforming a lot of points\n    // - Allow additionalOptions to be undefined, which simplifies handing over a simple spread\n    const len = additionalPartialOptions.length;\n    // Fast path: no additional options\n    if (len === 0) {\n        return baseOptions;\n    }\n    // Fast path: single additional option (most common case)\n    // Avoids the mergePartialOptions call and its internal spread\n    if (len === 1) {\n        const only = additionalPartialOptions[0];\n        if (only == null)\n            return baseOptions;\n        return { ...baseOptions, ...only };\n    }\n    let hasAdditional = false;\n    for (let i = 0; i < len; i++) {\n        if (additionalPartialOptions[i] != null) {\n            hasAdditional = true;\n            break;\n        }\n    }\n    if (!hasAdditional)\n        return baseOptions;\n    return {\n        ...baseOptions,\n        ...mergePartialOptions(...additionalPartialOptions)\n    };\n}\nexport function mergePartialOptions(...partialOptions) {\n    const definedPartialOptionsArray = partialOptions.filter((partialOptions) => partialOptions !== undefined && partialOptions !== null);\n    if (definedPartialOptionsArray.length === 0) {\n        return {};\n    }\n    else if (definedPartialOptionsArray.length === 1) {\n        return definedPartialOptionsArray[0];\n    }\n    else {\n        // This spreads out eacht of the partialOptions\n        return Object.assign({}, ...definedPartialOptionsArray);\n    }\n}\nexport function removeUndefinedOptions(...optionsArray) {\n    const mergedOptions = {};\n    for (let i = 0; i < optionsArray.length; i++) {\n        const options = optionsArray[i];\n        if (!options)\n            continue;\n        for (const key in options) {\n            const value = options[key];\n            if (value !== undefined) {\n                mergedOptions[key] = value;\n            }\n        }\n    }\n    return mergedOptions;\n}\n// Note: not using Exclude here like we do in removeUndefinedOptions,\n// since TypeScript often inferes too strict types\nexport function mergeOptionsUnlessUndefined(baseOptions, ...additionalOptions) {\n    return {\n        ...baseOptions,\n        ...removeUndefinedOptions(...additionalOptions)\n    };\n}\nexport function mergeTwoOptionsUnlessUndefined(baseOptions, additionalOption) {\n    if (!additionalOption || Object.keys(additionalOption).length === 0) {\n        return baseOptions;\n    }\n    // Build a filtered copy, excluding omitted keys and undefined values\n    const filtered = {};\n    for (const key in additionalOption) {\n        if (additionalOption[key] !== undefined) {\n            filtered[key] = additionalOption[key];\n        }\n    }\n    return {\n        ...baseOptions,\n        ...filtered\n    };\n}\nexport function optionKeysToUndefinedOptions(optionKeys) {\n    if (optionKeys === undefined) {\n        return undefined;\n    }\n    return optionKeys.reduce((acc, curr) => ((acc[curr] = undefined), acc), {});\n}\nexport function optionKeysByMapIdToUndefinedOptionsByMapId(optionKeysByMapId) {\n    if (optionKeysByMapId === undefined) {\n        return undefined;\n    }\n    const optionsByMapId = new Map();\n    for (const mapId of optionKeysByMapId.keys()) {\n        const optionKeys = optionKeysByMapId.get(mapId);\n        optionsByMapId.set(mapId, optionKeysToUndefinedOptions(optionKeys));\n    }\n    return optionsByMapId;\n}\n"],"names":["mergeOptions","baseOptions","additionalPartialOptions","len","only","hasAdditional","i","mergePartialOptions","partialOptions","definedPartialOptionsArray","removeUndefinedOptions","optionsArray","mergedOptions","options","key","value","mergeOptionsUnlessUndefined","additionalOptions","optionKeysToUndefinedOptions","optionKeys","acc","curr"],"mappings":"AACO,SAASA,EAAaC,MAAgBC,GAA0B;AAOnE,QAAMC,IAAMD,EAAyB;AAErC,MAAIC,MAAQ;AACR,WAAOF;AAIX,MAAIE,MAAQ,GAAG;AACX,UAAMC,IAAOF,EAAyB,CAAC;AACvC,WAAIE,KAAQ,OACDH,IACJ,EAAE,GAAGA,GAAa,GAAGG,EAAA;AAAA,EAChC;AACA,MAAIC,IAAgB;AACpB,WAASC,IAAI,GAAGA,IAAIH,GAAKG;AACrB,QAAIJ,EAAyBI,CAAC,KAAK,MAAM;AACrC,MAAAD,IAAgB;AAChB;AAAA,IACJ;AAEJ,SAAKA,IAEE;AAAA,IACH,GAAGJ;AAAA,IACH,GAAGM,EAAoB,GAAGL,CAAwB;AAAA,EAAA,IAH3CD;AAKf;AACO,SAASM,KAAuBC,GAAgB;AACnD,QAAMC,IAA6BD,EAAe,OAAO,CAACA,MAAmDA,KAAmB,IAAI;AACpI,SAAIC,EAA2B,WAAW,IAC/B,CAAA,IAEFA,EAA2B,WAAW,IACpCA,EAA2B,CAAC,IAI5B,OAAO,OAAO,CAAA,GAAI,GAAGA,CAA0B;AAE9D;AACO,SAASC,KAA0BC,GAAc;AACpD,QAAMC,IAAgB,CAAA;AACtB,WAASN,IAAI,GAAGA,IAAIK,EAAa,QAAQL,KAAK;AAC1C,UAAMO,IAAUF,EAAaL,CAAC;AAC9B,QAAKO;AAEL,iBAAWC,KAAOD,GAAS;AACvB,cAAME,IAAQF,EAAQC,CAAG;AACzB,QAAIC,MAAU,WACVH,EAAcE,CAAG,IAAIC;AAAA,MAE7B;AAAA,EACJ;AACA,SAAOH;AACX;AAGO,SAASI,EAA4Bf,MAAgBgB,GAAmB;AAC3E,SAAO;AAAA,IACH,GAAGhB;AAAA,IACH,GAAGS,EAAuB,GAAGO,CAAiB;AAAA,EAAA;AAEtD;AAiBO,SAASC,EAA6BC,GAAY;AACrD,MAAIA,MAAe;AAGnB,WAAOA,EAAW,OAAO,CAACC,GAAKC,OAAWD,EAAIC,CAAI,IAAI,QAAYD,IAAM,CAAA,CAAE;AAC9E;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es217.js","sources":["../../../node_modules/@vis.gl/react-maplibre/dist/utils/assert.js"],"sourcesContent":["export default function assert(condition, message) {\n    if (!condition) {\n        throw new Error(message);\n    }\n}\n//# sourceMappingURL=assert.js.map"],"names":["assert","condition","message"],"mappings":"AAAA,SAAwBA,EAAOC,GAAWC,GAAS;AAC/C,MAAI,CAACD;AACD,UAAM,IAAI,MAAMC,CAAO;AAE/B;","x_google_ignoreList":[0]}