@synnaxlabs/x 0.44.2 → 0.44.4

package/.turbo/turbo-build.log

@@ -1,11 +1,11 @@
 
-> @synnaxlabs/x@0.44.2 build /home/runner/work/synnax/synnax/x/ts
+> @synnaxlabs/x@0.44.4 build /home/runner/work/synnax/synnax/x/ts
 > tsc --noEmit && vite build
 
  Synnax - Production mode
 vite v7.0.4 building for production...
 transforming...
-✓ 147 modules transformed.
+✓ 145 modules transformed.
 Generated an empty chunk: "destructor".
 rendering chunks...
 
@@ -28,45 +28,43 @@ computing gzip size...
 dist/caseconv.js              0.07 kB │ gzip:  0.09 kB
 dist/runtime.js               0.08 kB │ gzip:  0.09 kB
 dist/dimensions.js            0.08 kB │ gzip:  0.08 kB
-dist/position.js              0.08 kB │ gzip:  0.09 kB
 dist/identity.js              0.10 kB │ gzip:  0.11 kB
 dist/array.js                 0.24 kB │ gzip:  0.20 kB
-dist/spatial-BSWPzMkK.js      0.28 kB │ gzip:  0.23 kB
+dist/spatial-QY891r0E.js      0.28 kB │ gzip:  0.23 kB
 dist/change-DLl6DccR.js       0.30 kB │ gzip:  0.23 kB
 dist/debounce.js              0.36 kB │ gzip:  0.18 kB
 dist/telem.js                 0.41 kB │ gzip:  0.25 kB
 dist/link.js                  0.44 kB │ gzip:  0.34 kB
 dist/index-D4NCYiQB.js        0.45 kB │ gzip:  0.30 kB
-dist/record-CAcQ5PNX.js       0.51 kB │ gzip:  0.32 kB
-dist/spatial.js               0.58 kB │ gzip:  0.29 kB
-dist/direction-8etxfKaR.js    0.67 kB │ gzip:  0.38 kB
+dist/spatial.js               0.51 kB │ gzip:  0.26 kB
+dist/record-tSFQKmdG.js       0.61 kB │ gzip:  0.37 kB
+dist/direction-DKdfJwj7.js    0.76 kB │ gzip:  0.42 kB
 dist/external-BYuXBYJh.js     0.79 kB │ gzip:  0.34 kB
-dist/external-Birv9jaY.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
-dist/dimensions-CRgergMS.js   1.49 kB │ gzip:  0.66 kB
+dist/base-BORMP3mH.js         1.30 kB │ gzip:  0.54 kB
+dist/dimensions-RaRkesPq.js   1.49 kB │ gzip:  0.66 kB
 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/index-B5l_quQn.js        2.56 kB │ gzip:  1.00 kB
-dist/path-DVFrKaNI.js         2.63 kB │ gzip:  0.94 kB
-dist/location-Ar5y2DX2.js     2.86 kB │ gzip:  1.18 kB
+dist/path-Blh4wJuA.js         2.72 kB │ gzip:  0.97 kB
+dist/location-CGLioInQ.js     2.80 kB │ gzip:  1.16 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/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-EA1uaEDj.js      87.74 kB │ gzip: 18.83 kB
-[vite:dts] Declaration files built in 4679ms.
+dist/xy-CBuhMaIo.js           4.31 kB │ gzip:  1.59 kB
+dist/bounds-BQqppNFf.js       6.20 kB │ gzip:  2.09 kB
+dist/box-DRH5SOaY.js          6.38 kB │ gzip:  2.23 kB
+dist/scale-BhIvACdB.js        6.49 kB │ gzip:  1.89 kB
+dist/index.js                27.11 kB │ gzip:  8.73 kB
+dist/series-kgnLXSDr.js      91.88 kB │ gzip: 19.48 kB
+[vite:dts] Declaration files built in 4552ms.
 
 Generated an empty chunk: "destructor".
 dist/destructor.cjs            0.01 kB │ gzip:  0.03 kB
 dist/xy.cjs                    0.13 kB │ gzip:  0.14 kB
-dist/box.cjs                   0.14 kB │ gzip:  0.15 kB
+dist/box.cjs                   0.14 kB │ gzip:  0.14 kB
 dist/scale.cjs                 0.14 kB │ gzip:  0.15 kB
 dist/binary.cjs                0.14 kB │ gzip:  0.15 kB
 dist/unique.cjs                0.15 kB │ gzip:  0.15 kB
