@synnaxlabs/x 0.44.1 → 0.44.3

package/.turbo/turbo-build.log

@@ -1,5 +1,5 @@
 
-> @synnaxlabs/x@0.44.1 build /home/runner/work/synnax/synnax/x/ts
+> @synnaxlabs/x@0.44.3 build /home/runner/work/synnax/synnax/x/ts
 > tsc --noEmit && vite build
 
  Synnax - Production mode
@@ -41,8 +41,8 @@ computing gzip size...
 dist/spatial.js               0.58 kB │ gzip:  0.29 kB
 dist/direction-8etxfKaR.js    0.67 kB │ gzip:  0.38 kB
 dist/external-BYuXBYJh.js     0.79 kB │ gzip:  0.34 kB
-dist/external-BFgJjMcS.js     0.86 kB │ gzip:  0.52 kB
 dist/worker.js                0.87 kB │ gzip:  0.40 kB
+dist/external-BM_NS5yM.js     0.87 kB │ gzip:  0.52 kB
 dist/external-BPgtxa8d.js     0.99 kB │ gzip:  0.56 kB
 dist/observe.js               1.10 kB │ gzip:  0.48 kB
 dist/base-DFq0vvGn.js         1.23 kB │ gzip:  0.52 kB
@@ -50,18 +50,18 @@ computing gzip size...
 dist/url.js                   1.70 kB │ gzip:  0.76 kB
 dist/index-D2xcvEO5.js        1.86 kB │ gzip:  0.89 kB
 dist/position-PQ6op54I.js     2.23 kB │ gzip:  1.06 kB
-dist/path-BXdMenka.js         2.44 kB │ gzip:  0.89 kB
 dist/index-B5l_quQn.js        2.56 kB │ gzip:  1.00 kB
+dist/path-Blh4wJuA.js         2.72 kB │ gzip:  0.97 kB
 dist/location-Ar5y2DX2.js     2.86 kB │ gzip:  1.18 kB
-dist/index-PNh31WTW.js        3.58 kB │ gzip:  1.36 kB
-dist/deep.js                  3.71 kB │ gzip:  1.42 kB
+dist/index-CBMHFqs4.js        3.62 kB │ gzip:  1.37 kB
+dist/deep.js                  3.93 kB │ gzip:  1.52 kB
 dist/xy-C_-hb3Q2.js           3.94 kB │ gzip:  1.47 kB
-dist/bounds-Dj9nG39I.js       6.04 kB │ gzip:  2.00 kB
+dist/bounds-8OC_obRs.js       6.20 kB │ gzip:  2.09 kB
 dist/box-CO_2_DGG.js          6.44 kB │ gzip:  2.26 kB
-dist/scale-EWNUk-bn.js        6.49 kB │ gzip:  1.89 kB
-dist/index.js                26.85 kB │ gzip:  8.64 kB
-dist/series-Bn5y1tD1.js      87.74 kB │ gzip: 18.83 kB
-[vite:dts] Declaration files built in 4715ms.
+dist/scale-Db1Gunj0.js        6.49 kB │ gzip:  1.89 kB
+dist/index.js                27.17 kB │ gzip:  8.74 kB
+dist/series-Cl3Vh_u-.js      91.29 kB │ gzip: 19.32 kB
+[vite:dts] Declaration files built in 4531ms.
 
 Generated an empty chunk: "destructor".
 dist/destructor.cjs            0.01 kB │ gzip:  0.03 kB
@@ -94,7 +94,7 @@ computing gzip size...
 dist/direction-386XDm2w.cjs    0.56 kB │ gzip:  0.35 kB
 dist/external-B9AAGv50.cjs     0.58 kB │ gzip:  0.30 kB
 dist/spatial.cjs               0.63 kB │ gzip:  0.33 kB
-dist/external-mffsMzJx.cjs     0.67 kB │ gzip:  0.45 kB
+dist/external-E3ErJeeM.cjs     0.68 kB │ gzip:  0.45 kB
 dist/worker.cjs                0.71 kB │ gzip:  0.39 kB
 dist/observe.cjs               0.76 kB │ gzip:  0.36 kB
 dist/external-uXk0Avrg.cjs     0.79 kB │ gzip:  0.49 kB
@@ -103,15 +103,15 @@ computing gzip size...
 dist/index-DdhM_E4k.cjs        1.35 kB │ gzip:  0.72 kB
 dist/base-BAM2mqCy.cjs         1.40 kB │ gzip:  0.58 kB
 dist/position-DSy2hONH.cjs     1.70 kB │ gzip:  0.94 kB
-dist/path-st_E5-LJ.cjs         1.78 kB │ gzip:  0.79 kB
 dist/index-BQe8OIgm.cjs        1.98 kB │ gzip:  0.90 kB
+dist/path-CPSfCjde.cjs         2.00 kB │ gzip:  0.88 kB
 dist/location-DZi8ftXp.cjs     2.49 kB │ gzip:  1.06 kB
-dist/index-B1m2qvBT.cjs        2.52 kB │ gzip:  1.10 kB
-dist/deep.cjs                  2.62 kB │ gzip:  1.19 kB
+dist/index-DOJlZHqJ.cjs        2.54 kB │ gzip:  1.12 kB
+dist/deep.cjs                  2.79 kB │ gzip:  1.27 kB
 dist/xy-CUE3QDNn.cjs           2.88 kB │ gzip:  1.31 kB
-dist/scale-C6qKDbRb.cjs        4.11 kB │ gzip:  1.47 kB
-dist/bounds-D6e9xoHt.cjs       4.56 kB │ gzip:  1.77 kB
+dist/scale-C3fEtXxW.cjs        4.11 kB │ gzip:  1.47 kB
+dist/bounds-CRK04jp7.cjs       4.67 kB │ gzip:  1.85 kB
 dist/box-Cxki783Y.cjs          4.99 kB │ gzip:  2.02 kB
