@agrotools1/at-components 0.6.0 → 0.6.3

package/dist/node_modules/.pnpm/@arcgis_core@4.29.10/node_modules/@arcgis/core/core/libs/rbush/PooledRBush.js

@@ -1,275 +0,0 @@
-import { indexOf as F, PositionHint as y } from "../../arrayUtils.js";
-import w from "../../PooledArray.js";
-import { q as A } from "../../../chunks/quickselect.js";
-class N {
-  constructor(t = 9, n) {
-    this._compareMinX = P, this._compareMinY = R, this._toBBox = (e) => e, this._maxEntries = Math.max(4, t || 9), this._minEntries = Math.max(2, Math.ceil(0.4 * this._maxEntries)), n && (typeof n == "function" ? this._toBBox = n : this._initFormat(n)), this.clear();
-  }
-  destroy() {
-    this.clear(), _.prune(), M.prune(), d.prune(), X.prune();
-  }
-  all(t) {
-    this._all(this._data, t);
-  }
-  search(t, n) {
-    let e = this._data;
-    const i = this._toBBox;
-    if (B(t, e))
-      for (_.clear(); e; ) {
-        for (let s = 0, a = e.children.length; s < a; s++) {
-          const r = e.children[s], o = e.leaf ? i(r) : r;
-          B(t, o) && (e.leaf ? n(r) : E(t, o) ? this._all(r, n) : _.push(r));
-        }
-        e = _.pop();
-      }
-  }
-  collides(t) {
-    let n = this._data;
-    const e = this._toBBox;
-    if (!B(t, n))
-      return !1;
-    for (_.clear(); n; ) {
-      for (let i = 0, s = n.children.length; i < s; i++) {
-        const a = n.children[i], r = n.leaf ? e(a) : a;
-        if (B(t, r)) {
-          if (n.leaf || E(t, r))
-            return !0;
-          _.push(a);
-        }
-      }
-      n = _.pop();
-    }
-    return !1;
-  }
-  load(t) {
-    if (!t.length)
-      return this;
-    if (t.length < this._minEntries) {
-      for (let e = 0, i = t.length; e < i; e++)
-        this.insert(t[e]);
-      return this;
-    }
-    let n = this._build(t.slice(0, t.length), 0, t.length - 1, 0);
-    if (this._data.children.length)
-      if (this._data.height === n.height)
-        this._splitRoot(this._data, n);
-      else {
-        if (this._data.height < n.height) {
-          const e = this._data;
-          this._data = n, n = e;
-        }
-        this._insert(n, this._data.height - n.height - 1, !0);
-      }
-    else
-      this._data = n;
-    return this;
-  }
-  insert(t) {
-    return t && this._insert(t, this._data.height - 1), this;
-  }
-  clear() {
-    return this._data = new Y([]), this;
-  }
-  remove(t) {
-    if (!t)
-      return this;
-    let n, e = this._data, i = null, s = 0, a = !1;
-    const r = this._toBBox(t);
-    for (d.clear(), X.clear(); e || d.length > 0; ) {
-      if (e || (e = d.pop(), i = d.data[d.length - 1], s = X.pop() ?? 0, a = !0), e.leaf && (n = F(e.children, t, e.children.length, e.indexHint), n !== -1))
-        return e.children.splice(n, 1), d.push(e), this._condense(d), this;
-      a || e.leaf || !E(e, r) ? i ? (s++, e = i.children[s], a = !1) : e = null : (d.push(e), X.push(s), s = 0, i = e, e = e.children[0]);
-    }
-    return this;
-  }
-  toJSON() {
-    return this._data;
-  }
-  fromJSON(t) {
-    return this._data = t, this;
-  }
-  _all(t, n) {
-    let e = t;
-    for (M.clear(); e; ) {
-      if (e.leaf === !0)
-        for (const i of e.children)
-          n(i);
-      else
-        M.pushArray(e.children);
-      e = M.pop() ?? null;
-    }
-  }
-  _build(t, n, e, i) {
-    const s = e - n + 1;
-    let a = this._maxEntries;
-    if (s <= a) {
-      const l = new Y(t.slice(n, e + 1));
-      return x(l, this._toBBox), l;
-    }
-    i || (i = Math.ceil(Math.log(s) / Math.log(a)), a = Math.ceil(s / a ** (i - 1)));
-    const r = new S([]);
-    r.height = i;
-    const o = Math.ceil(s / a), c = o * Math.ceil(Math.sqrt(a));
-    j(t, n, e, c, this._compareMinX);
-    for (let l = n; l <= e; l += c) {
-      const m = Math.min(l + c - 1, e);
-      j(t, l, m, o, this._compareMinY);
-      for (let u = l; u <= m; u += o) {
-        const H = Math.min(u + o - 1, m);
-        r.children.push(this._build(t, u, H, i - 1));
-      }
-    }
-    return x(r, this._toBBox), r;
-  }
-  _chooseSubtree(t, n, e, i) {
-    for (; i.push(n), n.leaf !== !0 && i.length - 1 !== e; ) {
-      let s, a = 1 / 0, r = 1 / 0;
-      for (let o = 0, c = n.children.length; o < c; o++) {
-        const l = n.children[o], m = b(l), u = D(t, l) - m;
-        u < r ? (r = u, a = m < a ? m : a, s = l) : u === r && m < a && (a = m, s = l);
-      }
-      n = s || n.children[0];
-    }
-    return n;
-  }
-  _insert(t, n, e) {
-    const i = this._toBBox, s = e ? t : i(t);
-    d.clear();
-    const a = this._chooseSubtree(s, this._data, n, d);
-    for (a.children.push(t), p(a, s); n >= 0 && d.data[n].children.length > this._maxEntries; )
-      this._split(d, n), n--;
-    this._adjustParentBBoxes(s, d, n);
-  }
-  _split(t, n) {
-    const e = t.data[n], i = e.children.length, s = this._minEntries;
-    this._chooseSplitAxis(e, s, i);
-    const a = this._chooseSplitIndex(e, s, i);
-    if (!a)
-      return void console.log("  Error: assertion failed at PooledRBush._split: no valid split index");
-    const r = e.children.splice(a, e.children.length - a), o = e.leaf ? new Y(r) : new S(r);
-    o.height = e.height, x(e, this._toBBox), x(o, this._toBBox), n ? t.data[n - 1].children.push(o) : this._splitRoot(e, o);
-  }
-  _splitRoot(t, n) {
-    this._data = new S([t, n]), this._data.height = t.height + 1, x(this._data, this._toBBox);
-  }
-  _chooseSplitIndex(t, n, e) {
-    let i, s, a;
-    i = s = 1 / 0;
-    for (let r = n; r <= e - n; r++) {
-      const o = f(t, 0, r, this._toBBox), c = f(t, r, e, this._toBBox), l = O(o, c), m = b(o) + b(c);
-      l < i ? (i = l, a = r, s = m < s ? m : s) : l === i && m < s && (s = m, a = r);
-    }
-    return a;
-  }
-  _chooseSplitAxis(t, n, e) {
-    const i = t.leaf ? this._compareMinX : P, s = t.leaf ? this._compareMinY : R;
-    this._allDistMargin(t, n, e, i) < this._allDistMargin(t, n, e, s) && t.children.sort(i);
-  }
-  _allDistMargin(t, n, e, i) {
-    t.children.sort(i);
-    const s = this._toBBox, a = f(t, 0, n, s), r = f(t, e - n, e, s);
-    let o = g(a) + g(r);
-    for (let c = n; c < e - n; c++) {
-      const l = t.children[c];
-      p(a, t.leaf ? s(l) : l), o += g(a);
-    }
-    for (let c = e - n - 1; c >= n; c--) {
-      const l = t.children[c];
-      p(r, t.leaf ? s(l) : l), o += g(r);
-    }
-    return o;
-  }
-  _adjustParentBBoxes(t, n, e) {
-    for (let i = e; i >= 0; i--)
-      p(n.data[i], t);
-  }
-  _condense(t) {
-    for (let n = t.length - 1; n >= 0; n--) {
-      const e = t.data[n];
-      if (e.children.length === 0)
-        if (n > 0) {
-          const i = t.data[n - 1], s = i.children;
-          s.splice(F(s, e, s.length, i.indexHint), 1);
-        } else
-          this.clear();
-      else
-        x(e, this._toBBox);
-    }
-  }
-  _initFormat(t) {
-    const n = ["return a", " - b", ";"];
-    this._compareMinX = new Function("a", "b", n.join(t[0])), this._compareMinY = new Function("a", "b", n.join(t[1])), this._toBBox = new Function("a", "return {minX: a" + t[0] + ", minY: a" + t[1] + ", maxX: a" + t[2] + ", maxY: a" + t[3] + "};");
-  }
-}
-function x(h, t) {
-  f(h, 0, h.children.length, t, h);
-}
-function f(h, t, n, e, i) {
-  i || (i = new Y([])), i.minX = 1 / 0, i.minY = 1 / 0, i.maxX = -1 / 0, i.maxY = -1 / 0;
-  for (let s, a = t; a < n; a++)
-    s = h.children[a], p(i, h.leaf ? e(s) : s);
-  return i;
-}
-function p(h, t) {
-  h.minX = Math.min(h.minX, t.minX), h.minY = Math.min(h.minY, t.minY), h.maxX = Math.max(h.maxX, t.maxX), h.maxY = Math.max(h.maxY, t.maxY);
-}
-function P(h, t) {
-  return h.minX - t.minX;
-}
-function R(h, t) {
-  return h.minY - t.minY;
-}
-function b(h) {
-  return (h.maxX - h.minX) * (h.maxY - h.minY);
-}
-function g(h) {
-  return h.maxX - h.minX + (h.maxY - h.minY);
-}
-function D(h, t) {
-  return (Math.max(t.maxX, h.maxX) - Math.min(t.minX, h.minX)) * (Math.max(t.maxY, h.maxY) - Math.min(t.minY, h.minY));
-}
-function O(h, t) {
-  const n = Math.max(h.minX, t.minX), e = Math.max(h.minY, t.minY), i = Math.min(h.maxX, t.maxX), s = Math.min(h.maxY, t.maxY);
-  return Math.max(0, i - n) * Math.max(0, s - e);
-}
-function E(h, t) {
-  return h.minX <= t.minX && h.minY <= t.minY && t.maxX <= h.maxX && t.maxY <= h.maxY;
-}
-function B(h, t) {
-  return t.minX <= h.maxX && t.minY <= h.maxY && t.maxX >= h.minX && t.maxY >= h.minY;
-}
-function j(h, t, n, e, i) {
-  const s = [t, n];
-  for (; s.length; ) {
-    const a = s.pop(), r = s.pop();
-    if (a - r <= e)
-      continue;
-    const o = r + Math.ceil((a - r) / e / 2) * e;
-    A(h, o, r, a, i), s.push(r, o, o, a);
-  }
-}
-const _ = new w(), M = new w(), d = new w(), X = new w({ deallocator: void 0 });
-class $ {
-  constructor() {
-    this.minX = 1 / 0, this.minY = 1 / 0, this.maxX = -1 / 0, this.maxY = -1 / 0;
-  }
-}
-class v extends $ {
-  constructor() {
-    super(...arguments), this.height = 1, this.indexHint = new y();
-  }
-}
-class Y extends v {
-  constructor(t) {
-    super(), this.children = t, this.leaf = !0;
-  }
-}
-class S extends v {
-  constructor(t) {
-    super(), this.children = t, this.leaf = !1;
-  }
-}
-export {
-  $ as BBox,
-  N as PooledRBush
-};