@@ -79,39 +77,37 @@ computing gzip size...
 dist/caseconv.cjs              0.15 kB │ gzip:  0.15 kB
 dist/runtime.cjs               0.15 kB │ gzip:  0.15 kB
 dist/location.cjs              0.15 kB │ gzip:  0.15 kB
-dist/position.cjs              0.15 kB │ gzip:  0.15 kB
 dist/direction.cjs             0.16 kB │ gzip:  0.15 kB
 dist/dimensions.cjs            0.16 kB │ gzip:  0.15 kB
 dist/identity.cjs              0.16 kB │ gzip:  0.15 kB
 dist/change-C-YELKx6.cjs       0.23 kB │ gzip:  0.20 kB
-dist/spatial-DGpZ2sO3.cjs      0.24 kB │ gzip:  0.21 kB
+dist/spatial-BsGadoUr.cjs      0.24 kB │ gzip:  0.21 kB
 dist/array.cjs                 0.25 kB │ gzip:  0.18 kB
 dist/index-udOjA9d-.cjs        0.32 kB │ gzip:  0.25 kB
 dist/debounce.cjs              0.33 kB │ gzip:  0.22 kB
-dist/record-YvCh7bzB.cjs       0.41 kB │ gzip:  0.28 kB
 dist/link.cjs                  0.42 kB │ gzip:  0.30 kB
+dist/record-BwjIgrpU.cjs       0.49 kB │ gzip:  0.33 kB
 dist/telem.cjs                 0.54 kB │ gzip:  0.27 kB
-dist/direction-386XDm2w.cjs    0.56 kB │ gzip:  0.35 kB
+dist/spatial.cjs               0.57 kB │ gzip:  0.31 kB
 dist/external-B9AAGv50.cjs     0.58 kB │ gzip:  0.30 kB
-dist/spatial.cjs               0.63 kB │ gzip:  0.33 kB
-dist/external-DsmsSN1Y.cjs     0.67 kB │ gzip:  0.45 kB
+dist/direction-XCdrc4is.cjs    0.62 kB │ gzip:  0.38 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
 dist/url.cjs                   0.88 kB │ gzip:  0.51 kB
-dist/dimensions-D2QGoNXO.cjs   1.17 kB │ gzip:  0.58 kB
+dist/dimensions-qY12pyfC.cjs   1.17 kB │ gzip:  0.58 kB
 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-BeMr8xWN.cjs         1.93 kB │ gzip:  0.84 kB
+dist/base-BLNViP3D.cjs         1.47 kB │ gzip:  0.59 kB
 dist/index-BQe8OIgm.cjs        1.98 kB │ gzip:  0.90 kB
-dist/location-DZi8ftXp.cjs     2.49 kB │ gzip:  1.06 kB
+dist/path-CPSfCjde.cjs         2.00 kB │ gzip:  0.88 kB
+dist/location-DJ_K4SlP.cjs     2.40 kB │ gzip:  1.04 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/box-Cxki783Y.cjs          4.99 kB │ gzip:  2.02 kB
-dist/index.cjs                20.35 kB │ gzip:  7.58 kB
-dist/series-CcA_WjbJ.cjs      37.82 kB │ gzip: 10.09 kB
-✓ built in 5.60s
+dist/xy-BKIJiLu_.cjs           3.14 kB │ gzip:  1.41 kB
+dist/scale-76Azh2EE.cjs        4.11 kB │ gzip:  1.47 kB
+dist/bounds-BXbqBINt.cjs       4.67 kB │ gzip:  1.85 kB
+dist/box-qgxWXNhm.cjs          4.87 kB │ gzip:  1.99 kB
+dist/index.cjs                20.56 kB │ gzip:  7.65 kB
+dist/series-tAhThbnz.cjs      39.15 kB │ gzip: 10.36 kB
+✓ built in 5.33s

package/dist/base-BLNViP3D.cjs