-dist/index.cjs                20.35 kB │ gzip:  7.58 kB
-dist/series-CYAhDD6B.cjs      37.82 kB │ gzip: 10.09 kB
-✓ built in 5.51s
+dist/index.cjs                20.62 kB │ gzip:  7.68 kB
+dist/series-BcF7A8Je.cjs      38.89 kB │ gzip: 10.27 kB
+✓ built in 5.37s

package/dist/bounds-8OC_obRs.js

@@ -0,0 +1,186 @@
+import { j as x } from "./base-DFq0vvGn.js";
+const a = (r) => (e, n) => {
+  if (typeof e == "bigint") {
+    if (g(n))
+      return r(e, BigInt(n));
+    const t = r(Number(e), Number(n));
+    return typeof t == "number" ? BigInt(Math.round(t)) : t;
+  }
+  return r(Number(e), Number(n));
+}, w = a((r, e) => r - e), v = a((r, e) => r + e), q = (r, e, n = 1e-4) => Math.abs(r - e) < n, y = (r, e) => {
+  const n = typeof r == "bigint", t = typeof e == "bigint";
+  return n && t ? r === e : n && g(e) ? r === BigInt(e) : t && g(r) ? e === BigInt(r) : r === e;
+}, R = (r) => {
+  const e = 10 ** Math.floor(Math.log10(r));
+  return Math.round(r / e) * e;
+}, B = a((r, e) => r <= e ? r : e), g = (r) => typeof r == "bigint" ? !0 : Number.isInteger(r), U = a((r, e) => r >= e ? r : e), _ = (r) => typeof r == "bigint" ? r < 0n ? -r : r : r < 0 ? -r : r, W = a((r, e) => r * e), G = a((r, e) => r / e), s = (r, e, n) => {
+  const t = {};
+  if (typeof e == "object" && (n = e, e = void 0), n = { makeValid: !0, ...n }, typeof r == "number" || typeof r == "bigint")
+    e != null ? (t.lower = r, t.upper = e) : (t.lower = typeof r == "bigint" ? 0n : 0, t.upper = r);
+  else if (Array.isArray(r)) {
+    if (r.length !== 2) throw new Error("bounds: expected array of length 2");
+    [t.lower, t.upper] = r;
+  } else
+    t.lower = r.lower, t.upper = r.upper;
+  return n?.makeValid ? h(t) : t;
+}, N = Object.freeze({ lower: 0, upper: 0 }), M = Object.freeze({ lower: -1 / 0, upper: 1 / 0 }), j = Object.freeze({ lower: 0, upper: 1 }), A = Object.freeze({ lower: -1, upper: 1 }), O = (r, e) => {
+  if (r == null && e == null) return !0;
+  if (r == null || e == null) return !1;
+  const n = s(r), t = s(e);
+  return n?.lower === t?.lower && n?.upper === t?.upper;
+}, h = (r) => r.lower > r.upper ? { lower: r.upper, upper: r.lower } : r, P = (r, e) => {
+  const n = s(r);
+  return e < n.lower ? n.lower : e >= n.upper ? n.upper - (typeof n.upper == "number" ? 1 : 1n) : e;
+}, f = (r, e) => {
+  const n = s(r);
+  if (typeof e == "number" || typeof e == "bigint")
+    return e >= n.lower && e < n.upper;
+  const t = s(e);
+  return t.lower >= n.lower && t.upper <= n.upper;
+}, z = (r, e) => {
+  const n = s(r), t = s(e);
+  return n.lower === t.lower ? !0 : t.upper === n.lower || t.lower === n.upper ? !1 : f(n, t.upper) || f(n, t.lower) || f(t, n.upper) || f(t, n.lower);
+}, d = (r) => {
+  const e = s(r);
+  return e.upper - e.lower;
+}, E = (r) => {
+  const e = s(r);
+  return typeof e.lower == "bigint" ? e.lower === 0n && e.upper === 0n : e.lower === 0 && e.upper === 0;
+}, k = (r) => {
+  const e = d(r);
+  return typeof e == "number" ? e === 0 : e === 0n;
+}, D = (r) => {
+  const e = s(r);
+  return typeof e.lower == "bigint" ? !0 : Number.isFinite(e.lower) && Number.isFinite(e.upper);
+}, F = (r) => {
+  const e = s(r);
+  return (e.upper + e.lower) / 2;
+}, L = (r) => ({
+  lower: Math.min(...r.map((e) => s(e).lower)),
+  upper: Math.max(...r.map((e) => s(e).upper))
+}), T = (r) => ({
+  lower: Math.max(...r.map((e) => s(e).lower)),
+  upper: Math.min(...r.map((e) => s(e).upper))
+}), Z = (r) => {
+  const e = s(r), n = typeof e.lower == "bigint";
+  return Array.from({ length: Number(d(r)) }, (t, o) => n ? e.lower + BigInt(o) : e.lower + o);
+}, I = (r, e) => {
+  const n = r.map((u) => s(u)), t = n.findIndex((u) => f(u, e) || e < u.lower);
+  if (t === -1) return { index: r.length, position: 0 };
+  const o = n[t];
+  return f(o, e) ? { index: t, position: Number(e - o.lower) } : { index: t, position: 0 };
+}, b = {
+  removeBefore: 0,
+  removeAfter: 0,
+  insertInto: 0,
+  deleteInBetween: 0
+}, C = (r, e) => {
+  const n = r.map((l) => s(l)), t = s(e);
+  if (n.length === 0) return b;
+  const o = I(n, t.lower), u = I(n, t.upper);
+  if (o.index === r.length) return { ...b, insertInto: r.length };
+  if (u.index === 0) return { ...b, removeAfter: u.position };
+  if (o.index === u.index)
+    return o.position !== 0 && u.position !== 0 ? null : {
+      removeAfter: u.position,
+      removeBefore: o.position,
+      insertInto: o.index,
+      deleteInBetween: 0
+    };
+  let i = u.index - o.index, c = o.index, p = w(Number(d(n[o.index])), o.position);
+  return o.position !== 0 ? (i -= 1, c += 1) : p = 0, {
+    removeBefore: p,
+    removeAfter: u.position,
+    insertInto: c,
+    deleteInBetween: i
+  };
+}, S = (r, e, n) => {
+  const t = r.map((c) => s(c)), o = n > 0 ? 1 : n < 0 ? -1 : 0;
+  if (o === 0) return e;
+  let u = n, i = e;
+  for (; y(u, 0) === !1; ) {
+    const c = t.findIndex((p) => o > 0 ? i >= p.lower && i < p.upper : i > p.lower && i <= p.upper);
+    if (c !== -1) {
+      const p = t[c];
+      let l;
+      if (o > 0 ? l = w(p.upper, i) : l = w(i, p.lower), l > 0) {
+        const m = B(_(u), l);
+        if (i = v(
+          i,
+          o > 0 ? m : -m
+        ), u = w(u, o > 0 ? m : -m), y(u, 0)) return i;
+        continue;
+      }
+    }
+    if (o > 0) {
+      const p = t.filter((l) => l.lower > i);
+      if (p.length > 0) i = p[0].lower;
+      else return i;
+    } else {
+      const p = t.filter((l) => l.upper < i);
+      if (p.length > 0)
+        i = p[p.length - 1].upper;
+      else return i;
+    }
+  }
+  return i;
+}, V = (r, e, n) => {
+  const t = r.map((i) => s(i));
+  if (e === n) return typeof e == "bigint" ? 0n : 0;
+  const o = e < n ? s([e, n]) : s([n, e]);
+  let u = typeof e == "bigint" ? 0n : 0;
+  for (const i of t) {
+    const c = i.lower > o.lower ? i.lower : o.lower, p = i.upper < o.upper ? i.upper : o.upper;
+    if (c < p) {
+      const l = p - c;
+      u = u + l;
+    }
+  }
+  return u;
+}, H = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  CLIP: A,
+  DECIMAL: j,
+  INFINITE: M,
+  ZERO: N,
+  bounds: x,
+  buildInsertionPlan: C,
+  clamp: P,
+  construct: s,
+  contains: f,
+  distance: V,
+  equals: O,
+  findInsertPosition: I,
+  isFinite: D,
+  isZero: E,
+  linspace: Z,
+  makeValid: h,
+  max: L,
+  mean: F,
+  min: T,
+  overlapsWith: z,
+  span: d,
+  spanIsZero: k,
+  traverse: S
+}, Symbol.toStringTag, { value: "Module" }));
+export {
+  v as a,
+  H as b,
+  s as c,
+  G as d,
+  P as e,
+  f,
+  L as g,
+  V as h,
+  d as i,
+  _ as j,
+  q as k,
+  y as l,
+  W as m,
+  g as n,
+  U as o,
+  B as p,
+  R as r,
+  w as s,
+  S as t
+};