package/dist/node_modules/.pnpm/@arcgis_core@4.29.10/node_modules/@arcgis/core/core/loadAll.js

@@ -1,27 +0,0 @@
-import { map as c, result as f } from "./asyncUtils.js";
-import e from "./Collection.js";
-import u from "./Loadable.js";
-async function h(a, n) {
-  return await a.load(), d(a, n);
-}
-async function d(a, n) {
-  const i = [], t = (...o) => {
-    for (const l of o)
-      l != null && (Array.isArray(l) ? t(...l) : e.isCollection(l) ? l.forEach((s) => t(s)) : u.isLoadable(l) && i.push(l));
-  };
-  n(t);
-  let r = null;
-  if (await c(i, async (o) => {
-    const l = await f(m(o) ? o.loadAll() : o.load());
-    l.ok !== !1 || r || (r = l);
-  }), r)
-    throw r.error;
-  return a;
-}
-function m(a) {
-  return "loadAll" in a && typeof a.loadAll == "function";
-}
-export {
-  h as loadAll,
-  d as loadAllChildren
-};

package/dist/node_modules/.pnpm/@arcgis_core@4.29.10/node_modules/@arcgis/core/core/mathUtils.js

@@ -1,79 +0,0 @@
-import { l as h, s as m } from "../chunks/vec32.js";
-const i = new Float32Array(1);
-function b(n) {
-  --n;
-  for (let a = 1; a < 32; a <<= 1)
-    n |= n >> a;
-  return n + 1;
-}
-function f(n, a, r) {
-  return Math.min(Math.max(n, a), r);
-}
-function d(n) {
-  return n--, n |= n >> 1, n |= n >> 2, n |= n >> 4, n |= n >> 8, n |= n >> 16, ++n;
-}
-function M(n, a, r) {
-  return n + (a - n) * r;
-}
-function x(n, a, r, e, u) {
-  return M(e, u, (n - a) / (r - a));
-}
-function B(n) {
-  return n * Math.PI / 180;
-}
-function P(n) {
-  return 180 * n / Math.PI;
-}
-function A(n) {
-  return Math.acos(f(n, -1, 1));
-}
-function g(n) {
-  return Math.asin(f(n, -1, 1));
-}
-function t(n, a, r = 1e-6) {
-  return n === a ? !0 : !Number.isFinite(n) || !Number.isFinite(a) ? !1 : (n > a ? n - a : a - n) <= r;
-}
-const o = new DataView(new ArrayBuffer(Float64Array.BYTES_PER_ELEMENT));
-function w(n) {
-  return o.setFloat64(0, n), o.getBigInt64(0);
-}
-function F(n) {
-  return o.setBigInt64(0, n), o.getFloat64(0);
-}
-const s = BigInt("1000000");
-p(1);
-function p(n) {
-  const a = w(n = Math.abs(n)), r = F(a <= s ? s : a - s);
-  return Math.abs(n - r);
-}
-function I(n) {
-  return l(Math.max(-c, Math.min(n, c)));
-}
-function l(n) {
-  return i[0] = n, i[0];
-}
-function T(n, a) {
-  const r = h(n), e = g(n[2] / r), u = Math.atan2(n[1] / r, n[0] / r);
-  return m(a, r, e, u), a;
-}
-function N(n) {
-  const a = n[0] * n[0] + n[1] * n[1] + n[2] * n[2], r = n[3] * n[3] + n[4] * n[4] + n[5] * n[5], e = n[6] * n[6] + n[7] * n[7] + n[8] * n[8];
-  return !(t(a, 1) && t(r, 1) && t(e, 1));
-}
-const c = l(34028234663852886e22);
-export {
-  A as acosClamped,
-  g as asinClamped,
-  T as cartesianToSpherical,
-  f as clamp,
-  I as clampFloat32,
-  B as deg2rad,
-  t as floatEqualAbsolute,
-  N as hasScaling,
-  M as lerp,
-  b as nextHighestPowerOfTwo,
-  d as nextPowerOfTwo,
-  c as numberMaxFloat32,
-  P as rad2deg,
-  x as scale
-};