@@ -0,0 +1 @@
+"use strict";const n=require("zod"),t=n.z.tuple([n.z.number(),n.z.number()]);n.z.tuple([n.z.bigint(),n.z.bigint()]);const d=n.z.object({width:n.z.number(),height:n.z.number()}),O=n.z.object({signedWidth:n.z.number(),signedHeight:n.z.number()}),g=["width","height"];n.z.enum(g);const c=["start","center","end"],N=["signedWidth","signedHeight"];n.z.enum(N);const L=n.z.object({x:n.z.number(),y:n.z.number()}),S=n.z.object({clientX:n.z.number(),clientY:n.z.number()}),s=["x","y"],o=n.z.enum(s),u=["top","right","bottom","left"],I=n.z.enum(u),r=["left","right"],l=n.z.enum(r),z=["top","bottom"],a=n.z.enum(z),e=["center"],T=n.z.enum(e),C=[...u,...e],i=n.z.enum(C),E=n.z.enum(c),m=["first","last"],h=n.z.enum(m),b=n.z.object({lower:n.z.number(),upper:n.z.number()}),p=n.z.object({lower:n.z.bigint(),upper:n.z.bigint()});n.z.union([b,t]);n.z.union([p,t]);const D=n.z.enum([...o.options,...i.options]);n.z.enum(["x","left","right"]);n.z.enum(["y","top","bottom"]);const A=n.z.union([o,i,n.z.instanceof(String)]);exports.ALIGNMENTS=c;exports.CENTER_LOCATIONS=e;exports.DIRECTIONS=s;exports.ORDERS=m;exports.X_LOCATIONS=r;exports.Y_LOCATIONS=z;exports.alignment=E;exports.bounds=b;exports.centerLocation=T;exports.clientXY=S;exports.crudeDirection=D;exports.crudeLocation=A;exports.dimensions=d;exports.direction=o;exports.location=i;exports.numberCouple=t;exports.order=h;exports.outerLocation=I;exports.signedDimensions=O;exports.xLocation=l;exports.xy=L;exports.yLocation=a;

package/dist/{base-DFq0vvGn.js → base-BORMP3mH.js}

@@ -1,38 +1,41 @@
 import { z as n } from "zod";
 const t = n.tuple([n.number(), n.number()]);
 n.tuple([n.bigint(), n.bigint()]);
-const S = n.object({ width: n.number(), height: n.number() }), h = n.object({
+const p = n.object({ width: n.number(), height: n.number() }), N = n.object({
   signedWidth: n.number(),
   signedHeight: n.number()
 }), c = ["width", "height"];
 n.enum(c);
 const u = ["start", "center", "end"], r = ["signedWidth", "signedHeight"];
 n.enum(r);
-const p = n.object({ x: n.number(), y: n.number() }), I = n.object({ clientX: n.number(), clientY: n.number() }), a = ["x", "y"], o = n.enum(a), e = ["top", "right", "bottom", "left"], L = n.enum(e), m = ["left", "right"], C = n.enum(m), b = ["top", "bottom"], E = n.enum(b), s = ["center"], T = n.enum(s), g = [...e, ...s], i = n.enum(g), D = n.enum(u), d = ["first", "last"], j = n.enum(d), O = n.object({ lower: n.number(), upper: n.number() }), l = n.object({ lower: n.bigint(), upper: n.bigint() });
+const S = n.object({ x: n.number(), y: n.number() }), I = n.object({ clientX: n.number(), clientY: n.number() }), m = ["x", "y"], o = n.enum(m), e = ["top", "right", "bottom", "left"], L = n.enum(e), a = ["left", "right"], C = n.enum(a), b = ["top", "bottom"], E = n.enum(b), s = ["center"], T = n.enum(s), g = [...e, ...s], i = n.enum(g), D = n.enum(u), d = ["first", "last"], f = n.enum(d), O = n.object({ lower: n.number(), upper: n.number() }), l = n.object({ lower: n.bigint(), upper: n.bigint() });
 n.union([O, t]);
 n.union([l, t]);
-const A = n.enum([...o.options, ...i.options]), f = n.union([o, i, n.instanceof(String)]);
+const j = n.enum([...o.options, ...i.options]);
+n.enum(["x", "left", "right"]);
+n.enum(["y", "top", "bottom"]);
+const x = n.union([o, i, n.instanceof(String)]);
 export {
   u as A,
   s as C,
-  a as D,
+  m as D,
   d as O,
-  m as X,
+  a as X,
   b as Y,
   D as a,
   o as b,
-  A as c,
-  S as d,
+  j as c,
+  p as d,
   C as e,
   T as f,
-  f as g,
+  x as g,
   L as h,
   I as i,
   O as j,
   i as l,
   t as n,
-  j as o,
-  h as s,
-  p as x,
+  f as o,
+  N as s,
+  S as x,
   E as y
 };

package/dist/bounds-BQqppNFf.js

@@ -0,0 +1,186 @@
+import { j as x } from "./base-BORMP3mH.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-BXbqBINt.cjs

@@ -0,0 +1 @@
+"use strict";const O=require("./base-BLNViP3D.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-BXbqBINt.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-BQqppNFf.js";
 export {
   r as bounds
 };