package/dist/bounds-CRK04jp7.cjs

@@ -0,0 +1 @@
+"use strict";const O=require("./base-BAM2mqCy.cjs"),d=r=>(e,n)=>{if(typeof e=="bigint"){if(b(n))return r(e,BigInt(n));const t=r(Number(e),Number(n));return typeof t=="number"?BigInt(Math.round(t)):t}return r(Number(e),Number(n))},m=d((r,e)=>r-e),h=d((r,e)=>r+e),j=(r,e,n=1e-4)=>Math.abs(r-e)<n,I=(r,e)=>{const n=typeof r=="bigint",t=typeof e=="bigint";return n&&t?r===e:n&&b(e)?r===BigInt(e):t&&b(r)?e===BigInt(r):r===e},P=r=>{const e=10**Math.floor(Math.log10(r));return Math.round(r/e)*e},x=d((r,e)=>r<=e?r:e),b=r=>typeof r=="bigint"?!0:Number.isInteger(r),T=d((r,e)=>r>=e?r:e),v=r=>typeof r=="bigint"?r<0n?-r:r:r<0?-r:r,z=d((r,e)=>r*e),E=d((r,e)=>r/e),u=(r,e,n)=>{const t={};if(typeof e=="object"&&(n=e,e=void 0),n={makeValid:!0,...n},typeof r=="number"||typeof r=="bigint")e!=null?(t.lower=r,t.upper=e):(t.lower=typeof r=="bigint"?0n:0,t.upper=r);else if(Array.isArray(r)){if(r.length!==2)throw new Error("bounds: expected array of length 2");[t.lower,t.upper]=r}else t.lower=r.lower,t.upper=r.upper;return n?.makeValid?B(t):t},q=Object.freeze({lower:0,upper:0}),D=Object.freeze({lower:-1/0,upper:1/0}),F=Object.freeze({lower:0,upper:1}),L=Object.freeze({lower:-1,upper:1}),Z=(r,e)=>{if(r==null&&e==null)return!0;if(r==null||e==null)return!1;const n=u(r),t=u(e);return n?.lower===t?.lower&&n?.upper===t?.upper},B=r=>r.lower>r.upper?{lower:r.upper,upper:r.lower}:r,_=(r,e)=>{const n=u(r);return e<n.lower?n.lower:e>=n.upper?n.upper-(typeof n.upper=="number"?1:1n):e},f=(r,e)=>{const n=u(r);if(typeof e=="number"||typeof e=="bigint")return e>=n.lower&&e<n.upper;const t=u(e);return t.lower>=n.lower&&t.upper<=n.upper},k=(r,e)=>{const n=u(r),t=u(e);return n.lower===t.lower?!0:t.upper===n.lower||t.lower===n.upper?!1:f(n,t.upper)||f(n,t.lower)||f(t,n.upper)||f(t,n.lower)},w=r=>{const e=u(r);return e.upper-e.lower},C=r=>{const e=u(r);return typeof e.lower=="bigint"?e.lower===0n&&e.upper===0n:e.lower===0&&e.upper===0},S=r=>{const e=w(r);return typeof e=="number"?e===0:e===0n},V=r=>{const e=u(r);return typeof e.lower=="bigint"?!0:Number.isFinite(e.lower)&&Number.isFinite(e.upper)},$=r=>{const e=u(r);return(e.upper+e.lower)/2},N=r=>({lower:Math.min(...r.map(e=>u(e).lower)),upper:Math.max(...r.map(e=>u(e).upper))}),R=r=>({lower:Math.max(...r.map(e=>u(e).lower)),upper:Math.min(...r.map(e=>u(e).upper))}),U=r=>{const e=u(r),n=typeof e.lower=="bigint";return Array.from({length:Number(w(r))},(t,o)=>n?e.lower+BigInt(o):e.lower+o)},y=(r,e)=>{const n=r.map(s=>u(s)),t=n.findIndex(s=>f(s,e)||e<s.lower);if(t===-1)return{index:r.length,position:0};const o=n[t];return f(o,e)?{index:t,position:Number(e-o.lower)}:{index:t,position:0}},g={removeBefore:0,removeAfter:0,insertInto:0,deleteInBetween:0},W=(r,e)=>{const n=r.map(l=>u(l)),t=u(e);if(n.length===0)return g;const o=y(n,t.lower),s=y(n,t.upper);if(o.index===r.length)return{...g,insertInto:r.length};if(s.index===0)return{...g,removeAfter:s.position};if(o.index===s.index)return o.position!==0&&s.position!==0?null:{removeAfter:s.position,removeBefore:o.position,insertInto:o.index,deleteInBetween:0};let i=s.index-o.index,c=o.index,p=m(Number(w(n[o.index])),o.position);return o.position!==0?(i-=1,c+=1):p=0,{removeBefore:p,removeAfter:s.position,insertInto:c,deleteInBetween:i}},M=(r,e,n)=>{const t=r.map(c=>u(c)),o=n>0?1:n<0?-1:0;if(o===0)return e;let s=n,i=e;for(;I(s,0)===!1;){const c=t.findIndex(p=>o>0?i>=p.lower&&i<p.upper:i>p.lower&&i<=p.upper);if(c!==-1){const p=t[c];let l;if(o>0?l=m(p.upper,i):l=m(i,p.lower),l>0){const a=x(v(s),l);if(i=h(i,o>0?a:-a),s=m(s,o>0?a:-a),I(s,0))return i;continue}}if(o>0){const p=t.filter(l=>l.lower>i);if(p.length>0)i=p[0].lower;else return i}else{const p=t.filter(l=>l.upper<i);if(p.length>0)i=p[p.length-1].upper;else return i}}return i},A=(r,e,n)=>{const t=r.map(i=>u(i));if(e===n)return typeof e=="bigint"?0n:0;const o=e<n?u([e,n]):u([n,e]);let s=typeof e=="bigint"?0n:0;for(const i of t){const c=i.lower>o.lower?i.lower:o.lower,p=i.upper<o.upper?i.upper:o.upper;if(c<p){const l=p-c;s=s+l}}return s},G=Object.freeze(Object.defineProperty({__proto__:null,CLIP:L,DECIMAL:F,INFINITE:D,ZERO:q,bounds:O.bounds,buildInsertionPlan:W,clamp:_,construct:u,contains:f,distance:A,equals:Z,findInsertPosition:y,isFinite:V,isZero:C,linspace:U,makeValid:B,max:N,mean:$,min:R,overlapsWith:k,span:w,spanIsZero:S,traverse:M},Symbol.toStringTag,{value:"Module"}));exports.abs=v;exports.add=h;exports.bounds=G;exports.clamp=_;exports.closeTo=j;exports.construct=u;exports.contains=f;exports.distance=A;exports.div=E;exports.equal=I;exports.isInteger=b;exports.max=N;exports.max$1=T;exports.min=x;exports.mult=z;exports.roundToNearestMagnitude=P;exports.span=w;exports.sub=m;exports.traverse=M;