package/dist/node_modules/.pnpm/@arcgis_core@4.29.10/node_modules/@arcgis/core/core/maybe.js

@@ -1,36 +0,0 @@
-function t(e, r) {
-  if (e == null)
-    throw new Error(r ?? "value is None");
-}
-function a(e) {
-  return e == null || e.destroy(), null;
-}
-function s(e) {
-  return e == null || e.dispose(), null;
-}
-function i(e) {
-  return e == null || e.remove(), null;
-}
-function n(e) {
-  return e == null || e.abort(), null;
-}
-function f(e) {
-  return e == null || e.release(), null;
-}
-function b(e, r, l) {
-  return e != null && r != null ? l != null ? l(e, r) : e.equals(r) : e === r;
-}
-function c(e, r) {
-  let l;
-  return e.some((u, o) => (l = r(u, o), l != null)), l ?? void 0;
-}
-export {
-  n as abortMaybe,
-  t as assertIsSome,
-  a as destroyMaybe,
-  s as disposeMaybe,
-  b as equalsMaybe,
-  c as mappedFind,
-  f as releaseMaybe,
-  i as removeMaybe
-};

package/dist/node_modules/.pnpm/@arcgis_core@4.29.10/node_modules/@arcgis/core/core/memoize.js

@@ -1,18 +0,0 @@
-function o(e) {
-  let n, t, i = [], u = !1;
-  function h(...r) {
-    return u && n === this && l(r, i) || (t = e.apply(this, r), n = this, i = r, u = !0), t;
-  }
-  return h;
-}
-function l(e, n) {
-  if (e.length !== n.length)
-    return !1;
-  for (let t = 0; t < e.length; ++t)
-    if (e[t] !== n[t])
-      return !1;
-  return !0;
-}
-export {
-  o as memoize
-};

