@tktb-tess/util-fns 0.5.1 → 0.7.0

package/LICENSE

@@ -1,21 +1,21 @@
-MIT License
-
-Copyright (c) 2025 Tessyrrhaqt
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
+MIT License
+
+Copyright (c) 2025 Tessyrrhaqt
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -1,31 +1,30 @@
-# util-fns
-
-Utility functions for personal use
-
-ESM only
-
-Available in both a browser and Node.js environment.
-
-## Install
-
-```bash
-npm i @tktb-tess/util-fns
-```
-
-### Usage
-
-```ts
-import { modPow } from '@tktb-tess/util-fns';
-
-const main = async () => {
-    const ans = modPow(2n, 16n, 17n);
-
-    console.log(ans); // 1n
-};
-
-main();
-
-```
-
-
-
+# util-fns
+
+Utility functions for personal use
+
+ESM only
+
+Available in both a browser and Node.js environment.
+
+## Install
+
+```bash
+npm i @tktb-tess/util-fns
+```
+
+### Usage
+
+```ts
+import { modPow, bailliePSW } from '@tktb-tess/util-fns';
+
+const ans = modPow(2n, 16n, 17n);
+console.log(ans); // 1n
+
+// Baillie-PSW primality test
+console.log(bailliePSW(2n)); // true
+console.log(bailliePSW(4n)): // false
+
+```
+
+
+

package/dist/bundle.js