package/dist/bounds.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./bounds-D6e9xoHt.cjs");exports.bounds=e.bounds;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./bounds-CRK04jp7.cjs");exports.bounds=e.bounds;

package/dist/bounds.js

@@ -1,4 +1,4 @@
-import { b as r } from "./bounds-Dj9nG39I.js";
+import { b as r } from "./bounds-8OC_obRs.js";
 export {
   r as bounds
 };

package/dist/compare.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index-B1m2qvBT.cjs");exports.compare=e.compare;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index-DOJlZHqJ.cjs");exports.compare=e.compare;

package/dist/compare.js

@@ -1,4 +1,4 @@
-import { c as a } from "./index-PNh31WTW.js";
+import { c as a } from "./index-CBMHFqs4.js";
 export {
   a as compare
 };

package/dist/deep.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("./identity.cjs"),y=require("./path-st_E5-LJ.cjs"),d=t=>JSON.parse(JSON.stringify(t)),j=(t,...l)=>(l.forEach(i=>{let r=t;const f=i.split(".");f.forEach((n,e)=>{typeof r!="object"||r===null||(e===f.length-1?delete r[n]:n in r&&(r=r[n]))})}),t),A=(t,l,i="")=>{const r={},f=(n,e,s)=>{if(typeof n!=typeof e||n===null||e===null){r[s]=[n,e];return}if(typeof n=="object"&&typeof e=="object")if(Array.isArray(n)&&Array.isArray(e)){if(n.length!==e.length){r[s]=[n,e];return}for(let o=0;o<n.length;o++)f(n[o],e[o],`${s}[${o}]`)}else new Set([...Object.keys(n),...Object.keys(e)]).forEach(c=>{f(n[c],e[c],s!==""?`${s}.${c}`:c)});else n!==e&&(r[s]=[n,e])};return f(t,l,i),r},p=(t,l)=>{const i=Array.isArray(t),r=Array.isArray(l);if(i!==r)return!1;if(i&&r){const e=t,s=l;if(e.length!==s.length)return!1;for(let o=0;o<e.length;o++)if(!p(e[o],s[o]))return!1;return!0}if(t==null||l==null||typeof t!="object"||typeof l!="object")return t===l;if("equals"in t)return t.equals(l);const f=Object.keys(t),n=Object.keys(l);if(f.length!==n.length)return!1;for(const e of f){const s=t[e],o=l[e];if(typeof s=="object"&&typeof o=="object"){if(!p(s,o))return!1}else if(s!==o)return!1}return!0},h=(t,l)=>{if(typeof t!="object"||t==null)return t===l;const i=Object.keys(t),r=Object.keys(l);if(r.length>i.length)return!1;for(const f of r){const n=t[f],e=l[f];if(typeof n=="object"&&typeof e=="object"){if(!h(n,e))return!1}else if(n!==e)return!1}return!0},a=(t,...l)=>{if(l.length===0)return t;const i=l.shift();if(u.isObject(t)&&u.isObject(i))for(const r in i)try{u.isObject(i[r])?(r in t||Object.assign(t,{[r]:{}}),a(t[r],i[r])):Object.assign(t,{[r]:i[r]})}catch(f){throw f instanceof TypeError?new TypeError(`.${r}: ${f.message}`):f}return a(t,...l)},k=(t,l,i)=>{const r=(f,n,e)=>{if(e.def?.type==="union")return e.def.options.reduce((s,o)=>r(s,n,o),f);if(e.def?.type==="intersection"){const s=r(f,n,e.def.left);return r(s,n,e.def.right)}for(const s in n){const o=n[s];let c=e?.shape;if(c!=null)for(;c!=null;){if(c[s]!=null){const g=c[s].safeParse(o);if(g.success){f[s]=g.data;break}}c=c.def?.shape}typeof o=="object"&&!Array.isArray(o)&&o!==null&&e&&e.shape&&e.shape[s]&&(f[s]||={},r(f[s],o,e.shape[s]))}return f};return r({...t},l,i)},O=Object.freeze(Object.defineProperty({__proto__:null,copy:d,deleteD:j,difference:A,element:y.element,equal:p,get:y.get,has:y.has,override:a,overrideValidItems:k,partialEqual:h,pathsMatch:y.pathsMatch,remove:y.remove,set:y.set,transformPath:y.transformPath},Symbol.toStringTag,{value:"Module"}));exports.deep=O;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("./identity.cjs"),y=require("./path-CPSfCjde.cjs"),d=t=>{try{return structuredClone(t)}catch{return console.warn("Failed to deep copy object, falling back to JSON.parse(JSON.stringify)",t),console.trace(),JSON.parse(JSON.stringify(t))}},j=(t,...f)=>(f.forEach(i=>{let r=t;const l=i.split(".");l.forEach((n,e)=>{typeof r!="object"||r===null||(e===l.length-1?delete r[n]:n in r&&(r=r[n]))})}),t),A=(t,f,i="")=>{const r={},l=(n,e,s)=>{if(typeof n!=typeof e||n===null||e===null){r[s]=[n,e];return}if(typeof n=="object"&&typeof e=="object")if(Array.isArray(n)&&Array.isArray(e)){if(n.length!==e.length){r[s]=[n,e];return}for(let o=0;o<n.length;o++)l(n[o],e[o],`${s}[${o}]`)}else new Set([...Object.keys(n),...Object.keys(e)]).forEach(c=>{l(n[c],e[c],s!==""?`${s}.${c}`:c)});else n!==e&&(r[s]=[n,e])};return l(t,f,i),r},p=(t,f)=>{const i=Array.isArray(t),r=Array.isArray(f);if(i!==r)return!1;if(i&&r){const e=t,s=f;if(e.length!==s.length)return!1;for(let o=0;o<e.length;o++)if(!p(e[o],s[o]))return!1;return!0}if(t==null||f==null||typeof t!="object"||typeof f!="object")return t===f;if("equals"in t)return t.equals(f);const l=Object.keys(t),n=Object.keys(f);if(l.length!==n.length)return!1;for(const e of l){const s=t[e],o=f[e];if(typeof s=="object"&&typeof o=="object"){if(!p(s,o))return!1}else if(s!==o)return!1}return!0},h=(t,f)=>{if(typeof t!="object"||t==null)return t===f;const i=Object.keys(t),r=Object.keys(f);if(r.length>i.length)return!1;for(const l of r){const n=t[l],e=f[l];if(typeof n=="object"&&typeof e=="object"){if(!h(n,e))return!1}else if(n!==e)return!1}return!0},a=(t,...f)=>{if(f.length===0)return t;const i=f.shift();if(u.isObject(t)&&u.isObject(i))for(const r in i)try{u.isObject(i[r])?(r in t||Object.assign(t,{[r]:{}}),a(t[r],i[r])):Object.assign(t,{[r]:i[r]})}catch(l){throw l instanceof TypeError?new TypeError(`.${r}: ${l.message}`):l}return a(t,...f)},k=(t,f,i)=>{const r=(l,n,e)=>{if(e.def?.type==="union")return e.def.options.reduce((s,o)=>r(s,n,o),l);if(e.def?.type==="intersection"){const s=r(l,n,e.def.left);return r(s,n,e.def.right)}for(const s in n){const o=n[s];let c=e?.shape;if(c!=null)for(;c!=null;){if(c[s]!=null){const g=c[s].safeParse(o);if(g.success){l[s]=g.data;break}}c=c.def?.shape}typeof o=="object"&&!Array.isArray(o)&&o!==null&&e&&e.shape&&e.shape[s]&&(l[s]||={},r(l[s],o,e.shape[s]))}return l};return r({...t},f,i)},O=Object.freeze(Object.defineProperty({__proto__:null,copy:d,deleteD:j,difference:A,element:y.element,equal:p,get:y.get,has:y.has,override:a,overrideValidItems:k,partialEqual:h,pathsMatch:y.pathsMatch,remove:y.remove,resolvePath:y.resolvePath,set:y.set,transformPath:y.transformPath},Symbol.toStringTag,{value:"Module"}));exports.deep=O;