package/dist/node_modules/.pnpm/@arcgis_core@4.29.10/node_modules/@arcgis/core/core/multiOriginJSONSupportUtils.js

@@ -1,6 +0,0 @@
-function n(i) {
-  return i && "getAtOrigin" in i && "originOf" in i;
-}
-export {
-  n as isMultiOriginJSONMixin
-};

package/dist/node_modules/.pnpm/@arcgis_core@4.29.10/node_modules/@arcgis/core/core/nextTick.js

@@ -1,12 +0,0 @@
-const t = [];
-function e(o) {
-  t.push(o), t.length === 1 && queueMicrotask(() => {
-    const n = t.slice();
-    t.length = 0;
-    for (const c of n)
-      c();
-  });
-}
-export {
-  e as nextTick
-};

package/dist/node_modules/.pnpm/@arcgis_core@4.29.10/node_modules/@arcgis/core/core/number.js

@@ -1,130 +0,0 @@
-import { escapeRegExpString as S } from "./string.js";
-import { getLocale as E } from "../intl/locale.js";
-const x = { ar: [".", ","], bg: [",", " "], bs: [",", "."], ca: [",", "."], cs: [",", " "], da: [",", "."], de: [",", "."], "de-ch": [".", "’"], el: [",", "."], en: [".", ","], "en-au": [".", ","], es: [",", "."], "es-mx": [".", ","], et: [",", " "], fi: [",", " "], fr: [",", " "], "fr-ch": [",", " "], he: [".", ","], hi: [".", ",", "#,##,##0.###"], hr: [",", "."], hu: [",", " "], id: [",", "."], it: [",", "."], "it-ch": [".", "’"], ja: [".", ","], ko: [".", ","], lt: [",", " "], lv: [",", " "], mk: [",", "."], nb: [",", " "], nl: [",", "."], pl: [",", " "], pt: [",", "."], "pt-pt": [",", " "], ro: [",", "."], ru: [",", " "], sk: [",", " "], sl: [",", "."], sr: [",", "."], sv: [",", " "], th: [".", ","], tr: [",", "."], uk: [",", " "], vi: [",", "."], zh: [".", ","] };
-function w(e = E()) {
-  let r = (e = e.toLowerCase()) in x;
-  if (!r) {
-    const o = e.split("-");
-    o.length > 1 && o[0] in x && (e = o[0], r = !0), r || (e = "en");
-  }
-  const [t, n, s = "#,##0.###"] = x[e];
-  return { decimal: t, group: n, pattern: s };
-}
-function A(e, r) {
-  const t = w((r = { ...r }).locale);
-  r.customs = t;
-  const n = r.pattern || t.pattern;
-  return isNaN(e) || Math.abs(e) === 1 / 0 ? null : v(e, n, r);
-}
-const N = /[#0,]*[#0](?:\.0*#*)?/;
-function v(e, r, t) {
-  const n = (t = t || {}).customs.group, s = t.customs.decimal, o = r.split(";"), l = o[0];
-  if ((r = o[e < 0 ? 1 : 0] || "-" + l).includes("%"))
-    e *= 100;
-  else if (r.includes("‰"))
-    e *= 1e3;
-  else {
-    if (r.includes("¤"))
-      throw new Error("currency notation not supported");
-    if (r.includes("E"))
-      throw new Error("exponential notation not supported");
-  }
-  const d = N, u = l.match(d);
-  if (!u)
-    throw new Error("unable to find a number expression in pattern: " + r);
-  return t.fractional === !1 && (t.places = 0), r.replace(d, z(e, u[0], { decimal: s, group: n, places: t.places, round: t.round }));
-}
-function z(e, r, t) {
-  (t = t || {}).places === !0 && (t.places = 0), t.places === 1 / 0 && (t.places = 6);
-  const n = r.split("."), s = typeof t.places == "string" && t.places.indexOf(",");
-  let o = t.places;
-  s ? o = t.places.substring(s + 1) : +o >= 0 || (o = (n[1] || []).length), t.round < 0 || (e = Number(e.toFixed(Number(o))));
-  const l = String(Math.abs(e)).split("."), d = l[1] || "";
-  if (n[1] || t.places) {
-    s && (t.places = t.places.substring(0, s));
-    const c = t.places !== void 0 ? t.places : n[1] && n[1].lastIndexOf("0") + 1;
-    +c > d.length && (l[1] = d.padEnd(Number(c), "0")), +o < d.length && (l[1] = d.substr(0, Number(o)));
-  } else
-    l[1] && l.pop();
-  const u = n[0].replace(",", "");
-  let g = u.indexOf("0");
-  g !== -1 && (g = u.length - g, g > l[0].length && (l[0] = l[0].padStart(g, "0")), u.includes("#") || (l[0] = l[0].substr(l[0].length - g)));
-  let p, i, a = n[0].lastIndexOf(",");
-  if (a !== -1) {
-    p = n[0].length - a - 1;
-    const c = n[0].substr(0, a);
-    a = c.lastIndexOf(","), a !== -1 && (i = c.length - a - 1);
-  }
-  const f = [];
-  for (let c = l[0]; c; ) {
-    const m = c.length - p;
-    f.push(m > 0 ? c.substr(m) : c), c = m > 0 ? c.slice(0, m) : "", i && (p = i, i = void 0);
-  }
-  return l[0] = f.reverse().join(t.group || ","), l.join(t.decimal || ".");
-}
-function O(e) {
-  const r = w((e = e || {}).locale), t = e.pattern || r.pattern, n = r.group, s = r.decimal;
-  let o = 1;
-  if (t.includes("%"))
-    o /= 100;
-  else if (t.includes("‰"))
-    o /= 1e3;
-  else if (t.includes("¤"))
-    throw new Error("currency notation not supported");
-  const l = t.split(";");
-  return l.length === 1 && l.push("-" + l[0]), { regexp: h(l, (u) => (u = "(?:" + S(u, ".") + ")").replace(N, (g) => {
-    const p = { signed: !1, separator: e.strict ? n : [n, ""], fractional: e.fractional, decimal: s, exponent: !1 }, i = g.split(".");
-    let a = e.places;
-    i.length === 1 && o !== 1 && (i[1] = "###"), i.length === 1 || a === 0 ? p.fractional = !1 : (a === void 0 && (a = e.pattern ? i[1].lastIndexOf("0") + 1 : 1 / 0), a && e.fractional == null && (p.fractional = !0), !e.places && +a < i[1].length && (a += "," + i[1].length), p.places = a);
-    const f = i[0].split(",");
-    return f.length > 1 && (p.groupSize = f.pop().length, f.length > 1 && (p.groupSize2 = f.pop().length)), "(" + y(p) + ")";
-  }), !0).replaceAll(/[\xa0 ]/g, "[\\s\\xa0]"), group: n, decimal: s, factor: o };
-}
-function R(e, r) {
-  const t = O(r), n = new RegExp("^" + t.regexp + "$").exec(e);
-  if (!n)
-    return NaN;
-  let s = n[1];
-  if (!n[1]) {
-    if (!n[2])
-      return NaN;
-    s = n[2], t.factor *= -1;
-  }
-  return s = s.replaceAll(new RegExp("[" + t.group + "\\s\\xa0]", "g"), "").replace(t.decimal, "."), Number(s) * t.factor;
-}
-function y(e) {
-  "places" in (e = e || {}) || (e.places = 1 / 0), typeof e.decimal != "string" && (e.decimal = "."), "fractional" in e && !String(e.places).startsWith("0") || (e.fractional = [!0, !1]), "exponent" in e || (e.exponent = [!0, !1]), "eSigned" in e || (e.eSigned = [!0, !1]);
-  const r = b(e), t = h(e.fractional, (s) => {
-    let o = "";
-    return s && e.places !== 0 && (o = "\\" + e.decimal, e.places === 1 / 0 ? o = "(?:" + o + "\\d+)?" : o += "\\d{" + e.places + "}"), o;
-  }, !0);
-  let n = r + t;
-  return t && (n = "(?:(?:" + n + ")|(?:" + t + "))"), n + h(e.exponent, (s) => s ? "([eE]" + b({ signed: e.eSigned }) + ")" : "");
-}
-function b(e) {
-  return "signed" in (e = e || {}) || (e.signed = [!0, !1]), "separator" in e ? "groupSize" in e || (e.groupSize = 3) : e.separator = "", h(e.signed, (r) => r ? "[-+]" : "", !0) + h(e.separator, (r) => {
-    if (!r)
-      return "(?:\\d+)";
-    (r = S(r)) === " " ? r = "\\s" : r === " " && (r = "\\s\\xa0");
-    const t = e.groupSize, n = e.groupSize2;
-    if (n) {
-      const s = "(?:0|[1-9]\\d{0," + (n - 1) + "}(?:[" + r + "]\\d{" + n + "})*[" + r + "]\\d{" + t + "})";
-      return t - n > 0 ? "(?:" + s + "|(?:0|[1-9]\\d{0," + (t - 1) + "}))" : s;
-    }
-    return "(?:0|[1-9]\\d{0," + (t - 1) + "}(?:[" + r + "]\\d{" + t + "})*)";
-  }, !0);
-}
-const h = (e, r, t) => {
-  if (!(e instanceof Array))
-    return r(e);
-  const n = [];
-  for (let s = 0; s < e.length; s++)
-    n.push(r(e[s]));
-  return I(n.join("|"), !!t);
-}, I = (e, r) => "(" + (r ? "?:" : "") + e + ")";
-export {
-  O as _parseInfo,
-  A as format,
-  w as getCustoms,
-  R as parse
-};

package/dist/node_modules/.pnpm/@arcgis_core@4.29.10/node_modules/@arcgis/core/core/object.js

@@ -1,39 +0,0 @@
-import { clone as n } from "./lang.js";
-function l(u, e, a = !1) {
-  return f(u, e, a);
-}
-function y(u, e) {
-  if (e != null)
-    return e[u] || s(u.split("."), !1, e);
-}
-function A(u, e, a) {
-  const r = u.split("."), t = r.pop(), o = s(r, !0, a);
-  o && t && (o[t] = e);
-}
-function s(u, e, a) {
-  let r = a;
-  for (const t of u) {
-    if (r == null)
-      return;
-    if (!(t in r)) {
-      if (!e)
-        return;
-      r[t] = {};
-    }
-    r = r[t];
-  }
-  return r;
-}
-function f(u, e, a) {
-  return e ? Object.keys(e).reduce((r, t) => {
-    let o = r[t], i = e[t];
-    return o === i ? r : o === void 0 ? (r[t] = n(i), r) : (Array.isArray(i) || Array.isArray(r) ? (o = o ? Array.isArray(o) ? r[t] = o.concat() : r[t] = [o] : r[t] = [], i && (Array.isArray(i) || (i = [i]), a ? i.forEach((c) => {
-      o.includes(c) || o.push(c);
-    }) : r[t] = i.concat())) : i && typeof i == "object" ? r[t] = f(o, i, a) : r.hasOwnProperty(t) && !e.hasOwnProperty(t) || (r[t] = i), r);
-  }, u || {}) : u;
-}
-export {
-  l as deepMerge,
-  y as getDeepValue,
-  A as setDeepValue
-};