@synnaxlabs/x 0.14.2 → 0.15.0

package/dist/x.js

@@ -1,13 +1,13 @@
 var Ai = Object.defineProperty;
 var Ii = (t, e, r) => e in t ? Ai(t, e, { enumerable: !0, configurable: !0, writable: !0, value: r }) : t[e] = r;
-var y = (t, e, r) => (Ii(t, typeof e != "symbol" ? e + "" : e, r), r);
+var h = (t, e, r) => (Ii(t, typeof e != "symbol" ? e + "" : e, r), r);
 let Ni = "_-0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ", Ei = (t = 21) => {
   let e = "", r = t;
   for (; r--; )
     e += Ni[Math.random() * 64 | 0];
   return e;
 };
-const ss = (t) => t != null && typeof t == "object" && "toString" in t, Eu = (t) => {
+const ss = (t) => t != null && typeof t == "object" && "toString" in t, Zu = (t) => {
   if (ss(t))
     return (t == null ? void 0 : t.toString().length) === 0;
   switch (typeof t) {
@@ -50,25 +50,25 @@ const ss = (t) => t != null && typeof t == "object" && "toString" in t, Eu = (t)
 }, Ci = (t, e, r) => {
   const n = Nr(e[t], r);
   return (s, i) => n(s[t], i[t]);
-}, Mi = (t, e) => t.length !== e.length ? t.length - e.length : t.every((r, n) => r === e[n]) ? 0 : -1, ji = (t, e) => {
+}, Mi = (t, e) => t.length !== e.length ? t.length - e.length : t.every((r, n) => r === e[n]) ? 0 : -1, Ri = (t, e) => {
   if (t.length !== e.length)
     return t.length - e.length;
   if (t.length === 0)
     return 0;
   const r = Nr(t[0]), n = [...t].sort(r), s = [...e].sort(r);
   return n.every((i, a) => i === s[a]) ? 0 : -1;
-}, Ri = (t, e) => t === e ? 0 : t === "first" && e === "last" ? 1 : -1, is = (t) => (e, r) => t(r, e);
-const Cu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}, ji = (t, e) => t === e ? 0 : t === "first" && e === "last" ? 1 : -1, is = (t) => (e, r) => t(r, e);
+const Lu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   EQUAL: 0,
   GREATER_THAN: 1,
   LESS_THAN: -1,
   newF: Nr,
   newFieldF: Ci,
-  order: Ri,
+  order: ji,
   primitiveArrays: Mi,
   reverseF: is,
-  unorderedPrimitiveArrays: ji
+  unorderedPrimitiveArrays: Ri
 }, Symbol.toStringTag, { value: "Module" }));
 var V;
 (function(t) {
@@ -203,8 +203,8 @@ class be extends Error {
         else {
           let o = n, l = 0;
           for (; l < a.path.length; ) {
-            const h = a.path[l];
-            l === a.path.length - 1 ? (o[h] = o[h] || { _errors: [] }, o[h]._errors.push(r(a))) : o[h] = o[h] || { _errors: [] }, o = o[h], l++;
+            const p = a.path[l];
+            l === a.path.length - 1 ? (o[p] = o[p] || { _errors: [] }, o[p]._errors.push(r(a))) : o[p] = o[p] || { _errors: [] }, o = o[p], l++;
           }
         }
     };
@@ -230,7 +230,7 @@ class be extends Error {
   }
 }
 be.create = (t) => new be(t);
-const It = (t, e) => {
+const Nt = (t, e) => {
   let r;
   switch (t.code) {
     case x.invalid_type:
@@ -286,22 +286,22 @@ const It = (t, e) => {
   }
   return { message: r };
 };
-let as = It;
+let as = Nt;
 function Ui(t) {
   as = t;
 }
-function yr() {
+function gr() {
   return as;
 }
-const gr = (t) => {
+const mr = (t) => {
   const { data: e, path: r, errorMaps: n, issueData: s } = t, i = [...r, ...s.path || []], a = {
     ...s,
     path: i
   };
   let o = "";
-  const l = n.filter((h) => !!h).slice().reverse();
-  for (const h of l)
-    o = h(a, { data: e, defaultError: o }).message;
+  const l = n.filter((p) => !!p).slice().reverse();
+  for (const p of l)
+    o = p(a, { data: e, defaultError: o }).message;
   return {
     ...s,
     path: i,
@@ -309,15 +309,15 @@ const gr = (t) => {
   };
 }, Zi = [];
 function S(t, e) {
-  const r = gr({
+  const r = mr({
     issueData: e,
     data: t.data,
     path: t.path,
     errorMaps: [
       t.common.contextualErrorMap,
       t.schemaErrorMap,
-      yr(),
-      It
+      gr(),
+      Nt
       // then global default map
     ].filter((n) => !!n)
   });
@@ -364,7 +364,7 @@ class ue {
 }
 const M = Object.freeze({
   status: "aborted"
-}), os = (t) => ({ status: "dirty", value: t }), fe = (t) => ({ status: "valid", value: t }), Gr = (t) => t.status === "aborted", Jr = (t) => t.status === "dirty", Nt = (t) => t.status === "valid", mr = (t) => typeof Promise < "u" && t instanceof Promise;
+}), os = (t) => ({ status: "dirty", value: t }), fe = (t) => ({ status: "valid", value: t }), Gr = (t) => t.status === "aborted", Jr = (t) => t.status === "dirty", Et = (t) => t.status === "valid", xr = (t) => typeof Promise < "u" && t instanceof Promise;
 var N;
 (function(t) {
   t.errToObj = (e) => typeof e == "string" ? { message: e } : e || {}, t.toString = (e) => typeof e == "string" ? e : e == null ? void 0 : e.message;
@@ -377,8 +377,8 @@ class Ie {
     return this._cachedPath.length || (this._key instanceof Array ? this._cachedPath.push(...this._path, ...this._key) : this._cachedPath.push(...this._path, this._key)), this._cachedPath;
   }
 }
-const Pn = (t, e) => {
-  if (Nt(e))
+const $n = (t, e) => {
+  if (Et(e))
     return { success: !0, data: e.value };
   if (!t.common.issues.length)
     throw new Error("Validation failed but no issues detected.");
@@ -392,7 +392,7 @@ const Pn = (t, e) => {
     }
   };
 };
-function j(t) {
+function R(t) {
   if (!t)
     return {};
   const { errorMap: e, invalid_type_error: r, required_error: n, description: s } = t;
@@ -400,7 +400,7 @@ function j(t) {
     throw new Error(`Can't use "invalid_type_error" or "required_error" in conjunction with custom error map.`);
   return e ? { errorMap: e, description: s } : { errorMap: (a, o) => a.code !== "invalid_type" ? { message: o.defaultError } : typeof o.data > "u" ? { message: n ?? o.defaultError } : { message: r ?? o.defaultError }, description: s };
 }
-class R {
+class j {
   constructor(e) {
     this.spa = this.safeParseAsync, this._def = e, this.parse = this.parse.bind(this), this.safeParse = this.safeParse.bind(this), this.parseAsync = this.parseAsync.bind(this), this.safeParseAsync = this.safeParseAsync.bind(this), this.spa = this.spa.bind(this), this.refine = this.refine.bind(this), this.refinement = this.refinement.bind(this), this.superRefine = this.superRefine.bind(this), this.optional = this.optional.bind(this), this.nullable = this.nullable.bind(this), this.nullish = this.nullish.bind(this), this.array = this.array.bind(this), this.promise = this.promise.bind(this), this.or = this.or.bind(this), this.and = this.and.bind(this), this.transform = this.transform.bind(this), this.brand = this.brand.bind(this), this.default = this.default.bind(this), this.catch = this.catch.bind(this), this.describe = this.describe.bind(this), this.pipe = this.pipe.bind(this), this.readonly = this.readonly.bind(this), this.isNullable = this.isNullable.bind(this), this.isOptional = this.isOptional.bind(this);
   }
@@ -435,7 +435,7 @@ class R {
   }
   _parseSync(e) {
     const r = this._parse(e);
-    if (mr(r))
+    if (xr(r))
       throw new Error("Synchronous parse encountered promise.");
     return r;
   }
@@ -463,7 +463,7 @@ class R {
       data: e,
       parsedType: Ge(e)
     }, i = this._parseSync({ data: e, path: s.path, parent: s });
-    return Pn(s, i);
+    return $n(s, i);
   }
   async parseAsync(e, r) {
     const n = await this.safeParseAsync(e, r);
@@ -483,8 +483,8 @@ class R {
       parent: null,
       data: e,
       parsedType: Ge(e)
-    }, s = this._parse({ data: e, path: n.path, parent: n }), i = await (mr(s) ? s : Promise.resolve(s));
-    return Pn(n, i);
+    }, s = this._parse({ data: e, path: n.path, parent: n }), i = await (xr(s) ? s : Promise.resolve(s));
+    return $n(n, i);
   }
   refine(e, r) {
     const n = (s) => typeof r == "string" || typeof r > "u" ? { message: r } : typeof r == "function" ? r(s) : r;
@@ -510,7 +510,7 @@ class R {
     return this._refinement(e);
   }
   optional() {
-    return $e.create(this, this._def);
+    return Pe.create(this, this._def);
   }
   nullable() {
     return gt.create(this, this._def);
@@ -528,11 +528,11 @@ class R {
     return jt.create([this, e], this._def);
   }
   and(e) {
-    return Rt.create(this, e, this._def);
+    return Bt.create(this, e, this._def);
   }
   transform(e) {
     return new _e({
-      ...j(this._def),
+      ...R(this._def),
       schema: this,
       typeName: E.ZodEffects,
       effect: { type: "transform", transform: e }
@@ -541,7 +541,7 @@ class R {
   default(e) {
     const r = typeof e == "function" ? e : () => e;
     return new Pt({
-      ...j(this._def),
+      ...R(this._def),
       innerType: this,
       defaultValue: r,
       typeName: E.ZodDefault
@@ -551,13 +551,13 @@ class R {
     return new us({
       typeName: E.ZodBranded,
       type: this,
-      ...j(this._def)
+      ...R(this._def)
     });
   }
   catch(e) {
     const r = typeof e == "function" ? e : () => e;
-    return new br({
-      ...j(this._def),
+    return new Or({
+      ...R(this._def),
       innerType: this,
       catchValue: r,
       typeName: E.ZodCatch
@@ -571,10 +571,10 @@ class R {
     });
   }
   pipe(e) {
-    return Wt.create(this, e);
+    return Gt.create(this, e);
   }
   readonly() {
-    return _r.create(this);
+    return Tr.create(this);
   }
   isOptional() {
     return this.safeParse(void 0).success;
@@ -583,13 +583,13 @@ class R {
     return this.safeParse(null).success;
   }
 }
-const Li = /^c[^\s-]{8,}$/i, Pi = /^[a-z][a-z0-9]*$/, $i = /^[0-9A-HJKMNP-TV-Z]{26}$/, Di = /^[0-9a-fA-F]{8}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{12}$/i, Vi = /^(?!\.)(?!.*\.\.)([A-Z0-9_+-\.]*)[A-Z0-9_+-]@([A-Z0-9][A-Z0-9\-]*\.)+[A-Z]{2,}$/i, zi = "^(\\p{Extended_Pictographic}|\\p{Emoji_Component})+$";
+const Li = /^c[^\s-]{8,}$/i, $i = /^[a-z][a-z0-9]*$/, Pi = /^[0-9A-HJKMNP-TV-Z]{26}$/, Di = /^[0-9a-fA-F]{8}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{12}$/i, Vi = /^(?!\.)(?!.*\.\.)([A-Z0-9_+-\.]*)[A-Z0-9_+-]@([A-Z0-9][A-Z0-9\-]*\.)+[A-Z]{2,}$/i, zi = "^(\\p{Extended_Pictographic}|\\p{Emoji_Component})+$";
 let Yr;
 const qi = /^(((25[0-5])|(2[0-4][0-9])|(1[0-9]{2})|([0-9]{1,2}))\.){3}((25[0-5])|(2[0-4][0-9])|(1[0-9]{2})|([0-9]{1,2}))$/, Yi = /^(([a-f0-9]{1,4}:){7}|::([a-f0-9]{1,4}:){0,6}|([a-f0-9]{1,4}:){1}:([a-f0-9]{1,4}:){0,5}|([a-f0-9]{1,4}:){2}:([a-f0-9]{1,4}:){0,4}|([a-f0-9]{1,4}:){3}:([a-f0-9]{1,4}:){0,3}|([a-f0-9]{1,4}:){4}:([a-f0-9]{1,4}:){0,2}|([a-f0-9]{1,4}:){5}:([a-f0-9]{1,4}:){0,1})([a-f0-9]{1,4}|(((25[0-5])|(2[0-4][0-9])|(1[0-9]{2})|([0-9]{1,2}))\.){3}((25[0-5])|(2[0-4][0-9])|(1[0-9]{2})|([0-9]{1,2})))$/, Fi = (t) => t.precision ? t.offset ? new RegExp(`^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}\\.\\d{${t.precision}}(([+-]\\d{2}(:?\\d{2})?)|Z)$`) : new RegExp(`^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}\\.\\d{${t.precision}}Z$`) : t.precision === 0 ? t.offset ? new RegExp("^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}(([+-]\\d{2}(:?\\d{2})?)|Z)$") : new RegExp("^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}Z$") : t.offset ? new RegExp("^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}(\\.\\d+)?(([+-]\\d{2}(:?\\d{2})?)|Z)$") : new RegExp("^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}(\\.\\d+)?Z$");
 function Ki(t, e) {
   return !!((e === "v4" || !e) && qi.test(t) || (e === "v6" || !e) && Yi.test(t));
 }
-class we extends R {
+class we extends j {
   _parse(e) {
     if (this._def.coerce && (e.data = String(e.data)), this._getType(e) !== T.string) {
       const i = this._getOrReturnCtx(e);
@@ -666,13 +666,13 @@ class we extends R {
           message: i.message
         }), n.dirty());
       else if (i.kind === "cuid2")
-        Pi.test(e.data) || (s = this._getOrReturnCtx(e, s), S(s, {
+        $i.test(e.data) || (s = this._getOrReturnCtx(e, s), S(s, {
           validation: "cuid2",
           code: x.invalid_string,
           message: i.message
         }), n.dirty());
       else if (i.kind === "ulid")
-        $i.test(e.data) || (s = this._getOrReturnCtx(e, s), S(s, {
+        Pi.test(e.data) || (s = this._getOrReturnCtx(e, s), S(s, {
           validation: "ulid",
           code: x.invalid_string,
           message: i.message
@@ -887,14 +887,14 @@ we.create = (t) => {
     checks: [],
     typeName: E.ZodString,
     coerce: (e = t == null ? void 0 : t.coerce) !== null && e !== void 0 ? e : !1,
-    ...j(t)
+    ...R(t)
   });
 };
 function Wi(t, e) {
   const r = (t.toString().split(".")[1] || "").length, n = (e.toString().split(".")[1] || "").length, s = r > n ? r : n, i = parseInt(t.toFixed(s).replace(".", "")), a = parseInt(e.toFixed(s).replace(".", ""));
   return i % a / Math.pow(10, s);
 }
-class rt extends R {
+class rt extends j {
   constructor() {
     super(...arguments), this.min = this.gte, this.max = this.lte, this.step = this.multipleOf;
   }
@@ -1064,9 +1064,9 @@ rt.create = (t) => new rt({
   checks: [],
   typeName: E.ZodNumber,
   coerce: (t == null ? void 0 : t.coerce) || !1,
-  ...j(t)
+  ...R(t)
 });
-class nt extends R {
+class nt extends j {
   constructor() {
     super(...arguments), this.min = this.gte, this.max = this.lte;
   }
@@ -1191,10 +1191,10 @@ nt.create = (t) => {
     checks: [],
     typeName: E.ZodBigInt,
     coerce: (e = t == null ? void 0 : t.coerce) !== null && e !== void 0 ? e : !1,
-    ...j(t)
+    ...R(t)
   });
 };
-class Et extends R {
+class Ct extends j {
   _parse(e) {
     if (this._def.coerce && (e.data = !!e.data), this._getType(e) !== T.boolean) {
       const n = this._getOrReturnCtx(e);
@@ -1207,12 +1207,12 @@ class Et extends R {
     return fe(e.data);
   }
 }
-Et.create = (t) => new Et({
+Ct.create = (t) => new Ct({
   typeName: E.ZodBoolean,
   coerce: (t == null ? void 0 : t.coerce) || !1,
-  ...j(t)
+  ...R(t)
 });
-class pt extends R {
+class pt extends j {
   _parse(e) {
     if (this._def.coerce && (e.data = new Date(e.data)), this._getType(e) !== T.date) {
       const i = this._getOrReturnCtx(e);
@@ -1288,9 +1288,9 @@ pt.create = (t) => new pt({
   checks: [],
   coerce: (t == null ? void 0 : t.coerce) || !1,
   typeName: E.ZodDate,
-  ...j(t)
+  ...R(t)
 });
-class xr extends R {
+class vr extends j {
   _parse(e) {
     if (this._getType(e) !== T.symbol) {
       const n = this._getOrReturnCtx(e);
@@ -1303,11 +1303,11 @@ class xr extends R {
     return fe(e.data);
   }
 }
-xr.create = (t) => new xr({
+vr.create = (t) => new vr({
   typeName: E.ZodSymbol,
-  ...j(t)
+  ...R(t)
 });
-class Ct extends R {
+class Mt extends j {
   _parse(e) {
     if (this._getType(e) !== T.undefined) {
       const n = this._getOrReturnCtx(e);
@@ -1320,11 +1320,11 @@ class Ct extends R {
     return fe(e.data);
   }
 }
-Ct.create = (t) => new Ct({
+Mt.create = (t) => new Mt({
   typeName: E.ZodUndefined,
-  ...j(t)
+  ...R(t)
 });
-class Mt extends R {
+class Rt extends j {
   _parse(e) {
     if (this._getType(e) !== T.null) {
       const n = this._getOrReturnCtx(e);
@@ -1337,11 +1337,11 @@ class Mt extends R {
     return fe(e.data);
   }
 }
-Mt.create = (t) => new Mt({
+Rt.create = (t) => new Rt({
   typeName: E.ZodNull,
-  ...j(t)
+  ...R(t)
 });
-class Ot extends R {
+class Ot extends j {
   constructor() {
     super(...arguments), this._any = !0;
   }
@@ -1351,9 +1351,9 @@ class Ot extends R {
 }
 Ot.create = (t) => new Ot({
   typeName: E.ZodAny,
-  ...j(t)
+  ...R(t)
 });
-class dt extends R {
+class dt extends j {
   constructor() {
     super(...arguments), this._unknown = !0;
   }
@@ -1363,9 +1363,9 @@ class dt extends R {
 }
 dt.create = (t) => new dt({
   typeName: E.ZodUnknown,
-  ...j(t)
+  ...R(t)
 });
-class Ve extends R {
+class Ve extends j {
   _parse(e) {
     const r = this._getOrReturnCtx(e);
     return S(r, {
@@ -1377,9 +1377,9 @@ class Ve extends R {
 }
 Ve.create = (t) => new Ve({
   typeName: E.ZodNever,
-  ...j(t)
+  ...R(t)
 });
-class vr extends R {
+class wr extends j {
   _parse(e) {
     if (this._getType(e) !== T.undefined) {
       const n = this._getOrReturnCtx(e);
@@ -1392,11 +1392,11 @@ class vr extends R {
     return fe(e.data);
   }
 }
-vr.create = (t) => new vr({
+wr.create = (t) => new wr({
   typeName: E.ZodVoid,
-  ...j(t)
+  ...R(t)
 });
-class Oe extends R {
+class Oe extends j {
   _parse(e) {
     const { ctx: r, status: n } = this._processInputParams(e), s = this._def;
     if (r.parsedType !== T.array)
@@ -1467,14 +1467,14 @@ Oe.create = (t, e) => new Oe({
   maxLength: null,
   exactLength: null,
   typeName: E.ZodArray,
-  ...j(e)
+  ...R(e)
 });
 function wt(t) {
   if (t instanceof Q) {
     const e = {};
     for (const r in t.shape) {
       const n = t.shape[r];
-      e[r] = $e.create(wt(n));
+      e[r] = Pe.create(wt(n));
     }
     return new Q({
       ...t._def,
@@ -1484,9 +1484,9 @@ function wt(t) {
     return t instanceof Oe ? new Oe({
       ...t._def,
       type: wt(t.element)
-    }) : t instanceof $e ? $e.create(wt(t.unwrap())) : t instanceof gt ? gt.create(wt(t.unwrap())) : t instanceof Ne ? Ne.create(t.items.map((e) => wt(e))) : t;
+    }) : t instanceof Pe ? Pe.create(wt(t.unwrap())) : t instanceof gt ? gt.create(wt(t.unwrap())) : t instanceof Ne ? Ne.create(t.items.map((e) => wt(e))) : t;
 }
-class Q extends R {
+class Q extends j {
   constructor() {
     super(...arguments), this._cached = null, this.nonstrict = this.passthrough, this.augment = this.extend;
   }
@@ -1498,48 +1498,48 @@ class Q extends R {
   }
   _parse(e) {
     if (this._getType(e) !== T.object) {
-      const h = this._getOrReturnCtx(e);
-      return S(h, {
+      const p = this._getOrReturnCtx(e);
+      return S(p, {
         code: x.invalid_type,
         expected: T.object,
-        received: h.parsedType
+        received: p.parsedType
       }), M;
     }
     const { status: n, ctx: s } = this._processInputParams(e), { shape: i, keys: a } = this._getCached(), o = [];
     if (!(this._def.catchall instanceof Ve && this._def.unknownKeys === "strip"))
-      for (const h in s.data)
-        a.includes(h) || o.push(h);
+      for (const p in s.data)
+        a.includes(p) || o.push(p);
     const l = [];
-    for (const h of a) {
-      const b = i[h], k = s.data[h];
+    for (const p of a) {
+      const b = i[p], k = s.data[p];
       l.push({
-        key: { status: "valid", value: h },
-        value: b._parse(new Ie(s, k, s.path, h)),
-        alwaysSet: h in s.data
+        key: { status: "valid", value: p },
+        value: b._parse(new Ie(s, k, s.path, p)),
+        alwaysSet: p in s.data
       });
     }
     if (this._def.catchall instanceof Ve) {
-      const h = this._def.unknownKeys;
-      if (h === "passthrough")
+      const p = this._def.unknownKeys;
+      if (p === "passthrough")
         for (const b of o)
           l.push({
             key: { status: "valid", value: b },
             value: { status: "valid", value: s.data[b] }
           });
-      else if (h === "strict")
+      else if (p === "strict")
         o.length > 0 && (S(s, {
           code: x.unrecognized_keys,
           keys: o
         }), n.dirty());
-      else if (h !== "strip")
+      else if (p !== "strip")
         throw new Error("Internal ZodObject error: invalid unknownKeys value.");
     } else {
-      const h = this._def.catchall;
+      const p = this._def.catchall;
       for (const b of o) {
         const k = s.data[b];
         l.push({
           key: { status: "valid", value: b },
-          value: h._parse(
+          value: p._parse(
             new Ie(s, k, s.path, b)
             //, ctx.child(key), value, getParsedType(value)
           ),
@@ -1548,17 +1548,17 @@ class Q extends R {
       }
     }
     return s.common.async ? Promise.resolve().then(async () => {
-      const h = [];
+      const p = [];
       for (const b of l) {
         const k = await b.key;
-        h.push({
+        p.push({
           key: k,
           value: await b.value,
           alwaysSet: b.alwaysSet
         });
       }
-      return h;
-    }).then((h) => ue.mergeObjectSync(n, h)) : ue.mergeObjectSync(n, l);
+      return p;
+    }).then((p) => ue.mergeObjectSync(n, p)) : ue.mergeObjectSync(n, l);
   }
   get shape() {
     return this._def.shape();
@@ -1740,7 +1740,7 @@ class Q extends R {
         r[n] = this.shape[n];
       else {
         let i = this.shape[n];
-        for (; i instanceof $e; )
+        for (; i instanceof Pe; )
           i = i._def.innerType;
         r[n] = i;
       }
@@ -1758,23 +1758,23 @@ Q.create = (t, e) => new Q({
   unknownKeys: "strip",
   catchall: Ve.create(),
   typeName: E.ZodObject,
-  ...j(e)
+  ...R(e)
 });
 Q.strictCreate = (t, e) => new Q({
   shape: () => t,
   unknownKeys: "strict",
   catchall: Ve.create(),
   typeName: E.ZodObject,
-  ...j(e)
+  ...R(e)
 });
 Q.lazycreate = (t, e) => new Q({
   shape: t,
   unknownKeys: "strip",
   catchall: Ve.create(),
   typeName: E.ZodObject,
-  ...j(e)
+  ...R(e)
 });
-class jt extends R {
+class jt extends j {
   _parse(e) {
     const { ctx: r } = this._processInputParams(e), n = this._def.options;
     function s(i) {
@@ -1813,7 +1813,7 @@ class jt extends R {
       let i;
       const a = [];
       for (const l of n) {
-        const h = {
+        const p = {
           ...r,
           common: {
             ...r.common,
@@ -1823,11 +1823,11 @@ class jt extends R {
         }, b = l._parseSync({
           data: r.data,
           path: r.path,
-          parent: h
+          parent: p
         });
         if (b.status === "valid")
           return b;
-        b.status === "dirty" && !i && (i = { result: b, ctx: h }), h.common.issues.length && a.push(h.common.issues);
+        b.status === "dirty" && !i && (i = { result: b, ctx: p }), p.common.issues.length && a.push(p.common.issues);
       }
       if (i)
         return r.common.issues.push(...i.ctx.common.issues), i.result;
@@ -1845,10 +1845,10 @@ class jt extends R {
 jt.create = (t, e) => new jt({
   options: t,
   typeName: E.ZodUnion,
-  ...j(e)
+  ...R(e)
 });
-const tr = (t) => t instanceof Ut ? tr(t.schema) : t instanceof _e ? tr(t.innerType()) : t instanceof Zt ? [t.value] : t instanceof st ? t.options : t instanceof Lt ? Object.keys(t.enum) : t instanceof Pt ? tr(t._def.innerType) : t instanceof Ct ? [void 0] : t instanceof Mt ? [null] : null;
-class Er extends R {
+const rr = (t) => t instanceof Zt ? rr(t.schema) : t instanceof _e ? rr(t.innerType()) : t instanceof Lt ? [t.value] : t instanceof st ? t.options : t instanceof $t ? Object.keys(t.enum) : t instanceof Pt ? rr(t._def.innerType) : t instanceof Mt ? [void 0] : t instanceof Rt ? [null] : null;
+class Er extends j {
   _parse(e) {
     const { ctx: r } = this._processInputParams(e);
     if (r.parsedType !== T.object)
@@ -1892,7 +1892,7 @@ class Er extends R {
   static create(e, r, n) {
     const s = /* @__PURE__ */ new Map();
     for (const i of r) {
-      const a = tr(i.shape[e]);
+      const a = rr(i.shape[e]);
       if (!a)
         throw new Error(`A discriminator value for key \`${e}\` could not be extracted from all schema options`);
       for (const o of a) {
@@ -1906,7 +1906,7 @@ class Er extends R {
       discriminator: e,
       options: r,
       optionsMap: s,
-      ...j(n)
+      ...R(n)
     });
   }
 }
@@ -1937,7 +1937,7 @@ function Hr(t, e) {
   } else
     return r === T.date && n === T.date && +t == +e ? { valid: !0, data: t } : { valid: !1 };
 }
-class Rt extends R {
+class Bt extends j {
   _parse(e) {
     const { status: r, ctx: n } = this._processInputParams(e), s = (i, a) => {
       if (Gr(i) || Gr(a))
@@ -1969,13 +1969,13 @@ class Rt extends R {
     }));
   }
 }
-Rt.create = (t, e, r) => new Rt({
+Bt.create = (t, e, r) => new Bt({
   left: t,
   right: e,
   typeName: E.ZodIntersection,
-  ...j(r)
+  ...R(r)
 });
-class Ne extends R {
+class Ne extends j {
   _parse(e) {
     const { status: r, ctx: n } = this._processInputParams(e);
     if (n.parsedType !== T.array)
@@ -2022,10 +2022,10 @@ Ne.create = (t, e) => {
     items: t,
     typeName: E.ZodTuple,
     rest: null,
-    ...j(e)
+    ...R(e)
   });
 };
-class Bt extends R {
+class Ut extends j {
   get keySchema() {
     return this._def.keyType;
   }
@@ -2052,20 +2052,20 @@ class Bt extends R {
     return this._def.valueType;
   }
   static create(e, r, n) {
-    return r instanceof R ? new Bt({
+    return r instanceof j ? new Ut({
       keyType: e,
       valueType: r,
       typeName: E.ZodRecord,
-      ...j(n)
-    }) : new Bt({
+      ...R(n)
+    }) : new Ut({
       keyType: we.create(),
       valueType: e,
       typeName: E.ZodRecord,
-      ...j(r)
+      ...R(r)
     });
   }
 }
-class wr extends R {
+class br extends j {
   get keySchema() {
     return this._def.keyType;
   }
@@ -2080,40 +2080,40 @@ class wr extends R {
         expected: T.map,
         received: n.parsedType
       }), M;
-    const s = this._def.keyType, i = this._def.valueType, a = [...n.data.entries()].map(([o, l], h) => ({
-      key: s._parse(new Ie(n, o, n.path, [h, "key"])),
-      value: i._parse(new Ie(n, l, n.path, [h, "value"]))
+    const s = this._def.keyType, i = this._def.valueType, a = [...n.data.entries()].map(([o, l], p) => ({
+      key: s._parse(new Ie(n, o, n.path, [p, "key"])),
+      value: i._parse(new Ie(n, l, n.path, [p, "value"]))
     }));
     if (n.common.async) {
       const o = /* @__PURE__ */ new Map();
       return Promise.resolve().then(async () => {
         for (const l of a) {
-          const h = await l.key, b = await l.value;
-          if (h.status === "aborted" || b.status === "aborted")
+          const p = await l.key, b = await l.value;
+          if (p.status === "aborted" || b.status === "aborted")
             return M;
-          (h.status === "dirty" || b.status === "dirty") && r.dirty(), o.set(h.value, b.value);
+          (p.status === "dirty" || b.status === "dirty") && r.dirty(), o.set(p.value, b.value);
         }
         return { status: r.value, value: o };
       });
     } else {
       const o = /* @__PURE__ */ new Map();
       for (const l of a) {
-        const h = l.key, b = l.value;
-        if (h.status === "aborted" || b.status === "aborted")
+        const p = l.key, b = l.value;
+        if (p.status === "aborted" || b.status === "aborted")
           return M;
-        (h.status === "dirty" || b.status === "dirty") && r.dirty(), o.set(h.value, b.value);
+        (p.status === "dirty" || b.status === "dirty") && r.dirty(), o.set(p.value, b.value);
       }
       return { status: r.value, value: o };
     }
   }
 }
-wr.create = (t, e, r) => new wr({
+br.create = (t, e, r) => new br({
   valueType: e,
   keyType: t,
   typeName: E.ZodMap,
-  ...j(r)
+  ...R(r)
 });
-class yt extends R {
+class yt extends j {
   _parse(e) {
     const { status: r, ctx: n } = this._processInputParams(e);
     if (n.parsedType !== T.set)
@@ -2140,15 +2140,15 @@ class yt extends R {
     }), r.dirty());
     const i = this._def.valueType;
     function a(l) {
-      const h = /* @__PURE__ */ new Set();
+      const p = /* @__PURE__ */ new Set();
       for (const b of l) {
         if (b.status === "aborted")
           return M;
-        b.status === "dirty" && r.dirty(), h.add(b.value);
+        b.status === "dirty" && r.dirty(), p.add(b.value);
       }
-      return { status: r.value, value: h };
+      return { status: r.value, value: p };
     }
-    const o = [...n.data.values()].map((l, h) => i._parse(new Ie(n, l, n.path, h)));
+    const o = [...n.data.values()].map((l, p) => i._parse(new Ie(n, l, n.path, p)));
     return n.common.async ? Promise.all(o).then((l) => a(l)) : a(o);
   }
   min(e, r) {
@@ -2175,9 +2175,9 @@ yt.create = (t, e) => new yt({
   minSize: null,
   maxSize: null,
   typeName: E.ZodSet,
-  ...j(e)
+  ...R(e)
 });
-class bt extends R {
+class bt extends j {
   constructor() {
     super(...arguments), this.validate = this.implement;
   }
@@ -2190,15 +2190,15 @@ class bt extends R {
         received: r.parsedType
       }), M;
     function n(o, l) {
-      return gr({
+      return mr({
         data: o,
         path: r.path,
         errorMaps: [
           r.common.contextualErrorMap,
           r.schemaErrorMap,
-          yr(),
-          It
-        ].filter((h) => !!h),
+          gr(),
+          Nt
+        ].filter((p) => !!p),
         issueData: {
           code: x.invalid_arguments,
           argumentsError: l
@@ -2206,15 +2206,15 @@ class bt extends R {
       });
     }
     function s(o, l) {
-      return gr({
+      return mr({
         data: o,
         path: r.path,
         errorMaps: [
           r.common.contextualErrorMap,
           r.schemaErrorMap,
-          yr(),
-          It
-        ].filter((h) => !!h),
+          gr(),
+          Nt
+        ].filter((p) => !!p),
         issueData: {
           code: x.invalid_return_type,
           returnTypeError: l
@@ -2225,20 +2225,20 @@ class bt extends R {
     if (this._def.returns instanceof _t) {
       const o = this;
       return fe(async function(...l) {
-        const h = new be([]), b = await o._def.args.parseAsync(l, i).catch((q) => {
-          throw h.addIssue(n(l, q)), h;
+        const p = new be([]), b = await o._def.args.parseAsync(l, i).catch((Y) => {
+          throw p.addIssue(n(l, Y)), p;
         }), k = await Reflect.apply(a, this, b);
-        return await o._def.returns._def.type.parseAsync(k, i).catch((q) => {
-          throw h.addIssue(s(k, q)), h;
+        return await o._def.returns._def.type.parseAsync(k, i).catch((Y) => {
+          throw p.addIssue(s(k, Y)), p;
         });
       });
     } else {
       const o = this;
       return fe(function(...l) {
-        const h = o._def.args.safeParse(l, i);
-        if (!h.success)
-          throw new be([n(l, h.error)]);
-        const b = Reflect.apply(a, this, h.data), k = o._def.returns.safeParse(b, i);
+        const p = o._def.args.safeParse(l, i);
+        if (!p.success)
+          throw new be([n(l, p.error)]);
+        const b = Reflect.apply(a, this, p.data), k = o._def.returns.safeParse(b, i);
         if (!k.success)
           throw new be([s(b, k.error)]);
         return k.data;
@@ -2274,11 +2274,11 @@ class bt extends R {
       args: e || Ne.create([]).rest(dt.create()),
       returns: r || dt.create(),
       typeName: E.ZodFunction,
-      ...j(n)
+      ...R(n)
     });
   }
 }
-class Ut extends R {
+class Zt extends j {
   get schema() {
     return this._def.getter();
   }
@@ -2287,12 +2287,12 @@ class Ut extends R {
     return this._def.getter()._parse({ data: r.data, path: r.path, parent: r });
   }
 }
-Ut.create = (t, e) => new Ut({
+Zt.create = (t, e) => new Zt({
   getter: t,
   typeName: E.ZodLazy,
-  ...j(e)
+  ...R(e)
 });
-class Zt extends R {
+class Lt extends j {
   _parse(e) {
     if (e.data !== this._def.value) {
       const r = this._getOrReturnCtx(e);
@@ -2308,19 +2308,19 @@ class Zt extends R {
     return this._def.value;
   }
 }
-Zt.create = (t, e) => new Zt({
+Lt.create = (t, e) => new Lt({
   value: t,
   typeName: E.ZodLiteral,
-  ...j(e)
+  ...R(e)
 });
 function cs(t, e) {
   return new st({
     values: t,
     typeName: E.ZodEnum,
-    ...j(e)
+    ...R(e)
   });
 }
-class st extends R {
+class st extends j {
   _parse(e) {
     if (typeof e.data != "string") {
       const r = this._getOrReturnCtx(e), n = this._def.values;
@@ -2369,7 +2369,7 @@ class st extends R {
   }
 }
 st.create = cs;
-class Lt extends R {
+class $t extends j {
   _parse(e) {
     const r = V.getValidEnumValues(this._def.values), n = this._getOrReturnCtx(e);
     if (n.parsedType !== T.string && n.parsedType !== T.number) {
@@ -2394,12 +2394,12 @@ class Lt extends R {
     return this._def.values;
   }
 }
-Lt.create = (t, e) => new Lt({
+$t.create = (t, e) => new $t({
   values: t,
   typeName: E.ZodNativeEnum,
-  ...j(e)
+  ...R(e)
 });
-class _t extends R {
+class _t extends j {
   unwrap() {
     return this._def.type;
   }
@@ -2421,9 +2421,9 @@ class _t extends R {
 _t.create = (t, e) => new _t({
   type: t,
   typeName: E.ZodPromise,
-  ...j(e)
+  ...R(e)
 });
-class _e extends R {
+class _e extends j {
   innerType() {
     return this._def.schema;
   }
@@ -2480,14 +2480,14 @@ class _e extends R {
           path: n.path,
           parent: n
         });
-        if (!Nt(a))
+        if (!Et(a))
           return a;
         const o = s.transform(a.value, i);
         if (o instanceof Promise)
           throw new Error("Asynchronous transform encountered during synchronous parse operation. Use .parseAsync instead.");
         return { status: r.value, value: o };
       } else
-        return this._def.schema._parseAsync({ data: n.data, path: n.path, parent: n }).then((a) => Nt(a) ? Promise.resolve(s.transform(a.value, i)).then((o) => ({ status: r.value, value: o })) : a);
+        return this._def.schema._parseAsync({ data: n.data, path: n.path, parent: n }).then((a) => Et(a) ? Promise.resolve(s.transform(a.value, i)).then((o) => ({ status: r.value, value: o })) : a);
     V.assertNever(s);
   }
 }
@@ -2495,15 +2495,15 @@ _e.create = (t, e, r) => new _e({
   schema: t,
   typeName: E.ZodEffects,
   effect: e,
-  ...j(r)
+  ...R(r)
 });
 _e.createWithPreprocess = (t, e, r) => new _e({
   schema: e,
   effect: { type: "preprocess", transform: t },
   typeName: E.ZodEffects,
-  ...j(r)
+  ...R(r)
 });
-class $e extends R {
+class Pe extends j {
   _parse(e) {
     return this._getType(e) === T.undefined ? fe(void 0) : this._def.innerType._parse(e);
   }
@@ -2511,12 +2511,12 @@ class $e extends R {
     return this._def.innerType;
   }
 }
-$e.create = (t, e) => new $e({
+Pe.create = (t, e) => new Pe({
   innerType: t,
   typeName: E.ZodOptional,
-  ...j(e)
+  ...R(e)
 });
-class gt extends R {
+class gt extends j {
   _parse(e) {
     return this._getType(e) === T.null ? fe(null) : this._def.innerType._parse(e);
   }
@@ -2527,9 +2527,9 @@ class gt extends R {
 gt.create = (t, e) => new gt({
   innerType: t,
   typeName: E.ZodNullable,
-  ...j(e)
+  ...R(e)
 });
-class Pt extends R {
+class Pt extends j {
   _parse(e) {
     const { ctx: r } = this._processInputParams(e);
     let n = r.data;
@@ -2547,9 +2547,9 @@ Pt.create = (t, e) => new Pt({
   innerType: t,
   typeName: E.ZodDefault,
   defaultValue: typeof e.default == "function" ? e.default : () => e.default,
-  ...j(e)
+  ...R(e)
 });
-class br extends R {
+class Or extends j {
   _parse(e) {
     const { ctx: r } = this._processInputParams(e), n = {
       ...r,
@@ -2564,7 +2564,7 @@ class br extends R {
         ...n
       }
     });
-    return mr(s) ? s.then((i) => ({
+    return xr(s) ? s.then((i) => ({
       status: "valid",
       value: i.status === "valid" ? i.value : this._def.catchValue({
         get error() {
@@ -2586,13 +2586,13 @@ class br extends R {
     return this._def.innerType;
   }
 }
-br.create = (t, e) => new br({
+Or.create = (t, e) => new Or({
   innerType: t,
   typeName: E.ZodCatch,
   catchValue: typeof e.catch == "function" ? e.catch : () => e.catch,
-  ...j(e)
+  ...R(e)
 });
-class Or extends R {
+class _r extends j {
   _parse(e) {
     if (this._getType(e) !== T.nan) {
       const n = this._getOrReturnCtx(e);
@@ -2605,12 +2605,12 @@ class Or extends R {
     return { status: "valid", value: e.data };
   }
 }
-Or.create = (t) => new Or({
+_r.create = (t) => new _r({
   typeName: E.ZodNaN,
-  ...j(t)
+  ...R(t)
 });
 const Gi = Symbol("zod_brand");
-class us extends R {
+class us extends j {
   _parse(e) {
     const { ctx: r } = this._processInputParams(e), n = r.data;
     return this._def.type._parse({
@@ -2623,7 +2623,7 @@ class us extends R {
     return this._def.type;
   }
 }
-class Wt extends R {
+class Gt extends j {
   _parse(e) {
     const { status: r, ctx: n } = this._processInputParams(e);
     if (n.common.async)
@@ -2656,29 +2656,29 @@ class Wt extends R {
     }
   }
   static create(e, r) {
-    return new Wt({
+    return new Gt({
       in: e,
       out: r,
       typeName: E.ZodPipeline
     });
   }
 }
-class _r extends R {
+class Tr extends j {
   _parse(e) {
     const r = this._def.innerType._parse(e);
-    return Nt(r) && (r.value = Object.freeze(r.value)), r;
+    return Et(r) && (r.value = Object.freeze(r.value)), r;
   }
 }
-_r.create = (t, e) => new _r({
+Tr.create = (t, e) => new Tr({
   innerType: t,
   typeName: E.ZodReadonly,
-  ...j(e)
+  ...R(e)
 });
 const ls = (t, e = {}, r) => t ? Ot.create().superRefine((n, s) => {
   var i, a;
   if (!t(n)) {
-    const o = typeof e == "function" ? e(n) : typeof e == "string" ? { message: e } : e, l = (a = (i = o.fatal) !== null && i !== void 0 ? i : r) !== null && a !== void 0 ? a : !0, h = typeof o == "string" ? { message: o } : o;
-    s.addIssue({ code: "custom", ...h, fatal: l });
+    const o = typeof e == "function" ? e(n) : typeof e == "string" ? { message: e } : e, l = (a = (i = o.fatal) !== null && i !== void 0 ? i : r) !== null && a !== void 0 ? a : !0, p = typeof o == "string" ? { message: o } : o;
+    s.addIssue({ code: "custom", ...p, fatal: l });
   }
 }) : Ot.create(), Ji = {
   object: Q.lazycreate
@@ -2689,10 +2689,10 @@ var E;
 })(E || (E = {}));
 const Hi = (t, e = {
   message: `Input not instance of ${t.name}`
-}) => ls((r) => r instanceof t, e), fs = we.create, ds = rt.create, Xi = Or.create, Qi = nt.create, hs = Et.create, ea = pt.create, ta = xr.create, ra = Ct.create, na = Mt.create, sa = Ot.create, ia = dt.create, aa = Ve.create, oa = vr.create, ca = Oe.create, ua = Q.create, la = Q.strictCreate, fa = jt.create, da = Er.create, ha = Rt.create, pa = Ne.create, ya = Bt.create, ga = wr.create, ma = yt.create, xa = bt.create, va = Ut.create, wa = Zt.create, ba = st.create, Oa = Lt.create, _a = _t.create, $n = _e.create, Ta = $e.create, Sa = gt.create, ka = _e.createWithPreprocess, Aa = Wt.create, Ia = () => fs().optional(), Na = () => ds().optional(), Ea = () => hs().optional(), Ca = {
+}) => ls((r) => r instanceof t, e), fs = we.create, ds = rt.create, Xi = _r.create, Qi = nt.create, hs = Ct.create, ea = pt.create, ta = vr.create, ra = Mt.create, na = Rt.create, sa = Ot.create, ia = dt.create, aa = Ve.create, oa = wr.create, ca = Oe.create, ua = Q.create, la = Q.strictCreate, fa = jt.create, da = Er.create, ha = Bt.create, pa = Ne.create, ya = Ut.create, ga = br.create, ma = yt.create, xa = bt.create, va = Zt.create, wa = Lt.create, ba = st.create, Oa = $t.create, _a = _t.create, Pn = _e.create, Ta = Pe.create, Sa = gt.create, ka = _e.createWithPreprocess, Aa = Gt.create, Ia = () => fs().optional(), Na = () => ds().optional(), Ea = () => hs().optional(), Ca = {
   string: (t) => we.create({ ...t, coerce: !0 }),
   number: (t) => rt.create({ ...t, coerce: !0 }),
-  boolean: (t) => Et.create({
+  boolean: (t) => Ct.create({
     ...t,
     coerce: !0
   }),
@@ -2701,10 +2701,10 @@ const Hi = (t, e = {
 }, Ma = M;
 var g = /* @__PURE__ */ Object.freeze({
   __proto__: null,
-  defaultErrorMap: It,
+  defaultErrorMap: Nt,
   setErrorMap: Ui,
-  getErrorMap: yr,
-  makeIssue: gr,
+  getErrorMap: gr,
+  makeIssue: mr,
   EMPTY_PATH: Zi,
   addIssueToContext: S,
   ParseStatus: ue,
@@ -2713,8 +2713,8 @@ var g = /* @__PURE__ */ Object.freeze({
   OK: fe,
   isAborted: Gr,
   isDirty: Jr,
-  isValid: Nt,
-  isAsync: mr,
+  isValid: Et,
+  isAsync: xr,
   get util() {
     return V;
   },
@@ -2723,48 +2723,48 @@ var g = /* @__PURE__ */ Object.freeze({
   },
   ZodParsedType: T,
   getParsedType: Ge,
-  ZodType: R,
+  ZodType: j,
   ZodString: we,
   ZodNumber: rt,
   ZodBigInt: nt,
-  ZodBoolean: Et,
+  ZodBoolean: Ct,
   ZodDate: pt,
-  ZodSymbol: xr,
-  ZodUndefined: Ct,
-  ZodNull: Mt,
+  ZodSymbol: vr,
+  ZodUndefined: Mt,
+  ZodNull: Rt,
   ZodAny: Ot,
   ZodUnknown: dt,
   ZodNever: Ve,
-  ZodVoid: vr,
+  ZodVoid: wr,
   ZodArray: Oe,
   ZodObject: Q,
   ZodUnion: jt,
   ZodDiscriminatedUnion: Er,
-  ZodIntersection: Rt,
+  ZodIntersection: Bt,
   ZodTuple: Ne,
-  ZodRecord: Bt,
-  ZodMap: wr,
+  ZodRecord: Ut,
+  ZodMap: br,
   ZodSet: yt,
   ZodFunction: bt,
-  ZodLazy: Ut,
-  ZodLiteral: Zt,
+  ZodLazy: Zt,
+  ZodLiteral: Lt,
   ZodEnum: st,
-  ZodNativeEnum: Lt,
+  ZodNativeEnum: $t,
   ZodPromise: _t,
   ZodEffects: _e,
   ZodTransformer: _e,
-  ZodOptional: $e,
+  ZodOptional: Pe,
   ZodNullable: gt,
   ZodDefault: Pt,
-  ZodCatch: br,
-  ZodNaN: Or,
+  ZodCatch: Or,
+  ZodNaN: _r,
   BRAND: Gi,
   ZodBranded: us,
-  ZodPipeline: Wt,
-  ZodReadonly: _r,
+  ZodPipeline: Gt,
+  ZodReadonly: Tr,
   custom: ls,
-  Schema: R,
-  ZodSchema: R,
+  Schema: j,
+  ZodSchema: j,
   late: Ji,
   get ZodFirstPartyTypeKind() {
     return E;
@@ -2776,7 +2776,7 @@ var g = /* @__PURE__ */ Object.freeze({
   boolean: hs,
   date: ea,
   discriminatedUnion: da,
-  effect: $n,
+  effect: Pn,
   enum: ba,
   function: xa,
   instanceof: Hi,
@@ -2803,7 +2803,7 @@ var g = /* @__PURE__ */ Object.freeze({
   strictObject: la,
   string: fs,
   symbol: ta,
-  transformer: $n,
+  transformer: Pn,
   tuple: pa,
   undefined: ra,
   union: fa,
@@ -2814,16 +2814,16 @@ var g = /* @__PURE__ */ Object.freeze({
   quotelessJson: Bi,
   ZodError: be
 });
-const cn = g.tuple([g.number(), g.number()]), un = g.object({ width: g.number(), height: g.number() }), ja = g.object({
+const cn = g.tuple([g.number(), g.number()]), un = g.object({ width: g.number(), height: g.number() }), Ra = g.object({
   signedWidth: g.number(),
   signedHeight: g.number()
-}), Ra = ["width", "height"];
-g.enum(Ra);
+}), ja = ["width", "height"];
+g.enum(ja);
 const ps = ["start", "center", "end"], Ba = ["signedWidth", "signedHeight"];
 g.enum(Ba);
-const $t = g.object({ x: g.number(), y: g.number() }), ys = g.object({ clientX: g.number(), clientY: g.number() }), ln = ["x", "y"], gs = g.enum(ln), ms = ["top", "right", "bottom", "left"], Ua = g.enum(ms), Cr = ["left", "right"], fn = g.enum(Cr), dn = ["top", "bottom"], hn = g.enum(dn), pn = ["center"], Dn = g.enum(pn), Za = [...ms, ...pn], Mr = g.enum(Za), La = g.enum(ps), xs = ["first", "last"], Pa = g.enum(xs), vs = g.object({ lower: g.number(), upper: g.number() });
+const Dt = g.object({ x: g.number(), y: g.number() }), ys = g.object({ clientX: g.number(), clientY: g.number() }), ln = ["x", "y"], gs = g.enum(ln), ms = ["top", "right", "bottom", "left"], Ua = g.enum(ms), Cr = ["left", "right"], fn = g.enum(Cr), dn = ["top", "bottom"], hn = g.enum(dn), pn = ["center"], Dn = g.enum(pn), Za = [...ms, ...pn], Mr = g.enum(Za), La = g.enum(ps), xs = ["first", "last"], $a = g.enum(xs), vs = g.object({ lower: g.number(), upper: g.number() });
 g.union([vs, cn]);
-const $a = g.union([gs, Mr]), Da = g.union([gs, Mr, g.instanceof(String)]), K = (t, e) => {
+const Pa = g.union([gs, Mr]), Da = g.union([gs, Mr, g.instanceof(String)]), W = (t, e) => {
   const r = { lower: 0, upper: 0 };
   return typeof t == "number" ? e != null ? (r.lower = t, r.upper = e) : (r.lower = 0, r.upper = t) : Array.isArray(t) ? [r.lower, r.upper] = t : (r.lower = t.lower, r.upper = t.upper), ws(r);
 }, Va = { lower: 0, upper: 0 }, za = { lower: -1 / 0, upper: 1 / 0 }, qa = { lower: 0, upper: 1 }, Ya = { lower: -1, upper: 1 }, Fa = (t, e) => {
@@ -2831,40 +2831,40 @@ const $a = g.union([gs, Mr]), Da = g.union([gs, Mr, g.instanceof(String)]), K =
     return !0;
   if (t == null || e == null)
     return !1;
-  const r = K(t), n = K(e);
+  const r = W(t), n = W(e);
   return (r == null ? void 0 : r.lower) === (n == null ? void 0 : n.lower) && (r == null ? void 0 : r.upper) === (n == null ? void 0 : n.upper);
 }, ws = (t) => t.lower > t.upper ? { lower: t.upper, upper: t.lower } : t, Ka = (t, e) => {
-  const r = K(t);
+  const r = W(t);
   return e < r.lower ? r.lower : e >= r.upper ? r.upper - 1 : e;
 }, ft = (t, e) => {
-  const r = K(t);
+  const r = W(t);
   if (typeof e == "number")
     return e >= r.lower && e < r.upper;
-  const n = K(e);
+  const n = W(e);
   return n.lower >= r.lower && n.upper <= r.upper;
 }, Wa = (t, e) => {
-  const r = K(t), n = K(e);
+  const r = W(t), n = W(e);
   return r.lower == n.lower ? !0 : n.upper == r.lower || n.lower == r.upper ? !1 : ft(r, n.upper) || ft(r, n.lower) || ft(n, r.upper) || ft(n, r.lower);
-}, jr = (t) => {
-  const e = K(t);
+}, Rr = (t) => {
+  const e = W(t);
   return e.upper - e.lower;
 }, Ga = (t) => {
-  const e = K(t);
+  const e = W(t);
   return e.lower === 0 && e.upper === 0;
-}, Ja = (t) => jr(t) === 0, Ha = (t) => {
-  const e = K(t);
+}, Ja = (t) => Rr(t) === 0, Ha = (t) => {
+  const e = W(t);
   return Number.isFinite(e.lower) && Number.isFinite(e.upper);
 }, Xa = (t) => ({
-  lower: Math.min(...t.map((e) => K(e).lower)),
-  upper: Math.max(...t.map((e) => K(e).upper))
+  lower: Math.min(...t.map((e) => W(e).lower)),
+  upper: Math.max(...t.map((e) => W(e).upper))
 }), Qa = (t) => ({
-  lower: Math.max(...t.map((e) => K(e).lower)),
-  upper: Math.min(...t.map((e) => K(e).upper))
+  lower: Math.max(...t.map((e) => W(e).lower)),
+  upper: Math.min(...t.map((e) => W(e).upper))
 }), eo = (t) => {
-  const e = K(t);
-  return Array.from({ length: jr(t) }, (r, n) => n + e.lower);
+  const e = W(t);
+  return Array.from({ length: Rr(t) }, (r, n) => n + e.lower);
 }, Xr = (t, e) => {
-  const r = t.map(K), n = r.findIndex((i, a) => ft(i, e) || e < r[a].lower);
+  const r = t.map(W), n = r.findIndex((i, a) => ft(i, e) || e < r[a].lower);
   if (n === -1)
     return { index: t.length, position: 0 };
   const s = r[n];
@@ -2875,7 +2875,7 @@ const $a = g.union([gs, Mr]), Da = g.union([gs, Mr, g.instanceof(String)]), K =
   insertInto: 0,
   deleteInBetween: 0
 }, bs = (t, e) => {
-  const r = t.map(K), n = K(e);
+  const r = t.map(W), n = W(e);
   if (r.length === 0)
     return Fr;
   const s = Xr(t, n.lower), i = Xr(t, n.upper);
@@ -2893,7 +2893,7 @@ const $a = g.union([gs, Mr]), Da = g.union([gs, Mr, g.instanceof(String)]), K =
       insertInto: s.index,
       deleteInBetween: 0
     };
-  let a = i.index - s.index, o = s.index, l = jr(r[s.index]) - s.position;
+  let a = i.index - s.index, o = s.index, l = Rr(r[s.index]) - s.position;
   return s.position != 0 ? (a -= 1, o += 1) : l = 0, {
     removeBefore: l,
     removeAfter: i.position,
@@ -2904,9 +2904,9 @@ const $a = g.union([gs, Mr]), Da = g.union([gs, Mr, g.instanceof(String)]), K =
   const r = bs(t, e);
   if (r == null)
     return t;
-  const n = K(e);
-  return n.lower += r.removeBefore, n.upper -= r.removeAfter, t.splice(r.insertInto, r.deleteInBetween, n), t.map(K);
-}, Mu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  const n = W(e);
+  return n.lower += r.removeBefore, n.upper -= r.removeAfter, t.splice(r.insertInto, r.deleteInBetween, n), t.map(W);
+}, $u = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   CLIP: Ya,
   DECIMAL: qa,
@@ -2915,7 +2915,7 @@ const $a = g.union([gs, Mr]), Da = g.union([gs, Mr, g.instanceof(String)]), K =
   bounds: vs,
   buildInsertionPlan: bs,
   clamp: Ka,
-  construct: K,
+  construct: W,
   constructArray: eo,
   contains: ft,
   equals: Fa,
@@ -2927,9 +2927,9 @@ const $a = g.union([gs, Mr]), Da = g.union([gs, Mr, g.instanceof(String)]), K =
   max: Xa,
   min: Qa,
   overlapsWith: Wa,
-  span: jr,
+  span: Rr,
   spanIsZero: Ja
-}, Symbol.toStringTag, { value: "Module" })), Os = $a, qe = (t) => ln.includes(t) ? t : dn.includes(t) ? "y" : "x", ro = (t) => qe(t) === "x" ? "y" : "x", no = (t) => qe(t) === "x" ? "width" : "height", so = (t) => qe(t) === "x" ? "left" : "top", io = (t) => Os.safeParse(t).success, ao = (t) => qe(t) === "x" ? "signedWidth" : "signedHeight", ju = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}, Symbol.toStringTag, { value: "Module" })), Os = Pa, qe = (t) => ln.includes(t) ? t : dn.includes(t) ? "y" : "x", ro = (t) => qe(t) === "x" ? "y" : "x", no = (t) => qe(t) === "x" ? "width" : "height", so = (t) => qe(t) === "x" ? "left" : "top", io = (t) => Os.safeParse(t).success, ao = (t) => qe(t) === "x" ? "signedWidth" : "signedHeight", Pu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   construct: qe,
   crude: Os,
@@ -2939,8 +2939,8 @@ const $a = g.union([gs, Mr]), Da = g.union([gs, Mr, g.instanceof(String)]), K =
   signedDimension: ao,
   swap: ro
 }, Symbol.toStringTag, { value: "Module" }));
-var ve = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {}, Z = {}, Rr = {};
-Object.defineProperty(Rr, "__esModule", { value: !0 });
+var ve = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {}, Z = {}, jr = {};
+Object.defineProperty(jr, "__esModule", { value: !0 });
 function oo(t) {
   return t === void 0 && (t = ""), t ? String(t).replace(/^[^A-Za-z0-9]*|[^A-Za-z0-9]*$/g, "").replace(/[^A-Za-z0-9]+/g, "$").replace(/([a-z])([A-Z])/g, function(e, r, n) {
     return r + "$" + n;
@@ -2948,7 +2948,7 @@ function oo(t) {
     return n.toUpperCase();
   }) : "";
 }
-Rr.default = oo;
+jr.default = oo;
 var Br = {};
 Object.defineProperty(Br, "__esModule", { value: !0 });
 function co(t) {
@@ -3047,27 +3047,27 @@ var mo = ve && ve.__spreadArrays || function() {
   return n;
 };
 Object.defineProperty(wn, "__esModule", { value: !0 });
-var je = xt;
-function rr(t, e) {
-  if (e === void 0 && (e = je.DefaultOption), !je.isValidObject(t))
+var Re = xt;
+function nr(t, e) {
+  if (e === void 0 && (e = Re.DefaultOption), !Re.isValidObject(t))
     return null;
-  e = je.validateOptions(e);
+  e = Re.validateOptions(e);
   var r = {};
   return Object.keys(t).forEach(function(n) {
     var s = t[n], i = n.toLowerCase();
-    e.recursive && (je.isValidObject(s) ? je.belongToTypes(s, e.keepTypesOnRecursion) || (s = rr(s, e)) : e.recursiveInArray && je.isArrayObject(s) && (s = mo(s).map(function(a) {
+    e.recursive && (Re.isValidObject(s) ? Re.belongToTypes(s, e.keepTypesOnRecursion) || (s = nr(s, e)) : e.recursiveInArray && Re.isArrayObject(s) && (s = mo(s).map(function(a) {
       var o = a;
-      if (je.isValidObject(a))
-        je.belongToTypes(o, e.keepTypesOnRecursion) || (o = rr(a, e));
-      else if (je.isArrayObject(a)) {
-        var l = rr({ key: a }, e);
+      if (Re.isValidObject(a))
+        Re.belongToTypes(o, e.keepTypesOnRecursion) || (o = nr(a, e));
+      else if (Re.isArrayObject(a)) {
+        var l = nr({ key: a }, e);
         o = l.key;
       }
       return o;
     }))), r[i] = s;
   }), r;
 }
-wn.default = rr;
+wn.default = nr;
 var bn = {}, xo = ve && ve.__spreadArrays || function() {
   for (var t = 0, e = 0, r = arguments.length; e < r; e++)
     t += arguments[e].length;
@@ -3077,27 +3077,27 @@ var bn = {}, xo = ve && ve.__spreadArrays || function() {
   return n;
 };
 Object.defineProperty(bn, "__esModule", { value: !0 });
-var Re = xt;
-function nr(t, e) {
-  if (e === void 0 && (e = Re.DefaultOption), !Re.isValidObject(t))
+var je = xt;
+function sr(t, e) {
+  if (e === void 0 && (e = je.DefaultOption), !je.isValidObject(t))
     return null;
-  e = Re.validateOptions(e);
+  e = je.validateOptions(e);
   var r = {};
   return Object.keys(t).forEach(function(n) {
     var s = t[n], i = n.toUpperCase();
-    e.recursive && (Re.isValidObject(s) ? Re.belongToTypes(s, e.keepTypesOnRecursion) || (s = nr(s, e)) : e.recursiveInArray && Re.isArrayObject(s) && (s = xo(s).map(function(a) {
+    e.recursive && (je.isValidObject(s) ? je.belongToTypes(s, e.keepTypesOnRecursion) || (s = sr(s, e)) : e.recursiveInArray && je.isArrayObject(s) && (s = xo(s).map(function(a) {
       var o = a;
-      if (Re.isValidObject(a))
-        Re.belongToTypes(o, e.keepTypesOnRecursion) || (o = nr(a, e));
-      else if (Re.isArrayObject(a)) {
-        var l = nr({ key: a }, e);
+      if (je.isValidObject(a))
+        je.belongToTypes(o, e.keepTypesOnRecursion) || (o = sr(a, e));
+      else if (je.isArrayObject(a)) {
+        var l = sr({ key: a }, e);
         o = l.key;
       }
       return o;
     }))), r[i] = s;
   }), r;
 }
-bn.default = nr;
+bn.default = sr;
 var On = {}, vo = ve && ve.__spreadArrays || function() {
   for (var t = 0, e = 0, r = arguments.length; e < r; e++)
     t += arguments[e].length;
@@ -3107,27 +3107,27 @@ var On = {}, vo = ve && ve.__spreadArrays || function() {
   return n;
 };
 Object.defineProperty(On, "__esModule", { value: !0 });
-var Be = xt, wo = Rr;
-function sr(t, e) {
+var Be = xt, wo = jr;
+function ir(t, e) {
   if (e === void 0 && (e = Be.DefaultOption), !Be.isValidObject(t))
     return null;
   e = Be.validateOptions(e);
   var r = {};
   return Object.keys(t).forEach(function(n) {
     var s = t[n], i = wo.default(n);
-    e.recursive && (Be.isValidObject(s) ? Be.belongToTypes(s, e.keepTypesOnRecursion) || (s = sr(s, e)) : e.recursiveInArray && Be.isArrayObject(s) && (s = vo(s).map(function(a) {
+    e.recursive && (Be.isValidObject(s) ? Be.belongToTypes(s, e.keepTypesOnRecursion) || (s = ir(s, e)) : e.recursiveInArray && Be.isArrayObject(s) && (s = vo(s).map(function(a) {
       var o = a;
       if (Be.isValidObject(a))
-        Be.belongToTypes(o, e.keepTypesOnRecursion) || (o = sr(a, e));
+        Be.belongToTypes(o, e.keepTypesOnRecursion) || (o = ir(a, e));
       else if (Be.isArrayObject(a)) {
-        var l = sr({ key: a }, e);
+        var l = ir({ key: a }, e);
         o = l.key;
       }
       return o;
     }))), r[i] = s;
   }), r;
 }
-On.default = sr;
+On.default = ir;
 var _n = {}, bo = ve && ve.__spreadArrays || function() {
   for (var t = 0, e = 0, r = arguments.length; e < r; e++)
     t += arguments[e].length;
@@ -3138,26 +3138,26 @@ var _n = {}, bo = ve && ve.__spreadArrays || function() {
 };
 Object.defineProperty(_n, "__esModule", { value: !0 });
 var Ue = xt, Oo = Br;
-function ir(t, e) {
+function ar(t, e) {
   if (e === void 0 && (e = Ue.DefaultOption), !Ue.isValidObject(t))
     return null;
   e = Ue.validateOptions(e);
   var r = {};
   return Object.keys(t).forEach(function(n) {
     var s = t[n], i = Oo.default(n);
-    e.recursive && (Ue.isValidObject(s) ? Ue.belongToTypes(s, e.keepTypesOnRecursion) || (s = ir(s, e)) : e.recursiveInArray && Ue.isArrayObject(s) && (s = bo(s).map(function(a) {
+    e.recursive && (Ue.isValidObject(s) ? Ue.belongToTypes(s, e.keepTypesOnRecursion) || (s = ar(s, e)) : e.recursiveInArray && Ue.isArrayObject(s) && (s = bo(s).map(function(a) {
       var o = a;
       if (Ue.isValidObject(a))
-        Ue.belongToTypes(o, e.keepTypesOnRecursion) || (o = ir(a, e));
+        Ue.belongToTypes(o, e.keepTypesOnRecursion) || (o = ar(a, e));
       else if (Ue.isArrayObject(a)) {
-        var l = ir({ key: a }, e);
+        var l = ar({ key: a }, e);
         o = l.key;
       }
       return o;
     }))), r[i] = s;
   }), r;
 }
-_n.default = ir;
+_n.default = ar;
 var Tn = {}, _o = ve && ve.__spreadArrays || function() {
   for (var t = 0, e = 0, r = arguments.length; e < r; e++)
     t += arguments[e].length;
@@ -3168,26 +3168,26 @@ var Tn = {}, _o = ve && ve.__spreadArrays || function() {
 };
 Object.defineProperty(Tn, "__esModule", { value: !0 });
 var Ze = xt, To = Ur;
-function ar(t, e) {
+function or(t, e) {
   if (e === void 0 && (e = Ze.DefaultOption), !Ze.isValidObject(t))
     return null;
   e = Ze.validateOptions(e);
   var r = {};
   return Object.keys(t).forEach(function(n) {
     var s = t[n], i = To.default(n);
-    e.recursive && (Ze.isValidObject(s) ? Ze.belongToTypes(s, e.keepTypesOnRecursion) || (s = ar(s, e)) : e.recursiveInArray && Ze.isArrayObject(s) && (s = _o(s).map(function(a) {
+    e.recursive && (Ze.isValidObject(s) ? Ze.belongToTypes(s, e.keepTypesOnRecursion) || (s = or(s, e)) : e.recursiveInArray && Ze.isArrayObject(s) && (s = _o(s).map(function(a) {
       var o = a;
       if (Ze.isValidObject(a))
-        Ze.belongToTypes(o, e.keepTypesOnRecursion) || (o = ar(a, e));
+        Ze.belongToTypes(o, e.keepTypesOnRecursion) || (o = or(a, e));
       else if (Ze.isArrayObject(a)) {
-        var l = ar({ key: a }, e);
+        var l = or({ key: a }, e);
         o = l.key;
       }
       return o;
     }))), r[i] = s;
   }), r;
 }
-Tn.default = ar;
+Tn.default = or;
 var Sn = {}, So = ve && ve.__spreadArrays || function() {
   for (var t = 0, e = 0, r = arguments.length; e < r; e++)
     t += arguments[e].length;
@@ -3198,29 +3198,29 @@ var Sn = {}, So = ve && ve.__spreadArrays || function() {
 };
 Object.defineProperty(Sn, "__esModule", { value: !0 });
 var Le = xt, ko = Zr;
-function or(t, e) {
+function cr(t, e) {
   if (e === void 0 && (e = Le.DefaultOption), !Le.isValidObject(t))
     return null;
   e = Le.validateOptions(e);
   var r = {};
   return Object.keys(t).forEach(function(n) {
     var s = t[n], i = ko.default(n);
-    e.recursive && (Le.isValidObject(s) ? Le.belongToTypes(s, e.keepTypesOnRecursion) || (s = or(s, e)) : e.recursiveInArray && Le.isArrayObject(s) && (s = So(s).map(function(a) {
+    e.recursive && (Le.isValidObject(s) ? Le.belongToTypes(s, e.keepTypesOnRecursion) || (s = cr(s, e)) : e.recursiveInArray && Le.isArrayObject(s) && (s = So(s).map(function(a) {
       var o = a;
       if (Le.isValidObject(a))
-        Le.belongToTypes(o, e.keepTypesOnRecursion) || (o = or(a, e));
+        Le.belongToTypes(o, e.keepTypesOnRecursion) || (o = cr(a, e));
       else if (Le.isArrayObject(a)) {
-        var l = or({ key: a }, e);
+        var l = cr({ key: a }, e);
         o = l.key;
       }
       return o;
     }))), r[i] = s;
   }), r;
 }
-Sn.default = or;
+Sn.default = cr;
 Object.defineProperty(Z, "__esModule", { value: !0 });
 Z.kebabKeys = Z.pascalKeys = Z.snakeKeys = Z.camelKeys = Z.upperKeys = Z.lowerKeys = Z.toLowerCase = Z.toUpperCase = Z.toKebabCase = Z.toHeaderCase = Z.toSentenceCase = Z.toTextCase = Z.toPathCase = Z.toDotCase = Z.toPascalCase = Z.toSnakeCase = Z.toCamelCase = void 0;
-var _s = Rr;
+var _s = jr;
 Z.toCamelCase = _s.default;
 var Ts = Br;
 Z.toSnakeCase = Ts.default;
@@ -3240,10 +3240,10 @@ var Cs = Zr;
 Z.toKebabCase = Cs.default;
 var Ms = wn;
 Z.lowerKeys = Ms.default;
-var js = bn;
-Z.upperKeys = js.default;
-var Rs = On;
-Z.camelKeys = Rs.default;
+var Rs = bn;
+Z.upperKeys = Rs.default;
+var js = On;
+Z.camelKeys = js.default;
 var Bs = _n;
 Z.snakeKeys = Bs.default;
 var Us = Tn;
@@ -3254,10 +3254,10 @@ var Ls = function(t) {
   return String(t || "").toLowerCase();
 };
 Z.toLowerCase = Ls;
-var Ps = function(t) {
+var $s = function(t) {
   return String(t || "").toUpperCase();
 };
-Z.toUpperCase = Ps;
+Z.toUpperCase = $s;
 var Ao = {
   toCamelCase: _s.default,
   toSnakeCase: Ts.default,
@@ -3268,22 +3268,22 @@ var Ao = {
   toSentenceCase: Ns.default,
   toHeaderCase: Es.default,
   toKebabCase: Cs.default,
-  toUpperCase: Ps,
+  toUpperCase: $s,
   toLowerCase: Ls,
   lowerKeys: Ms.default,
-  upperKeys: js.default,
-  camelKeys: Rs.default,
+  upperKeys: Rs.default,
+  camelKeys: js.default,
   snakeKeys: Bs.default,
   pascalKeys: Us.default,
   kebabKeys: Zs.default
 };
 Z.default = Ao;
-var $s = Z;
+var Ps = Z;
 const Ds = {
   recursive: !0,
   recursiveInArray: !0,
   keepTypesOnRecursion: [Number, String, Uint8Array]
-}, Io = (t) => $s.snakeKeys(t, Ds), No = (t) => $s.camelKeys(t, Ds);
+}, Io = (t) => Ps.snakeKeys(t, Ds), No = (t) => Ps.camelKeys(t, Ds);
 var mt;
 ((t) => {
   t.toSnake = Io, t.toCamel = No, t.capitalize = (e) => e[0].toUpperCase() + e.slice(1);
@@ -3294,53 +3294,53 @@ const Eo = fn, Co = hn, Mo = {
   bottom: "top",
   left: "right",
   center: "center"
-}, jo = {
+}, Ro = {
   top: "left",
   right: "top",
   bottom: "right",
   left: "bottom",
   center: "center"
-}, Ro = Da, it = (t) => t instanceof String ? t : ln.includes(t) ? t === "x" ? "left" : "top" : t, cr = (t) => Mo[it(t)], Bo = (t) => jo[it(t)], Dt = (t) => {
+}, jo = Da, it = (t) => t instanceof String ? t : ln.includes(t) ? t === "x" ? "left" : "top" : t, ur = (t) => Mo[it(t)], Bo = (t) => Ro[it(t)], Vt = (t) => {
   const e = it(t);
   return e === "top" || e === "bottom" ? "y" : "x";
 }, Vs = g.object({
   x: fn.or(Dn),
   y: hn.or(Dn)
-}), zs = g.object({ x: fn, y: hn }), Tt = Object.freeze({ x: "left", y: "top" }), kn = Object.freeze({ x: "right", y: "top" }), Lr = Object.freeze({ x: "left", y: "bottom" }), An = Object.freeze({ x: "right", y: "bottom" }), Vt = Object.freeze({ x: "center", y: "center" }), qs = Object.freeze({ x: "center", y: "top" }), Ys = Object.freeze({ x: "center", y: "bottom" }), Fs = Object.freeze({ x: "right", y: "center" }), Ks = Object.freeze({ x: "left", y: "center" }), Ws = Object.freeze([
+}), zs = g.object({ x: fn, y: hn }), St = Object.freeze({ x: "left", y: "top" }), kn = Object.freeze({ x: "right", y: "top" }), Lr = Object.freeze({ x: "left", y: "bottom" }), An = Object.freeze({ x: "right", y: "bottom" }), zt = Object.freeze({ x: "center", y: "center" }), qs = Object.freeze({ x: "center", y: "top" }), Ys = Object.freeze({ x: "center", y: "bottom" }), Fs = Object.freeze({ x: "right", y: "center" }), Ks = Object.freeze({ x: "left", y: "center" }), Ws = Object.freeze([
   Ks,
   Fs,
   qs,
   Ys,
-  Tt,
+  St,
   kn,
   Lr,
   An,
-  Vt
-]), Pr = (t, e) => t.x === e.x && t.y === e.y, ur = (t, e) => {
+  zt
+]), $r = (t, e) => t.x === e.x && t.y === e.y, lr = (t, e) => {
   if (typeof e == "object") {
     let r = !0;
     return "x" in e && (t.x === e.x || (r = !1)), "y" in e && (t.y === e.y || (r = !1)), r;
   }
   return t.x === e || t.y === e;
-}, Gs = (t) => [t.x, t.y], lr = (t) => Dt(it(t)) === "x", Uo = (t) => Dt(it(t)) === "y", Zo = (t) => `${t.x}${mt.capitalize(t.y)}`, Lo = (t, e) => {
+}, Gs = (t) => [t.x, t.y], fr = (t) => Vt(it(t)) === "x", Uo = (t) => Vt(it(t)) === "y", Zo = (t) => `${t.x}${mt.capitalize(t.y)}`, Lo = (t, e) => {
   let r, n;
-  if (typeof t == "object" && "x" in t ? (r = t.x, n = t.y) : (r = it(t), n = it(e ?? t)), Dt(r) === Dt(n) && r !== "center" && n !== "center")
+  if (typeof t == "object" && "x" in t ? (r = t.x, n = t.y) : (r = it(t), n = it(e ?? t)), Vt(r) === Vt(n) && r !== "center" && n !== "center")
     throw new Error(
       `[XYLocation] - encountered two locations with the same direction: ${r.toString()} - ${n.toString()}`
     );
-  const s = { ...Vt };
-  return r === "center" ? lr(n) ? [s.x, s.y] = [n, r] : [s.x, s.y] = [r, n] : n === "center" ? lr(r) ? [s.x, s.y] = [r, n] : [s.x, s.y] = [n, r] : lr(r) ? [s.x, s.y] = [r, n] : [s.x, s.y] = [n, r], s;
-}, Ru = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  const s = { ...zt };
+  return r === "center" ? fr(n) ? [s.x, s.y] = [n, r] : [s.x, s.y] = [r, n] : n === "center" ? fr(r) ? [s.x, s.y] = [r, n] : [s.x, s.y] = [n, r] : fr(r) ? [s.x, s.y] = [r, n] : [s.x, s.y] = [n, r], s;
+}, Du = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   BOTTOM_CENTER: Ys,
   BOTTOM_LEFT: Lr,
   BOTTOM_RIGHT: An,
-  CENTER: Vt,
+  CENTER: zt,
   CENTER_LOCATIONS: pn,
   LEFT_CENTER: Ks,
   RIGHT_CENTER: Fs,
   TOP_CENTER: qs,
-  TOP_LEFT: Tt,
+  TOP_LEFT: St,
   TOP_RIGHT: kn,
   XY_LOCATIONS: Ws,
   X_LOCATIONS: Cr,
@@ -3348,112 +3348,112 @@ const Eo = fn, Co = hn, Mo = {
   construct: it,
   constructXY: Lo,
   corner: zs,
-  crude: Ro,
-  direction: Dt,
-  isX: lr,
+  crude: jo,
+  direction: Vt,
+  isX: fr,
   isY: Uo,
   location: Mr,
   outer: Ua,
   rotate90: Bo,
-  swap: cr,
+  swap: ur,
   x: Eo,
   xy: Vs,
   xyCouple: Gs,
-  xyEquals: Pr,
-  xyMatches: ur,
+  xyEquals: $r,
+  xyMatches: lr,
   xyToString: Zo,
   y: Co
 }, Symbol.toStringTag, { value: "Module" })), Qr = g.union([
   g.number(),
-  $t,
+  Dt,
   cn,
   un,
-  ja,
+  Ra,
   ys
-]), W = (t, e) => {
+]), G = (t, e) => {
   if (typeof t == "string") {
     if (e === void 0)
       throw new Error("The y coordinate must be given.");
     return t === "x" ? { x: e, y: 0 } : { x: 0, y: e };
   }
   return typeof t == "number" ? { x: t, y: e ?? t } : Array.isArray(t) ? { x: t[0], y: t[1] } : "signedWidth" in t ? { x: t.signedWidth, y: t.signedHeight } : "clientX" in t ? { x: t.clientX, y: t.clientY } : "width" in t ? { x: t.width, y: t.height } : { x: t.x, y: t.y };
-}, ze = { x: 0, y: 0 }, Js = { x: 1, y: 1 }, Po = { x: 1 / 0, y: 1 / 0 }, $o = { x: NaN, y: NaN }, Tr = (t, e, r = 0) => {
-  const n = W(t), s = W(e);
+}, ze = { x: 0, y: 0 }, Js = { x: 1, y: 1 }, $o = { x: 1 / 0, y: 1 / 0 }, Po = { x: NaN, y: NaN }, Sr = (t, e, r = 0) => {
+  const n = G(t), s = G(e);
   return r === 0 ? n.x === s.x && n.y === s.y : Math.abs(n.x - s.x) <= r && Math.abs(n.y - s.y) <= r;
-}, Do = (t) => Tr(t, ze), Vo = (t, e, r = e) => {
-  const n = W(t);
+}, Do = (t) => Sr(t, ze), Vo = (t, e, r = e) => {
+  const n = G(t);
   return { x: n.x * e, y: n.y * r };
 }, In = (t, e) => {
-  const r = W(t);
+  const r = G(t);
   return { x: r.x + e, y: r.y };
 }, Nn = (t, e) => {
-  const r = W(t);
+  const r = G(t);
   return { x: r.x, y: r.y + e };
-}, Sr = (t, e, r, ...n) => typeof e == "string" && typeof r == "number" ? e === "x" ? In(t, r) : Nn(t, r) : [t, e, r ?? ze, ...n].reduce((s, i) => {
-  const a = W(i);
+}, kr = (t, e, r, ...n) => typeof e == "string" && typeof r == "number" ? e === "x" ? In(t, r) : Nn(t, r) : [t, e, r ?? ze, ...n].reduce((s, i) => {
+  const a = G(i);
   return { x: s.x + a.x, y: s.y + a.y };
 }, ze), zo = (t, e, r) => {
-  const n = W(t);
+  const n = G(t);
   return e === "x" ? { x: r, y: n.y } : { x: n.x, y: r };
 }, qo = (t, e) => {
-  const r = W(t), n = W(e);
+  const r = G(t), n = G(e);
   return Math.sqrt((r.x - n.x) ** 2 + (r.y - n.y) ** 2);
 }, Yo = (t, e) => {
-  const r = W(t), n = W(e);
+  const r = G(t), n = G(e);
   return Math.abs(r.x - n.x);
 }, Fo = (t, e) => {
-  const r = W(t), n = W(e);
+  const r = G(t), n = G(e);
   return Math.abs(r.y - n.y);
 }, Ko = (t, e) => {
-  const r = W(t), n = W(e);
+  const r = G(t), n = G(e);
   return { x: n.x - r.x, y: n.y - r.y };
 }, Wo = (t) => {
-  const e = W(t);
+  const e = G(t);
   return Number.isNaN(e.x) || Number.isNaN(e.y);
 }, Go = (t) => {
-  const e = W(t);
+  const e = G(t);
   return Number.isFinite(e.x) && Number.isFinite(e.y);
 }, Jo = (t) => {
-  const e = W(t);
+  const e = G(t);
   return [e.x, e.y];
 }, Ho = (t) => {
-  const e = W(t);
+  const e = G(t);
   return { left: e.x, top: e.y };
 }, en = (t, e = 0) => {
-  const r = W(t);
+  const r = G(t);
   return { x: Number(r.x.toFixed(e)), y: Number(r.y.toFixed(e)) };
-}, Bu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}, Vu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  INFINITY: Po,
-  NAN: $o,
+  INFINITY: $o,
+  NAN: Po,
   ONE: Js,
   ZERO: ze,
   clientXY: ys,
-  construct: W,
+  construct: G,
   couple: Jo,
   crudeZ: Qr,
   css: Ho,
   distance: qo,
-  equals: Tr,
+  equals: Sr,
   isFinite: Go,
   isNan: Wo,
   isZero: Do,
   scale: Vo,
   set: zo,
-  translate: Sr,
+  translate: kr,
   translateX: In,
   translateY: Nn,
   translation: Ko,
   truncate: en,
   xDistance: Yo,
-  xy: $t,
+  xy: Dt,
   yDistance: Fo
-}, Symbol.toStringTag, { value: "Module" })), Ht = g.union([g.number(), g.string()]);
+}, Symbol.toStringTag, { value: "Module" })), Xt = g.union([g.number(), g.string()]);
 g.object({
-  top: Ht,
-  left: Ht,
-  width: Ht,
-  height: Ht
+  top: Xt,
+  left: Xt,
+  width: Xt,
+  height: Xt
 });
 g.object({
   left: g.number(),
@@ -3462,10 +3462,10 @@ g.object({
   bottom: g.number()
 });
 const Xo = g.object({
-  one: $t,
-  two: $t,
+  one: Dt,
+  two: Dt,
   root: zs
-}), Qo = { one: ze, two: ze, root: Tt }, ec = { one: ze, two: Js, root: Lr }, Hs = (t, e) => ({
+}), Qo = { one: ze, two: ze, root: St }, ec = { one: ze, two: Js, root: Lr }, Hs = (t, e) => ({
   one: t.one,
   two: t.two,
   root: e ?? t.root
@@ -3473,7 +3473,7 @@ const Xo = g.object({
   const i = {
     one: { ...ze },
     two: { ...ze },
-    root: s ?? Tt
+    root: s ?? St
   };
   if (typeof t == "number") {
     if (typeof e != "number")
@@ -3505,11 +3505,11 @@ const Xo = g.object({
 }, Xs = (t, e) => {
   const r = z(t);
   return "one" in e ? Xe(e) >= Xe(r) && He(e) <= He(r) && Qe(e) >= Qe(r) && ht(e) <= ht(r) : e.x >= Xe(r) && e.x <= He(r) && e.y >= Qe(r) && e.y <= ht(r);
-}, rc = (t, e) => Tr(t.one, e.one) && Tr(t.two, e.two) && Pr(t.root, e.root), En = (t) => ({
+}, rc = (t, e) => Sr(t.one, e.one) && Sr(t.two, e.two) && $r(t.root, e.root), En = (t) => ({
   width: Te(t),
   height: Ee(t)
 }), nc = (t) => ({
-  signedWidth: $r(t),
+  signedWidth: Pr(t),
   signedHeight: Dr(t)
 }), sc = (t) => ({
   top: Qe(t),
@@ -3517,39 +3517,39 @@ const Xo = g.object({
   width: Te(t),
   height: Ee(t)
 }), Cn = (t, e, r = !1) => {
-  const n = qe(e) === "y" ? Dr(t) : $r(t);
+  const n = qe(e) === "y" ? Dr(t) : Pr(t);
   return r ? n : Math.abs(n);
-}, St = (t, e) => {
+}, kt = (t, e) => {
   const r = z(t);
   return {
-    x: e.x === "center" ? zt(r).x : at(r, e.x),
-    y: e.y === "center" ? zt(r).y : at(r, e.y)
+    x: e.x === "center" ? qt(r).x : at(r, e.x),
+    y: e.y === "center" ? qt(r).y : at(r, e.y)
   };
 }, at = (t, e) => {
   const r = z(t), n = Gs(r.root).includes(e) ? Math.min : Math.max;
   return Cr.includes(e) ? n(r.one.x, r.two.x) : n(r.one.y, r.two.y);
 }, ic = (t, e) => {
   const r = at(t, e);
-  return Cr.includes(e) ? { x: r, y: zt(t).y } : { x: zt(t).x, y: r };
-}, ac = (t) => t.one.x === t.two.x && t.one.y === t.two.y, Te = (t) => Cn(t, "x"), Ee = (t) => Cn(t, "y"), $r = (t) => {
+  return Cr.includes(e) ? { x: r, y: qt(t).y } : { x: qt(t).x, y: r };
+}, ac = (t) => t.one.x === t.two.x && t.one.y === t.two.y, Te = (t) => Cn(t, "x"), Ee = (t) => Cn(t, "y"), Pr = (t) => {
   const e = z(t);
   return e.two.x - e.one.x;
 }, Dr = (t) => {
   const e = z(t);
   return e.two.y - e.one.y;
-}, Qs = (t) => St(t, Tt), oc = (t) => St(t, kn), cc = (t) => St(t, Lr), uc = (t) => St(t, An), He = (t) => at(t, "right"), ht = (t) => at(t, "bottom"), Xe = (t) => at(t, "left"), Qe = (t) => at(t, "top"), zt = (t) => Sr(Qs(t), {
-  x: $r(t) / 2,
+}, Qs = (t) => kt(t, St), oc = (t) => kt(t, kn), cc = (t) => kt(t, Lr), uc = (t) => kt(t, An), He = (t) => at(t, "right"), ht = (t) => at(t, "bottom"), Xe = (t) => at(t, "left"), Qe = (t) => at(t, "top"), qt = (t) => kr(Qs(t), {
+  x: Pr(t) / 2,
   y: Dr(t) / 2
-}), qt = (t) => {
+}), Yt = (t) => {
   const e = z(t);
   return e.root.x === "left" ? Xe(e) : He(e);
-}, Yt = (t) => {
+}, Ft = (t) => {
   const e = z(t);
   return e.root.y === "top" ? Qe(e) : ht(e);
-}, lc = (t) => ({ x: qt(t), y: Yt(t) }), fr = (t) => {
+}, lc = (t) => ({ x: Yt(t), y: Ft(t) }), dr = (t) => {
   const e = z(t);
   return { lower: e.one.x, upper: e.two.x };
-}, dr = (t) => {
+}, hr = (t) => {
   const e = z(t);
   return { lower: e.one.y, upper: e.two.y };
 }, fc = (t, e) => Hs(t, e), dc = (t, e) => {
@@ -3557,21 +3557,21 @@ const Xo = g.object({
   if (Xs(n, r))
     return [r, !1];
   let s;
-  return He(r) > Te(r) ? s = W({ x: qt(r) - Te(r), y: Yt(r) }) : s = W({ x: qt(r), y: Yt(r) - Ee(r) }), [z(s, En(r)), !0];
+  return He(r) > Te(r) ? s = G({ x: Yt(r) - Te(r), y: Ft(r) }) : s = G({ x: Yt(r), y: Ft(r) - Ee(r) }), [z(s, En(r)), !0];
 }, hc = (t, e) => {
-  const r = z(t), n = z(e), s = qt(n) + (Te(n) - Te(r)) / 2, i = Yt(n) + (Ee(n) - Ee(r)) / 2;
+  const r = z(t), n = z(e), s = Yt(n) + (Te(n) - Te(r)) / 2, i = Ft(n) + (Ee(n) - Ee(r)) / 2;
   return z({ x: s, y: i }, En(r));
 }, ei = (t) => typeof t != "object" || t == null ? !1 : "one" in t && "two" in t && "root" in t, pc = (t) => Te(t) / Ee(t), yc = (t, e, r) => {
   if (typeof e == "string") {
     if (r == null)
       throw new Error("Undefined amount passed into box.translate");
     const s = qe(e);
-    e = W(s, r);
+    e = G(s, r);
   }
   const n = z(t);
   return z(
-    Sr(n.one, e),
-    Sr(n.two, e),
+    kr(n.one, e),
+    kr(n.two, e),
     void 0,
     void 0,
     n.root
@@ -3591,7 +3591,7 @@ const Xo = g.object({
 }, ni = (t, e, r, n, s, i) => {
   const a = { x: t, y: e }, o = { x: t + r, y: e + n };
   return s.x !== i.x && (s.x === "center" ? (a.x -= r / 2, o.x -= r / 2) : (a.x -= r, o.x -= r)), s.y !== i.y && (s.y === "center" ? (a.y -= n / 2, o.y -= n / 2) : (a.y -= n, o.y -= n)), z(a, o, void 0, void 0, i);
-}, Uu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}, zu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   DECIMAL: ec,
   ZERO: Qo,
@@ -3601,7 +3601,7 @@ const Xo = g.object({
   bottomLeft: cc,
   bottomRight: uc,
   box: Xo,
-  center: zt,
+  center: qt,
   construct: z,
   constructWithAlternateRoot: ni,
   contains: Xs,
@@ -3625,19 +3625,19 @@ const Xo = g.object({
   root: lc,
   signedDims: nc,
   signedHeight: Dr,
-  signedWidth: $r,
+  signedWidth: Pr,
   top: Qe,
   topLeft: Qs,
   topRight: oc,
   translate: yc,
   truncate: gc,
   width: Te,
-  x: qt,
-  xBounds: fr,
-  xyLoc: St,
-  y: Yt,
-  yBounds: dr
-}, Symbol.toStringTag, { value: "Module" })), si = g.object({ signedWidth: g.number(), signedHeight: g.number() }), mc = g.union([un, si, $t, cn]), xc = { width: 0, height: 0 }, vc = { width: 1, height: 1 }, Se = (t, e) => typeof t == "number" ? { width: t, height: e ?? t } : Array.isArray(t) ? { width: t[0], height: t[1] } : "x" in t ? { width: t.x, height: t.y } : "signedWidth" in t ? { width: t.signedWidth, height: t.signedHeight } : { ...t }, wc = (t, e) => {
+  x: Yt,
+  xBounds: dr,
+  xyLoc: kt,
+  y: Ft,
+  yBounds: hr
+}, Symbol.toStringTag, { value: "Module" })), si = g.object({ signedWidth: g.number(), signedHeight: g.number() }), mc = g.union([un, si, Dt, cn]), xc = { width: 0, height: 0 }, vc = { width: 1, height: 1 }, Se = (t, e) => typeof t == "number" ? { width: t, height: e ?? t } : Array.isArray(t) ? { width: t[0], height: t[1] } : "x" in t ? { width: t.x, height: t.y } : "signedWidth" in t ? { width: t.signedWidth, height: t.signedHeight } : { ...t }, wc = (t, e) => {
   if (e == null)
     return !1;
   const r = Se(t), n = Se(e);
@@ -3660,7 +3660,7 @@ const Xo = g.object({
 }), kc = (t, e) => {
   const r = Se(t);
   return { width: r.width * e, height: r.height * e };
-}, Zu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}, qu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   DECIMAL: vc,
   ZERO: xc,
@@ -3678,27 +3678,27 @@ const Xo = g.object({
 }, Symbol.toStringTag, { value: "Module" })), Ac = (t, e, r) => (e != null && (t = Math.max(t, e)), r != null && (t = Math.min(t, r)), t), Ic = g.object({ offset: Qr, scale: Qr }), Nc = (t) => (e, r, n, s) => r === "dimension" ? [e, n] : [e, s ? n - t : n + t], Ec = (t) => (e, r, n, s) => [e, s ? n / t : n * t], Cc = (t) => (e, r, n) => {
   if (e === null)
     return [t, n];
-  const { lower: s, upper: i } = e, { lower: a, upper: o } = t, l = i - s, h = o - a;
+  const { lower: s, upper: i } = e, { lower: a, upper: o } = t, l = i - s, p = o - a;
   if (r === "dimension")
-    return [t, n * (h / l)];
-  const b = (n - s) * (h / l) + a;
+    return [t, n * (p / l)];
+  const b = (n - s) * (p / l) + a;
   return [t, b];
-}, Mc = (t) => (e, r, n) => [t, n], jc = () => (t, e, r) => {
+}, Mc = (t) => (e, r, n) => [t, n], Rc = () => (t, e, r) => {
   if (t === null)
     throw new Error("cannot invert without bounds");
   if (e === "dimension")
     return [t, r];
   const { lower: n, upper: s } = t;
   return [t, s - (r - n)];
-}, Rc = (t) => (e, r, n) => {
+}, jc = (t) => (e, r, n) => {
   const { lower: s, upper: i } = t;
   return n = Ac(n, s, i), [e, n];
 }, We = class We {
   constructor() {
-    y(this, "ops", []);
-    y(this, "currBounds", null);
-    y(this, "currType", null);
-    y(this, "reversed", !1);
+    h(this, "ops", []);
+    h(this, "currBounds", null);
+    h(this, "currType", null);
+    h(this, "reversed", !1);
     this.ops = [];
   }
   static translate(e) {
@@ -3719,19 +3719,19 @@ const Xo = g.object({
     return n.type = "magnify", r.ops.push(n), r;
   }
   scale(e, r) {
-    const n = K(e, r), s = this.new(), i = Cc(n);
+    const n = W(e, r), s = this.new(), i = Cc(n);
     return i.type = "scale", s.ops.push(i), s;
   }
   clamp(e, r) {
-    const n = K(e, r), s = this.new(), i = Rc(n);
+    const n = W(e, r), s = this.new(), i = jc(n);
     return i.type = "clamp", s.ops.push(i), s;
   }
   reBound(e, r) {
-    const n = K(e, r), s = this.new(), i = Mc(n);
+    const n = W(e, r), s = this.new(), i = Mc(n);
     return i.type = "re-bound", s.ops.push(i), s;
   }
   invert() {
-    const e = jc();
+    const e = Rc();
     e.type = "invert";
     const r = this.new();
     return r.ops.push(e), r;
@@ -3767,8 +3767,8 @@ const Xo = g.object({
     }), e.reversed = !e.reversed, e;
   }
 };
-y(We, "IDENTITY", new We());
-let Ft = We;
+h(We, "IDENTITY", new We());
+let Kt = We;
 const Bc = (t) => ({
   scale: {
     x: t.x.dim(1),
@@ -3779,10 +3779,10 @@ const Bc = (t) => ({
     y: t.y.pos(0)
   }
 }), ge = class ge {
-  constructor(e = new Ft(), r = new Ft(), n = null) {
-    y(this, "x");
-    y(this, "y");
-    y(this, "currRoot");
+  constructor(e = new Kt(), r = new Kt(), n = null) {
+    h(this, "x");
+    h(this, "y");
+    h(this, "currRoot");
     this.x = e, this.y = r, this.currRoot = n;
   }
   static translate(e, r) {
@@ -3807,7 +3807,7 @@ const Bc = (t) => ({
     return new ge().reBound(e);
   }
   translate(e, r) {
-    const n = W(e, r), s = this.copy();
+    const n = G(e, r), s = this.copy();
     return s.x = this.x.translate(n.x), s.y = this.y.translate(n.y), s;
   }
   translateX(e) {
@@ -3826,17 +3826,17 @@ const Bc = (t) => ({
     const r = this.copy();
     if (ei(e)) {
       const n = this.currRoot;
-      return r.currRoot = e.root, n != null && !Pr(n, e.root) && (n.x !== e.root.x && (r.x = r.x.invert()), n.y !== e.root.y && (r.y = r.y.invert())), r.x = r.x.scale(fr(e)), r.y = r.y.scale(dr(e)), r;
+      return r.currRoot = e.root, n != null && !$r(n, e.root) && (n.x !== e.root.x && (r.x = r.x.invert()), n.y !== e.root.y && (r.y = r.y.invert())), r.x = r.x.scale(dr(e)), r.y = r.y.scale(hr(e)), r;
     }
     return r.x = r.x.scale(e.width), r.y = r.y.scale(e.height), r;
   }
   reBound(e) {
     const r = this.copy();
-    return r.x = this.x.reBound(fr(e)), r.y = this.y.reBound(dr(e)), r;
+    return r.x = this.x.reBound(dr(e)), r.y = this.y.reBound(hr(e)), r;
   }
   clamp(e) {
     const r = this.copy();
-    return r.x = this.x.clamp(fr(e)), r.y = this.y.clamp(dr(e)), r;
+    return r.x = this.x.clamp(dr(e)), r.y = this.y.clamp(hr(e)), r;
   }
   copy() {
     const e = new ge();
@@ -3859,17 +3859,17 @@ const Bc = (t) => ({
     );
   }
 };
-y(ge, "IDENTITY", new ge());
+h(ge, "IDENTITY", new ge());
 let tn = ge;
-const Lu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Yu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  Scale: Ft,
+  Scale: Kt,
   XY: tn,
   crudeXYTransform: Ic,
   xyScaleToTransform: Bc
 }, Symbol.toStringTag, { value: "Module" })), Uc = (t, e) => {
   const { width: r, height: n } = t.getBoundingClientRect(), { innerWidth: s, innerHeight: i } = window;
-  let a = !1, o = W(e);
+  let a = !1, o = G(e);
   return e.x + r > s && (o = In(o, -r), a = !0), e.y + n > i && (o = Nn(o, -n), a = !0), [o, a];
 }, Vn = (t) => {
   if (t == null)
@@ -3893,16 +3893,16 @@ const Lu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   if (s != null) {
     const D = s.map((pe) => Vn(pe));
     l = l.slice().sort((pe, Ye) => {
-      const Ce = D.findIndex((G) => ur(pe, G)), ot = D.findIndex((G) => ur(Ye, G));
+      const Ce = D.findIndex((J) => lr(pe, J)), ot = D.findIndex((J) => lr(Ye, J));
       return Ce > -1 && ot > -1 ? Ce - ot : Ce > -1 ? -1 : ot > -1 ? 1 : 0;
     });
   }
-  const h = l.filter(
-    (D) => !Pr(D, Vt) && (o.x == null || D.x === o.x) && (o.y == null || D.y === o.y) && !a.some((pe) => ur(D, pe))
+  const p = l.filter(
+    (D) => !$r(D, zt) && (o.x == null || D.x === o.x) && (o.y == null || D.y === o.y) && !a.some((pe) => lr(D, pe))
   ).map((D) => i == null ? void 0 : i.map((pe) => [D, pe])).flat(), b = z(t), k = z(e), ee = z(r);
-  let q = -1 / 0;
-  const de = { location: Vt, adjustedDialog: ee };
-  return h.forEach(([D, pe]) => {
+  let Y = -1 / 0;
+  const de = { location: zt, adjustedDialog: ee };
+  return p.forEach(([D, pe]) => {
     const [Ye, Ce] = Lc({
       option: D,
       alignment: pe,
@@ -3910,7 +3910,7 @@ const Lu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
       target: k,
       dialog: ee
     });
-    Ce > q && (q = Ce, de.location = D, de.adjustedDialog = Ye);
+    Ce > Y && (Y = Ce, de.location = D, de.adjustedDialog = Ye);
   }), de;
 }, Lc = ({
   option: t,
@@ -3919,43 +3919,43 @@ const Lu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   target: n,
   dialog: s
 }) => {
-  const i = ii(t, e), a = St(n, t), o = ni(
+  const i = ii(t, e), a = kt(n, t), o = ni(
     a.x,
     a.y,
     Te(s),
     Ee(s),
     i,
-    Tt
+    St
   ), l = ri(ti(o, r));
   return [o, l];
-}, Pc = {
+}, $c = {
   start: "left",
   center: "center",
   end: "right"
-}, $c = {
+}, Pc = {
   start: "bottom",
   center: "center",
   end: "top"
 }, ii = (t, e) => {
   const r = { x: "center", y: "center" };
   if (t.y !== "center") {
-    r.y = cr(t.y);
-    const n = t.x === "left" ? cr : (s) => s;
-    r.x = n(Pc[e]);
+    r.y = ur(t.y);
+    const n = t.x === "left" ? ur : (s) => s;
+    r.x = n($c[e]);
   } else
-    r.x = cr(t.x), r.y = $c[e];
+    r.x = ur(t.x), r.y = Pc[e];
   return r;
-}, Pu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}, Fu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   dialog: Zc,
   getRoot: ii,
   posititonSoVisible: Uc
-}, Symbol.toStringTag, { value: "Module" })), $u = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}, Symbol.toStringTag, { value: "Module" })), Ku = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   ALIGNMENTS: ps,
   ORDERS: xs,
   alignment: La,
-  order: Pa
+  order: $a
 }, Symbol.toStringTag, { value: "Module" })), ai = (t, e) => {
   const r = new ne(e);
   if (![
@@ -3974,8 +3974,8 @@ const Lu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   return t instanceof ne ? new ne(n) : new se(n);
 }, O = class O {
   constructor(e, r = "UTC") {
-    y(this, "value");
-    y(this, "encodeValue", !0);
+    h(this, "value");
+    h(this, "encodeValue", !0);
     if (e == null)
       this.value = O.now().valueOf();
     else if (e instanceof Date)
@@ -4090,7 +4090,7 @@ const Lu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
    *   valid, regardless of the TimeStamp order.
    */
   range(e) {
-    return new kr(this, e).makeValid();
+    return new Tt(this, e).makeValid();
   }
   /**
    * Creates a TimeRange starting at the TimeStamp and spanning the given
@@ -4255,17 +4255,17 @@ const Lu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   }
 };
 /* One nanosecond after the unix epoch */
-y(O, "NANOSECOND", O.nanoseconds(1)), /** One microsecond after the unix epoch */
-y(O, "MICROSECOND", O.microseconds(1)), /** One millisecond after the unix epoch */
-y(O, "MILLISECOND", O.milliseconds(1)), /** One second after the unix epoch */
-y(O, "SECOND", O.seconds(1)), /** One minute after the unix epoch */
-y(O, "MINUTE", O.minutes(1)), /** One hour after the unix epoch */
-y(O, "HOUR", O.hours(1)), /** One day after the unix epoch */
-y(O, "DAY", O.days(1)), /** The maximum possible value for a timestamp */
-y(O, "MAX", new O((1n << 63n) - 1n)), /** The minimum possible value for a timestamp */
-y(O, "MIN", new O(0)), /** The unix epoch */
-y(O, "ZERO", new O(0)), /** A zod schema for validating timestamps */
-y(O, "z", g.union([
+h(O, "NANOSECOND", O.nanoseconds(1)), /** One microsecond after the unix epoch */
+h(O, "MICROSECOND", O.microseconds(1)), /** One millisecond after the unix epoch */
+h(O, "MILLISECOND", O.milliseconds(1)), /** One second after the unix epoch */
+h(O, "SECOND", O.seconds(1)), /** One minute after the unix epoch */
+h(O, "MINUTE", O.minutes(1)), /** One hour after the unix epoch */
+h(O, "HOUR", O.hours(1)), /** One day after the unix epoch */
+h(O, "DAY", O.days(1)), /** The maximum possible value for a timestamp */
+h(O, "MAX", new O((1n << 63n) - 1n)), /** The minimum possible value for a timestamp */
+h(O, "MIN", new O(0)), /** The unix epoch */
+h(O, "ZERO", new O(0)), /** A zod schema for validating timestamps */
+h(O, "z", g.union([
   g.object({ value: g.bigint() }).transform((e) => new O(e.value)),
   g.string().transform((e) => new O(BigInt(e))),
   g.instanceof(Number).transform((e) => new O(e)),
@@ -4275,8 +4275,8 @@ y(O, "z", g.union([
 let ne = O;
 const I = class I {
   constructor(e) {
-    y(this, "value");
-    y(this, "encodeValue", !0);
+    h(this, "value");
+    h(this, "encodeValue", !0);
     typeof e == "number" && (e = Math.trunc(e.valueOf())), this.value = BigInt(e.valueOf());
   }
   encode() {
@@ -4306,9 +4306,9 @@ const I = class I {
     );
   }
   toString() {
-    const e = this.truncate(I.DAY), r = this.truncate(I.HOUR), n = this.truncate(I.MINUTE), s = this.truncate(I.SECOND), i = this.truncate(I.MILLISECOND), a = this.truncate(I.MICROSECOND), o = this.truncate(I.NANOSECOND), l = e, h = r.sub(e), b = n.sub(r), k = s.sub(n), ee = i.sub(s), q = a.sub(i), de = o.sub(a);
+    const e = this.truncate(I.DAY), r = this.truncate(I.HOUR), n = this.truncate(I.MINUTE), s = this.truncate(I.SECOND), i = this.truncate(I.MILLISECOND), a = this.truncate(I.MICROSECOND), o = this.truncate(I.NANOSECOND), l = e, p = r.sub(e), b = n.sub(r), k = s.sub(n), ee = i.sub(s), Y = a.sub(i), de = o.sub(a);
     let D = "";
-    return l.isZero || (D += `${l.days}d `), h.isZero || (D += `${h.hours}h `), b.isZero || (D += `${b.minutes}m `), k.isZero || (D += `${k.seconds}s `), ee.isZero || (D += `${ee.milliseconds}ms `), q.isZero || (D += `${q.microseconds}µs `), de.isZero || (D += `${de.nanoseconds}ns`), D.trim();
+    return l.isZero || (D += `${l.days}d `), p.isZero || (D += `${p.hours}h `), b.isZero || (D += `${b.minutes}m `), k.isZero || (D += `${k.seconds}s `), ee.isZero || (D += `${ee.milliseconds}ms `), Y.isZero || (D += `${Y.microseconds}µs `), de.isZero || (D += `${de.nanoseconds}ns`), D.trim();
   }
   /** @returns the decimal number of days in the timespan */
   get days() {
@@ -4433,17 +4433,17 @@ const I = class I {
   }
 };
 /** A nanosecond. */
-y(I, "NANOSECOND", I.nanoseconds(1)), /** A microsecond. */
-y(I, "MICROSECOND", I.microseconds(1)), /** A millisecond. */
-y(I, "MILLISECOND", I.milliseconds(1)), /** A second. */
-y(I, "SECOND", I.seconds(1)), /** A minute. */
-y(I, "MINUTE", I.minutes(1)), /** Represents an hour. */
-y(I, "HOUR", I.hours(1)), /** Represents a day. */
-y(I, "DAY", I.days(1)), /** The maximum possible value for a TimeSpan. */
-y(I, "MAX", new I((1n << 63n) - 1n)), /** The minimum possible value for a TimeSpan. */
-y(I, "MIN", new I(0)), /** The zero value for a TimeSpan. */
-y(I, "ZERO", new I(0)), /** A zod schema for validating and transforming timespans */
-y(I, "z", g.union([
+h(I, "NANOSECOND", I.nanoseconds(1)), /** A microsecond. */
+h(I, "MICROSECOND", I.microseconds(1)), /** A millisecond. */
+h(I, "MILLISECOND", I.milliseconds(1)), /** A second. */
+h(I, "SECOND", I.seconds(1)), /** A minute. */
+h(I, "MINUTE", I.minutes(1)), /** Represents an hour. */
+h(I, "HOUR", I.hours(1)), /** Represents a day. */
+h(I, "DAY", I.days(1)), /** The maximum possible value for a TimeSpan. */
+h(I, "MAX", new I((1n << 63n) - 1n)), /** The minimum possible value for a TimeSpan. */
+h(I, "MIN", new I(0)), /** The zero value for a TimeSpan. */
+h(I, "ZERO", new I(0)), /** A zod schema for validating and transforming timespans */
+h(I, "z", g.union([
   g.object({ value: g.bigint() }).transform((e) => new I(e.value)),
   g.string().transform((e) => new I(BigInt(e))),
   g.instanceof(Number).transform((e) => new I(e)),
@@ -4451,7 +4451,7 @@ y(I, "z", g.union([
   g.instanceof(I)
 ]));
 let se = I;
-const Pe = class Pe extends Number {
+const $e = class $e extends Number {
   constructor(e) {
     e instanceof Number ? super(e.valueOf()) : super(e);
   }
@@ -4461,7 +4461,7 @@ const Pe = class Pe extends Number {
   }
   /** @returns The number of seconds in the Rate. */
   equals(e) {
-    return this.valueOf() === new Pe(e).valueOf();
+    return this.valueOf() === new $e(e).valueOf();
   }
   /**
    * Calculates the period of the Rate as a TimeSpan.
@@ -4516,7 +4516,7 @@ const Pe = class Pe extends Number {
    * @returns A Rate representing the given number of Hz.
    */
   static hz(e) {
-    return new Pe(e);
+    return new $e(e);
   }
   /**
    * Creates a Rate representing the given number of kHz.
@@ -4525,16 +4525,16 @@ const Pe = class Pe extends Number {
    * @returns A Rate representing the given number of kHz.
    */
   static khz(e) {
-    return Pe.hz(e * 1e3);
+    return $e.hz(e * 1e3);
   }
 };
 /** A zod schema for validating and transforming rates */
-y(Pe, "z", g.union([
-  g.number().transform((e) => new Pe(e)),
-  g.instanceof(Number).transform((e) => new Pe(e)),
-  g.instanceof(Pe)
+h($e, "z", g.union([
+  g.number().transform((e) => new $e(e)),
+  g.instanceof(Number).transform((e) => new $e(e)),
+  g.instanceof($e)
 ]));
-let zn = Pe;
+let zn = $e;
 const ie = class ie extends Number {
   /**
    * Creates a Density representing the given number of bytes per value.
@@ -4554,13 +4554,13 @@ const ie = class ie extends Number {
   }
 };
 /** Unknown/Invalid Density. */
-y(ie, "UNKNOWN", new ie(0)), /** 128 bits per value. */
-y(ie, "BIT128", new ie(16)), /** 64 bits per value. */
-y(ie, "BIT64", new ie(8)), /** 32 bits per value. */
-y(ie, "BIT32", new ie(4)), /** 16 bits per value. */
-y(ie, "BIT16", new ie(2)), /** 8 bits per value. */
-y(ie, "BIT8", new ie(1)), /** A zod schema for validating and transforming densities */
-y(ie, "z", g.union([
+h(ie, "UNKNOWN", new ie(0)), /** 128 bits per value. */
+h(ie, "BIT128", new ie(16)), /** 64 bits per value. */
+h(ie, "BIT64", new ie(8)), /** 32 bits per value. */
+h(ie, "BIT32", new ie(4)), /** 16 bits per value. */
+h(ie, "BIT16", new ie(2)), /** 8 bits per value. */
+h(ie, "BIT8", new ie(1)), /** A zod schema for validating and transforming densities */
+h(ie, "z", g.union([
   g.number().transform((e) => new ie(e)),
   g.instanceof(Number).transform((e) => new ie(e)),
   g.instanceof(ie)
@@ -4582,7 +4582,7 @@ const he = class he {
      *
      * In most cases, operations should treat start as inclusive.
      */
-    y(this, "start");
+    h(this, "start");
     /**
      * The starting TimeStamp of the TimeRange.
      *
@@ -4591,7 +4591,7 @@ const he = class he {
      *
      * In most cases, operations should treat end as exclusive.
      */
-    y(this, "end");
+    h(this, "end");
     this.start = new ne(e), this.end = new ne(r);
   }
   /** @returns The TimeSpan occupied by the TimeRange. */
@@ -4667,33 +4667,33 @@ const he = class he {
   }
 };
 /** The maximum possible time range. */
-y(he, "MAX", new he(ne.MIN, ne.MAX)), /** The minimum possible time range. */
-y(he, "MIN", new he(ne.MAX, ne.MIN)), /** A zero time range. */
-y(he, "ZERO", new he(ne.ZERO, ne.ZERO)), /** A zod schema for validating and transforming time ranges */
-y(he, "z", g.union([
+h(he, "MAX", new he(ne.MIN, ne.MAX)), /** The minimum possible time range. */
+h(he, "MIN", new he(ne.MAX, ne.MIN)), /** A zero time range. */
+h(he, "ZERO", new he(ne.ZERO, ne.ZERO)), /** A zod schema for validating and transforming time ranges */
+h(he, "z", g.union([
   g.object({ start: ne.z, end: ne.z }).transform((e) => new he(e.start, e.end)),
   g.instanceof(he)
 ]));
-let kr = he;
-const p = class p extends String {
+let Tt = he;
+const y = class y extends String {
   constructor(e) {
-    if (e instanceof p || typeof e == "string" || typeof e.valueOf() == "string") {
+    if (e instanceof y || typeof e == "string" || typeof e.valueOf() == "string") {
       super(e.valueOf());
       return;
     } else {
-      const r = p.ARRAY_CONSTRUCTOR_DATA_TYPES.get(e.constructor.name);
+      const r = y.ARRAY_CONSTRUCTOR_DATA_TYPES.get(e.constructor.name);
       if (r != null) {
         super(r.valueOf());
         return;
       }
     }
-    throw super(p.UNKNOWN.valueOf()), new Error(`unable to find data type for ${e.toString()}`);
+    throw super(y.UNKNOWN.valueOf()), new Error(`unable to find data type for ${e.toString()}`);
   }
   /**
    * @returns the TypedArray constructor for the DataType.
    */
   get Array() {
-    const e = p.ARRAY_CONSTRUCTORS.get(this.toString());
+    const e = y.ARRAY_CONSTRUCTORS.get(this.toString());
     if (e == null)
       throw new Error(`unable to find array constructor for ${this.valueOf()}`);
     return e;
@@ -4706,10 +4706,10 @@ const p = class p extends String {
     return this.valueOf();
   }
   get isVariable() {
-    return this.equals(p.JSON) || this.equals(p.STRING);
+    return this.equals(y.JSON) || this.equals(y.STRING);
   }
   get density() {
-    const e = p.DENSITIES.get(this.toString());
+    const e = y.DENSITIES.get(this.toString());
     if (e == null)
       throw new Error(`unable to find density for ${this.valueOf()}`);
     return e;
@@ -4727,92 +4727,92 @@ const p = class p extends String {
     return this.toString();
   }
   get usesBigInt() {
-    return p.BIG_INT_TYPES.some((e) => e.equals(this));
+    return y.BIG_INT_TYPES.some((e) => e.equals(this));
   }
 };
 /** Represents an Unknown/Invalid DataType. */
-y(p, "UNKNOWN", new p("unknown")), /** Represents a 64-bit floating point value. */
-y(p, "FLOAT64", new p("float64")), /** Represents a 32-bit floating point value. */
-y(p, "FLOAT32", new p("float32")), /** Represents a 64-bit signed integer value. */
-y(p, "INT64", new p("int64")), /** Represents a 32-bit signed integer value. */
-y(p, "INT32", new p("int32")), /** Represents a 16-bit signed integer value. */
-y(p, "INT16", new p("int16")), /** Represents a 8-bit signed integer value. */
-y(p, "INT8", new p("int8")), /** Represents a 64-bit unsigned integer value. */
-y(p, "UINT64", new p("uint64")), /** Represents a 32-bit unsigned integer value. */
-y(p, "UINT32", new p("uint32")), /** Represents a 16-bit unsigned integer value. */
-y(p, "UINT16", new p("uint16")), /** Represents a 8-bit unsigned integer value. */
-y(p, "UINT8", new p("uint8")), /** Represents a boolean value. Alias for UINT8. */
-y(p, "BOOLEAN", p.UINT8), /** Represents a 64-bit unix epoch. */
-y(p, "TIMESTAMP", new p("timestamp")), /** Represents a UUID data type */
-y(p, "UUID", new p("uuid")), /** Represents a string data type. Strings have an unknown density, and are separate
+h(y, "UNKNOWN", new y("unknown")), /** Represents a 64-bit floating point value. */
+h(y, "FLOAT64", new y("float64")), /** Represents a 32-bit floating point value. */
+h(y, "FLOAT32", new y("float32")), /** Represents a 64-bit signed integer value. */
+h(y, "INT64", new y("int64")), /** Represents a 32-bit signed integer value. */
+h(y, "INT32", new y("int32")), /** Represents a 16-bit signed integer value. */
+h(y, "INT16", new y("int16")), /** Represents a 8-bit signed integer value. */
+h(y, "INT8", new y("int8")), /** Represents a 64-bit unsigned integer value. */
+h(y, "UINT64", new y("uint64")), /** Represents a 32-bit unsigned integer value. */
+h(y, "UINT32", new y("uint32")), /** Represents a 16-bit unsigned integer value. */
+h(y, "UINT16", new y("uint16")), /** Represents a 8-bit unsigned integer value. */
+h(y, "UINT8", new y("uint8")), /** Represents a boolean value. Alias for UINT8. */
+h(y, "BOOLEAN", y.UINT8), /** Represents a 64-bit unix epoch. */
+h(y, "TIMESTAMP", new y("timestamp")), /** Represents a UUID data type */
+h(y, "UUID", new y("uuid")), /** Represents a string data type. Strings have an unknown density, and are separate
  * by a newline character. */
-y(p, "STRING", new p("string")), /** Represents a JSON data type. JSON has an unknown density, and is separated by a
+h(y, "STRING", new y("string")), /** Represents a JSON data type. JSON has an unknown density, and is separated by a
  * newline character. */
-y(p, "JSON", new p("json")), y(p, "ARRAY_CONSTRUCTORS", /* @__PURE__ */ new Map([
-  [p.UINT8.toString(), Uint8Array],
-  [p.UINT16.toString(), Uint16Array],
-  [p.UINT32.toString(), Uint32Array],
-  [p.UINT64.toString(), BigUint64Array],
-  [p.FLOAT32.toString(), Float32Array],
-  [p.FLOAT64.toString(), Float64Array],
-  [p.INT8.toString(), Int8Array],
-  [p.INT16.toString(), Int16Array],
-  [p.INT32.toString(), Int32Array],
-  [p.INT64.toString(), BigInt64Array],
-  [p.TIMESTAMP.toString(), BigInt64Array],
-  [p.STRING.toString(), Uint8Array],
-  [p.JSON.toString(), Uint8Array],
-  [p.UUID.toString(), Uint8Array]
-])), y(p, "ARRAY_CONSTRUCTOR_DATA_TYPES", /* @__PURE__ */ new Map([
-  [Uint8Array.name, p.UINT8],
-  [Uint16Array.name, p.UINT16],
-  [Uint32Array.name, p.UINT32],
-  [BigUint64Array.name, p.UINT64],
-  [Float32Array.name, p.FLOAT32],
-  [Float64Array.name, p.FLOAT64],
-  [Int8Array.name, p.INT8],
-  [Int16Array.name, p.INT16],
-  [Int32Array.name, p.INT32],
-  [BigInt64Array.name, p.INT64]
-])), y(p, "DENSITIES", /* @__PURE__ */ new Map([
-  [p.UINT8.toString(), ce.BIT8],
-  [p.UINT16.toString(), ce.BIT16],
-  [p.UINT32.toString(), ce.BIT32],
-  [p.UINT64.toString(), ce.BIT64],
-  [p.FLOAT32.toString(), ce.BIT32],
-  [p.FLOAT64.toString(), ce.BIT64],
-  [p.INT8.toString(), ce.BIT8],
-  [p.INT16.toString(), ce.BIT16],
-  [p.INT32.toString(), ce.BIT32],
-  [p.INT64.toString(), ce.BIT64],
-  [p.TIMESTAMP.toString(), ce.BIT64],
-  [p.STRING.toString(), ce.UNKNOWN],
-  [p.JSON.toString(), ce.UNKNOWN],
-  [p.UUID.toString(), ce.BIT128]
+h(y, "JSON", new y("json")), h(y, "ARRAY_CONSTRUCTORS", /* @__PURE__ */ new Map([
+  [y.UINT8.toString(), Uint8Array],
+  [y.UINT16.toString(), Uint16Array],
+  [y.UINT32.toString(), Uint32Array],
+  [y.UINT64.toString(), BigUint64Array],
+  [y.FLOAT32.toString(), Float32Array],
+  [y.FLOAT64.toString(), Float64Array],
+  [y.INT8.toString(), Int8Array],
+  [y.INT16.toString(), Int16Array],
+  [y.INT32.toString(), Int32Array],
+  [y.INT64.toString(), BigInt64Array],
+  [y.TIMESTAMP.toString(), BigInt64Array],
+  [y.STRING.toString(), Uint8Array],
+  [y.JSON.toString(), Uint8Array],
+  [y.UUID.toString(), Uint8Array]
+])), h(y, "ARRAY_CONSTRUCTOR_DATA_TYPES", /* @__PURE__ */ new Map([
+  [Uint8Array.name, y.UINT8],
+  [Uint16Array.name, y.UINT16],
+  [Uint32Array.name, y.UINT32],
+  [BigUint64Array.name, y.UINT64],
+  [Float32Array.name, y.FLOAT32],
+  [Float64Array.name, y.FLOAT64],
+  [Int8Array.name, y.INT8],
+  [Int16Array.name, y.INT16],
+  [Int32Array.name, y.INT32],
+  [BigInt64Array.name, y.INT64]
+])), h(y, "DENSITIES", /* @__PURE__ */ new Map([
+  [y.UINT8.toString(), ce.BIT8],
+  [y.UINT16.toString(), ce.BIT16],
+  [y.UINT32.toString(), ce.BIT32],
+  [y.UINT64.toString(), ce.BIT64],
+  [y.FLOAT32.toString(), ce.BIT32],
+  [y.FLOAT64.toString(), ce.BIT64],
+  [y.INT8.toString(), ce.BIT8],
+  [y.INT16.toString(), ce.BIT16],
+  [y.INT32.toString(), ce.BIT32],
+  [y.INT64.toString(), ce.BIT64],
+  [y.TIMESTAMP.toString(), ce.BIT64],
+  [y.STRING.toString(), ce.UNKNOWN],
+  [y.JSON.toString(), ce.UNKNOWN],
+  [y.UUID.toString(), ce.BIT128]
 ])), /** All the data types. */
-y(p, "ALL", [
-  p.UNKNOWN,
-  p.FLOAT64,
-  p.FLOAT32,
-  p.INT64,
-  p.INT32,
-  p.INT16,
-  p.INT8,
-  p.UINT64,
-  p.UINT32,
-  p.UINT16,
-  p.UINT8,
-  p.TIMESTAMP,
-  p.UUID,
-  p.STRING,
-  p.JSON
-]), y(p, "BIG_INT_TYPES", [p.INT64, p.UINT64, p.TIMESTAMP]), /** A zod schema for a DataType. */
-y(p, "z", g.union([
-  g.string().transform((e) => new p(e)),
-  g.instanceof(p)
+h(y, "ALL", [
+  y.UNKNOWN,
+  y.FLOAT64,
+  y.FLOAT32,
+  y.INT64,
+  y.INT32,
+  y.INT16,
+  y.INT8,
+  y.UINT64,
+  y.UINT32,
+  y.UINT16,
+  y.UINT8,
+  y.TIMESTAMP,
+  y.UUID,
+  y.STRING,
+  y.JSON
+]), h(y, "BIG_INT_TYPES", [y.INT64, y.UINT64, y.TIMESTAMP]), /** A zod schema for a DataType. */
+h(y, "z", g.union([
+  g.string().transform((e) => new y(e)),
+  g.instanceof(y)
 ]));
-let H = p;
-const P = class P extends Number {
+let q = y;
+const $ = class $ extends Number {
   constructor(e) {
     super(e.valueOf());
   }
@@ -4825,33 +4825,33 @@ const P = class P extends Number {
     return this.valueOf() < e.valueOf();
   }
   add(e) {
-    return P.bytes(this.valueOf() + e.valueOf());
+    return $.bytes(this.valueOf() + e.valueOf());
   }
   sub(e) {
-    return P.bytes(this.valueOf() - e.valueOf());
+    return $.bytes(this.valueOf() - e.valueOf());
   }
   truncate(e) {
-    return new P(Math.trunc(this.valueOf() / e.valueOf()) * e.valueOf());
+    return new $(Math.trunc(this.valueOf() / e.valueOf()) * e.valueOf());
   }
   remainder(e) {
-    return P.bytes(this.valueOf() % e.valueOf());
+    return $.bytes(this.valueOf() % e.valueOf());
   }
   get gigabytes() {
-    return this.valueOf() / P.GIGABYTE.valueOf();
+    return this.valueOf() / $.GIGABYTE.valueOf();
   }
   get megabytes() {
-    return this.valueOf() / P.MEGABYTE.valueOf();
+    return this.valueOf() / $.MEGABYTE.valueOf();
   }
   get kilobytes() {
-    return this.valueOf() / P.KILOBYTE.valueOf();
+    return this.valueOf() / $.KILOBYTE.valueOf();
   }
   get terabytes() {
-    return this.valueOf() / P.TERABYTE.valueOf();
+    return this.valueOf() / $.TERABYTE.valueOf();
   }
   toString() {
-    const e = this.truncate(P.TERABYTE), r = this.truncate(P.GIGABYTE), n = this.truncate(P.MEGABYTE), s = this.truncate(P.KILOBYTE), i = this.truncate(P.BYTE), a = e, o = r.sub(e), l = n.sub(r), h = s.sub(n), b = i.sub(s);
+    const e = this.truncate($.TERABYTE), r = this.truncate($.GIGABYTE), n = this.truncate($.MEGABYTE), s = this.truncate($.KILOBYTE), i = this.truncate($.BYTE), a = e, o = r.sub(e), l = n.sub(r), p = s.sub(n), b = i.sub(s);
     let k = "";
-    return a.isZero || (k += `${a.terabytes}TB `), o.isZero || (k += `${o.gigabytes}GB `), l.isZero || (k += `${l.megabytes}MB `), h.isZero || (k += `${h.kilobytes}KB `), (!b.isZero || k === "") && (k += `${b.valueOf()}B`), k.trim();
+    return a.isZero || (k += `${a.terabytes}TB `), o.isZero || (k += `${o.gigabytes}GB `), l.isZero || (k += `${l.megabytes}MB `), p.isZero || (k += `${p.kilobytes}KB `), (!b.isZero || k === "") && (k += `${b.valueOf()}B`), k.trim();
   }
   /**
    * Creates a Size from the given number of bytes.
@@ -4860,7 +4860,7 @@ const P = class P extends Number {
    * @returns A Size representing the given number of bytes.
    */
   static bytes(e = 1) {
-    return new P(e);
+    return new $(e);
   }
   /**
    * Creates a Size from the given number if kilobytes.
@@ -4869,7 +4869,7 @@ const P = class P extends Number {
    * @returns A Size representing the given number of kilobytes.
    */
   static kilobytes(e = 1) {
-    return P.bytes(e.valueOf() * 1e3);
+    return $.bytes(e.valueOf() * 1e3);
   }
   /**
    * Creates a Size from the given number of megabytes.
@@ -4878,7 +4878,7 @@ const P = class P extends Number {
    * @returns A Size representing the given number of megabytes.
    */
   static megabytes(e = 1) {
-    return P.kilobytes(e.valueOf() * 1e3);
+    return $.kilobytes(e.valueOf() * 1e3);
   }
   /**
    * Creates a Size from the given number of gigabytes.
@@ -4887,7 +4887,7 @@ const P = class P extends Number {
    * @returns A Size representing the given number of gigabytes.
    */
   static gigabytes(e = 1) {
-    return P.megabytes(e.valueOf() * 1e3);
+    return $.megabytes(e.valueOf() * 1e3);
   }
   /**
    * Creates a Size from the given number of terabytes.
@@ -4896,25 +4896,25 @@ const P = class P extends Number {
    * @returns  A Size representing the given number of terabytes.
    */
   static terabytes(e) {
-    return P.gigabytes(e.valueOf() * 1e3);
+    return $.gigabytes(e.valueOf() * 1e3);
   }
   get isZero() {
     return this.valueOf() === 0;
   }
 };
 /** A single byte */
-y(P, "BYTE", new P(1)), /** A kilobyte */
-y(P, "KILOBYTE", P.kilobytes(1)), /** A megabyte */
-y(P, "MEGABYTE", P.megabytes(1)), /** A gigabyte */
-y(P, "GIGABYTE", P.gigabytes(1)), /** A terabyte. */
-y(P, "TERABYTE", P.terabytes(1)), /** The zero value for Size */
-y(P, "ZERO", new P(0)), /** A zod schema for a Size. */
-y(P, "z", g.union([
-  g.number().transform((e) => new P(e)),
-  g.instanceof(P)
+h($, "BYTE", new $(1)), /** A kilobyte */
+h($, "KILOBYTE", $.kilobytes(1)), /** A megabyte */
+h($, "MEGABYTE", $.megabytes(1)), /** A gigabyte */
+h($, "GIGABYTE", $.gigabytes(1)), /** A terabyte. */
+h($, "TERABYTE", $.terabytes(1)), /** The zero value for Size */
+h($, "ZERO", new $(0)), /** A zod schema for a Size. */
+h($, "z", g.union([
+  g.number().transform((e) => new $(e)),
+  g.instanceof($)
 ]));
-let Ar = P;
-const Du = g.union([
+let Ar = $;
+const Wu = g.union([
   g.instanceof(Uint8Array),
   g.instanceof(Uint16Array),
   g.instanceof(Uint32Array),
@@ -4928,35 +4928,35 @@ const Du = g.union([
 ]), oi = (t) => {
   const e = typeof t;
   return e === "string" || e === "number" || e === "boolean" || e === "bigint" || t instanceof ne || t instanceof se || t instanceof Date;
-}, Dc = (t, e, r, n = 0) => t.usesBigInt && !e.usesBigInt ? Number(r) - Number(n) : !t.usesBigInt && e.usesBigInt ? BigInt(r) - BigInt(n) : At(r, -n), Vc = (t) => t == null ? !1 : Array.isArray(t) || t instanceof ArrayBuffer || ArrayBuffer.isView(t) && !(t instanceof DataView) || t instanceof ke ? !0 : oi(t), ut = -1;
+}, Dc = (t, e, r, n = 0) => t.usesBigInt && !e.usesBigInt ? Number(r) - Number(n) : !t.usesBigInt && e.usesBigInt ? BigInt(r) - BigInt(n) : It(r, -n), Vc = (t) => t == null ? !1 : Array.isArray(t) || t instanceof ArrayBuffer || ArrayBuffer.isView(t) && !(t instanceof DataView) || t instanceof ke ? !0 : oi(t), ut = -1;
 class ke {
   constructor(e) {
-    y(this, "key", "");
+    h(this, "key", "");
     /** The data type of the array */
-    y(this, "dataType");
+    h(this, "dataType");
     /**
      * A sample offset that can be used to shift the values of all samples upwards or
      * downwards. Typically used to convert arrays to lower precision while preserving
      * the relative range of actual values.
      */
-    y(this, "sampleOffset");
+    h(this, "sampleOffset");
     /**
      * Stores information about the buffer state of this array into a WebGL buffer.
      */
-    y(this, "gl");
+    h(this, "gl");
     /** The underlying data. */
-    y(this, "_data");
-    y(this, "_timeRange");
-    y(this, "alignment", 0);
+    h(this, "_data");
+    h(this, "_timeRange");
+    h(this, "alignment", 0);
     /** A cached minimum value. */
-    y(this, "_cachedMin");
+    h(this, "_cachedMin");
     /** A cached maximum value. */
-    y(this, "_cachedMax");
+    h(this, "_cachedMax");
     /** The write position of the buffer. */
-    y(this, "writePos", ut);
+    h(this, "writePos", ut);
     /** Tracks the number of entities currently using this array. */
-    y(this, "_refCount", 0);
-    y(this, "_cachedLength");
+    h(this, "_refCount", 0);
+    h(this, "_cachedLength");
     Vc(e) && (e = { data: e });
     const {
       dataType: r,
@@ -4970,17 +4970,17 @@ class ke {
       this.key = l.key, this.dataType = l.dataType, this.sampleOffset = l.sampleOffset, this.gl = l.gl, this._data = l._data, this._timeRange = l._timeRange, this.alignment = l.alignment, this._cachedMin = l._cachedMin, this._cachedMax = l._cachedMax, this.writePos = l.writePos, this._refCount = l._refCount, this._cachedLength = l._cachedLength;
       return;
     }
-    const h = oi(l), b = Array.isArray(l);
+    const p = oi(l), b = Array.isArray(l);
     if (r != null)
-      this.dataType = new H(r);
+      this.dataType = new q(r);
     else {
       if (l instanceof ArrayBuffer)
         throw new Error(
           "cannot infer data type from an ArrayBuffer instance when constructing a Series. Please provide a data type."
         );
-      if (b || h) {
+      if (b || p) {
         let k = l;
-        if (!h) {
+        if (!p) {
           if (l.length === 0)
             throw new Error(
               "cannot infer data type from a zero length JS array when constructing a Series. Please provide a data type."
@@ -4988,33 +4988,33 @@ class ke {
           k = l[0];
         }
         if (typeof k == "string")
-          this.dataType = H.STRING;
+          this.dataType = q.STRING;
         else if (typeof k == "number")
-          this.dataType = H.FLOAT64;
+          this.dataType = q.FLOAT64;
         else if (typeof k == "bigint")
-          this.dataType = H.INT64;
+          this.dataType = q.INT64;
         else if (typeof k == "boolean")
-          this.dataType = H.BOOLEAN;
+          this.dataType = q.BOOLEAN;
         else if (k instanceof ne || k instanceof Date || k instanceof ne)
-          this.dataType = H.TIMESTAMP;
+          this.dataType = q.TIMESTAMP;
         else if (typeof k == "object")
-          this.dataType = H.JSON;
+          this.dataType = q.JSON;
         else
           throw new Error(
             `cannot infer data type of ${typeof k} when constructing a Series from a JS array`
           );
       } else
-        this.dataType = new H(l);
+        this.dataType = new q(l);
     }
-    if (!b && !h)
+    if (!b && !p)
       this._data = l;
     else {
-      let k = h ? [l] : l;
+      let k = p ? [l] : l;
       const ee = k[0];
-      (ee instanceof ne || ee instanceof Date || ee instanceof se) && (k = k.map((q) => new ne(q).valueOf())), this.dataType.equals(H.STRING) ? (this._cachedLength = k.length, this._data = new TextEncoder().encode(k.join(`
+      (ee instanceof ne || ee instanceof Date || ee instanceof se) && (k = k.map((Y) => new ne(Y).valueOf())), this.dataType.equals(q.STRING) ? (this._cachedLength = k.length, this._data = new TextEncoder().encode(k.join(`
 `) + `
-`)) : this.dataType.equals(H.JSON) ? (this._cachedLength = k.length, this._data = new TextEncoder().encode(
-        k.map((q) => JSON.stringify(q)).join(`
+`)) : this.dataType.equals(q.JSON) ? (this._cachedLength = k.length, this._data = new TextEncoder().encode(
+        k.map((Y) => JSON.stringify(Y)).join(`
 `) + `
 `
       )) : this._data = new this.dataType.Array(k).buffer;
@@ -5029,7 +5029,7 @@ class ke {
   static alloc({ capacity: e, dataType: r, ...n }) {
     if (e === 0)
       throw new Error("[Series] - cannot allocate an array of length 0");
-    const s = new new H(r).Array(e), i = new ke({
+    const s = new new q(r).Array(e), i = new ke({
       data: s.buffer,
       dataType: r,
       ...n
@@ -5040,7 +5040,7 @@ class ke {
     const s = n.spanRange(r.span(e)), i = new BigInt64Array(e);
     for (let a = 0; a < e; a++)
       i[a] = BigInt(n.add(r.span(a)).valueOf());
-    return new ke({ data: i, dataType: H.TIMESTAMP, timeRange: s });
+    return new ke({ data: i, dataType: q.TIMESTAMP, timeRange: s });
   }
   get refCount() {
     return this._refCount;
@@ -5049,7 +5049,7 @@ class ke {
     const n = new TextEncoder().encode(e.join(`
 `) + `
 `);
-    return new ke({ data: n, dataType: H.STRING, timeRange: r });
+    return new ke({ data: n, dataType: q.STRING, timeRange: r });
   }
   static fromJSON(e, r) {
     const n = new TextEncoder().encode(
@@ -5057,7 +5057,7 @@ class ke {
 `) + `
 `
     );
-    return new ke({ data: n, dataType: H.JSON, timeRange: r });
+    return new ke({ data: n, dataType: q.JSON, timeRange: r });
   }
   acquire(e) {
     this._refCount++, e != null && this.updateGLBuffer(e);
@@ -5096,15 +5096,15 @@ class ke {
     return this.writePos === ut ? this.underlyingData : new this.dataType.Array(this._data, 0, this.writePos);
   }
   toStrings() {
-    if (!this.dataType.equals(H.STRING))
+    if (!this.dataType.equals(q.STRING))
       throw new Error("cannot convert non-string series to strings");
     return new TextDecoder().decode(this.buffer).split(`
 `).slice(0, -1);
   }
   toUUIDs() {
-    if (!this.dataType.equals(H.UUID))
+    if (!this.dataType.equals(q.UUID))
       throw new Error("cannot convert non-uuid series to uuids");
-    const e = H.UUID.density.valueOf(), r = Array(this.length);
+    const e = q.UUID.density.valueOf(), r = Array(this.length);
     for (let n = 0; n < this.length; n++) {
       const s = this.buffer.slice(n * e, (n + 1) * e), i = Array.from(new Uint8Array(s), (a) => a.toString(16).padStart(2, "0")).join("").replace(/(.{8})(.{4})(.{4})(.{4})(.{12})/, "$1-$2-$3-$4-$5");
       r[n] = i;
@@ -5112,7 +5112,7 @@ class ke {
     return r;
   }
   parseJSON(e) {
-    if (!this.dataType.equals(H.JSON))
+    if (!this.dataType.equals(q.JSON))
       throw new Error("cannot convert non-string series to strings");
     return new TextDecoder().decode(this.buffer).split(`
 `).slice(0, -1).map((r) => e.parse(JSON.parse(r)));
@@ -5140,6 +5140,8 @@ class ke {
     return this._cachedLength != null ? this._cachedLength : this.dataType.isVariable ? this.calculateCachedLength() : this.writePos === ut ? this.data.length : this.writePos;
   }
   calculateCachedLength() {
+    if (!this.dataType.isVariable)
+      throw new Error("cannot calculate length of a non-variable length data type");
     let e = 0;
     return this.data.forEach((r) => {
       r === 10 && e++;
@@ -5172,7 +5174,7 @@ class ke {
   calcRawMax() {
     if (this.length === 0)
       return -1 / 0;
-    if (this.dataType.equals(H.TIMESTAMP))
+    if (this.dataType.equals(q.TIMESTAMP))
       this._cachedMax = this.data[this.data.length - 1];
     else if (this.dataType.usesBigInt) {
       const e = this.data;
@@ -5187,12 +5189,12 @@ class ke {
   get max() {
     if (this.dataType.isVariable)
       throw new Error("cannot calculate maximum on a variable length data type");
-    return this.writePos === 0 ? -1 / 0 : (this._cachedMax == null && (this._cachedMax = this.calcRawMax()), At(this._cachedMax, this.sampleOffset));
+    return this.writePos === 0 ? -1 / 0 : (this._cachedMax == null && (this._cachedMax = this.calcRawMax()), It(this._cachedMax, this.sampleOffset));
   }
   calcRawMin() {
     if (this.length === 0)
       return 1 / 0;
-    if (this.dataType.equals(H.TIMESTAMP))
+    if (this.dataType.equals(q.TIMESTAMP))
       this._cachedMin = this.data[0];
     else if (this.dataType.usesBigInt) {
       const e = this.data;
@@ -5207,11 +5209,11 @@ class ke {
   get min() {
     if (this.dataType.isVariable)
       throw new Error("cannot calculate minimum on a variable length data type");
-    return this.writePos === 0 ? 1 / 0 : (this._cachedMin == null && (this._cachedMin = this.calcRawMin()), At(this._cachedMin, this.sampleOffset));
+    return this.writePos === 0 ? 1 / 0 : (this._cachedMin == null && (this._cachedMin = this.calcRawMin()), It(this._cachedMin, this.sampleOffset));
   }
   /** @returns the bounds of this array. */
   get bounds() {
-    return K(Number(this.min), Number(this.max));
+    return W(Number(this.min), Number(this.max));
   }
   maybeRecomputeMinMax(e) {
     if (this._cachedMin != null) {
@@ -5227,9 +5229,11 @@ class ke {
     this.max, this.min;
   }
   get range() {
-    return At(this.max, -this.min);
+    return It(this.max, -this.min);
   }
   at(e, r) {
+    if (this.dataType.isVariable)
+      return this.atVariable(e, r ?? !1);
     e < 0 && (e = this.length + e);
     const n = this.data[e];
     if (n == null) {
@@ -5237,7 +5241,26 @@ class ke {
         throw new Error(`[series] - no value at index ${e}`);
       return;
     }
-    return At(n, this.sampleOffset);
+    return It(n, this.sampleOffset);
+  }
+  atVariable(e, r) {
+    e < 0 && (e = this.length + e);
+    let n = 0, s = 0;
+    for (let a = 0; a < this.data.length; a++)
+      if (this.data[a] === 10) {
+        if (e === 0) {
+          s = a;
+          break;
+        }
+        n = a + 1, e--;
+      }
+    if (s === 0 && (s = this.data.length), n >= s || e > 0) {
+      if (r)
+        throw new Error(`[series] - no value at index ${e}`);
+      return;
+    }
+    const i = this.data.slice(n, s);
+    return this.dataType.equals(q.STRING) ? new TextDecoder().decode(i) : JSON.parse(new TextDecoder().decode(i));
   }
   /**
    * @returns the index of the first sample that is greater than or equal to the given value.
@@ -5256,7 +5279,7 @@ class ke {
     return r;
   }
   updateGLBuffer(e) {
-    if (this.gl.control = e, !this.dataType.equals(H.FLOAT32))
+    if (this.gl.control = e, !this.dataType.equals(q.FLOAT32))
       throw new Error("Only FLOAT32 arrays can be used in WebGL");
     const { buffer: r, bufferUsage: n, prevBuffer: s } = this.gl;
     if (r == null && (this.gl.buffer = e.createBuffer()), this.writePos !== s)
@@ -5271,6 +5294,13 @@ class ke {
           n === "static" ? e.STATIC_DRAW : e.DYNAMIC_DRAW
         ), this.gl.prevBuffer = ut;
   }
+  as(e) {
+    if (!new q(e).equals(this.dataType))
+      throw new Error(
+        `cannot convert series of type ${this.dataType.toString()} to ${e.toString()}`
+      );
+    return this;
+  }
   get digest() {
     var e;
     return {
@@ -5292,7 +5322,7 @@ class ke {
     };
   }
   get alignmentBounds() {
-    return K(this.alignment, this.alignment + this.length);
+    return W(this.alignment, this.alignment + this.length);
   }
   maybeGarbageCollectGLBuffer(e) {
     this.gl.buffer != null && (e.deleteBuffer(this.gl.buffer), this.gl.buffer = null, this.gl.prevBuffer = 0, this.gl.control = null);
@@ -5302,6 +5332,13 @@ class ke {
       throw new Error("gl buffer not initialized");
     return this.gl.prevBuffer !== this.writePos && console.warn("buffer not updated"), this.gl.buffer;
   }
+  [Symbol.iterator]() {
+    if (this.dataType.isVariable) {
+      const e = new zc(this);
+      return this.dataType.equals(q.JSON) ? new qc(e) : e;
+    }
+    return new Yc(this);
+  }
   slice(e, r) {
     if (e <= 0 && (r == null || r >= this.length))
       return this;
@@ -5319,28 +5356,155 @@ class ke {
     return new ke({
       data: this.buffer,
       dataType: this.dataType,
-      timeRange: kr.ZERO,
+      timeRange: Tt.ZERO,
       sampleOffset: this.sampleOffset,
       glBufferUsage: "static",
       alignment: e
     });
   }
 }
-const At = (t, e) => typeof t == "bigint" && typeof e == "bigint" || typeof t == "number" && typeof e == "number" ? t + e : Number(t) + Number(e), Vu = g.record(
+class zc {
+  constructor(e) {
+    h(this, "series");
+    h(this, "index");
+    h(this, "decoder");
+    if (!e.dataType.isVariable)
+      throw new Error(
+        "cannot create a variable series iterator for a non-variable series"
+      );
+    this.series = e, this.index = 0, this.decoder = new TextDecoder();
+  }
+  next() {
+    const e = this.index, r = this.series.data;
+    for (; this.index < r.length && r[this.index] !== 10; )
+      this.index++;
+    const n = this.index;
+    return e === n ? { done: !0, value: void 0 } : (this.index++, { done: !1, value: this.decoder.decode(this.series.buffer.slice(e, n)) });
+  }
+  [Symbol.iterator]() {
+    return this;
+  }
+}
+var Ru;
+class qc {
+  constructor(e) {
+    h(this, "wrapped");
+    h(this, Ru, "JSONSeriesIterator");
+    this.wrapped = e;
+  }
+  next() {
+    const e = this.wrapped.next();
+    return e.done === !0 ? { done: !0, value: void 0 } : { done: !1, value: JSON.parse(e.value) };
+  }
+  [Symbol.iterator]() {
+    return this;
+  }
+}
+Ru = Symbol.toStringTag;
+var ju;
+class Yc {
+  constructor(e) {
+    h(this, "series");
+    h(this, "index");
+    h(this, ju, "SeriesIterator");
+    this.series = e, this.index = 0;
+  }
+  next() {
+    return this.index >= this.series.length ? { done: !0, value: void 0 } : {
+      done: !1,
+      value: this.series.at(this.index++, !0)
+    };
+  }
+  [Symbol.iterator]() {
+    return this;
+  }
+}
+ju = Symbol.toStringTag;
+const It = (t, e) => typeof t == "bigint" && typeof e == "bigint" || typeof t == "number" && typeof e == "number" ? t + e : Number(t) + Number(e);
+class Gu {
+  constructor(e) {
+    h(this, "series");
+    if (e.length !== 0) {
+      const r = e[0].dataType;
+      for (let n = 1; n < e.length; n++)
+        if (!e[n].dataType.equals(r))
+          throw new Error("[multi-series] - series must have the same data type");
+    }
+    this.series = e;
+  }
+  as(e) {
+    if (!new q(e).equals(this.dataType))
+      throw new Error(
+        `cannot convert series of type ${this.dataType.toString()} to ${e.toString()}`
+      );
+    return this;
+  }
+  get dataType() {
+    return this.series.length === 0 ? q.UNKNOWN : this.series[0].dataType;
+  }
+  get timeRange() {
+    return this.series.length === 0 ? Tt.ZERO : new Tt(
+      this.series[0].timeRange.start,
+      this.series[this.series.length - 1].timeRange.end
+    );
+  }
+  push(e) {
+    this.series.push(e);
+  }
+  get length() {
+    return this.series.reduce((e, r) => e + r.length, 0);
+  }
+  at(e, r = !1) {
+    e < 0 && (e = this.length + e);
+    for (const n of this.series) {
+      if (e < n.length)
+        return n.at(e, r);
+      e -= n.length;
+    }
+    if (r)
+      throw new Error(`[series] - no value at index ${e}`);
+  }
+  [Symbol.iterator]() {
+    return this.series.length === 0 ? {
+      next() {
+        return { done: !0, value: void 0 };
+      }
+    } : new Fc(this.series);
+  }
+}
+var Bu;
+class Fc {
+  constructor(e) {
+    h(this, "series");
+    h(this, "seriesIndex");
+    h(this, "internal");
+    h(this, Bu, "MultiSeriesIterator");
+    this.series = e, this.seriesIndex = 0, this.internal = e[0][Symbol.iterator]();
+  }
+  next() {
+    const e = this.internal.next();
+    return e.done === !1 ? e : this.seriesIndex === this.series.length - 1 ? { done: !0, value: void 0 } : (this.internal = this.series[++this.seriesIndex][Symbol.iterator](), this.next());
+  }
+  [Symbol.iterator]() {
+    return this;
+  }
+}
+Bu = Symbol.toStringTag;
+const Ju = g.record(
   g.union([g.number(), g.string(), g.symbol()]),
   g.unknown()
-), zu = (t) => Object.entries(t), qu = (t) => {
+), Hu = (t) => Object.entries(t), Xu = (t) => {
   if (t === void 0 || typeof t == "string" || typeof t == "number")
     return t;
   if (t.toString === void 0)
     throw new Error("invalid renderer");
   return t.toString();
-}, hr = (t) => t != null && typeof t == "object" && !Array.isArray(t), ci = () => (
+}, pr = (t) => t != null && typeof t == "object" && !Array.isArray(t), ci = () => (
   // eslint-disable-next-line @typescript-eslint/prefer-optional-chain
   typeof process < "u" && process.versions != null && process.versions.node != null ? "node" : typeof window > "u" || window.document === void 0 ? "webworker" : "browser"
-), zc = ci(), ui = ["MacOS", "Windows", "Linux", "Docker"], qc = g.enum(ui);
-let Xt;
-const Yc = () => {
+), Kc = ci(), ui = ["MacOS", "Windows", "Linux", "Docker"], Wc = g.enum(ui);
+let Qt;
+const Gc = () => {
   if (typeof window > "u")
     return;
   const t = window.navigator.userAgent.toLowerCase();
@@ -5350,17 +5514,17 @@ const Yc = () => {
     return "Windows";
   if (t.includes("linux"))
     return "Linux";
-}, Fc = (t = {}) => {
+}, Jc = (t = {}) => {
   const { force: e, default: r } = t;
-  return e ?? Xt ?? (Xt = Yc(), Xt ?? r);
-}, Yu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  return e ?? Qt ?? (Qt = Gc(), Qt ?? r);
+}, Qu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   OPERATING_SYSTEMS: ui,
-  RUNTIME: zc,
+  RUNTIME: Kc,
   detect: ci,
-  getOS: Fc,
-  osZ: qc
-}, Symbol.toStringTag, { value: "Module" })), Kc = (t) => JSON.parse(JSON.stringify(t)), Wc = (t, ...e) => (e.forEach((r) => {
+  getOS: Jc,
+  osZ: Wc
+}, Symbol.toStringTag, { value: "Module" })), Hc = (t) => JSON.parse(JSON.stringify(t)), Xc = (t, ...e) => (e.forEach((r) => {
   let n = t;
   const s = r.split(".");
   s.forEach((i, a) => {
@@ -5381,7 +5545,7 @@ const Yc = () => {
     s = a;
   }
   return s;
-}, Gc = (t, e, r) => {
+}, Qc = (t, e, r) => {
   const n = e.split(".");
   let s = t;
   for (let i = 0; i < n.length - 1; i++) {
@@ -5391,10 +5555,10 @@ const Yc = () => {
     s = s[a];
   }
   s[n[n.length - 1]] = r;
-}, Jc = (t, e) => {
+}, eu = (t, e) => {
   const r = t.split(".");
   return e < 0 ? r[r.length + e] : r[e];
-}, Hc = (t) => t.join("."), Xc = (t, e) => {
+}, tu = (t) => t.join("."), ru = (t, e) => {
   try {
     return li(t, e), !0;
   } catch {
@@ -5404,10 +5568,10 @@ const Yc = () => {
   if (e.length === 0)
     return t;
   const r = e.shift();
-  if (hr(t) && hr(r))
+  if (pr(t) && pr(r))
     for (const n in r)
       try {
-        hr(r[n]) ? (n in t || Object.assign(t, { [n]: {} }), rn(t[n], r[n])) : Object.assign(t, { [n]: r[n] });
+        pr(r[n]) ? (n in t || Object.assign(t, { [n]: {} }), rn(t[n], r[n])) : Object.assign(t, { [n]: r[n] });
       } catch (s) {
         throw s instanceof TypeError ? new TypeError(`.${n}: ${s.message}`) : s;
       }
@@ -5456,7 +5620,7 @@ const Yc = () => {
       return !1;
   }
   return !0;
-}, Qc = (t) => {
+}, nu = (t) => {
   let e, r;
   return (...s) => {
     if (Ir(e, s))
@@ -5464,7 +5628,7 @@ const Yc = () => {
     const i = t(...s);
     return e = s, r = i, i;
   };
-}, eu = (t, e, r = "") => {
+}, su = (t, e, r = "") => {
   const n = {}, s = (i, a, o) => {
     if (typeof i != typeof a || i === null || a === null) {
       n[o] = [i, a];
@@ -5479,44 +5643,44 @@ const Yc = () => {
         for (let l = 0; l < i.length; l++)
           s(i[l], a[l], `${o}[${l}]`);
       } else
-        (/* @__PURE__ */ new Set([...Object.keys(i), ...Object.keys(a)])).forEach((h) => {
-          s(i[h], a[h], o ? `${o}.${h}` : h);
+        (/* @__PURE__ */ new Set([...Object.keys(i), ...Object.keys(a)])).forEach((p) => {
+          s(i[p], a[p], o ? `${o}.${p}` : p);
         });
     else
       i !== a && (n[o] = [i, a]);
   };
   return s(t, e, r), n;
-}, Fu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}, el = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  copy: Kc,
-  deleteD: Wc,
-  difference: eu,
-  element: Jc,
+  copy: Hc,
+  deleteD: Xc,
+  difference: su,
+  element: eu,
   equal: Ir,
   get: li,
-  has: Xc,
-  join: Hc,
-  memo: Qc,
+  has: ru,
+  join: tu,
+  memo: nu,
   merge: rn,
   partialEqual: fi,
-  set: Gc
-}, Symbol.toStringTag, { value: "Module" })), Ku = (t, e) => {
+  set: Qc
+}, Symbol.toStringTag, { value: "Module" })), tl = (t, e) => {
   let r = null;
   return e === 0 ? t : (...s) => {
     r !== null && (clearTimeout(r), r = null), r = setTimeout(() => t(...s), e);
   };
-}, Wu = (t, e) => {
+}, rl = (t, e) => {
   let r = null;
   return e === 0 ? t : (...s) => {
     r === null && (r = setTimeout(() => {
       t(...s), r = null;
     }, e));
   };
-}, Gu = (t) => [...new Set(t)], Ju = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}, nl = (t) => [...new Set(t)], sl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null
-}, Symbol.toStringTag, { value: "Module" })), tu = (...t) => t.map(di).join(""), di = (t) => (t.endsWith("/") || (t += "/"), t.startsWith("/") && (t = t.slice(1)), t), ru = (t) => t.endsWith("/") ? t.slice(0, -1) : t, Hu = (t, e = "") => t === null ? "" : "?" + Object.entries(t).filter(([, r]) => r == null ? !1 : Array.isArray(r) ? r.length > 0 : !0).map(([r, n]) => `${e}${r}=${n}`).join("&");
+}, Symbol.toStringTag, { value: "Module" })), iu = (...t) => t.map(di).join(""), di = (t) => (t.endsWith("/") || (t += "/"), t.startsWith("/") && (t = t.slice(1)), t), au = (t) => t.endsWith("/") ? t.slice(0, -1) : t, il = (t, e = "") => t === null ? "" : "?" + Object.entries(t).filter(([, r]) => r == null ? !1 : Array.isArray(r) ? r.length > 0 : !0).map(([r, n]) => `${e}${r}=${n}`).join("&");
 var tt;
-let Xu = (tt = class {
+let al = (tt = class {
   /**
    * @param host - The hostname or IP address of the server.
    * @param port - The port number of the server.
@@ -5524,10 +5688,10 @@ let Xu = (tt = class {
    * @param pathPrefix - A path prefix to use for all requests. Defaults to "".
    */
   constructor({ host: e, port: r, protocol: n = "", pathPrefix: s = "" }) {
-    y(this, "protocol");
-    y(this, "host");
-    y(this, "port");
-    y(this, "path");
+    h(this, "protocol");
+    h(this, "host");
+    h(this, "port");
+    h(this, "path");
     this.protocol = n, this.host = e, this.port = r, this.path = di(s);
   }
   /**
@@ -5551,17 +5715,17 @@ let Xu = (tt = class {
   child(e) {
     return new tt({
       ...this,
-      pathPrefix: tu(this.path, e)
+      pathPrefix: iu(this.path, e)
     });
   }
   /** @returns a string representation of the url */
   toString() {
-    return ru(
+    return au(
       `${this.protocol}://${this.host}:${this.port}/${this.path}`
     );
   }
-}, y(tt, "UNKNOWN", new tt({ host: "unknown", port: 0 })), tt);
-const Qu = (t) => Array.isArray(t) ? t : [t], el = (t) => Array.isArray(t) ? t : t === null ? [] : [t], nu = (t, e, r) => {
+}, h(tt, "UNKNOWN", new tt({ host: "unknown", port: 0 })), tt);
+const ol = (t) => Array.isArray(t) ? t : [t], cl = (t) => Array.isArray(t) ? t : t === null ? [] : [t], ou = (t, e, r) => {
   let n = 0, s = t.length - 1;
   for (; n <= s; ) {
     const i = Math.floor((n + s) / 2), a = r(t[i], e);
@@ -5570,13 +5734,13 @@ const Qu = (t) => Array.isArray(t) ? t : [t], el = (t) => Array.isArray(t) ? t :
     a < 0 ? n = i + 1 : s = i - 1;
   }
   return -1;
-}, tl = {
-  binary: nu
+}, ul = {
+  binary: ou
 };
 class qn {
   constructor(e) {
-    y(this, "sender");
-    y(this, "handlers");
+    h(this, "sender");
+    h(this, "handlers");
     this.sender = e, this.handlers = /* @__PURE__ */ new Map();
   }
   handle({ data: e }) {
@@ -5585,15 +5749,15 @@ class qn {
     r == null ? console.warn(`No handler for ${e.type}`) : r(e.payload);
   }
   route(e) {
-    const r = su(e, this.sender), n = new iu(r);
+    const r = cu(e, this.sender), n = new uu(r);
     return this.handlers.set(e, n), n;
   }
 }
-const su = (t, e) => (r, n) => e({ type: t, payload: r }, n);
-class iu {
+const cu = (t, e) => (r, n) => e({ type: t, payload: r }, n);
+class uu {
   constructor(e) {
-    y(this, "_send");
-    y(this, "handler");
+    h(this, "_send");
+    h(this, "handler");
     this._send = e, this.handler = null;
   }
   send(e, r = []) {
@@ -5603,7 +5767,7 @@ class iu {
     this.handler = e;
   }
 }
-const rl = () => {
+const ll = () => {
   let t, e;
   const r = (s, i) => {
     e.handle({ data: s });
@@ -5617,7 +5781,7 @@ try {
   nn = new TextDecoder();
 } catch {
 }
-var w, xe, c = 0, J = {}, $, Je, me = 0, Ae = 0, oe, De, ye = [], L, Yn = {
+var w, xe, c = 0, H = {}, P, Je, me = 0, Ae = 0, oe, De, ye = [], L, Yn = {
   useRecords: !1,
   mapsAsObjects: !0
 };
@@ -5631,26 +5795,26 @@ try {
 } catch {
   yi = 1 / 0;
 }
-class Kt {
+class Wt {
   constructor(e) {
     e && (e.useRecords === !1 && e.mapsAsObjects === void 0 && (e.mapsAsObjects = !0), e.sequential && e.trusted !== !1 && (e.trusted = !0, !e.structures && e.useRecords != !1 && (e.structures = [], e.maxSharedStructures || (e.maxSharedStructures = 0))), e.structures ? e.structures.sharedLength = e.structures.length : e.getStructures && ((e.structures = []).uninitialized = !0, e.structures.sharedLength = 0), e.int64AsNumber && (e.int64AsType = "number")), Object.assign(this, e);
   }
   unpack(e, r) {
     if (w)
-      return wi(() => (an(), this ? this.unpack(e, r) : Kt.prototype.unpack.call(Yn, e, r)));
+      return wi(() => (an(), this ? this.unpack(e, r) : Wt.prototype.unpack.call(Yn, e, r)));
     !e.buffer && e.constructor === ArrayBuffer && (e = typeof Buffer < "u" ? Buffer.from(e) : new Uint8Array(e)), typeof r == "object" ? (xe = r.end || e.length, c = r.start || 0) : (c = 0, xe = r > -1 ? r : e.length), Ae = 0, Je = null, oe = null, w = e;
     try {
       L = e.dataView || (e.dataView = new DataView(e.buffer, e.byteOffset, e.byteLength));
     } catch (n) {
       throw w = null, e instanceof Uint8Array ? n : new Error("Source must be a Uint8Array or Buffer but was a " + (e && typeof e == "object" ? e.constructor.name : typeof e));
     }
-    if (this instanceof Kt) {
-      if (J = this, this.structures)
-        return $ = this.structures, Qt(r);
-      (!$ || $.length > 0) && ($ = []);
+    if (this instanceof Wt) {
+      if (H = this, this.structures)
+        return P = this.structures, er(r);
+      (!P || P.length > 0) && (P = []);
     } else
-      J = Yn, (!$ || $.length > 0) && ($ = []);
-    return Qt(r);
+      H = Yn, (!P || P.length > 0) && (P = []);
+    return er(r);
   }
   unpackMultiple(e, r) {
     let n, s = 0;
@@ -5661,11 +5825,11 @@ class Kt {
         if (r(a, s, c) === !1)
           return;
         for (; c < i; )
-          if (s = c, r(Qt(), s, c) === !1)
+          if (s = c, r(er(), s, c) === !1)
             return;
       } else {
         for (n = [a]; c < i; )
-          s = c, n.push(Qt());
+          s = c, n.push(er());
         return n;
       }
     } catch (i) {
@@ -5692,15 +5856,15 @@ class Kt {
     return this.unpack(e, r);
   }
 }
-function Qt(t) {
+function er(t) {
   try {
-    if (!J.trusted && !et) {
-      let r = $.sharedLength || 0;
-      r < $.length && ($.length = r);
+    if (!H.trusted && !et) {
+      let r = P.sharedLength || 0;
+      r < P.length && (P.length = r);
     }
     let e;
-    if (J.randomAccessStructure && w[c] < 64 && w[c] >= 32 && Fn ? (e = Fn(w, c, xe, J), w = null, !(t && t.lazy) && e && (e = e.toJSON()), c = xe) : e = re(), oe && (c = oe.postBundlePosition, oe = null), et && ($.restoreStructures = null), c == xe)
-      $ && $.restoreStructures && Kn(), $ = null, w = null, De && (De = null);
+    if (H.randomAccessStructure && w[c] < 64 && w[c] >= 32 && Fn ? (e = Fn(w, c, xe, H), w = null, !(t && t.lazy) && e && (e = e.toJSON()), c = xe) : e = re(), oe && (c = oe.postBundlePosition, oe = null), et && (P.restoreStructures = null), c == xe)
+      P && P.restoreStructures && Kn(), P = null, w = null, De && (De = null);
     else {
       if (c > xe)
         throw new Error("Unexpected end of MessagePack data");
@@ -5716,13 +5880,13 @@ function Qt(t) {
     }
     return e;
   } catch (e) {
-    throw $ && $.restoreStructures && Kn(), an(), (e instanceof RangeError || e.message.startsWith("Unexpected end of buffer") || c > xe) && (e.incomplete = !0), e;
+    throw P && P.restoreStructures && Kn(), an(), (e instanceof RangeError || e.message.startsWith("Unexpected end of buffer") || c > xe) && (e.incomplete = !0), e;
   }
 }
 function Kn() {
-  for (let t in $.restoreStructures)
-    $[t] = $.restoreStructures[t];
-  $.restoreStructures = null;
+  for (let t in P.restoreStructures)
+    P[t] = P.restoreStructures[t];
+  P.restoreStructures = null;
 }
 function re() {
   let t = w[c++];
@@ -5731,11 +5895,11 @@ function re() {
       if (t < 64)
         return t;
       {
-        let e = $[t & 63] || J.getStructures && gi()[t & 63];
+        let e = P[t & 63] || H.getStructures && gi()[t & 63];
         return e ? (e.read || (e.read = Mn(e, t & 63)), e.read()) : t;
       }
     } else if (t < 144)
-      if (t -= 128, J.mapsAsObjects) {
+      if (t -= 128, H.mapsAsObjects) {
         let e = {};
         for (let r = 0; r < t; r++) {
           let n = xi();
@@ -5753,14 +5917,14 @@ function re() {
       let e = new Array(t);
       for (let r = 0; r < t; r++)
         e[r] = re();
-      return J.freezeData ? Object.freeze(e) : e;
+      return H.freezeData ? Object.freeze(e) : e;
     }
   else if (t < 192) {
     let e = t - 160;
     if (Ae >= c)
       return Je.slice(c - me, (c += e) - me);
     if (Ae == 0 && xe < 140) {
-      let r = e < 16 ? jn(e) : mi(e);
+      let r = e < 16 ? Rn(e) : mi(e);
       if (r != null)
         return r;
     }
@@ -5791,8 +5955,8 @@ function re() {
       case 201:
         return e = L.getUint32(c), c += 4, lt(e);
       case 202:
-        if (e = L.getFloat32(c), J.useFloat32 > 2) {
-          let r = Rn[(w[c] & 127) << 1 | w[c + 1] >> 7];
+        if (e = L.getFloat32(c), H.useFloat32 > 2) {
+          let r = jn[(w[c] & 127) << 1 | w[c + 1] >> 7];
           return c += 4, (r * e + (e > 0 ? 0.5 : -0.5) >> 0) / r;
         }
         return c += 4, e;
@@ -5805,7 +5969,7 @@ function re() {
       case 206:
         return e = L.getUint32(c), c += 4, e;
       case 207:
-        return J.int64AsType === "number" ? (e = L.getUint32(c) * 4294967296, e += L.getUint32(c + 4)) : J.int64AsType === "string" ? e = L.getBigUint64(c).toString() : J.int64AsType === "auto" ? (e = L.getBigUint64(c), e <= BigInt(2) << BigInt(52) && (e = Number(e))) : e = L.getBigUint64(c), c += 8, e;
+        return H.int64AsType === "number" ? (e = L.getUint32(c) * 4294967296, e += L.getUint32(c + 4)) : H.int64AsType === "string" ? e = L.getBigUint64(c).toString() : H.int64AsType === "auto" ? (e = L.getBigUint64(c), e <= BigInt(2) << BigInt(52) && (e = Number(e))) : e = L.getBigUint64(c), c += 8, e;
       case 208:
         return L.getInt8(c++);
       case 209:
@@ -5813,7 +5977,7 @@ function re() {
       case 210:
         return e = L.getInt32(c), c += 4, e;
       case 211:
-        return J.int64AsType === "number" ? (e = L.getInt32(c) * 4294967296, e += L.getUint32(c + 4)) : J.int64AsType === "string" ? e = L.getBigInt64(c).toString() : J.int64AsType === "auto" ? (e = L.getBigInt64(c), e >= BigInt(-2) << BigInt(52) && e <= BigInt(2) << BigInt(52) && (e = Number(e))) : e = L.getBigInt64(c), c += 8, e;
+        return H.int64AsType === "number" ? (e = L.getInt32(c) * 4294967296, e += L.getUint32(c + 4)) : H.int64AsType === "string" ? e = L.getBigInt64(c).toString() : H.int64AsType === "auto" ? (e = L.getBigInt64(c), e >= BigInt(-2) << BigInt(52) && e <= BigInt(2) << BigInt(52) && (e = Number(e))) : e = L.getBigInt64(c), c += 8, e;
       case 212:
         if (e = w[c++], e == 114)
           return Qn(w[c++] & 63);
@@ -5832,11 +5996,11 @@ function re() {
       case 216:
         return lt(16);
       case 217:
-        return e = w[c++], Ae >= c ? Je.slice(c - me, (c += e) - me) : ou(e);
+        return e = w[c++], Ae >= c ? Je.slice(c - me, (c += e) - me) : fu(e);
       case 218:
-        return e = L.getUint16(c), c += 2, Ae >= c ? Je.slice(c - me, (c += e) - me) : cu(e);
+        return e = L.getUint16(c), c += 2, Ae >= c ? Je.slice(c - me, (c += e) - me) : du(e);
       case 219:
-        return e = L.getUint32(c), c += 4, Ae >= c ? Je.slice(c - me, (c += e) - me) : uu(e);
+        return e = L.getUint32(c), c += 4, Ae >= c ? Je.slice(c - me, (c += e) - me) : hu(e);
       case 220:
         return e = L.getUint16(c), c += 2, Gn(e);
       case 221:
@@ -5856,11 +6020,11 @@ function re() {
     }
   }
 }
-const au = /^[a-zA-Z_$][a-zA-Z\d_$]*$/;
+const lu = /^[a-zA-Z_$][a-zA-Z\d_$]*$/;
 function Mn(t, e) {
   function r() {
     if (r.count++ > yi) {
-      let s = t.read = new Function("r", "return function(){return " + (J.freezeData ? "Object.freeze" : "") + "({" + t.map((i) => i === "__proto__" ? "__proto_:r()" : au.test(i) ? i + ":r()" : "[" + JSON.stringify(i) + "]:r()").join(",") + "})}")(re);
+      let s = t.read = new Function("r", "return function(){return " + (H.freezeData ? "Object.freeze" : "") + "({" + t.map((i) => i === "__proto__" ? "__proto_:r()" : lu.test(i) ? i + ":r()" : "[" + JSON.stringify(i) + "]:r()").join(",") + "})}")(re);
       return t.highByte === 0 && (t.read = Wn(e, t.read)), s();
     }
     let n = {};
@@ -5868,7 +6032,7 @@ function Mn(t, e) {
       let a = t[s];
       a === "__proto__" && (a = "__proto_"), n[a] = re();
     }
-    return J.freezeData ? Object.freeze(n) : n;
+    return H.freezeData ? Object.freeze(n) : n;
   }
   return r.count = 0, t.highByte === 0 ? Wn(e, r) : r;
 }
@@ -5876,19 +6040,19 @@ const Wn = (t, e) => function() {
   let r = w[c++];
   if (r === 0)
     return e();
-  let n = t < 32 ? -(t + (r << 5)) : t + (r << 5), s = $[n] || gi()[n];
+  let n = t < 32 ? -(t + (r << 5)) : t + (r << 5), s = P[n] || gi()[n];
   if (!s)
     throw new Error("Record id is not defined for " + n);
   return s.read || (s.read = Mn(s, t)), s.read();
 };
 function gi() {
-  let t = wi(() => (w = null, J.getStructures()));
-  return $ = J._mergeStructures(t, $);
+  let t = wi(() => (w = null, H.getStructures()));
+  return P = H._mergeStructures(t, P);
 }
-var sn = Gt, ou = Gt, cu = Gt, uu = Gt;
-function Gt(t) {
+var sn = Jt, fu = Jt, du = Jt, hu = Jt;
+function Jt(t) {
   let e;
-  if (t < 16 && (e = jn(t)))
+  if (t < 16 && (e = Rn(t)))
     return e;
   if (t > 64 && nn)
     return nn.decode(w.subarray(c, c += t));
@@ -5917,10 +6081,10 @@ function Gn(t) {
   let e = new Array(t);
   for (let r = 0; r < t; r++)
     e[r] = re();
-  return J.freezeData ? Object.freeze(e) : e;
+  return H.freezeData ? Object.freeze(e) : e;
 }
 function Jn(t) {
-  if (J.mapsAsObjects) {
+  if (H.mapsAsObjects) {
     let e = {};
     for (let r = 0; r < t; r++) {
       let n = xi();
@@ -5947,7 +6111,7 @@ function mi(t) {
   }
   return ae.apply(String, r);
 }
-function jn(t) {
+function Rn(t) {
   if (t < 4)
     if (t < 2) {
       if (t === 0)
@@ -6016,58 +6180,58 @@ function jn(t) {
         if (t === 8)
           return ae(e, r, n, s, i, a, o, l);
         {
-          let h = w[c++];
-          if ((h & 128) > 0) {
+          let p = w[c++];
+          if ((p & 128) > 0) {
             c -= 9;
             return;
           }
-          return ae(e, r, n, s, i, a, o, l, h);
+          return ae(e, r, n, s, i, a, o, l, p);
         }
       } else if (t < 12) {
-        let h = w[c++], b = w[c++];
-        if ((h & 128) > 0 || (b & 128) > 0) {
+        let p = w[c++], b = w[c++];
+        if ((p & 128) > 0 || (b & 128) > 0) {
           c -= 10;
           return;
         }
         if (t < 11)
-          return ae(e, r, n, s, i, a, o, l, h, b);
+          return ae(e, r, n, s, i, a, o, l, p, b);
         let k = w[c++];
         if ((k & 128) > 0) {
           c -= 11;
           return;
         }
-        return ae(e, r, n, s, i, a, o, l, h, b, k);
+        return ae(e, r, n, s, i, a, o, l, p, b, k);
       } else {
-        let h = w[c++], b = w[c++], k = w[c++], ee = w[c++];
-        if ((h & 128) > 0 || (b & 128) > 0 || (k & 128) > 0 || (ee & 128) > 0) {
+        let p = w[c++], b = w[c++], k = w[c++], ee = w[c++];
+        if ((p & 128) > 0 || (b & 128) > 0 || (k & 128) > 0 || (ee & 128) > 0) {
           c -= 12;
           return;
         }
         if (t < 14) {
           if (t === 12)
-            return ae(e, r, n, s, i, a, o, l, h, b, k, ee);
+            return ae(e, r, n, s, i, a, o, l, p, b, k, ee);
           {
-            let q = w[c++];
-            if ((q & 128) > 0) {
+            let Y = w[c++];
+            if ((Y & 128) > 0) {
               c -= 13;
               return;
             }
-            return ae(e, r, n, s, i, a, o, l, h, b, k, ee, q);
+            return ae(e, r, n, s, i, a, o, l, p, b, k, ee, Y);
           }
         } else {
-          let q = w[c++], de = w[c++];
-          if ((q & 128) > 0 || (de & 128) > 0) {
+          let Y = w[c++], de = w[c++];
+          if ((Y & 128) > 0 || (de & 128) > 0) {
             c -= 14;
             return;
           }
           if (t < 15)
-            return ae(e, r, n, s, i, a, o, l, h, b, k, ee, q, de);
+            return ae(e, r, n, s, i, a, o, l, p, b, k, ee, Y, de);
           let D = w[c++];
           if ((D & 128) > 0) {
             c -= 15;
             return;
           }
-          return ae(e, r, n, s, i, a, o, l, h, b, k, ee, q, de, D);
+          return ae(e, r, n, s, i, a, o, l, p, b, k, ee, Y, de, D);
         }
       }
     }
@@ -6091,10 +6255,10 @@ function Hn() {
       default:
         throw new Error("Expected string");
     }
-  return Gt(e);
+  return Jt(e);
 }
 function Kr(t) {
-  return J.copyBuffers ? (
+  return H.copyBuffers ? (
     // specifically use the copying slice (not the node one)
     Uint8Array.prototype.slice.call(w, c, c += t)
   ) : w.subarray(c, c += t);
@@ -6146,22 +6310,22 @@ function xi() {
     i = L.getUint32(n), r.push(i), n += 4;
   for (s += 3; n < s; )
     i = w[n++], r.push(i);
-  let o = t < 16 ? jn(t) : mi(t);
+  let o = t < 16 ? Rn(t) : mi(t);
   return o != null ? r.string = o : r.string = sn(t);
 }
 const Qn = (t, e) => {
   let r = re().map((i) => i.toString()), n = t;
   e !== void 0 && (t = t < 32 ? -((e << 5) + t) : (e << 5) + t, r.highByte = e);
-  let s = $[t];
-  return s && (s.isShared || et) && (($.restoreStructures || ($.restoreStructures = []))[t] = s), $[t] = r, r.read = Mn(r, n), r.read();
+  let s = P[t];
+  return s && (s.isShared || et) && ((P.restoreStructures || (P.restoreStructures = []))[t] = s), P[t] = r, r.read = Mn(r, n), r.read();
 };
 ye[0] = () => {
 };
 ye[0].noBuffer = !0;
-let lu = { Error, TypeError, ReferenceError };
+let pu = { Error, TypeError, ReferenceError };
 ye[101] = () => {
   let t = re();
-  return (lu[t[0]] || Error)(t[1]);
+  return (pu[t[0]] || Error)(t[1]);
 };
 ye[105] = (t) => {
   let e = L.getUint32(c - 4);
@@ -6179,21 +6343,21 @@ ye[112] = (t) => {
 };
 ye[115] = () => new Set(re());
 const vi = ["Int8", "Uint8", "Uint8Clamped", "Int16", "Uint16", "Int32", "Uint32", "Float32", "Float64", "BigInt64", "BigUint64"].map((t) => t + "Array");
-let fu = typeof globalThis == "object" ? globalThis : window;
+let yu = typeof globalThis == "object" ? globalThis : window;
 ye[116] = (t) => {
   let e = t[0], r = vi[e];
   if (!r)
     throw new Error("Could not find typed array for code " + e);
-  return new fu[r](Uint8Array.prototype.slice.call(t, 1).buffer);
+  return new yu[r](Uint8Array.prototype.slice.call(t, 1).buffer);
 };
 ye[120] = () => {
   let t = re();
   return new RegExp(t[0], t[1]);
 };
-const du = [];
+const gu = [];
 ye[98] = (t) => {
   let e = (t[0] << 24) + (t[1] << 16) + (t[2] << 8) + t[3], r = c;
-  return c += e - t.length, oe = du, oe = [Hn(), Hn()], oe.position0 = 0, oe.position1 = 0, oe.postBundlePosition = c, c = r, re();
+  return c += e - t.length, oe = gu, oe = [Hn(), Hn()], oe.position0 = 0, oe.position1 = 0, oe.postBundlePosition = c, c = r, re();
 };
 ye[255] = (t) => t.length == 4 ? new Date((t[0] * 16777216 + (t[1] << 16) + (t[2] << 8) + t[3]) * 1e3) : t.length == 8 ? new Date(
   ((t[0] << 22) + (t[1] << 14) + (t[2] << 6) + (t[3] >> 2)) / 1e6 + ((t[3] & 3) * 4294967296 + t[4] * 16777216 + (t[5] << 16) + (t[6] << 8) + t[7]) * 1e3
@@ -6201,53 +6365,53 @@ ye[255] = (t) => t.length == 4 ? new Date((t[0] * 16777216 + (t[1] << 16) + (t[2
   ((t[0] << 24) + (t[1] << 16) + (t[2] << 8) + t[3]) / 1e6 + ((t[4] & 128 ? -281474976710656 : 0) + t[6] * 1099511627776 + t[7] * 4294967296 + t[8] * 16777216 + (t[9] << 16) + (t[10] << 8) + t[11]) * 1e3
 ) : /* @__PURE__ */ new Date("invalid");
 function wi(t) {
-  let e = xe, r = c, n = me, s = Ae, i = Je, a = De, o = oe, l = new Uint8Array(w.slice(0, xe)), h = $, b = $.slice(0, $.length), k = J, ee = et, q = t();
-  return xe = e, c = r, me = n, Ae = s, Je = i, De = a, oe = o, w = l, et = ee, $ = h, $.splice(0, $.length, ...b), J = k, L = new DataView(w.buffer, w.byteOffset, w.byteLength), q;
+  let e = xe, r = c, n = me, s = Ae, i = Je, a = De, o = oe, l = new Uint8Array(w.slice(0, xe)), p = P, b = P.slice(0, P.length), k = H, ee = et, Y = t();
+  return xe = e, c = r, me = n, Ae = s, Je = i, De = a, oe = o, w = l, et = ee, P = p, P.splice(0, P.length, ...b), H = k, L = new DataView(w.buffer, w.byteOffset, w.byteLength), Y;
 }
 function an() {
-  w = null, De = null, $ = null;
+  w = null, De = null, P = null;
 }
-const Rn = new Array(147);
+const jn = new Array(147);
 for (let t = 0; t < 256; t++)
-  Rn[t] = +("1e" + Math.floor(45.15 - t * 0.30103));
-var Vr = new Kt({ useRecords: !1 });
-const hu = Vr.unpack;
+  jn[t] = +("1e" + Math.floor(45.15 - t * 0.30103));
+var Vr = new Wt({ useRecords: !1 });
+const mu = Vr.unpack;
 Vr.unpackMultiple;
 Vr.unpack;
-let pu = new Float32Array(1);
-new Uint8Array(pu.buffer, 0, 4);
-let pr;
+let xu = new Float32Array(1);
+new Uint8Array(xu.buffer, 0, 4);
+let yr;
 try {
-  pr = new TextEncoder();
+  yr = new TextEncoder();
 } catch {
 }
 let on, bi;
-const zr = typeof Buffer < "u", er = zr ? function(t) {
+const zr = typeof Buffer < "u", tr = zr ? function(t) {
   return Buffer.allocUnsafeSlow(t);
 } : Uint8Array, Oi = zr ? Buffer : Uint8Array, es = zr ? 4294967296 : 2144337920;
-let f, kt, F, u = 0, le, X = null, yu;
-const gu = 21760, mu = /[\u0080-\uFFFF]/, vt = Symbol("record-id");
-class xu extends Kt {
+let f, At, K, u = 0, le, X = null, vu;
+const wu = 21760, bu = /[\u0080-\uFFFF]/, vt = Symbol("record-id");
+class Ou extends Wt {
   constructor(e) {
     super(e), this.offset = 0;
     let r, n, s, i, a = Oi.prototype.utf8Write ? function(d, A) {
       return f.utf8Write(d, A, 4294967295);
-    } : pr && pr.encodeInto ? function(d, A) {
-      return pr.encodeInto(d, f.subarray(A)).written;
+    } : yr && yr.encodeInto ? function(d, A) {
+      return yr.encodeInto(d, f.subarray(A)).written;
     } : !1, o = this;
     e || (e = {});
-    let l = e && e.sequential, h = e.structures || e.saveStructures, b = e.maxSharedStructures;
-    if (b == null && (b = h ? 32 : 0), b > 8160)
+    let l = e && e.sequential, p = e.structures || e.saveStructures, b = e.maxSharedStructures;
+    if (b == null && (b = p ? 32 : 0), b > 8160)
       throw new Error("Maximum maxSharedStructure is 8160");
     e.structuredClone && e.moreTypes == null && (this.moreTypes = !0);
     let k = e.maxOwnStructures;
-    k == null && (k = h ? 32 : 64), !this.structures && e.useRecords != !1 && (this.structures = []);
-    let ee = b > 32 || k + b > 64, q = b + 64, de = b + k + 64;
+    k == null && (k = p ? 32 : 64), !this.structures && e.useRecords != !1 && (this.structures = []);
+    let ee = b > 32 || k + b > 64, Y = b + 64, de = b + k + 64;
     if (de > 8256)
       throw new Error("Maximum maxSharedStructure + maxOwnStructure is 8192");
     let D = [], pe = 0, Ye = 0;
     this.pack = this.encode = function(d, A) {
-      if (f || (f = new er(8192), F = f.dataView || (f.dataView = new DataView(f.buffer, 0, 8192)), u = 0), le = f.length - 10, le - u < 2048 ? (f = new er(f.length), F = f.dataView || (f.dataView = new DataView(f.buffer, 0, f.length)), le = f.length - 10, u = 0) : u = u + 7 & 2147483640, r = u, A & Su && (u += A & 255), i = o.structuredClone ? /* @__PURE__ */ new Map() : null, o.bundleStrings && typeof d != "string" ? (X = [], X.size = 1 / 0) : X = null, s = o.structures, s) {
+      if (f || (f = new tr(8192), K = f.dataView || (f.dataView = new DataView(f.buffer, 0, 8192)), u = 0), le = f.length - 10, le - u < 2048 ? (f = new tr(f.length), K = f.dataView || (f.dataView = new DataView(f.buffer, 0, f.length)), le = f.length - 10, u = 0) : u = u + 7 & 2147483640, r = u, A & Nu && (u += A & 255), i = o.structuredClone ? /* @__PURE__ */ new Map() : null, o.bundleStrings && typeof d != "string" ? (X = [], X.size = 1 / 0) : X = null, s = o.structures, s) {
         s.uninitialized && (s = o._mergeStructures(o.getStructures()));
         let m = s.sharedLength || 0;
         if (m > b)
@@ -6260,8 +6424,8 @@ class xu extends Kt {
               continue;
             let B, U = s.transitions;
             for (let C = 0, te = _.length; C < te; C++) {
-              let Y = _[C];
-              B = U[Y], B || (B = U[Y] = /* @__PURE__ */ Object.create(null)), U = B;
+              let F = _[C];
+              B = U[F], B || (B = U[F] = /* @__PURE__ */ Object.create(null)), U = B;
             }
             U[vt] = v + 64;
           }
@@ -6271,31 +6435,31 @@ class xu extends Kt {
       }
       n && (n = !1);
       try {
-        o.randomAccessStructure && d && d.constructor && d.constructor === Object ? ki(d) : G(d);
+        o.randomAccessStructure && d && d.constructor && d.constructor === Object ? ki(d) : J(d);
         let m = X;
-        if (X && ns(r, G, 0), i && i.idsToInsert) {
+        if (X && ns(r, J, 0), i && i.idsToInsert) {
           let v = i.idsToInsert.sort((C, te) => C.offset > te.offset ? 1 : -1), _ = v.length, B = -1;
           for (; m && _ > 0; ) {
             let C = v[--_].offset + r;
-            C < m.stringsPosition + r && B === -1 && (B = 0), C > m.position + r ? B >= 0 && (B += 6) : (B >= 0 && (F.setUint32(
+            C < m.stringsPosition + r && B === -1 && (B = 0), C > m.position + r ? B >= 0 && (B += 6) : (B >= 0 && (K.setUint32(
               m.position + r,
-              F.getUint32(m.position + r) + B
+              K.getUint32(m.position + r) + B
             ), B = -1), m = m.previous, _++);
           }
-          B >= 0 && m && F.setUint32(
+          B >= 0 && m && K.setUint32(
             m.position + r,
-            F.getUint32(m.position + r) + B
+            K.getUint32(m.position + r) + B
           ), u += v.length * 6, u > le && Fe(u), o.offset = u;
-          let U = wu(f.subarray(r, u), v);
+          let U = Tu(f.subarray(r, u), v);
           return i = null, U;
         }
-        return o.offset = u, A & _u ? (f.start = r, f.end = u, f) : f.subarray(r, u);
+        return o.offset = u, A & Au ? (f.start = r, f.end = u, f) : f.subarray(r, u);
       } finally {
         if (s && (Ce(), n && o.saveStructures)) {
-          let m = s.sharedLength || 0, v = f.subarray(r, u), _ = bu(s, o);
+          let m = s.sharedLength || 0, v = f.subarray(r, u), _ = Su(s, o);
           return o.saveStructures(_, _.isCompatible) === !1 ? o.pack(d, A) : (o.lastNamedStructuresLength = m, v);
         }
-        A & Tu && (u = r);
+        A & Iu && (u = r);
       }
     };
     const Ce = () => {
@@ -6310,54 +6474,54 @@ class xu extends Kt {
       }
     }, ot = (d) => {
       var A = d.length;
-      A < 16 ? f[u++] = 144 | A : A < 65536 ? (f[u++] = 220, f[u++] = A >> 8, f[u++] = A & 255) : (f[u++] = 221, F.setUint32(u, A), u += 4);
+      A < 16 ? f[u++] = 144 | A : A < 65536 ? (f[u++] = 220, f[u++] = A >> 8, f[u++] = A & 255) : (f[u++] = 221, K.setUint32(u, A), u += 4);
       for (let m = 0; m < A; m++)
-        G(d[m]);
-    }, G = (d) => {
+        J(d[m]);
+    }, J = (d) => {
       u > le && (f = Fe(u));
       var A = typeof d, m;
       if (A === "string") {
         let v = d.length;
         if (X && v >= 4 && v < 4096) {
-          if ((X.size += v) > gu) {
+          if ((X.size += v) > wu) {
             let C, te = (X[0] ? X[0].length * 3 + X[1].length : 0) + 10;
             u + te > le && (f = Fe(u + te));
-            let Y;
-            X.position ? (Y = X, f[u] = 200, u += 3, f[u++] = 98, C = u - r, u += 4, ns(r, G, 0), F.setUint16(C + r - 3, u - r - C)) : (f[u++] = 214, f[u++] = 98, C = u - r, u += 4), X = ["", ""], X.previous = Y, X.size = 0, X.position = C;
+            let F;
+            X.position ? (F = X, f[u] = 200, u += 3, f[u++] = 98, C = u - r, u += 4, ns(r, J, 0), K.setUint16(C + r - 3, u - r - C)) : (f[u++] = 214, f[u++] = 98, C = u - r, u += 4), X = ["", ""], X.previous = F, X.size = 0, X.position = C;
           }
-          let U = mu.test(d);
-          X[U ? 0 : 1] += d, f[u++] = 193, G(U ? -v : v);
+          let U = bu.test(d);
+          X[U ? 0 : 1] += d, f[u++] = 193, J(U ? -v : v);
           return;
         }
         let _;
         v < 32 ? _ = 1 : v < 256 ? _ = 2 : v < 65536 ? _ = 3 : _ = 5;
         let B = v * 3;
         if (u + B > le && (f = Fe(u + B)), v < 64 || !a) {
-          let U, C, te, Y = u + _;
+          let U, C, te, F = u + _;
           for (U = 0; U < v; U++)
-            C = d.charCodeAt(U), C < 128 ? f[Y++] = C : C < 2048 ? (f[Y++] = C >> 6 | 192, f[Y++] = C & 63 | 128) : (C & 64512) === 55296 && ((te = d.charCodeAt(U + 1)) & 64512) === 56320 ? (C = 65536 + ((C & 1023) << 10) + (te & 1023), U++, f[Y++] = C >> 18 | 240, f[Y++] = C >> 12 & 63 | 128, f[Y++] = C >> 6 & 63 | 128, f[Y++] = C & 63 | 128) : (f[Y++] = C >> 12 | 224, f[Y++] = C >> 6 & 63 | 128, f[Y++] = C & 63 | 128);
-          m = Y - u - _;
+            C = d.charCodeAt(U), C < 128 ? f[F++] = C : C < 2048 ? (f[F++] = C >> 6 | 192, f[F++] = C & 63 | 128) : (C & 64512) === 55296 && ((te = d.charCodeAt(U + 1)) & 64512) === 56320 ? (C = 65536 + ((C & 1023) << 10) + (te & 1023), U++, f[F++] = C >> 18 | 240, f[F++] = C >> 12 & 63 | 128, f[F++] = C >> 6 & 63 | 128, f[F++] = C & 63 | 128) : (f[F++] = C >> 12 | 224, f[F++] = C >> 6 & 63 | 128, f[F++] = C & 63 | 128);
+          m = F - u - _;
         } else
           m = a(d, u + _);
-        m < 32 ? f[u++] = 160 | m : m < 256 ? (_ < 2 && f.copyWithin(u + 2, u + 1, u + 1 + m), f[u++] = 217, f[u++] = m) : m < 65536 ? (_ < 3 && f.copyWithin(u + 3, u + 2, u + 2 + m), f[u++] = 218, f[u++] = m >> 8, f[u++] = m & 255) : (_ < 5 && f.copyWithin(u + 5, u + 3, u + 3 + m), f[u++] = 219, F.setUint32(u, m), u += 4), u += m;
+        m < 32 ? f[u++] = 160 | m : m < 256 ? (_ < 2 && f.copyWithin(u + 2, u + 1, u + 1 + m), f[u++] = 217, f[u++] = m) : m < 65536 ? (_ < 3 && f.copyWithin(u + 3, u + 2, u + 2 + m), f[u++] = 218, f[u++] = m >> 8, f[u++] = m & 255) : (_ < 5 && f.copyWithin(u + 5, u + 3, u + 3 + m), f[u++] = 219, K.setUint32(u, m), u += 4), u += m;
       } else if (A === "number")
         if (d >>> 0 === d)
-          d < 32 || d < 128 && this.useRecords === !1 || d < 64 && !this.randomAccessStructure ? f[u++] = d : d < 256 ? (f[u++] = 204, f[u++] = d) : d < 65536 ? (f[u++] = 205, f[u++] = d >> 8, f[u++] = d & 255) : (f[u++] = 206, F.setUint32(u, d), u += 4);
+          d < 32 || d < 128 && this.useRecords === !1 || d < 64 && !this.randomAccessStructure ? f[u++] = d : d < 256 ? (f[u++] = 204, f[u++] = d) : d < 65536 ? (f[u++] = 205, f[u++] = d >> 8, f[u++] = d & 255) : (f[u++] = 206, K.setUint32(u, d), u += 4);
         else if (d >> 0 === d)
-          d >= -32 ? f[u++] = 256 + d : d >= -128 ? (f[u++] = 208, f[u++] = d + 256) : d >= -32768 ? (f[u++] = 209, F.setInt16(u, d), u += 2) : (f[u++] = 210, F.setInt32(u, d), u += 4);
+          d >= -32 ? f[u++] = 256 + d : d >= -128 ? (f[u++] = 208, f[u++] = d + 256) : d >= -32768 ? (f[u++] = 209, K.setInt16(u, d), u += 2) : (f[u++] = 210, K.setInt32(u, d), u += 4);
         else {
           let v;
           if ((v = this.useFloat32) > 0 && d < 4294967296 && d >= -2147483648) {
-            f[u++] = 202, F.setFloat32(u, d);
+            f[u++] = 202, K.setFloat32(u, d);
             let _;
             if (v < 4 || // this checks for rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved
-            (_ = d * Rn[(f[u] & 127) << 1 | f[u + 1] >> 7]) >> 0 === _) {
+            (_ = d * jn[(f[u] & 127) << 1 | f[u + 1] >> 7]) >> 0 === _) {
               u += 4;
               return;
             } else
               u--;
           }
-          f[u++] = 203, F.setFloat64(u, d), u += 8;
+          f[u++] = 203, K.setFloat64(u, d), u += 8;
         }
       else if (A === "object" || A === "function")
         if (!d)
@@ -6370,23 +6534,23 @@ class xu extends Kt {
                 let B = i.idsToInsert || (i.idsToInsert = []);
                 _.id = B.push(_);
               }
-              f[u++] = 214, f[u++] = 112, F.setUint32(u, _.id), u += 4;
+              f[u++] = 214, f[u++] = 112, K.setUint32(u, _.id), u += 4;
               return;
             } else
               i.set(d, { offset: u - r });
           }
           let v = d.constructor;
           if (v === Object)
-            Jt(d, !0);
+            Ht(d, !0);
           else if (v === Array)
             ot(d);
           else if (v === Map)
             if (this.mapAsEmptyObject)
               f[u++] = 128;
             else {
-              m = d.size, m < 16 ? f[u++] = 128 | m : m < 65536 ? (f[u++] = 222, f[u++] = m >> 8, f[u++] = m & 255) : (f[u++] = 223, F.setUint32(u, m), u += 4);
+              m = d.size, m < 16 ? f[u++] = 128 | m : m < 65536 ? (f[u++] = 222, f[u++] = m >> 8, f[u++] = m & 255) : (f[u++] = 223, K.setUint32(u, m), u += 4);
               for (let [_, B] of d)
-                G(_), G(B);
+                J(_), J(B);
             }
           else {
             for (let _ = 0, B = on.length; _ < B; _++) {
@@ -6396,22 +6560,22 @@ class xu extends Kt {
                 if (C.write) {
                   C.type && (f[u++] = 212, f[u++] = C.type, f[u++] = 0);
                   let Ke = C.write.call(this, d);
-                  Ke === d ? Array.isArray(d) ? ot(d) : Jt(d) : G(Ke);
+                  Ke === d ? Array.isArray(d) ? ot(d) : Ht(d) : J(Ke);
                   return;
                 }
-                let te = f, Y = F, Me = u;
+                let te = f, F = K, Me = u;
                 f = null;
                 let ct;
                 try {
                   ct = C.pack.call(this, d, (Ke) => (f = te, te = null, u += Ke, u > le && Fe(u), {
                     target: f,
-                    targetView: F,
+                    targetView: K,
                     position: u - Ke
-                  }), G);
+                  }), J);
                 } finally {
-                  te && (f = te, F = Y, u = Me, le = f.length - 10);
+                  te && (f = te, K = F, u = Me, le = f.length - 10);
                 }
-                ct && (ct.length + u > le && Fe(ct.length + u), u = vu(ct, f, u, C.type));
+                ct && (ct.length + u > le && Fe(ct.length + u), u = _u(ct, f, u, C.type));
                 return;
               }
             }
@@ -6421,11 +6585,11 @@ class xu extends Kt {
               if (d.toJSON) {
                 const _ = d.toJSON();
                 if (_ !== d)
-                  return G(_);
+                  return J(_);
               }
               if (A === "function")
-                return G(this.writeFunction && this.writeFunction(d));
-              Jt(d, !d.hasOwnProperty);
+                return J(this.writeFunction && this.writeFunction(d));
+              Ht(d, !d.hasOwnProperty);
             }
           }
         }
@@ -6433,11 +6597,11 @@ class xu extends Kt {
         f[u++] = d ? 195 : 194;
       else if (A === "bigint") {
         if (d < BigInt(1) << BigInt(63) && d >= -(BigInt(1) << BigInt(63)))
-          f[u++] = 211, F.setBigInt64(u, d);
+          f[u++] = 211, K.setBigInt64(u, d);
         else if (d < BigInt(1) << BigInt(64) && d > 0)
-          f[u++] = 207, F.setBigUint64(u, d);
+          f[u++] = 207, K.setBigUint64(u, d);
         else if (this.largeBigIntToFloat)
-          f[u++] = 203, F.setFloat64(u, Number(d));
+          f[u++] = 203, K.setFloat64(u, Number(d));
         else
           throw new RangeError(d + " was too large to fit in MessagePack 64-bit integer format, set largeBigIntToFloat to convert to float-64");
         u += 8;
@@ -6447,24 +6611,24 @@ class xu extends Kt {
         throw new Error("Unknown type: " + A);
     }, Bn = this.variableMapSize || this.coercibleKeyAsNumber ? (d) => {
       let A = Object.keys(d), m = A.length;
-      m < 16 ? f[u++] = 128 | m : m < 65536 ? (f[u++] = 222, f[u++] = m >> 8, f[u++] = m & 255) : (f[u++] = 223, F.setUint32(u, m), u += 4);
+      m < 16 ? f[u++] = 128 | m : m < 65536 ? (f[u++] = 222, f[u++] = m >> 8, f[u++] = m & 255) : (f[u++] = 223, K.setUint32(u, m), u += 4);
       let v;
       if (this.coercibleKeyAsNumber)
         for (let _ = 0; _ < m; _++) {
           v = A[_];
           let B = Number(v);
-          G(isNaN(B) ? v : B), G(d[v]);
+          J(isNaN(B) ? v : B), J(d[v]);
         }
       else
         for (let _ = 0; _ < m; _++)
-          G(v = A[_]), G(d[v]);
+          J(v = A[_]), J(d[v]);
     } : (d, A) => {
       f[u++] = 222;
       let m = u - r;
       u += 2;
       let v = 0;
       for (let _ in d)
-        (A || d.hasOwnProperty(_)) && (G(_), G(d[_]), v++);
+        (A || d.hasOwnProperty(_)) && (J(_), J(d[_]), v++);
       f[m++ + r] = v >> 8, f[m + r] = v & 255;
     }, Un = this.useRecords === !1 ? Bn : e.progressiveRecords && !ee ? (
       // this is about 2% faster for highly stable structures, since it only requires one for-in loop (but much more expensive when new structure needs to be written)
@@ -6477,14 +6641,14 @@ class xu extends Kt {
             else {
               let C = Object.keys(d), te = v;
               v = s.transitions;
-              let Y = 0;
+              let F = 0;
               for (let Me = 0, ct = C.length; Me < ct; Me++) {
                 let Ke = C[Me];
-                m = v[Ke], m || (m = v[Ke] = /* @__PURE__ */ Object.create(null), Y++), v = m;
+                m = v[Ke], m || (m = v[Ke] = /* @__PURE__ */ Object.create(null), F++), v = m;
               }
-              _ + r + 1 == u ? (u--, qr(v, C, Y)) : Ln(v, C, _, Y), B = !0, v = te[U];
+              _ + r + 1 == u ? (u--, qr(v, C, F)) : Ln(v, C, _, F), B = !0, v = te[U];
             }
-            G(d[U]);
+            J(d[U]);
           }
         if (!B) {
           let U = v[vt];
@@ -6498,8 +6662,8 @@ class xu extends Kt {
       let B = v[vt];
       B ? B >= 96 && ee ? (f[u++] = ((B -= 96) & 31) + 96, f[u++] = B >> 5) : f[u++] = B : qr(v, v.__keys__ || Object.keys(d), _);
       for (let U in d)
-        (A || d.hasOwnProperty(U)) && G(d[U]);
-    }, Zn = typeof this.useRecords == "function" && this.useRecords, Jt = Zn ? (d, A) => {
+        (A || d.hasOwnProperty(U)) && J(d[U]);
+    }, Zn = typeof this.useRecords == "function" && this.useRecords, Ht = Zn ? (d, A) => {
       Zn(d) ? Un(d, A) : Bn(d, A);
     } : Un, Fe = (d) => {
       let A;
@@ -6512,39 +6676,39 @@ class xu extends Kt {
         );
       } else
         A = (Math.max(d - r << 2, f.length - 1) >> 12) + 1 << 12;
-      let m = new er(A);
-      return F = m.dataView || (m.dataView = new DataView(m.buffer, 0, A)), d = Math.min(d, f.length), f.copy ? f.copy(m, 0, r, d) : m.set(f.slice(r, d)), u -= r, r = 0, le = m.length - 10, f = m;
+      let m = new tr(A);
+      return K = m.dataView || (m.dataView = new DataView(m.buffer, 0, A)), d = Math.min(d, f.length), f.copy ? f.copy(m, 0, r, d) : m.set(f.slice(r, d)), u -= r, r = 0, le = m.length - 10, f = m;
     }, qr = (d, A, m) => {
       let v = s.nextId;
-      v || (v = 64), v < q && this.shouldShareStructure && !this.shouldShareStructure(A) ? (v = s.nextOwnId, v < de || (v = q), s.nextOwnId = v + 1) : (v >= de && (v = q), s.nextId = v + 1);
+      v || (v = 64), v < Y && this.shouldShareStructure && !this.shouldShareStructure(A) ? (v = s.nextOwnId, v < de || (v = Y), s.nextOwnId = v + 1) : (v >= de && (v = Y), s.nextId = v + 1);
       let _ = A.highByte = v >= 96 && ee ? v - 96 >> 5 : -1;
-      d[vt] = v, d.__keys__ = A, s[v - 64] = A, v < q ? (A.isShared = !0, s.sharedLength = v - 63, n = !0, _ >= 0 ? (f[u++] = (v & 31) + 96, f[u++] = _) : f[u++] = v) : (_ >= 0 ? (f[u++] = 213, f[u++] = 114, f[u++] = (v & 31) + 96, f[u++] = _) : (f[u++] = 212, f[u++] = 114, f[u++] = v), m && (pe += Ye * m), D.length >= k && (D.shift()[vt] = 0), D.push(d), G(A));
+      d[vt] = v, d.__keys__ = A, s[v - 64] = A, v < Y ? (A.isShared = !0, s.sharedLength = v - 63, n = !0, _ >= 0 ? (f[u++] = (v & 31) + 96, f[u++] = _) : f[u++] = v) : (_ >= 0 ? (f[u++] = 213, f[u++] = 114, f[u++] = (v & 31) + 96, f[u++] = _) : (f[u++] = 212, f[u++] = 114, f[u++] = v), m && (pe += Ye * m), D.length >= k && (D.shift()[vt] = 0), D.push(d), J(A));
     }, Ln = (d, A, m, v) => {
       let _ = f, B = u, U = le, C = r;
-      f = kt, u = 0, r = 0, f || (kt = f = new er(8192)), le = f.length - 10, qr(d, A, v), kt = f;
+      f = At, u = 0, r = 0, f || (At = f = new tr(8192)), le = f.length - 10, qr(d, A, v), At = f;
       let te = u;
       if (f = _, u = B, le = U, r = C, te > 1) {
-        let Y = u + te - 1;
-        Y > le && Fe(Y);
+        let F = u + te - 1;
+        F > le && Fe(F);
         let Me = m + r;
-        f.copyWithin(Me + te, Me + 1, u), f.set(kt.slice(0, te), Me), u = Y;
+        f.copyWithin(Me + te, Me + 1, u), f.set(At.slice(0, te), Me), u = F;
       } else
-        f[m + r] = kt[0];
+        f[m + r] = At[0];
     }, ki = (d, A) => {
-      let m = yu(d, f, r, u, s, Fe, (v, _, B) => {
+      let m = vu(d, f, r, u, s, Fe, (v, _, B) => {
         if (B)
           return n = !0;
         u = _;
         let U = f;
-        return G(v), Ce(), U !== f ? { position: u, targetView: F, target: f } : u;
+        return J(v), Ce(), U !== f ? { position: u, targetView: K, target: f } : u;
       }, this);
       if (m === 0)
-        return Jt(d, !0);
+        return Ht(d, !0);
       u = m;
     };
   }
   useBuffer(e) {
-    f = e, F = new DataView(f.buffer, f.byteOffset, f.byteLength), u = 0;
+    f = e, K = new DataView(f.buffer, f.byteOffset, f.byteLength), u = 0;
   }
   clearSharedData() {
     this.structures && (this.structures = []), this.typedStructs && (this.typedStructs = []);
@@ -6631,7 +6795,7 @@ function rs(t, e) {
   }
   n.set(t, s);
 }
-function vu(t, e, r, n) {
+function _u(t, e, r, n) {
   let s = t.length;
   switch (s) {
     case 1:
@@ -6654,7 +6818,7 @@ function vu(t, e, r, n) {
   }
   return e[r++] = n, e.set(t, r), r += s, r;
 }
-function wu(t, e) {
+function Tu(t, e) {
   let r, n = e.length * 6, s = t.length - n;
   for (; r = e.pop(); ) {
     let i = r.offset, a = r.id;
@@ -6666,41 +6830,41 @@ function wu(t, e) {
 }
 function ns(t, e, r) {
   if (X.length > 0) {
-    F.setUint32(X.position + t, u + r - X.position - t), X.stringsPosition = u - t;
+    K.setUint32(X.position + t, u + r - X.position - t), X.stringsPosition = u - t;
     let n = X;
     X = null, e(n[0]), e(n[1]);
   }
 }
-function bu(t, e) {
+function Su(t, e) {
   return t.isCompatible = (r) => {
     let n = !r || (e.lastNamedStructuresLength || 0) === r.length;
     return n || e._mergeStructures(r), n;
   }, t;
 }
-let _i = new xu({ useRecords: !1 });
-const Ou = _i.pack;
+let _i = new Ou({ useRecords: !1 });
+const ku = _i.pack;
 _i.pack;
-const _u = 512, Tu = 1024, Su = 2048;
+const Au = 512, Iu = 1024, Nu = 2048;
 class Ti {
   constructor() {
-    y(this, "contentType", "application/msgpack");
+    h(this, "contentType", "application/msgpack");
   }
   encode(e) {
-    return Ou(mt.toSnake(e));
+    return ku(mt.toSnake(e));
   }
   decode(e, r) {
-    const n = mt.toCamel(hu(new Uint8Array(e)));
+    const n = mt.toCamel(mu(new Uint8Array(e)));
     return r != null ? r.parse(n) : n;
   }
 }
 class Si {
   constructor() {
-    y(this, "contentType", "application/json");
-    y(this, "decoder");
+    h(this, "contentType", "application/json");
+    h(this, "decoder");
     this.decoder = new TextDecoder();
   }
   encode(e) {
-    const r = JSON.stringify(mt.toSnake(e), (n, s) => ArrayBuffer.isView(s) ? Array.from(s) : hr(s) && "encode_value" in s ? typeof s.value == "bigint" ? s.value.toString() : s.value : typeof s == "bigint" ? s.toString() : s);
+    const r = JSON.stringify(mt.toSnake(e), (n, s) => ArrayBuffer.isView(s) ? Array.from(s) : pr(s) && "encode_value" in s ? typeof s.value == "bigint" ? s.value.toString() : s.value : typeof s == "bigint" ? s.toString() : s);
     return new TextEncoder().encode(r);
   }
   decode(e, r) {
@@ -6710,18 +6874,18 @@ class Si {
   static registerCustomType() {
   }
 }
-const ku = [
+const Eu = [
   new Ti(),
   new Si()
-], nl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+], fl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  ENCODERS: ku,
+  ENCODERS: Eu,
   JSONEncoderDecoder: Si,
   MsgpackEncoderDecoder: Ti
 }, Symbol.toStringTag, { value: "Module" }));
-class Au {
+class Cu {
   constructor(e) {
-    y(this, "handlers");
+    h(this, "handlers");
     this.handlers = e ?? /* @__PURE__ */ new Map();
   }
   onChange(e) {
@@ -6731,67 +6895,68 @@ class Au {
     this.handlers.forEach((r, n) => n(e));
   }
 }
-const sl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const dl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  Observer: Au
-}, Symbol.toStringTag, { value: "Module" })), Iu = (t) => g.object({
+  Observer: Cu
+}, Symbol.toStringTag, { value: "Module" })), Mu = (t) => g.object({
   variant: g.enum(["set", "delete"]),
   key: g.string(),
   value: t
-}), il = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}), hl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  Z: Iu
-}, Symbol.toStringTag, { value: "Module" })), al = (t) => Array.isArray(t) ? [...t] : typeof t == "object" && t !== null ? { ...t } : t, ol = (t) => t ? -1 : 1;
+  Z: Mu
+}, Symbol.toStringTag, { value: "Module" })), pl = (t) => Array.isArray(t) ? [...t] : typeof t == "object" && t !== null ? { ...t } : t, yl = (t) => t ? -1 : 1;
 export {
   mt as Case,
-  H as DataType,
+  q as DataType,
   ce as Density,
+  Gu as MultiSeries,
   zn as Rate,
   qn as RoutedWorker,
-  tl as Search,
+  ul as Search,
   ke as Series,
   Ar as Size,
-  kr as TimeRange,
+  Tt as TimeRange,
   se as TimeSpan,
   ne as TimeStamp,
-  iu as TypedWorker,
-  Xu as URL,
-  At as addSamples,
-  nl as binary,
-  Mu as bounds,
-  Uu as box,
-  Hu as buildQueryString,
-  il as change,
+  uu as TypedWorker,
+  al as URL,
+  It as addSamples,
+  fl as binary,
+  $u as bounds,
+  zu as box,
+  il as buildQueryString,
+  hl as change,
   Ac as clamp,
-  Cu as compare,
+  Lu as compare,
   Dc as convertDataType,
-  qu as convertRenderV,
-  rl as createMockWorkers,
-  Ku as debounce,
-  Fu as deep,
-  Zu as dimensions,
-  ju as direction,
-  zu as getEntries,
-  ol as invert,
+  Xu as convertRenderV,
+  ll as createMockWorkers,
+  tl as debounce,
+  el as deep,
+  qu as dimensions,
+  Pu as direction,
+  Hu as getEntries,
+  yl as invert,
   Vc as isCrudeSeries,
-  hr as isObject,
+  pr as isObject,
   ss as isStringer,
   oi as isTelemValue,
-  Ju as kv,
-  Ru as location,
-  el as nullToArr,
-  sl as observe,
-  Pu as position,
-  Eu as primitiveIsZero,
-  Yu as runtime,
-  Lu as scale,
-  al as shallowCopy,
-  $u as spatial,
-  Wu as throttle,
-  Qu as toArray,
-  Du as typedArrayZ,
-  Gu as unique,
-  Vu as unknownRecordZ,
-  Bu as xy
+  sl as kv,
+  Du as location,
+  cl as nullToArr,
+  dl as observe,
+  Fu as position,
+  Zu as primitiveIsZero,
+  Qu as runtime,
+  Yu as scale,
+  pl as shallowCopy,
+  Ku as spatial,
+  rl as throttle,
+  ol as toArray,
+  Wu as typedArrayZ,
+  nl as unique,
+  Ju as unknownRecordZ,
+  Vu as xy
 };
 //# sourceMappingURL=x.js.map