package/dist/deep.js

@@ -1,13 +1,22 @@
 import { isObject as y } from "./identity.js";
-import { e as h, g as d, h as A, p as j, r as k, s as V, t as E } from "./path-BXdMenka.js";
-const $ = (t) => JSON.parse(JSON.stringify(t)), w = (t, ...l) => (l.forEach((i) => {
+import { e as h, g as d, h as A, p as j, r as k, a as V, s as w, t as E } from "./path-Blh4wJuA.js";
+const O = (t) => {
+  try {
+    return structuredClone(t);
+  } catch {
+    return console.warn(
+      "Failed to deep copy object, falling back to JSON.parse(JSON.stringify)",
+      t
+    ), console.trace(), JSON.parse(JSON.stringify(t));
+  }
+}, $ = (t, ...f) => (f.forEach((i) => {
   let r = t;
-  const f = i.split(".");
-  f.forEach((s, e) => {
-    typeof r != "object" || r === null || (e === f.length - 1 ? delete r[s] : s in r && (r = r[s]));
+  const l = i.split(".");
+  l.forEach((s, e) => {
+    typeof r != "object" || r === null || (e === l.length - 1 ? delete r[s] : s in r && (r = r[s]));
   });
-}), t), q = (t, l, i = "") => {
-  const r = {}, f = (s, e, n) => {
+}), t), _ = (t, f, i = "") => {
+  const r = {}, l = (s, e, n) => {
     if (typeof s != typeof e || s === null || e === null) {
       r[n] = [s, e];
       return;
@@ -18,10 +27,10 @@ const $ = (t) => JSON.parse(JSON.stringify(t)), w = (t, ...l) => (l.forEach((i)
           r[n] = [s, e];
           return;
         }
-        for (let o = 0; o < s.length; o++) f(s[o], e[o], `${n}[${o}]`);
+        for (let o = 0; o < s.length; o++) l(s[o], e[o], `${n}[${o}]`);
       } else
         (/* @__PURE__ */ new Set([...Object.keys(s), ...Object.keys(e)])).forEach((c) => {
-          f(
+          l(
             s[c],
             e[c],
             n !== "" ? `${n}.${c}` : c
@@ -29,59 +38,59 @@ const $ = (t) => JSON.parse(JSON.stringify(t)), w = (t, ...l) => (l.forEach((i)
         });
     else s !== e && (r[n] = [s, e]);
   };
-  return f(t, l, i), r;
-}, u = (t, l) => {
-  const i = Array.isArray(t), r = Array.isArray(l);
+  return l(t, f, i), r;
+}, u = (t, f) => {
+  const i = Array.isArray(t), r = Array.isArray(f);
   if (i !== r) return !1;
   if (i && r) {
-    const e = t, n = l;
+    const e = t, n = f;
     if (e.length !== n.length) return !1;
     for (let o = 0; o < e.length; o++) if (!u(e[o], n[o])) return !1;
     return !0;
   }
-  if (t == null || l == null || typeof t != "object" || typeof l != "object")
-    return t === l;
-  if ("equals" in t) return t.equals(l);
-  const f = Object.keys(t), s = Object.keys(l);
-  if (f.length !== s.length) return !1;
-  for (const e of f) {
-    const n = t[e], o = l[e];
+  if (t == null || f == null || typeof t != "object" || typeof f != "object")
+    return t === f;
+  if ("equals" in t) return t.equals(f);
+  const l = Object.keys(t), s = Object.keys(f);
+  if (l.length !== s.length) return !1;
+  for (const e of l) {
+    const n = t[e], o = f[e];
     if (typeof n == "object" && typeof o == "object") {
       if (!u(n, o)) return !1;
     } else if (n !== o) return !1;
   }
   return !0;
-}, g = (t, l) => {
-  if (typeof t != "object" || t == null) return t === l;
-  const i = Object.keys(t), r = Object.keys(l);
+}, g = (t, f) => {
+  if (typeof t != "object" || t == null) return t === f;
+  const i = Object.keys(t), r = Object.keys(f);
   if (r.length > i.length) return !1;
-  for (const f of r) {
-    const s = t[f], e = l[f];
+  for (const l of r) {
+    const s = t[l], e = f[l];
     if (typeof s == "object" && typeof e == "object") {
       if (!g(s, e)) return !1;
     } else if (s !== e) return !1;
   }
   return !0;
-}, p = (t, ...l) => {
-  if (l.length === 0) return t;
-  const i = l.shift();
+}, p = (t, ...f) => {
+  if (f.length === 0) return t;
+  const i = f.shift();
   if (y(t) && y(i))
     for (const r in i)
       try {
         y(i[r]) ? (r in t || Object.assign(t, { [r]: {} }), p(t[r], i[r])) : Object.assign(t, { [r]: i[r] });
-      } catch (f) {
-        throw f instanceof TypeError ? new TypeError(`.${r}: ${f.message}`) : f;
+      } catch (l) {
+        throw l instanceof TypeError ? new TypeError(`.${r}: ${l.message}`) : l;
       }
-  return p(t, ...l);
-}, K = (t, l, i) => {
-  const r = (f, s, e) => {
+  return p(t, ...f);
+}, q = (t, f, i) => {
+  const r = (l, s, e) => {
     if (e.def?.type === "union")
       return e.def.options.reduce(
         (n, o) => r(n, s, o),
-        f
+        l
       );
     if (e.def?.type === "intersection") {
-      const n = r(f, s, e.def.left);
+      const n = r(l, s, e.def.left);
       return r(n, s, e.def.right);
     }
     for (const n in s) {
@@ -92,34 +101,35 @@ const $ = (t) => JSON.parse(JSON.stringify(t)), w = (t, ...l) => (l.forEach((i)
           if (c[n] != null) {
             const a = c[n].safeParse(o);
             if (a.success) {
-              f[n] = a.data;
+              l[n] = a.data;
               break;
             }
           }
           c = c.def?.shape;
         }
-      typeof o == "object" && !Array.isArray(o) && o !== null && e && e.shape && e.shape[n] && (f[n] ||= {}, r(f[n], o, e.shape[n]));
+      typeof o == "object" && !Array.isArray(o) && o !== null && e && e.shape && e.shape[n] && (l[n] ||= {}, r(l[n], o, e.shape[n]));
     }
-    return f;
+    return l;
   };
-  return r({ ...t }, l, i);
-}, m = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  return r({ ...t }, f, i);
+}, N = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  copy: $,
-  deleteD: w,
-  difference: q,
+  copy: O,
+  deleteD: $,
+  difference: _,
   element: h,
   equal: u,
   get: d,
   has: A,
   override: p,
-  overrideValidItems: K,
+  overrideValidItems: q,
   partialEqual: g,
   pathsMatch: j,
   remove: k,
-  set: V,
+  resolvePath: V,
+  set: w,
   transformPath: E
 }, Symbol.toStringTag, { value: "Module" }));
 export {
-  m as deep
+  N as deep
 };

package/dist/{external-BFgJjMcS.js → external-BM_NS5yM.js}

@@ -1,13 +1,13 @@
-import u from "zod";
-import { t as i, g as f } from "./path-BXdMenka.js";
-const m = (e) => e.nullable().transform((t) => t === null ? void 0 : t).optional(), p = (e) => u.array(e).or(e.transform((t) => [t])), s = (e) => i(e, (t, r, n) => {
-  const l = r === n.length - 1, a = !isNaN(parseInt(t)), c = !isNaN(parseInt(n[r + 1]));
-  return a && (t = "element"), l || c ? t : [t, "shape"];
+import a from "zod";
+import { t as i, g as f } from "./path-Blh4wJuA.js";
+const m = (e) => e.nullable().transform((t) => t === null ? void 0 : t).optional(), p = (e) => a.array(e).or(e.transform((t) => [t])), s = (e) => i(e, (t, r, n) => {
+  const l = r === n.length - 1, u = !isNaN(parseInt(t)), c = !isNaN(parseInt(n[r + 1]));
+  return u && (t = "element"), l || c ? t : [t, "shape"];
 }), o = (e, t) => {
   if (e == null) return null;
   const r = e[t];
   return r == null && typeof e == "object" && "sourceType" in e ? e.sourceType()[t] : r;
-}, y = (e, t, r) => f(
+}, y = (e, t, r) => t === "" ? e : f(
   o(e, "shape"),
   s(t),
   { ...r, getter: o }

package/dist/external-E3ErJeeM.cjs

@@ -0,0 +1 @@
+"use strict";const a=require("zod"),s=require("./path-CPSfCjde.cjs"),f=e=>e.nullable().transform(t=>t===null?void 0:t).optional(),p=e=>a.array(e).or(e.transform(t=>[t])),u=e=>s.transformPath(e,(t,r,n)=>{const l=r===n.length-1,c=!isNaN(parseInt(t)),i=!isNaN(parseInt(n[r+1]));return c&&(t="element"),l||i?t:[t,"shape"]}),o=(e,t)=>{if(e==null)return null;const r=e[t];return r==null&&typeof e=="object"&&"sourceType"in e?e.sourceType()[t]:r},y=(e,t,r)=>t===""?e:s.get(o(e,"shape"),u(t),{...r,getter:o}),g=Object.freeze(Object.defineProperty({__proto__:null,getFieldSchema:y,getFieldSchemaPath:u,nullToUndefined:f,toArray:p},Symbol.toStringTag,{value:"Module"}));exports.external=g;

package/dist/{index-PNh31WTW.js → index-CBMHFqs4.js}

@@ -1,5 +1,5 @@
 import { a as m } from "./index-D4NCYiQB.js";
-class h {
+class N {
   /** The underlying primitive value */
   value;
   constructor(t) {
@@ -19,7 +19,7 @@ class h {
     return this.value.toString();
   }
 }
-const l = (e) => e != null && typeof e == "object" && "toString" in e, N = (e) => {
+const l = (e) => e != null && typeof e == "object" && "toString" in e, b = (e) => {
   if (l(e)) return e?.toString().length === 0;
   switch (typeof e) {
     case "string":
@@ -37,11 +37,12 @@ const l = (e) => e != null && typeof e == "object" && "toString" in e, N = (e) =
     default:
       return !1;
   }
-}, F = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}, p = (e) => !b(e), O = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  ValueExtension: h,
+  ValueExtension: N,
+  isNonZero: p,
   isStringer: l,
-  isZero: N
+  isZero: b
 }, Symbol.toStringTag, { value: "Module" })), g = (e, t = !1) => {
   const o = l(e) ? "stringer" : typeof e;
   let r;
@@ -67,19 +68,19 @@ const l = (e) => e != null && typeof e == "object" && "toString" in e, N = (e) =
     default:
       return console.warn(`sortFunc: unknown type ${o}`), () => -1;
   }
-  return t ? f(r) : r;
-}, p = (e, t, o) => {
+  return t ? h(r) : r;
+}, d = (e, t, o) => {
   const r = g(t[e], o);
   return (n, s) => r(n[e], s[e]);
-}, d = (e, t) => e.length !== t.length ? e.length - t.length : e.every((o, r) => o === t[r]) ? 0 : -1, b = (e, t) => {
+}, S = (e, t) => e.length !== t.length ? e.length - t.length : e.every((o, r) => o === t[r]) ? 0 : -1, f = (e, t) => {
   if (e.length !== t.length) return e.length - t.length;
   if (e.length === 0) return 0;
   const o = g(e[0]), r = [...e].sort(o), n = [...t].sort(o);
   return r.every((s, i) => s === n[i]) ? 0 : -1;
-}, S = (e, t) => {
+}, _ = (e, t) => {
   const o = m(e), r = m(t);
-  return b(o, r);
-}, _ = (e, t) => e === t ? 0 : e === "first" && t === "last" ? 1 : -1, f = (e) => (t, o) => e(o, t), c = 0, y = -1, A = 1, T = (e) => e < c, E = (e) => e > c, P = (e) => e >= c, j = (e) => e === c, q = (e, t) => {
+  return f(o, r);
+}, y = (e, t) => e === t ? 0 : e === "first" && t === "last" ? 1 : -1, h = (e) => (t, o) => e(o, t), c = 0, A = -1, T = 1, E = (e) => e < c, P = (e) => e > c, j = (e) => e >= c, q = (e) => e === c, w = (e, t) => {
   const o = /([a-zA-Z]+)|(\d+)/g, r = e.replace(/[\s_.-]+/g, "").match(o), n = t.replace(/[\s_.-]+/g, "").match(o);
   if (!r || !n) return 0;
   for (let s = 0; s < Math.min(r.length, n.length); s++) {
@@ -93,33 +94,33 @@ const l = (e) => e != null && typeof e == "object" && "toString" in e, N = (e) =
     } else return isNaN(Number(i)) ? -1 : 1;
   }
   return r.length - n.length;
-}, O = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}, k = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   EQUAL: c,
-  GREATER_THAN: A,
-  LESS_THAN: y,
-  isEqualTo: j,
-  isGreaterThan: E,
-  isGreaterThanEqual: P,
-  isLessThan: T,
+  GREATER_THAN: T,
+  LESS_THAN: A,
+  isEqualTo: q,
+  isGreaterThan: P,
+  isGreaterThanEqual: j,
+  isLessThan: E,
   newF: g,
-  newFieldF: p,
-  order: _,
-  primitiveArrays: d,
-  reverseF: f,
-  stringsWithNumbers: q,
-  uniqueUnorderedPrimitiveArrays: S,
-  unorderedPrimitiveArrays: b
+  newFieldF: d,
+  order: y,
+  primitiveArrays: S,
+  reverseF: h,
+  stringsWithNumbers: w,
+  uniqueUnorderedPrimitiveArrays: _,
+  unorderedPrimitiveArrays: f
 }, Symbol.toStringTag, { value: "Module" }));
 export {
   c as E,
-  A as G,
-  y as L,
-  h as V,
-  E as a,
-  T as b,
-  O as c,
-  j as i,
+  T as G,
+  A as L,
+  N as V,
+  P as a,
+  E as b,
+  k as c,
+  q as i,
   g as n,
-  F as p
+  O as p
 };

package/dist/index-DOJlZHqJ.cjs

@@ -0,0 +1 @@
+"use strict";const m=require("./index-udOjA9d-.cjs");class h{value;constructor(t){this.value=t}valueOf(){return this.value}toJSON(){return this.value}toString(){return this.value.toString()}}const g=e=>e!=null&&typeof e=="object"&&"toString"in e,b=e=>{if(g(e))return e?.toString().length===0;switch(typeof e){case"string":return e.length===0;case"number":return e===0;case"bigint":return e===0n;case"boolean":return!e;case"undefined":return!0;case"object":return e==null;default:return!1}},A=e=>!b(e),E=Object.freeze(Object.defineProperty({__proto__:null,ValueExtension:h,isNonZero:A,isStringer:g,isZero:b},Symbol.toStringTag,{value:"Module"})),l=(e,t=!1)=>{const o=g(e)?"stringer":typeof e;let r;switch(o){case"string":r=(n,s)=>n.localeCompare(s);break;case"stringer":r=(n,s)=>n.toString().localeCompare(s.toString());break;case"number":r=(n,s)=>Number(n)-Number(s);break;case"bigint":r=(n,s)=>BigInt(n)-BigInt(s)>0n?1:-1;break;case"boolean":r=(n,s)=>Number(n)-Number(s);break;case"undefined":r=()=>0;break;default:return console.warn(`sortFunc: unknown type ${o}`),()=>-1}return t?N(r):r},y=(e,t,o)=>{const r=l(t[e],o);return(n,s)=>r(n[e],s[e])},q=(e,t)=>e.length!==t.length?e.length-t.length:e.every((o,r)=>o===t[r])?0:-1,f=(e,t)=>{if(e.length!==t.length)return e.length-t.length;if(e.length===0)return 0;const o=l(e[0]),r=[...e].sort(o),n=[...t].sort(o);return r.every((s,i)=>s===n[i])?0:-1},P=(e,t)=>{const o=m.unique$1(e),r=m.unique$1(t);return f(o,r)},w=(e,t)=>e===t?0:e==="first"&&t==="last"?1:-1,N=e=>(t,o)=>e(o,t),u=0,p=-1,d=1,S=e=>e<u,T=e=>e>u,F=e=>e>=u,_=e=>e===u,j=(e,t)=>{const o=/([a-zA-Z]+)|(\d+)/g,r=e.replace(/[\s_.-]+/g,"").match(o),n=t.replace(/[\s_.-]+/g,"").match(o);if(!r||!n)return 0;for(let s=0;s<Math.min(r.length,n.length);s++){const i=r[s],a=n[s];if(isNaN(Number(i))&&isNaN(Number(a))){const c=i.localeCompare(a);if(c!==0)return c}else if(!isNaN(Number(i))&&!isNaN(Number(a))){const c=Number(i)-Number(a);if(c!==0)return c}else return isNaN(Number(i))?-1:1}return r.length-n.length},v=Object.freeze(Object.defineProperty({__proto__:null,EQUAL:u,GREATER_THAN:d,LESS_THAN:p,isEqualTo:_,isGreaterThan:T,isGreaterThanEqual:F,isLessThan:S,newF:l,newFieldF:y,order:w,primitiveArrays:q,reverseF:N,stringsWithNumbers:j,uniqueUnorderedPrimitiveArrays:P,unorderedPrimitiveArrays:f},Symbol.toStringTag,{value:"Module"}));exports.EQUAL=u;exports.GREATER_THAN=d;exports.LESS_THAN=p;exports.ValueExtension=h;exports.compare=v;exports.isEqualTo=_;exports.isGreaterThan=T;exports.isLessThan=S;exports.newF=l;exports.primitive=E;