@tempots/std 0.12.0 → 0.14.0

package/array.js

@@ -1,188 +1,129 @@
 import { objectKeys as v } from "./object.js";
-function q(n, r) {
-  return Array.from({ length: n.length }, (t, e) => r(n[e], e));
-}
-function B(n, r) {
-  const t = [];
-  for (const e of n)
-    t.push(...r(e));
-  return t;
-}
-function _(n) {
-  return n.length > 0 ? n[0] : void 0;
-}
-function k(n) {
-  return n.slice(1);
-}
-function F(n, r, t) {
-  if (n.length !== r.length) return !1;
-  for (let e = 0; e < n.length; e++)
-    if (!t(n[e], r[e])) return !1;
+const q = (t, n) => Array.from({ length: t.length }, (e, r) => n(t[r], r)), B = (t, n) => {
+  const e = [];
+  for (const r of t)
+    e.push(...n(r));
+  return e;
+}, _ = (t) => t.length > 0 ? t[0] : void 0, k = (t) => t.slice(1), F = (t, n, e) => {
+  if (t.length !== n.length) return !1;
+  for (let r = 0; r < t.length; r++)
+    if (!e(t[r], n[r])) return !1;
   return !0;
-}
-function I(n) {
-  return n.length === 0;
-}
-function M(n) {
-  return n.length > 0;
-}
-function x(n, r) {
-  const t = [];
-  for (const e of n) r(e) && t.push(e);
-  return t;
-}
-function b(n, r) {
-  const t = [];
-  for (let e = 0; e < n.length; e++) {
-    const u = r(n[e], e);
-    u != null && t.push(u);
+}, I = (t) => t.length === 0, M = (t) => t.length > 0, x = (t, n) => {
+  const e = [];
+  for (const r of t) n(r) && e.push(r);
+  return e;
+}, b = (t, n) => {
+  const e = [];
+  for (let r = 0; r < t.length; r++) {
+    const l = n(t[r], r);
+    l != null && e.push(l);
   }
-  return t;
-}
-function j(n) {
-  return x(n, (r) => r != null);
-}
-function D(n) {
-  return [].concat(...n);
-}
-function P(n, r, t) {
-  for (const e of n)
-    t = r(t, e);
-  return t;
-}
-function S(n, r) {
-  for (const t of n)
-    if (!r(t))
+  return e;
+}, j = (t) => x(t, (n) => n != null), D = (t) => [].concat(...t), P = (t, n, e) => {
+  for (const r of t)
+    e = n(e, r);
+  return e;
+}, S = (t, n) => {
+  for (const e of t)
+    if (!n(e))
       return !1;
   return !0;
-}
-function N(n, r) {
-  for (const t of n)
-    if (r(t))
+}, N = (t, n) => {
+  for (const e of t)
+    if (n(e))
       return !0;
   return !1;
-}
-function T(n, r) {
-  for (const t of n) r(t);
-}
-function $(...n) {
-  return [].concat(...n);
-}
-function H(n, r, t, e = !0) {
-  if (n.length < r.length)
-    return -1 * (e ? 1 : -1);
-  if (n.length > r.length)
-    return 1 * (e ? 1 : -1);
-  for (let u = 0; u < n.length; u++) {
-    const l = t(n[u], r[u]);
-    if (l !== 0) return l;
+}, T = (t, n) => {
+  for (const e of t) n(e);
+}, $ = (...t) => [].concat(...t), H = (t, n, e, r = !0) => {
+  if (t.length < n.length)
+    return -1 * (r ? 1 : -1);
+  if (t.length > n.length)
+    return 1 * (r ? 1 : -1);
+  for (let l = 0; l < t.length; l++) {
+    const a = e(t[l], n[l]);
+    if (a !== 0) return a;
   }
   return 0;
-}
-function C(n, r) {
-  return n.slice().sort(r);
-}
-function g(n, r) {
-  return Array.from({ length: n }, (t, e) => r(e));
-}
-function L(n, r = 0) {
-  return g(n, (t) => r + t);
-}
-function R(n, r) {
-  return g(n, () => r);
-}
-function V(n) {
-  return Array.from(new Set(n));
-}
-function W(n, r) {
-  const t = {};
-  return n.forEach((e) => {
-    t[r(e)] = e;
-  }), v(t).map((e) => t[e]);
-}
-function E(n, r) {
-  const t = n.indexOf(r);
-  return t < 0 ? !1 : (n.splice(t, 1), !0);
-}
-function z(n, r) {
-  let t = !1;
-  for (; E(n, r); )
-    t = !0;
-  return t;
-}
-function w(n, r) {
-  const t = n.findIndex(r);
-  return t < 0 ? !1 : (n.splice(t, 1), !0);
-}
-function G(n, r) {
-  let t = !1;
-  for (; w(n, r); )
-    t = !0;
-  return t;
-}
-function J(n) {
-  const r = [];
-  for (let t = n.next(); !(t.done ?? !1); t = n.next())
-    r.push(t.value);
-  return r;
-}
-function Q(n, r, t) {
-  const e = {
+}, C = (t, n) => t.slice().sort(n), g = (t, n) => Array.from({ length: t }, (e, r) => n(r)), L = (t, n = 0) => g(t, (e) => n + e), R = (t, n) => g(t, () => n), V = (t) => Array.from(new Set(t)), W = (t, n) => {
+  const e = {};
+  return t.forEach((r) => {
+    e[n(r)] = r;
+  }), v(e).map((r) => e[r]);
+}, E = (t, n) => {
+  const e = t.indexOf(n);
+  return e < 0 ? !1 : (t.splice(e, 1), !0);
+}, z = (t, n) => {
+  let e = !1;
+  for (; E(t, n); )
+    e = !0;
+  return e;
+}, w = (t, n) => {
+  const e = t.findIndex(n);
+  return e < 0 ? !1 : (t.splice(e, 1), !0);
+}, G = (t, n) => {
+  let e = !1;
+  for (; w(t, n); )
+    e = !0;
+  return e;
+}, J = (t) => {
+  const n = [];
+  for (let e = t.next(); !(e.done ?? !1); e = t.next())
+    n.push(e.value);
+  return n;
+}, Q = (t, n, e) => {
+  const r = {
     removals: [],
     swaps: [],
     inserts: []
-  }, { removals: u, inserts: l, swaps: c } = e, s = /* @__PURE__ */ new Map();
-  r.forEach((o, f) => s.set(t(o), f));
-  const a = n.map((o, f) => [o, f]).filter(([o]) => !s.has(t(o))).map(([o, f]) => f);
-  for (let o = a.length - 1; o >= 0; o--) {
-    const f = a[o], i = u.length > 0 ? u[u.length - 1] : void 0;
-    i != null && i.at === f + 1 ? (i.at--, i.qt++) : u.push({ at: f, qt: 1 });
+  }, { removals: l, inserts: a, swaps: u } = r, c = /* @__PURE__ */ new Map();
+  n.forEach((s, o) => c.set(e(s), o));
+  const f = t.map((s, o) => [s, o]).filter(([s]) => !c.has(e(s))).map(([s, o]) => o);
+  for (let s = f.length - 1; s >= 0; s--) {
+    const o = f[s], i = l.length > 0 ? l[l.length - 1] : void 0;
+    i != null && i.at === o + 1 ? (i.at--, i.qt++) : l.push({ at: o, qt: 1 });
   }
   const h = /* @__PURE__ */ new Map();
-  n.forEach((o, f) => h.set(t(o), f));
-  const y = r.map((o, f) => [o, f]).filter(([o]) => !h.has(t(o))).map(([o, f]) => f);
-  for (const o of y) {
-    const f = l.length > 0 ? l[l.length - 1] : void 0;
-    f != null && f.at + f.values.length === o ? f.values.push(r[o]) : l.push({ at: o, values: [r[o]] });
+  t.forEach((s, o) => h.set(e(s), o));
+  const y = n.map((s, o) => [s, o]).filter(([s]) => !h.has(e(s))).map(([s, o]) => o);
+  for (const s of y) {
+    const o = a.length > 0 ? a[a.length - 1] : void 0;
+    o != null && o.at + o.values.length === s ? o.values.push(n[s]) : a.push({ at: s, values: [n[s]] });
   }
-  const p = n.filter((o, f) => !a.includes(f)), m = /* @__PURE__ */ new Map();
-  for (let o = 0; o < p.length; o++)
-    m.set(t(p[o]), o);
-  const A = r.filter((o, f) => !y.includes(f));
-  for (let o = 0; o < A.length; o++) {
-    const f = t(A[o]), i = m.get(f);
-    if (i == null || o === i) continue;
-    const d = t(p[o]);
-    m.delete(d), c.push({ from: o, to: i });
+  const p = t.filter((s, o) => !f.includes(o)), m = /* @__PURE__ */ new Map();
+  for (let s = 0; s < p.length; s++)
+    m.set(e(p[s]), s);
+  const A = n.filter((s, o) => !y.includes(o));
+  for (let s = 0; s < A.length; s++) {
+    const o = e(A[s]), i = m.get(o);
+    if (i == null || s === i) continue;
+    const d = e(p[s]);
+    m.delete(d), u.push({ from: s, to: i });
   }
-  return e;
-}
-function U(n, r) {
-  const t = [...r];
-  for (const { at: e, qt: u } of n.removals)
-    t.splice(e, u);
-  for (const { from: e, to: u } of n.swaps) {
-    const l = t[u];
-    t[u] = t[e], t[e] = l;
+  return r;
+}, U = (t, n) => {
+  const e = [...n];
+  for (const { at: r, qt: l } of t.removals)
+    e.splice(r, l);
+  for (const { from: r, to: l } of t.swaps) {
+    const a = e[l];
+    e[l] = e[r], e[r] = a;
   }
-  for (const e of n.inserts)
-    t.splice(e.at, 0, ...e.values);
-  return t;
-}
-function X(n, r = " and ", t = ", ") {
-  return n.length === 0 ? "" : n.length === 1 ? String(n[0]) : `${n.slice(0, -1).join(t)}${r}${String(n[n.length - 1])}`;
-}
-function Y(n, r, t = !0) {
-  const e = n.map((s, a) => [s, a]);
-  e.sort((s, a) => r(s[0], a[0]));
-  const u = new Array(e.length);
-  let l = 0, c = e[0][0];
-  for (let s = 0; s < e.length; s++) {
-    const [a, h] = e[s];
-    r(a, c) !== 0 && (l = s, c = a), u[h] = l, t && l++;
+  for (const r of t.inserts)
+    e.splice(r.at, 0, ...r.values);
+  return e;
+}, X = (t, n = " and ", e = ", ") => t.length === 0 ? "" : t.length === 1 ? String(t[0]) : `${t.slice(0, -1).join(e)}${n}${String(t[t.length - 1])}`, Y = (t, n, e = !0) => {
+  const r = t.map((c, f) => [c, f]);
+  r.sort((c, f) => n(c[0], f[0]));
+  const l = new Array(r.length);
+  let a = 0, u = r[0][0];
+  for (let c = 0; c < r.length; c++) {
+    const [f, h] = r[c];
+    n(f, u) !== 0 && (a = c, u = f), l[h] = a, e && a++;
   }
-  return u;
-}
+  return l;
+};
 export {
   S as allElements,
   N as anyElement,

package/async-result.d.ts

@@ -4,35 +4,35 @@ import { Maybe } from './domain';
  * Represents the state when a result has not been requested yet.
  * @public
  */
-export interface NotAsked {
-    type: 'NotAsked';
-}
+export type NotAsked = {
+    readonly type: 'NotAsked';
+};
 /**
  * Represents a loading state in an asynchronous result.
  * @public
  */
-export interface Loading<V> {
-    type: 'Loading';
-    previousValue?: V;
-}
+export type Loading<V> = {
+    readonly type: 'Loading';
+    readonly previousValue?: V;
+};
 /**
  * Represents a successful result.
  * @typeParam V - The type of the value.
  * @public
  */
-export interface AsyncSuccess<V> {
-    type: 'AsyncSuccess';
-    value: V;
-}
+export type AsyncSuccess<V> = {
+    readonly type: 'AsyncSuccess';
+    readonly value: V;
+};
 /**
  * Represents a failure result.
  * @typeParam E - - The type of the error.
  * @public
  */
-export interface AsyncFailure<E> {
-    type: 'AsyncFailure';
-    error: E;
-}
+export type AsyncFailure<E> = {
+    readonly type: 'AsyncFailure';
+    readonly error: E;
+};
 /**
  * Represents the result of an asynchronous operation that can be in one of the following states:
  * - `NotAsked`: The operation has not been requested yet.

package/bigint.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function o(n,i){return i<0n&&(n=-n,i=-i),n<=0n?n/i:(n-1n)/i+1n}function b(n,i){return i<0n&&(n=-n,i=-i),n>=0n?n/i:(n+1n)/i-1n}function f(n,i){return n<i?-1:n>i?1:0}function r(n){return n<0n?-n:n}function s(n,i){return n<i?n:i}function c(n,i){return n>i?n:i}function l(n,i){if(i<0n)throw new Error("negative exponent");let e=1n;for(;i>0n;)(i&1n)!==0n&&(e*=n),i>>=1n,n*=n;return e}function u(n,i){for(n=r(n),i=r(i);i>0n;){const e=i;i=n%i,n=e}return n}function v(n,i){return r(n*i)/u(n,i)}function t(n){if(n<2n)return!1;if(n===2n||n===3n)return!0;if(n%2n===0n||n%3n===0n)return!1;let i=5n;for(;i*i<=n;){if(n%i===0n||n%(i+2n)===0n)return!1;i+=6n}return!0}function I(n){if(n<2n)return 2n;if(n===2n)return 3n;for(n%2n===0n?n++:n+=2n;!t(n);)n+=2n;return n}function P(n){if(n<=2n)throw new Error("no previous prime");if(n===3n)return 2n;for(n%2n===0n?n--:n-=2n;!t(n);)n-=2n;return n}function a(n){return n%2n===0n}function m(n){return n%2n!==0n}function w(n){return n===0n}function d(n){return n===1n}function h(n){return n<0n}function p(n){return n>0n}exports.biAbs=r;exports.biCeilDiv=o;exports.biCompare=f;exports.biFloorDiv=b;exports.biGcd=u;exports.biIsEven=a;exports.biIsNegative=h;exports.biIsOdd=m;exports.biIsOne=d;exports.biIsPositive=p;exports.biIsPrime=t;exports.biIsZero=w;exports.biLcm=v;exports.biMax=c;exports.biMin=s;exports.biNextPrime=I;exports.biPow=l;exports.biPrevPrime=P;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./error.cjs"),b=(n,i)=>(i<0n&&(n=-n,i=-i),n<=0n?n/i:(n-1n)/i+1n),c=(n,i)=>(i<0n&&(n=-n,i=-i),n>=0n?n/i:(n+1n)/i-1n),u=(n,i)=>n<i?-1:n>i?1:0,r=n=>n<0n?-n:n,f=(n,i)=>n<i?n:i,l=(n,i)=>n>i?n:i,m=(n,i)=>{if(i<0n)throw new o.ArgumentError("negative exponent for parameter y of biPow");let e=1n;for(;i>0n;)(i&1n)!==0n&&(e*=n),i>>=1n,n*=n;return e},s=(n,i)=>{for(n=r(n),i=r(i);i>0n;){const e=i;i=n%i,n=e}return n},v=(n,i)=>r(n*i)/s(n,i),t=n=>{if(n<2n)return!1;if(n===2n||n===3n)return!0;if(n%2n===0n||n%3n===0n)return!1;let i=5n;for(;i*i<=n;){if(n%i===0n||n%(i+2n)===0n)return!1;i+=6n}return!0},P=n=>{if(n<2n)return 2n;if(n===2n)return 3n;for(n%2n===0n?n++:n+=2n;!t(n);)n+=2n;return n},a=n=>{if(n<=2n)throw new o.ArgumentError(`no previous prime ${n} for biPrevPrime`);if(n===3n)return 2n;for(n%2n===0n?n--:n-=2n;!t(n);)n-=2n;return n},I=n=>n%2n===0n,w=n=>n%2n!==0n,d=n=>n===0n,g=n=>n===1n,h=n=>n<0n,p=n=>n>0n;exports.biAbs=r;exports.biCeilDiv=b;exports.biCompare=u;exports.biFloorDiv=c;exports.biGcd=s;exports.biIsEven=I;exports.biIsNegative=h;exports.biIsOdd=w;exports.biIsOne=g;exports.biIsPositive=p;exports.biIsPrime=t;exports.biIsZero=d;exports.biLcm=v;exports.biMax=l;exports.biMin=f;exports.biNextPrime=P;exports.biPow=m;exports.biPrevPrime=a;

package/bigint.d.ts

@@ -6,7 +6,7 @@
  * @returns The result of dividing `x` by `y`, rounded up to the nearest whole number.
  * @public
  */
-export declare function biCeilDiv(x: bigint, y: bigint): bigint;
+export declare const biCeilDiv: (x: bigint, y: bigint) => bigint;
 /**
  * Divides two BigInt numbers and returns the largest integer less than or equal to the quotient.
  *
@@ -15,7 +15,7 @@ export declare function biCeilDiv(x: bigint, y: bigint): bigint;
  * @returns The largest integer less than or equal to the quotient of `x` divided by `y`.
  * @public
  */
-export declare function biFloorDiv(x: bigint, y: bigint): bigint;
+export declare const biFloorDiv: (x: bigint, y: bigint) => bigint;
 /**
  * Compares two BigInt values and returns a number indicating their relative order.
  * @param x - The first BigInt value to compare.
@@ -24,7 +24,7 @@ export declare function biFloorDiv(x: bigint, y: bigint): bigint;
  * @public
  *          or zero if `x` is equal to `y`.
  */
-export declare function biCompare(x: bigint, y: bigint): number;
+export declare const biCompare: (x: bigint, y: bigint) => number;
 /**
  * Returns the absolute value of a bigint.
  *
@@ -32,7 +32,7 @@ export declare function biCompare(x: bigint, y: bigint): number;
  * @returns The absolute value of `x`.
  * @public
  */
-export declare function biAbs(x: bigint): bigint;
+export declare const biAbs: (x: bigint) => bigint;
 /**
  * Returns the minimum of two BigInt values.
  *
@@ -41,7 +41,7 @@ export declare function biAbs(x: bigint): bigint;
  * @returns The smaller of the two BigInt values.
  * @public
  */
-export declare function biMin(x: bigint, y: bigint): bigint;
+export declare const biMin: (x: bigint, y: bigint) => bigint;
 /**
  * Returns the maximum of two BigInt values.
  *
@@ -50,7 +50,7 @@ export declare function biMin(x: bigint, y: bigint): bigint;
  * @returns The maximum of the two BigInt values.
  * @public
  */
-export declare function biMax(x: bigint, y: bigint): bigint;
+export declare const biMax: (x: bigint, y: bigint) => bigint;
 /**
  * Calculates the power of a bigint number.
  *
@@ -58,9 +58,9 @@ export declare function biMax(x: bigint, y: bigint): bigint;
  * @param y - The exponent.
  * @returns The result of raising `x` to the power of `y`.
  * @public
- * @throws Error If the exponent `y` is negative.
+ * @throws Throws `ArgumentError` if the exponent `y` is negative.
  */
-export declare function biPow(x: bigint, y: bigint): bigint;
+export declare const biPow: (x: bigint, y: bigint) => bigint;
 /**
  * Calculates the greatest common divisor (GCD) of two BigInt numbers.
  *
@@ -69,7 +69,7 @@ export declare function biPow(x: bigint, y: bigint): bigint;
  * @returns The GCD of `x` and `y`.
  * @public
  */
-export declare function biGcd(x: bigint, y: bigint): bigint;
+export declare const biGcd: (x: bigint, y: bigint) => bigint;
 /**
  * Calculates the least common multiple (LCM) of two BigInt numbers.
  *
@@ -78,7 +78,7 @@ export declare function biGcd(x: bigint, y: bigint): bigint;
  * @returns The least common multiple of `x` and `y`.
  * @public
  */
-export declare function biLcm(x: bigint, y: bigint): bigint;
+export declare const biLcm: (x: bigint, y: bigint) => bigint;
 /**
  * Checks if a given number is prime.
  *
@@ -86,7 +86,7 @@ export declare function biLcm(x: bigint, y: bigint): bigint;
  * @returns `true` if the number is prime, `false` otherwise.
  * @public
  */
-export declare function biIsPrime(x: bigint): boolean;
+export declare const biIsPrime: (x: bigint) => boolean;
 /**
  * Finds the next prime number greater than the given number.
  *
@@ -94,7 +94,7 @@ export declare function biIsPrime(x: bigint): boolean;
  * @returns The next prime number greater than `x`.
  * @public
  */
-export declare function biNextPrime(x: bigint): bigint;
+export declare const biNextPrime: (x: bigint) => bigint;
 /**
  * Returns the previous prime number less than the given number.
  * Throws an error if there is no previous prime.
@@ -102,9 +102,9 @@ export declare function biNextPrime(x: bigint): bigint;
  * @param x - The number to find the previous prime for.
  * @returns The previous prime number less than `x`.
  * @public
- * @throws Error if there is no previous prime.
+ * @throws Throws `ArgumentError` if there is no previous prime.
  */
-export declare function biPrevPrime(x: bigint): bigint;
+export declare const biPrevPrime: (x: bigint) => bigint;
 /**
  * Checks if a given bigint is even.
  *
@@ -112,7 +112,7 @@ export declare function biPrevPrime(x: bigint): bigint;
  * @returns `true` if the bigint is even, `false` otherwise.
  * @public
  */
-export declare function biIsEven(x: bigint): boolean;
+export declare const biIsEven: (x: bigint) => boolean;
 /**
  * Checks if a given bigint is odd.
  *
@@ -120,7 +120,7 @@ export declare function biIsEven(x: bigint): boolean;
  * @returns `true` if the bigint is odd, `false` otherwise.
  * @public
  */
-export declare function biIsOdd(x: bigint): boolean;
+export declare const biIsOdd: (x: bigint) => boolean;
 /**
  * Checks if a given bigint is zero.
  *
@@ -128,7 +128,7 @@ export declare function biIsOdd(x: bigint): boolean;
  * @returns `true` if the bigint is zero, `false` otherwise.
  * @public
  */
-export declare function biIsZero(x: bigint): boolean;
+export declare const biIsZero: (x: bigint) => boolean;
 /**
  * Checks if a given bigint is equal to 1n.
  *
@@ -136,7 +136,7 @@ export declare function biIsZero(x: bigint): boolean;
  * @returns `true` if the bigint is equal to 1n, `false` otherwise.
  * @public
  */
-export declare function biIsOne(x: bigint): boolean;
+export declare const biIsOne: (x: bigint) => boolean;
 /**
  * Checks if a given bigint is negative.
  *
@@ -144,7 +144,7 @@ export declare function biIsOne(x: bigint): boolean;
  * @returns `true` if the bigint is negative, `false` otherwise.
  * @public
  */
-export declare function biIsNegative(x: bigint): boolean;
+export declare const biIsNegative: (x: bigint) => boolean;
 /**
  * Checks if a bigint is positive.
  *
@@ -152,4 +152,4 @@ export declare function biIsNegative(x: bigint): boolean;
  * @returns `true` if the bigint is positive, `false` otherwise.
  * @public
  */
-export declare function biIsPositive(x: bigint): boolean;
+export declare const biIsPositive: (x: bigint) => boolean;

package/bigint.js

@@ -1,96 +1,55 @@
-function f(n, r) {
-  return r < 0n && (n = -n, r = -r), n <= 0n ? n / r : (n - 1n) / r + 1n;
-}
-function o(n, r) {
-  return r < 0n && (n = -n, r = -r), n >= 0n ? n / r : (n + 1n) / r - 1n;
-}
-function c(n, r) {
-  return n < r ? -1 : n > r ? 1 : 0;
-}
-function e(n) {
-  return n < 0n ? -n : n;
-}
-function b(n, r) {
-  return n < r ? n : r;
-}
-function s(n, r) {
-  return n > r ? n : r;
-}
-function l(n, r) {
-  if (r < 0n) throw new Error("negative exponent");
+import { ArgumentError as t } from "./error.js";
+const c = (n, e) => (e < 0n && (n = -n, e = -e), n <= 0n ? n / e : (n - 1n) / e + 1n), f = (n, e) => (e < 0n && (n = -n, e = -e), n >= 0n ? n / e : (n + 1n) / e - 1n), u = (n, e) => n < e ? -1 : n > e ? 1 : 0, r = (n) => n < 0n ? -n : n, l = (n, e) => n < e ? n : e, m = (n, e) => n > e ? n : e, w = (n, e) => {
+  if (e < 0n)
+    throw new t("negative exponent for parameter y of biPow");
   let i = 1n;
-  for (; r > 0n; )
-    (r & 1n) !== 0n && (i *= n), r >>= 1n, n *= n;
+  for (; e > 0n; )
+    (e & 1n) !== 0n && (i *= n), e >>= 1n, n *= n;
   return i;
-}
-function u(n, r) {
-  for (n = e(n), r = e(r); r > 0n; ) {
-    const i = r;
-    r = n % r, n = i;
+}, s = (n, e) => {
+  for (n = r(n), e = r(e); e > 0n; ) {
+    const i = e;
+    e = n % e, n = i;
   }
   return n;
-}
-function w(n, r) {
-  return e(n * r) / u(n, r);
-}
-function t(n) {
+}, a = (n, e) => r(n * e) / s(n, e), o = (n) => {
   if (n < 2n) return !1;
   if (n === 2n || n === 3n) return !0;
   if (n % 2n === 0n || n % 3n === 0n) return !1;
-  let r = 5n;
-  for (; r * r <= n; ) {
-    if (n % r === 0n || n % (r + 2n) === 0n) return !1;
-    r += 6n;
+  let e = 5n;
+  for (; e * e <= n; ) {
+    if (n % e === 0n || n % (e + 2n) === 0n) return !1;
+    e += 6n;
   }
   return !0;
-}
-function v(n) {
+}, v = (n) => {
   if (n < 2n) return 2n;
   if (n === 2n) return 3n;
-  for (n % 2n === 0n ? n++ : n += 2n; !t(n); ) n += 2n;
+  for (n % 2n === 0n ? n++ : n += 2n; !o(n); ) n += 2n;
   return n;
-}
-function a(n) {
-  if (n <= 2n) throw new Error("no previous prime");
+}, P = (n) => {
+  if (n <= 2n) throw new t(`no previous prime ${n} for biPrevPrime`);
   if (n === 3n) return 2n;
-  for (n % 2n === 0n ? n-- : n -= 2n; !t(n); ) n -= 2n;
+  for (n % 2n === 0n ? n-- : n -= 2n; !o(n); ) n -= 2n;
   return n;
-}
-function h(n) {
-  return n % 2n === 0n;
-}
-function I(n) {
-  return n % 2n !== 0n;
-}
-function m(n) {
-  return n === 0n;
-}
-function P(n) {
-  return n === 1n;
-}
-function p(n) {
-  return n < 0n;
-}
-function d(n) {
-  return n > 0n;
-}
+}, h = (n) => n % 2n === 0n, p = (n) => n % 2n !== 0n, I = (n) => n === 0n, d = (n) => n === 1n, g = (n) => n < 0n, A = (n) => n > 0n;
 export {
-  e as biAbs,
-  f as biCeilDiv,
-  c as biCompare,
-  o as biFloorDiv,
-  u as biGcd,
+  r as biAbs,
+  c as biCeilDiv,
+  u as biCompare,
+  f as biFloorDiv,
+  s as biGcd,
   h as biIsEven,
-  p as biIsNegative,
-  I as biIsOdd,
-  P as biIsOne,
-  d as biIsPositive,
-  t as biIsPrime,
-  m as biIsZero,
-  w as biLcm,
-  s as biMax,
-  b as biMin,
+  g as biIsNegative,
+  p as biIsOdd,
+  d as biIsOne,
+  A as biIsPositive,
+  o as biIsPrime,
+  I as biIsZero,
+  a as biLcm,
+  m as biMax,
+  l as biMin,
   v as biNextPrime,
-  l as biPow,
-  a as biPrevPrime
+  w as biPow,
+  P as biPrevPrime
 };

package/boolean.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function a(e,o){return e===o?0:e?-1:1}function n(e){return e?1:0}function r(e){if(e==null)return!1;switch(e.toLowerCase()){case"true":case"false":case"0":case"1":case"on":case"off":return!0;default:return!1}}function t(e){switch(e.toLowerCase()){case"true":case"1":case"on":return!0;case"false":case"0":case"off":return!1;default:throw new Error(`unable to parse '${e}'`)}}function s(e,o){return e!==o}exports.booleanToInt=n;exports.canParseBoolean=r;exports.compareBooleans=a;exports.parseBoolean=t;exports.xorBoolean=s;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./error.cjs"),r=(e,o)=>e===o?0:e?-1:1,s=e=>e?1:0,n=e=>{if(e==null)return!1;switch(e.toLowerCase()){case"true":case"false":case"0":case"1":case"on":case"off":return!0;default:return!1}},t=e=>{switch(e.toLowerCase()){case"true":case"1":case"on":return!0;case"false":case"0":case"off":return!1;default:throw new a.ParsingError(`unable to parse '${e}' to boolean`)}},c=(e,o)=>e!==o;exports.booleanToInt=s;exports.canParseBoolean=n;exports.compareBooleans=r;exports.parseBoolean=t;exports.xorBoolean=c;