@tempots/std 0.13.0 → 0.14.0

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;

package/boolean.d.ts

@@ -9,7 +9,7 @@
  * @returns A comparison value.
  * @public
  */
-export declare function compareBooleans(a: boolean, b: boolean): number;
+export declare const compareBooleans: (a: boolean, b: boolean) => number;
 /**
  * Converts a boolean to an integer value (`true` => `1`, `false` => `0`).
  *
@@ -17,7 +17,7 @@ export declare function compareBooleans(a: boolean, b: boolean): number;
  * @returns The integer value.
  * @public
  */
-export declare function booleanToInt(v: boolean): number;
+export declare const booleanToInt: (v: boolean) => number;
 /**
  * Returns `true` if the passed value can be parsed as a boolean. The following values are considered parsable:
  *
@@ -31,7 +31,7 @@ export declare function booleanToInt(v: boolean): number;
  * @returns `true` if the value can be parsed; otherwise, `false`.
  * @public
  */
-export declare function canParseBoolean(v: string): boolean;
+export declare const canParseBoolean: (v: string) => boolean;
 /**
  * Returns `true`/`false` if the passed value can be parsed. The following values are considered parsable:
  *
@@ -43,7 +43,7 @@ export declare function canParseBoolean(v: string): boolean;
  * @returns The parsed boolean value.
  * @public
  */
-export declare function parseBoolean(v: string): boolean;
+export declare const parseBoolean: (v: string) => boolean;
 /**
  * Returns `true` when arguments are different.
  *
@@ -52,4 +52,4 @@ export declare function parseBoolean(v: string): boolean;
  * @returns The result of the XOR operation.
  * @public
  */
-export declare function xorBoolean(a: boolean, b: boolean): boolean;
+export declare const xorBoolean: (a: boolean, b: boolean) => boolean;

package/boolean.js