@@ -1,4 +1,4 @@
-const U = new TextEncoder(), _ = (n, t) => [n].includes(t), a = (n, t) => {
+const T = new TextEncoder(), $ = (n, t) => [n].includes(t), h = (n, t) => {
   if (typeof n != typeof t) return !1;
   const e = Object.prototype.toString.call(n), r = Object.prototype.toString.call(t);
   if (e !== r) return !1;
@@ -11,31 +11,31 @@ const U = new TextEncoder(), _ = (n, t) => [n].includes(t), a = (n, t) => {
   if (Array.isArray(n) && Array.isArray(t)) {
     if (n.length !== t.length) return !1;
     for (let s = 0; s < n.length; s++)
-      if (!a(n[s], t[s])) return !1;
+      if (!h(n[s], t[s])) return !1;
     return !0;
   }
   if (n instanceof Set && t instanceof Set) {
     const s = [...n.values()], i = [...t.values()];
-    return !!a(s, i);
+    return !!h(s, i);
   }
   if (n instanceof Map && t instanceof Map) {
     const s = [...n.keys()], i = [...t.keys()];
-    if (!a(s, i)) return !1;
+    if (!h(s, i)) return !1;
     const o = [...n.values()], c = [...t.values()];
-    return !!a(o, c);
+    return !!h(o, c);
   }
   if (e === "[object Object]") {
     const s = n, i = t, o = Object.keys(s), c = Object.keys(i);
     for (const u of o) {
-      const l = c.find((E) => E === u);
+      const l = c.find((j) => j === u);
       if (l === void 0) return !1;
-      const [h, g] = [s[u], i[l]];
-      if (!a(h, g)) return !1;
+      const [a, d] = [s[u], i[l]];
+      if (!h(a, d)) return !1;
     }
     return !0;
   }
   throw Error(`comparing these objects is still unavailable: ${n} ${t}`);
-}, $ = () => {
+}, q = () => {
   let n, t;
   return {
     promise: new Promise((r, s) => {
@@ -44,7 +44,7 @@ const U = new TextEncoder(), _ = (n, t) => [n].includes(t), a = (n, t) => {
     resolve: n,
     reject: t
   };
-}, q = (n) => new Promise((t) => {
+}, k = (n) => new Promise((t) => {
   setTimeout(() => t(), n);
 }), D = (n) => (...t) => () => n(...t), K = (n) => {
   const t = [];
@@ -55,31 +55,31 @@ const U = new TextEncoder(), _ = (n, t) => [n].includes(t), a = (n, t) => {
 ` && !s ? (e.push(r.trim()), t.push(e), e = [], r = "") : r += o;
   }
   return e.push(r.trim()), t.push(e), t;
-}, k = async (n, t) => {
-  const e = U.encode(n), r = await crypto.subtle.digest(t, e);
+}, J = async (n, t) => {
+  const e = T.encode(n), r = await crypto.subtle.digest(t, e);
   return new Uint8Array(r);
-}, J = () => globalThis.process && typeof process.version < "u" && typeof process.versions.node < "u", W = (n) => encodeURIComponent(n).replace(
+}, W = () => globalThis.process && typeof process.version < "u" && typeof process.versions.node < "u", z = (n) => encodeURIComponent(n).replace(
   /[!'()*]/g,
   (e) => `%${e.charCodeAt(0).toString(16).toUpperCase()}`
-), z = (n) => {
+), G = (n) => {
   if (n.includes("+"))
     throw Error("An input string has '+'");
   return decodeURIComponent(n);
-}, G = (n, t) => Math.floor(Math.random() * (t - n) + n), d = (n, t) => {
+}, H = (n, t) => Math.floor(Math.random() * (t - n) + n), g = (n, t) => {
   t < 0n && (t *= -1n);
   const e = n % t;
   return e < 0n ? e + t : e;
-}, b = (n, t = !1) => {
+}, I = (n, t = !1) => {
   if (!Number.isFinite(n)) throw Error("`length` is not a valid number");
   if (n <= 0) throw Error("`length` must be positive");
   const e = Math.ceil(n / 8), r = crypto.getRandomValues(new Uint8Array(e));
   let s = Array.from(r, (i) => i.toString(2).padStart(8, "0")).join("").slice(0, n);
   return t && (s = s.replace(/^./, "1")), BigInt("0b" + s);
-}, P = (n, t) => {
+}, U = (n, t) => {
   if (n >= t) throw Error("rangeError");
   const e = t - n, r = e.toString(2).length, s = (() => {
     for (let o = 0; o < 1e5; o++) {
-      const c = b(r);
+      const c = I(r);
       if (c >= p(2n, BigInt(r), e))
         return c % e;
     }
@@ -89,14 +89,14 @@ const U = new TextEncoder(), _ = (n, t) => [n].includes(t), a = (n, t) => {
 }, p = (n, t, e) => {
   if (e < 1n) throw Error("`mod` must be positive");
   if (t < 0n) throw Error("`power` must not be negative");
-  if (n = d(n, e), e === 1n) return 0n;
+  if (n = g(n, e), e === 1n) return 0n;
   if (n % e === 1n || n % e === 0n) return n;
   if (n === e - 1n) return t & 1n ? e - 1n : 1n;
   let r = 1n;
   for (; t > 0n; )
     t & 1n && (r = r * n % e), n = n * n % e, t >>= 1n;
   return r;
-}, T = (n, t) => {
+}, P = (n, t) => {
   if (n === 0n && t === 0n) return { x: 0n, y: 0n, gcd: 0n };
   if (n === 0n)
     return t > 0n ? { x: 0n, y: -1n, gcd: t } : { x: 0n, y: 1n, gcd: -t };
@@ -120,7 +120,7 @@ const U = new TextEncoder(), _ = (n, t) => [n].includes(t), a = (n, t) => {
   }
   const s = n + r | 1n, i = y(n, s), o = y(s, t);
   return i * o;
-}, j = (n) => {
+}, v = (n) => {
   let t = 3n, e = 1n, r = 1n;
   const s = BigInt(n.toString(2).length) - 1n;
   for (let i = s - 1n; i > -1n; --i) {
@@ -128,12 +128,12 @@ const U = new TextEncoder(), _ = (n, t) => [n].includes(t), a = (n, t) => {
     r *= y(t, o), t = o, e *= r;
   }
   return e;
-}, H = (n) => {
+}, Z = (n) => {
   if (n < 0n) throw Error("'n' must be non-negative");
   if (n === 0n) return 1n;
   const t = n - BigInt(n.toString(2).match(/1/g)?.length ?? 0);
-  return j(n) << t;
-}, Z = (n, t) => BigInt.asUintN(32, n >> (t & 31n) | n << (-t & 31n)), v = (n, t) => (n >>> (t & 31) | n << (-t & 31)) >>> 0, w = (n, t) => {
+  return v(n) << t;
+}, X = (n, t) => BigInt.asUintN(32, n >> (t & 31n) | n << (-t & 31n)), x = (n, t) => (n >>> (t & 31) | n << (-t & 31)) >>> 0, w = (n, t) => {
   if (t < 1n || t % 2n === 0n)
     throw Error("`n` is invalid");
   for (; n < 0n; )
@@ -149,7 +149,7 @@ const U = new TextEncoder(), _ = (n, t) => [n].includes(t), a = (n, t) => {
     [n, t] = [t, n], n % 4n === 3n && t % 4n === 3n && (e *= -1n), n %= t;
   }
   return t === 1n ? e : 0n;
-}, x = (n) => {
+}, M = (n) => {
   if (n < 0n) return !1;
   if (n === 0n) return !0;
   let t = 1n, e = n;
@@ -158,8 +158,8 @@ const U = new TextEncoder(), _ = (n, t) => [n].includes(t), a = (n, t) => {
     r ** 2n < n ? t = r : e = r;
   }
   return n === t ** 2n || n === (t + 1n) ** 2n;
-}, S = [0x853c49e6748fea9bn, 0xda3e39cb94b95bdbn], M = 0x5851f42d4c957f2dn;
-class I {
+}, S = [0x853c49e6748fea9bn, 0xda3e39cb94b95bdbn], V = 0x5851f42d4c957f2dn;
+class A {
   /**
    * length = 2, `[state, increment]`
    */
@@ -168,7 +168,7 @@ class I {
     return "PCGMinimal";
   }
   get [Symbol.toStringTag]() {
-    return I.name;
+    return A.name;
   }
   /** シード値の配列を返す */
   static getSeed() {
@@ -182,14 +182,14 @@ class I {
   }
   /** 内部状態を1サイクル進める */
   #n() {
-    this.#t[0] = this.#t[0] * M + this.#t[1];
+    this.#t[0] = this.#t[0] * V + this.#t[1];
   }
   /** 32bit 乱数を返す (内部状態は変わらない) */
   get #e() {
     const t = this.#t[0];
     if (!t) throw Error("empty state");
     const e = t >> 59n, r = BigInt.asUintN(32, (t ^ t >> 18n) >> 27n);
-    return v(Number(r), Number(e));
+    return x(Number(r), Number(e));
   }
   /** 内部状態を1進め、乱数を返す \
    *  普通はこれを使う
@@ -216,7 +216,7 @@ class I {
       yield typeof e == "number" ? this.getBoundedRand(e) : this.getRand();
   }
 }
-const V = (n) => {
+const C = (n) => {
   if (n <= 1n) return !1;
   if (n % 2n === 0n) return n === 2n;
   let t = n - 1n, e = 0n;
@@ -230,19 +230,19 @@ const V = (n) => {
     o = o * o % n;
   }
   return !1;
-}, C = (n) => {
+}, O = (n) => {
   let t = 5n, e = w(t, n);
   for (; e > 0n; ) {
-    if (t = t > 0n ? t + 2n : t - 2n, t *= -1n, t === -15n && x(n))
+    if (t = t > 0n ? t + 2n : t - 2n, t *= -1n, t === -15n && M(n))
       return [0n, 0n];
     e = w(t, n);
   }
   return [t, e];
-}, m = (n, t) => (n & 1n) === 1n ? d(n + t >> 1n, t) : d(n >> 1n, t), R = (n, t, e, r) => {
+}, m = (n, t) => (n & 1n) === 1n ? g(n + t >> 1n, t) : g(n >> 1n, t), R = (n, t, e, r) => {
   let s = 1n, i = e;
   const o = n.toString(2).slice(1);
   for (const c of o)
-    [s, i] = [d(s * i, t), m(i * i + r * s * s, t)], c === "1" && ([s, i] = [m(e * s + i, t), m(r * s + e * i, t)]);
+    [s, i] = [g(s * i, t), m(i * i + r * s * s, t)], c === "1" && ([s, i] = [m(e * s + i, t), m(r * s + e * i, t)]);
   return [s, i];
 }, F = (n, t, e, r) => {
   if (n % 2n !== 1n) throw Error("`n` must be odd");
@@ -255,7 +255,7 @@ const V = (n) => {
   r = p(r, s, n);
   for (let l = 0n; l < i; l++) {
     if (u === 0n) return !0;
-    u = d(u * u - 2n * r, n), r = p(r, 2n, n);
+    u = g(u * u - 2n * r, n), r = p(r, 2n, n);
   }
   return !1;
 }, B = (n) => {
@@ -292,25 +292,25 @@ const V = (n) => {
   for (const i of t)
     if (n % i === 0n)
       return n === i;
-  if (!V(n))
+  if (!C(n))
     return !1;
-  const [e, r] = C(n);
+  const [e, r] = O(n);
   if (r === 0n) return !1;
   const s = (1n - e) / 4n;
   return F(n, e, 1n, s);
-}, X = (n, t) => {
+}, Y = (n, t) => {
   if (t < 2n)
     throw Error("noPrimesFound");
   for (let r = 0; r < 1e5; r++) {
-    const s = P(n, t);
+    const s = U(n, t);
     if (B(s)) return s;
   }
   throw Error("noPrimesFound");
-}, Y = (n, t = !1) => {
+}, Q = (n, t = !1) => {
   if (n < 2)
     throw Error("noPrimesFound");
   for (let r = 0; r < 1e5; r++) {
-    const s = b(n, t);
+    const s = I(n, t);
     if (B(s)) return s;
   }
   throw Error("noPrimesFound");
@@ -350,10 +350,10 @@ class f {
     t = 1 / i;
     let [o, c] = [1n, s], [u, l] = [0n, 1n];
     for (; `${l}`.length < e + 1; ) {
-      const h = BigInt(Math.floor(t)), g = t - Number(h);
-      if ([o, c] = [c, h * c + o], [u, l] = [l, h * l + u], g === 0)
+      const a = BigInt(Math.floor(t)), d = t - Number(a);
+      if ([o, c] = [c, a * c + o], [u, l] = [l, a * l + u], d === 0)
         return new f(r ? -c : c, l);
-      t = 1 / g;
+      t = 1 / d;
     }
     return new f(r ? -o : o, u);
   }
@@ -361,7 +361,7 @@ class f {
    * reduction
    */
   #e() {
-    const { gcd: t } = T(this.#t, this.#n);
+    const { gcd: t } = P(this.#t, this.#n);
     t !== 0n && (this.#t /= t, this.#n /= t);
   }
   /**
@@ -458,31 +458,31 @@ class f {
       throw Error("cannot parse");
   }
 }
-const Q = (n) => {
+const tt = (n) => {
   let t = n.toString(16);
   t.length & 1 && (t = "0" + t);
   const e = [...t.match(/.{2}/g) ?? []];
   return Uint8Array.from(e, (r) => Number.parseInt(r, 16));
-}, tt = (n) => {
+}, nt = (n) => {
   const t = Array.from(n, (e) => e.toString(16).padStart(2, "0")).join("") || "00";
   return BigInt("0x" + t);
-}, O = (n) => {
+}, _ = (n) => {
   const t = Array.from(n, (e) => String.fromCharCode(e)).join("");
   return btoa(t);
-}, L = (n) => Uint8Array.from(atob(n), (t) => t.charCodeAt(0)), nt = (n) => O(n).replaceAll("+", "-").replaceAll("/", "_").replace(/=*$/g, ""), et = (n) => {
+}, L = (n) => Uint8Array.from(atob(n), (t) => t.charCodeAt(0)), et = (n) => _(n).replaceAll("+", "-").replaceAll("/", "_").replace(/=*$/g, ""), rt = (n) => {
   const t = n.length & 3;
   t > 0 && (n = n + "=".repeat(4 - t));
   const e = n.replaceAll("-", "+").replaceAll("_", "/");
   return L(e);
-}, rt = Symbol("for-branded-type");
-class A {
+};
+class N {
   #t;
   #n = [];
   static get name() {
     return "Queue";
   }
   get [Symbol.toStringTag]() {
-    return A.name;
+    return N.name;
   }
   constructor(...t) {
     this.#t = t;
@@ -508,13 +508,13 @@ class A {
     return this.toArray().toString();
   }
 }
-class N {
+class E {
   #t;
   static get name() {
     return "Executer";
   }
   get [Symbol.toStringTag]() {
-    return N.name;
+    return E.name;
   }
   constructor(t) {
     this.#t = {
@@ -532,7 +532,7 @@ class N {
       };
     });
   }
-  peer() {
+  get() {
     switch (this.#t.state) {
       case "fulfilled":
         return this.#t.data;
@@ -558,40 +558,61 @@ class N {
     return e;
   }
 }
+const b = "NamedError";
+class st extends Error {
+  name;
+  static name = b;
+  [Symbol.toStringTag] = b;
+  constructor(t, e, r) {
+    super(e, { cause: r }), this.name = t;
+  }
+  toJSON() {
+    const t = (() => {
+      const i = this.cause;
+      return typeof i == "string" || typeof i == "number" || typeof i == "boolean" ? i : typeof i == "bigint" ? i.toString() : typeof i == "object" && i !== null ? i instanceof Set || i instanceof Map ? Object.fromEntries(i) : i : void 0;
+    })(), { name: e, message: r, stack: s } = this;
+    return {
+      name: e,
+      message: r,
+      stack: s,
+      cause: t
+    };
+  }
+}
 export {
-  Q as BItoU8Arr,
-  rt as Brand,
-  N as Executer,
-  I as PCGMinimal,
-  A as Queue,
+  tt as BItoU8Arr,
+  E as Executer,
+  st as NamedError,
+  A as PCGMinimal,
+  N as Queue,
   f as Rational,
   B as bailliePSW,
   L as base64ToU8Arr,
-  et as base64UrlToU8Arr,
-  z as decodeRFC3986URIComponent,
-  W as encodeRFC3986URIComponent,
-  T as exEuclidean,
-  H as factorial,
-  k as getHash,
-  b as getRandBIByBitLength,
-  P as getRandBIByRange,
-  Y as getRandPrimeByBitLength,
-  X as getRandPrimeByRange,
-  G as getRndInt,
-  a as isEqual,
-  J as isNode,
-  x as isSquare,
+  rt as base64UrlToU8Arr,
+  G as decodeRFC3986URIComponent,
+  z as encodeRFC3986URIComponent,
+  P as exEuclidean,
+  Z as factorial,
+  J as getHash,
+  I as getRandBIByBitLength,
+  U as getRandBIByRange,
+  Q as getRandPrimeByBitLength,
+  Y as getRandPrimeByRange,
+  H as getRndInt,
+  h as isEqual,
+  W as isNode,
+  M as isSquare,
   w as jacobiSymbol,
   D as lazify,
   p as modPow,
   K as parseCSV,
-  $ as promiseWithResolvers,
-  d as residue,
-  v as rot32,
-  Z as rot32BI,
-  _ as sameValueZero,
-  q as sleep,
-  tt as u8ArrToBI,
-  O as u8ArrToBase64,
-  nt as u8ArrToBase64Url
+  q as promiseWithResolvers,
+  g as residue,
+  x as rot32,
+  X as rot32BI,
+  $ as sameValueZero,
+  k as sleep,
+  nt as u8ArrToBI,
+  _ as u8ArrToBase64,
+  et as u8ArrToBase64Url
 };

package/dist/executer.d.ts

@@ -13,6 +13,6 @@ export declare class Executer<T> {
     static get name(): 'Executer';
     get [Symbol.toStringTag](): "Executer";
     constructor(promise: Promise<T>);
-    peer(): T;
+    get(): T;
     static boundary<TArg extends unknown[]>(func: (...args: TArg) => void): (...args: TArg) => void;
 }

package/dist/main.d.ts

@@ -4,6 +4,6 @@ export * from './pcg-minimal';
 export * from './baillie-psw';
 export * from './fraction';
 export * from './u8arr-ext';
-export * from './brand';
 export * from './queue';
 export * from './executer';
+export * from './named-error';

package/dist/named-error.d.ts

@@ -0,0 +1,18 @@
+interface NamedError<EName extends string> {
+    readonly stack?: string;
+    readonly message: string;
+    readonly cause?: unknown;
+}
+declare class NamedError<EName extends string> extends Error {
+    readonly name: EName;
+    static readonly name = "NamedError";
+    readonly [Symbol.toStringTag] = "NamedError";
+    constructor(name: EName, message: string, cause?: unknown);
+    toJSON(): {
+        name: EName;
+        message: string;
+        stack: string | undefined;
+        cause: string | number | boolean | object | undefined;
+    };
+}
+export { NamedError };

package/dist/util.d.ts

@@ -1,3 +1,9 @@
+/**
+ * compare two objects with SameValueZero method
+ * @param a
+ * @param b
+ * @returns
+ */
 declare const sameValueZero: (a: unknown, b: unknown) => boolean;
 /**
  * judges whether two objects has the same (nested) properties \
@@ -20,12 +26,12 @@ declare const promiseWithResolvers: <T>() => {
  */
 declare const sleep: (delay: number) => Promise<void>;
 /**
- * makes a function be lazy
+ * makes a function lazy
  */
 declare const lazify: <ArgT extends unknown[], RetT>(func: (...args: ArgT) => RetT) => (...args: ArgT) => () => RetT;
 /**
  * parses CSV string \
- * can deal with CSV with escaping doublequote
+ * able to deal with CSV with escaping doublequote
  * @param csv CSV
  * @returns 2次元配列
  */

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@tktb-tess/util-fns",
-  "version": "0.5.1",
+  "version": "0.7.0",
   "description": "Utility functions for personal use",
   "files": [
     "dist"
@@ -8,9 +8,6 @@
   "type": "module",
   "author": "Tessyrrhaqt",
   "license": "MIT",
-  "publishConfig": {
-    "access": "public"
-  },
   "main": "./dist/bundle.js",
   "types": "./dist/main.d.ts",
   "exports": {
@@ -18,30 +15,29 @@
     "import": "./dist/bundle.js"
   },
   "engines": {
-    "node": "^22.0.0"
+    "node": "^22",
+    "pnpm": "^10"
   },
   "repository": {
     "type": "git",
-    "url": "https://github.com/tktb-tess/util-fns"
+    "url": "https://github.com/tktb-tess/util-fns.git"
   },
   "homepage": "https://github.com/tktb-tess/util-fns/blob/main/README.md",
-  "scripts": {
-    "dev": "vite",
-    "build": "tsc && vite build",
-    "test": "vitest run",
-    "typecheck": "tsc --noEmit"
-  },
   "devDependencies": {
-    "@types/node": "^24.3.0",
-    "jsdom": "^26.1.0",
-    "npm-check-updates": "^18.0.3",
-    "tsx": "^4.20.5",
-    "typescript": "^5.9.2",
-    "vite": "^7.1.3",
+    "@types/node": "^24.6.2",
+    "tsx": "^4.20.6",
+    "typescript": "^5.9.3",
+    "vite": "^7.1.9",
     "vite-plugin-dts": "^4.5.4",
     "vitest": "^3.2.4"
   },
   "volta": {
     "node": "22.19.0"
+  },
+  "scripts": {
+    "dev": "vite",
+    "build": "tsc && vite build",
+    "test": "vitest run",
+    "typecheck": "tsc --noEmit"
   }
-}
+}

package/dist/brand.d.ts

@@ -1,7 +0,0 @@
-declare const Brand: unique symbol;
-type Brand<in out K extends string | symbol> = {
-    readonly [Brand]: {
-        readonly [key in K]: K;
-    };
-};
-export { Brand };