@@ -1,10 +1,5 @@
-function a(e, r) {
-  return e === r ? 0 : e ? -1 : 1;
-}
-function n(e) {
-  return e ? 1 : 0;
-}
-function o(e) {
+import { ParsingError as a } from "./error.js";
+const r = (e, o) => e === o ? 0 : e ? -1 : 1, t = (e) => e ? 1 : 0, n = (e) => {
   if (e == null) return !1;
   switch (e.toLowerCase()) {
     case "true":
@@ -17,8 +12,7 @@ function o(e) {
     default:
       return !1;
   }
-}
-function t(e) {
+}, c = (e) => {
   switch (e.toLowerCase()) {
     case "true":
     case "1":
@@ -29,16 +23,13 @@ function t(e) {
     case "off":
       return !1;
     default:
-      throw new Error(`unable to parse '${e}'`);
+      throw new a(`unable to parse '${e}' to boolean`);
   }
-}
-function s(e, r) {
-  return e !== r;
-}
+}, l = (e, o) => e !== o;
 export {
-  n as booleanToInt,
-  o as canParseBoolean,
-  a as compareBooleans,
-  t as parseBoolean,
-  s as xorBoolean
+  t as booleanToInt,
+  n as canParseBoolean,
+  r as compareBooleans,
+  c as parseBoolean,
+  l as xorBoolean
 };

package/equal.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function g(e,t){return e===t||e!==e&&t!==t}function f(e,t){if(g(e,t))return!0;if(e==null||t==null)return!1;const u=Array.isArray(e),h=Array.isArray(t);if(u!==h)return!1;if(u){const n=e,r=t,a=n.length;if(a!==r.length)return!1;for(let s=0;s<a;s++)if(!f(n[s],r[s]))return!1;return!0}const l=e instanceof Date,j=t instanceof Date;if(l!==j)return!1;if(l){const n=e,r=t;return+n==+r}const p=e instanceof Set,I=t instanceof Set;if(p!==I)return!1;if(p){const n=e,r=t;if(n.size!==r.size)return!1;const a=n.keys();for(;;){const s=a.next();if(s.done??!1)break;if(!r.has(s.value))return!1}return!0}const y=e instanceof Map,O=t instanceof Map;if(y!==O)return!1;if(y){const n=e,r=t;if(n.size!==r.size)return!1;const s=n.keys();for(;;){const o=s.next();if(o.done??!1)break;if(!f(n.get(o.value),r.get(o.value)))return!1}return!0}const b=typeof e=="object";if(b!==(typeof t=="object"))return!1;if(b){const n=e,r=t,a=Object.keys(n),s=Object.keys(r),o=a.length;if(o!==s.length)return!1;for(let i=0;i<o;i++){const c=a[i];if(!Object.prototype.hasOwnProperty.call(r,c)||!f(n[c],r[c]))return!1}return!0}return!1}function d(e,t){return e==t}exports.deepEqual=f;exports.looseEqual=d;exports.strictEqual=g;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const g=(e,t)=>e===t||e!==e&&t!==t,f=(e,t)=>{if(g(e,t))return!0;if(e==null||t==null)return!1;const l=Array.isArray(e),h=Array.isArray(t);if(l!==h)return!1;if(l){const s=e,n=t,a=s.length;if(a!==n.length)return!1;for(let r=0;r<a;r++)if(!f(s[r],n[r]))return!1;return!0}const u=e instanceof Date,j=t instanceof Date;if(u!==j)return!1;if(u){const s=e,n=t;return+s==+n}const p=e instanceof Set,I=t instanceof Set;if(p!==I)return!1;if(p){const s=e,n=t;if(s.size!==n.size)return!1;const a=s.keys();for(;;){const r=a.next();if(r.done??!1)break;if(!n.has(r.value))return!1}return!0}const y=e instanceof Map,O=t instanceof Map;if(y!==O)return!1;if(y){const s=e,n=t;if(s.size!==n.size)return!1;const r=s.keys();for(;;){const o=r.next();if(o.done??!1)break;if(!f(s.get(o.value),n.get(o.value)))return!1}return!0}const b=typeof e=="object";if(b!==(typeof t=="object"))return!1;if(b){const s=e,n=t,a=Object.keys(s),r=Object.keys(n),o=a.length;if(o!==r.length)return!1;for(let c=0;c<o;c++){const i=a[c];if(!Object.prototype.hasOwnProperty.call(n,i)||!f(s[i],n[i]))return!1}return!0}return!1},d=(e,t)=>e==t;exports.deepEqual=f;exports.looseEqual=d;exports.strictEqual=g;

package/equal.d.ts

@@ -7,7 +7,7 @@
  * @returns `true` if the values are strictly equal, `false` otherwise.
  * @public
  */
-export declare function strictEqual<A>(a: A, b: A): boolean;
+export declare const strictEqual: <A>(a: A, b: A) => boolean;
 /**
  * Checks if two values are equal by comparing their contents.
  *
@@ -17,7 +17,7 @@ export declare function strictEqual<A>(a: A, b: A): boolean;
  * @returns `true` if the values are deeply equal, `false` otherwise.
  * @public
  */
-export declare function deepEqual<A>(a: A, b: A): boolean;
+export declare const deepEqual: <A>(a: A, b: A) => boolean;
 /**
  * Checks if two values are loosely equal.
  *
@@ -26,4 +26,4 @@ export declare function deepEqual<A>(a: A, b: A): boolean;
  * @returns `true` if the values are loosely equal, `false` otherwise.
  * @public
  */
-export declare function looseEqual<T>(a: T, b: T): boolean;
+export declare const looseEqual: <T>(a: T, b: T) => boolean;

package/equal.js

@@ -1,66 +1,60 @@
-function O(e, t) {
-  return e === t || e !== e && t !== t;
-}
-function i(e, t) {
+const O = (e, t) => e === t || e !== e && t !== t, i = (e, t) => {
   if (O(e, t)) return !0;
   if (e == null || t == null) return !1;
-  const u = Array.isArray(e), b = Array.isArray(t);
-  if (u !== b) return !1;
-  if (u) {
-    const n = e, r = t, a = n.length;
-    if (a !== r.length) return !1;
-    for (let s = 0; s < a; s++)
-      if (!i(n[s], r[s])) return !1;
+  const l = Array.isArray(e), b = Array.isArray(t);
+  if (l !== b) return !1;
+  if (l) {
+    const s = e, n = t, a = s.length;
+    if (a !== n.length) return !1;
+    for (let r = 0; r < a; r++)
+      if (!i(s[r], n[r])) return !1;
     return !0;
   }
-  const l = e instanceof Date, I = t instanceof Date;
-  if (l !== I) return !1;
-  if (l) {
-    const n = e, r = t;
-    return +n == +r;
+  const u = e instanceof Date, I = t instanceof Date;
+  if (u !== I) return !1;
+  if (u) {
+    const s = e, n = t;
+    return +s == +n;
   }
   const p = e instanceof Set, g = t instanceof Set;
   if (p !== g) return !1;
   if (p) {
-    const n = e, r = t;
-    if (n.size !== r.size) return !1;
-    const a = n.keys();
+    const s = e, n = t;
+    if (s.size !== n.size) return !1;
+    const a = s.keys();
     for (; ; ) {
-      const s = a.next();
-      if (s.done ?? !1) break;
-      if (!r.has(s.value)) return !1;
+      const r = a.next();
+      if (r.done ?? !1) break;
+      if (!n.has(r.value)) return !1;
     }
     return !0;
   }
   const h = e instanceof Map, j = t instanceof Map;
   if (h !== j) return !1;
   if (h) {
-    const n = e, r = t;
-    if (n.size !== r.size) return !1;
-    const s = n.keys();
+    const s = e, n = t;
+    if (s.size !== n.size) return !1;
+    const r = s.keys();
     for (; ; ) {
-      const f = s.next();
-      if (f.done ?? !1) break;
-      if (!i(n.get(f.value), r.get(f.value))) return !1;
+      const o = r.next();
+      if (o.done ?? !1) break;
+      if (!i(s.get(o.value), n.get(o.value))) return !1;
     }
     return !0;
   }
   const y = typeof e == "object";
   if (y !== (typeof t == "object")) return !1;
   if (y) {
-    const n = e, r = t, a = Object.keys(n), s = Object.keys(r), f = a.length;
-    if (f !== s.length) return !1;
-    for (let o = 0; o < f; o++) {
-      const c = a[o];
-      if (!Object.prototype.hasOwnProperty.call(r, c) || !i(n[c], r[c])) return !1;
+    const s = e, n = t, a = Object.keys(s), r = Object.keys(n), o = a.length;
+    if (o !== r.length) return !1;
+    for (let f = 0; f < o; f++) {
+      const c = a[f];
+      if (!Object.prototype.hasOwnProperty.call(n, c) || !i(s[c], n[c])) return !1;
     }
     return !0;
   }
   return !1;
-}
-function M(e, t) {
-  return e == t;
-}
+}, M = (e, t) => e == t;
 export {
   i as deepEqual,
   M as looseEqual,

package/error.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});class o extends Error{constructor(r="Operation aborted"){super(r),this.name="AbortError"}}class s extends Error{constructor(r="Missing implementation"){super(r),this.name="MissingImplementationError"}}class e extends Error{constructor(r){super(r),this.name="ParsingError"}}class n extends Error{constructor(r){super(r),this.name="ArgumentError"}}exports.AbortError=o;exports.ArgumentError=n;exports.MissingImplementationError=s;exports.ParsingError=e;

package/error.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Represents an error that is thrown when an operation is aborted.
+ */
+export declare class AbortError extends Error {
+    constructor(message?: string);
+}
+/**
+ * Represents an error that is thrown when a required implementation is missing.
+ */
+export declare class MissingImplementationError extends Error {
+    constructor(message?: string);
+}
+/**
+ * Represents an error that occurs during parsing.
+ */
+export declare class ParsingError extends Error {
+    constructor(message: string);
+}
+/**
+ * Represents an error that occurs when an invalid argument is passed to a function or method.
+ */
+export declare class ArgumentError extends Error {
+    constructor(message: string);
+}

package/error.js

@@ -0,0 +1,26 @@
+class t extends Error {
+  constructor(r = "Operation aborted") {
+    super(r), this.name = "AbortError";
+  }
+}
+class o extends Error {
+  constructor(r = "Missing implementation") {
+    super(r), this.name = "MissingImplementationError";
+  }
+}
+class e extends Error {
+  constructor(r) {
+    super(r), this.name = "ParsingError";
+  }
+}
+class n extends Error {
+  constructor(r) {
+    super(r), this.name = "ArgumentError";
+  }
+}
+export {
+  t as AbortError,
+  n as ArgumentError,
+  o as MissingImplementationError,
+  e as ParsingError
+};

package/function.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function i(e){return e}function n(e){return t=>(...r)=>e(t,...r)}function u(e){let t;return()=>(t===void 0&&(t=e()),t)}exports.curryLeft=n;exports.identity=i;exports.memoize=u;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=e=>e,o=e=>t=>(...r)=>e(t,...r),n=e=>{let t;return()=>(t===void 0&&(t=e()),t)};exports.curryLeft=o;exports.identity=i;exports.memoize=n;