@tempots/std 0.9.7 → 0.10.3

package/README.md

@@ -1,3 +1 @@
-# @tempots/std
-
-A standard library for TypeScript.
+# Tempo Standard Library

package/array.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const y=require("./maybe.cjs"),M=require("./object.cjs");function q(t,e){return Array.from({length:t.length},(n,r)=>e(t[r],r))}function E(t,e){const n=[];for(let r=0;r<t.length;r++){const i=e(t[r],r);i!=null&&n.push(i)}return n}function j(t,e){const n=[];for(const r of t)n.push(...e(r));return n}function w(t){return t.length>0?y.Maybe.just(t[0]):y.Maybe.nothing}function A(t){return t.slice(1)}function b(t,e,n){if(t.length!==e.length)return!1;for(let r=0;r<t.length;r++)if(!n(t[r],e[r]))return!1;return!0}function N(t){return function(e,n){return b(e,n,t)}}function O(t){return t.length===0}function B(t){return t.length>0}function k(t,e){const n=[];for(const r of t)e(r)&&n.push(r);return n}function I(t,e){const n=[];for(let r=0;r<t.length;r++){const i=e(t[r],r);i!=null&&n.push(i)}return n}function P(t){return k(t,e=>e!=null)}function _(t){return[].concat(...t)}function S(t,e,n){for(const r of t)n=e(n,r);return n}function C(t,e){for(const n of t)if(!e(n))return!1;return!0}function R(t,e){for(const n of t)if(e(n))return!0;return!1}function T(t,e){for(const n of t)e(n)}function $(...t){return[].concat(...t)}function D(t,e=!0){return function(n,r){if(n.length<r.length)return-1*(e?1:-1);if(n.length>r.length)return 1*(e?1:-1);for(let i=0;i<n.length;i++){const u=t(n[i],r[i]);if(u!==0)return u}return 0}}function L(t,e){return e.slice().sort(t)}function d(t,e){return Array.from({length:t},(n,r)=>e(r))}function V(t,e=0){return d(t,n=>e+n)}function W(t,e){return d(t,()=>e)}function z(t){return Array.from(new Set(t))}function G(t,e){const n={};return t.forEach(r=>{n[e(r)]=r}),M.keys(n).map(r=>n[r])}function H(t,e){const n=t.indexOf(e);return n<0?!1:(t.splice(n,1),!0)}function J(t,e){const n=t.findIndex(e);return n<0?!1:(t.splice(n,1),!0)}function Q(t){const e=[];for(let n=t.next();!(n.done??!1);n=t.next())e.push(n.value);return e}function U(t,e,n){const r={removals:[],swaps:[],inserts:[]},{removals:i,inserts:u,swaps:a}=r,l=new Map;e.forEach((o,f)=>l.set(n(o),f));const s=t.map((o,f)=>[o,f]).filter(([o])=>!l.has(n(o))).map(([o,f])=>f);for(let o=s.length-1;o>=0;o--){const f=s[o],c=i.length>0?i[i.length-1]:void 0;c!=null&&c.at===f+1?(c.at--,c.qt++):i.push({at:f,qt:1})}const h=new Map;t.forEach((o,f)=>h.set(n(o),f));const g=e.map((o,f)=>[o,f]).filter(([o])=>!h.has(n(o))).map(([o,f])=>f);for(const o of g){const f=u.length>0?u[u.length-1]:void 0;f!=null&&f.at+f.values.length===o?f.values.push(e[o]):u.push({at:o,values:[e[o]]})}const p=t.filter((o,f)=>!s.includes(f)),m=new Map;for(let o=0;o<p.length;o++)m.set(n(p[o]),o);const v=e.filter((o,f)=>!g.includes(f));for(let o=0;o<v.length;o++){const f=n(v[o]),c=m.get(f);if(c==null||o===c)continue;const x=n(p[o]);m.delete(x),a.push({from:o,to:c})}return r}function X(t,e){const n=[...e];for(const{at:r,qt:i}of t.removals)n.splice(r,i);for(const{from:r,to:i}of t.swaps){const u=n[i];n[i]=n[r],n[r]=u}for(const r of t.inserts)n.splice(r.at,0,...r.values);return n}function Y(t,e=" and ",n=", "){return t.length===0?"":t.length===1?String(t[0]):`${t.slice(0,-1).join(n)}${e}${String(t[t.length-1])}`}function Z(t,e,n=!0){const r=t.map((l,s)=>[l,s]);r.sort((l,s)=>e(l[0],s[0]));const i=new Array(r.length);let u=0,a=r[0][0];for(let l=0;l<r.length;l++){const[s,h]=r[l];e(s,a)!==0&&(u=l,a=s),i[h]=u,n&&u++}return i}exports.all=C;exports.any=R;exports.applyOperations=X;exports.concat=$;exports.diffOperations=U;exports.distinctByPredicate=G;exports.distinctPrimitive=z;exports.each=T;exports.equals=b;exports.fill=W;exports.filter=k;exports.filterMap=I;exports.filterNulls=P;exports.flatMap=j;exports.flatten=_;exports.foldLeft=S;exports.hasValues=B;exports.head=w;exports.isEmpty=O;exports.joinWithConjunction=Y;exports.makeCompare=D;exports.makeEquals=N;exports.map=q;exports.mapNotNull=E;exports.numbersRange=V;exports.ofIterableIterator=Q;exports.range=d;exports.rank=Z;exports.remove=H;exports.removeByPredicate=J;exports.sort=L;exports.tail=A;

package/{arrays.d.ts → array.d.ts}

@@ -1,9 +1,6 @@
-/**
- * Utility functions to manipulate `Array` values.
- */
 import { Maybe } from './maybe';
-import { type Ordering, type Compare } from './ord';
-import { type Primitive } from './types/utility';
+import { Compare, Primitive } from './domain';
+
 export declare function map<A, B>(arr: A[], f: (a: A, index: number) => B): B[];
 export declare function mapNotNull<A, B>(arr: A[], f: (a: A, index: number) => B | null | undefined): B[];
 export declare function flatMap<A, B>(arr: A[], f: (a: A) => B[]): B[];
@@ -14,6 +11,7 @@ export declare function makeEquals<T>(equality: (a: T, b: T) => boolean): (a: T[
 export declare function isEmpty<T>(arr: T[]): arr is [];
 export declare function hasValues<T>(arr: T[]): arr is [T, ...T[]];
 export declare function filter<T>(arr: T[], predicate: (v: T) => boolean): T[];
+export declare function filterMap<A, B>(arr: A[], f: (a: A, index: number) => Maybe<B>): B[];
 export declare function filterNulls<T>(arr: Array<T | null | undefined>): T[];
 export declare function flatten<T>(arr: T[][]): T[];
 export declare function foldLeft<T, B>(arr: T[], f: (acc: B, curr: T) => B, b: B): B;
@@ -22,13 +20,14 @@ export declare function any<T>(arr: T[], predicate: (v: T) => boolean): boolean;
 export declare function each<T>(arr: T[], f: (v: T) => void): void;
 export declare function concat<A>(...arrs: A[][]): A[];
 export declare function makeCompare<A>(comparef: Compare<A>, shorterFirst?: boolean): (a: A[], b: A[]) => number;
-export declare function sort<A>(compare: (a: A, b: A) => Ordering, arr: A[]): A[];
+export declare function sort<A>(compare: Compare<A>, arr: A[]): A[];
 export declare function range<A>(length: number, f: (index: number) => A): A[];
 export declare function numbersRange(length: number, startAt?: number): number[];
 export declare function fill<A>(length: number, value: A): A[];
 export declare function distinctPrimitive<T extends Primitive>(values: T[]): T[];
 export declare function distinctByPredicate<T>(values: T[], predicate: (a: T) => string): T[];
-export declare function remove<A>(arr: A[], item: A, predicate?: (a: A) => boolean): boolean;
+export declare function remove<A>(arr: A[], item: A): boolean;
+export declare function removeByPredicate<A>(arr: A[], predicate: (a: A) => boolean): boolean;
 export declare function ofIterableIterator<A>(it: IterableIterator<A>): A[];
 export interface DiffOperations<T> {
     removals: Array<{
@@ -47,3 +46,4 @@ export interface DiffOperations<T> {
 export declare function diffOperations<T, K>(from: T[], to: T[], getKey: (v: T) => K): DiffOperations<T>;
 export declare function applyOperations<T>(operations: DiffOperations<T>, start: T[]): T[];
 export declare function joinWithConjunction<A>(arr: A[], conjunction?: string, separator?: string): string;
+export declare function rank<T>(array: T[], compare: (a: T, b: T) => number, incrementDuplicates?: boolean): number[];

package/array.js

@@ -0,0 +1,223 @@
+import { Maybe as v } from "./maybe.js";
+import { keys as w } from "./object.js";
+function _(n, e) {
+  return Array.from({ length: n.length }, (t, r) => e(n[r], r));
+}
+function q(n, e) {
+  const t = [];
+  for (let r = 0; r < n.length; r++) {
+    const u = e(n[r], r);
+    u != null && t.push(u);
+  }
+  return t;
+}
+function y(n, e) {
+  const t = [];
+  for (const r of n)
+    t.push(...e(r));
+  return t;
+}
+function B(n) {
+  return n.length > 0 ? v.just(n[0]) : v.nothing;
+}
+function I(n) {
+  return n.slice(1);
+}
+function A(n, e, t) {
+  if (n.length !== e.length) return !1;
+  for (let r = 0; r < n.length; r++)
+    if (!t(n[r], e[r])) return !1;
+  return !0;
+}
+function N(n) {
+  return function(e, t) {
+    return A(e, t, n);
+  };
+}
+function O(n) {
+  return n.length === 0;
+}
+function j(n) {
+  return n.length > 0;
+}
+function E(n, e) {
+  const t = [];
+  for (const r of n) e(r) && t.push(r);
+  return t;
+}
+function P(n, e) {
+  const t = [];
+  for (let r = 0; r < n.length; r++) {
+    const u = e(n[r], r);
+    u != null && t.push(u);
+  }
+  return t;
+}
+function S(n) {
+  return E(n, (e) => e != null);
+}
+function $(n) {
+  return [].concat(...n);
+}
+function C(n, e, t) {
+  for (const r of n)
+    t = e(t, r);
+  return t;
+}
+function D(n, e) {
+  for (const t of n)
+    if (!e(t))
+      return !1;
+  return !0;
+}
+function R(n, e) {
+  for (const t of n)
+    if (e(t))
+      return !0;
+  return !1;
+}
+function T(n, e) {
+  for (const t of n) e(t);
+}
+function L(...n) {
+  return [].concat(...n);
+}
+function V(n, e = !0) {
+  return function(t, r) {
+    if (t.length < r.length)
+      return -1 * (e ? 1 : -1);
+    if (t.length > r.length)
+      return 1 * (e ? 1 : -1);
+    for (let u = 0; u < t.length; u++) {
+      const s = n(t[u], r[u]);
+      if (s !== 0) return s;
+    }
+    return 0;
+  };
+}
+function W(n, e) {
+  return e.slice().sort(n);
+}
+function x(n, e) {
+  return Array.from({ length: n }, (t, r) => e(r));
+}
+function z(n, e = 0) {
+  return x(n, (t) => e + t);
+}
+function G(n, e) {
+  return x(n, () => e);
+}
+function H(n) {
+  return Array.from(new Set(n));
+}
+function J(n, e) {
+  const t = {};
+  return n.forEach((r) => {
+    t[e(r)] = r;
+  }), w(t).map((r) => t[r]);
+}
+function Q(n, e) {
+  const t = n.indexOf(e);
+  return t < 0 ? !1 : (n.splice(t, 1), !0);
+}
+function U(n, e) {
+  const t = n.findIndex(e);
+  return t < 0 ? !1 : (n.splice(t, 1), !0);
+}
+function X(n) {
+  const e = [];
+  for (let t = n.next(); !(t.done ?? !1); t = n.next())
+    e.push(t.value);
+  return e;
+}
+function Y(n, e, t) {
+  const r = {
+    removals: [],
+    swaps: [],
+    inserts: []
+  }, { removals: u, inserts: s, swaps: a } = r, i = /* @__PURE__ */ new Map();
+  e.forEach((o, f) => i.set(t(o), f));
+  const l = n.map((o, f) => [o, f]).filter(([o]) => !i.has(t(o))).map(([o, f]) => f);
+  for (let o = l.length - 1; o >= 0; o--) {
+    const f = l[o], c = u.length > 0 ? u[u.length - 1] : void 0;
+    c != null && c.at === f + 1 ? (c.at--, c.qt++) : u.push({ at: f, qt: 1 });
+  }
+  const h = /* @__PURE__ */ new Map();
+  n.forEach((o, f) => h.set(t(o), f));
+  const g = e.map((o, f) => [o, f]).filter(([o]) => !h.has(t(o))).map(([o, f]) => f);
+  for (const o of g) {
+    const f = s.length > 0 ? s[s.length - 1] : void 0;
+    f != null && f.at + f.values.length === o ? f.values.push(e[o]) : s.push({ at: o, values: [e[o]] });
+  }
+  const p = n.filter((o, f) => !l.includes(f)), m = /* @__PURE__ */ new Map();
+  for (let o = 0; o < p.length; o++)
+    m.set(t(p[o]), o);
+  const d = e.filter((o, f) => !g.includes(f));
+  for (let o = 0; o < d.length; o++) {
+    const f = t(d[o]), c = m.get(f);
+    if (c == null || o === c) continue;
+    const k = t(p[o]);
+    m.delete(k), a.push({ from: o, to: c });
+  }
+  return r;
+}
+function Z(n, e) {
+  const t = [...e];
+  for (const { at: r, qt: u } of n.removals)
+    t.splice(r, u);
+  for (const { from: r, to: u } of n.swaps) {
+    const s = t[u];
+    t[u] = t[r], t[r] = s;
+  }
+  for (const r of n.inserts)
+    t.splice(r.at, 0, ...r.values);
+  return t;
+}
+function F(n, e = " and ", t = ", ") {
+  return n.length === 0 ? "" : n.length === 1 ? String(n[0]) : `${n.slice(0, -1).join(t)}${e}${String(n[n.length - 1])}`;
+}
+function K(n, e, t = !0) {
+  const r = n.map((i, l) => [i, l]);
+  r.sort((i, l) => e(i[0], l[0]));
+  const u = new Array(r.length);
+  let s = 0, a = r[0][0];
+  for (let i = 0; i < r.length; i++) {
+    const [l, h] = r[i];
+    e(l, a) !== 0 && (s = i, a = l), u[h] = s, t && s++;
+  }
+  return u;
+}
+export {
+  D as all,
+  R as any,
+  Z as applyOperations,
+  L as concat,
+  Y as diffOperations,
+  J as distinctByPredicate,
+  H as distinctPrimitive,
+  T as each,
+  A as equals,
+  G as fill,
+  E as filter,
+  P as filterMap,
+  S as filterNulls,
+  y as flatMap,
+  $ as flatten,
+  C as foldLeft,
+  j as hasValues,
+  B as head,
+  O as isEmpty,
+  F as joinWithConjunction,
+  V as makeCompare,
+  N as makeEquals,
+  _ as map,
+  q as mapNotNull,
+  z as numbersRange,
+  X as ofIterableIterator,
+  x as range,
+  K as rank,
+  Q as remove,
+  U as removeByPredicate,
+  W as sort,
+  I as tail
+};

package/bigint.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function o(n,e){return e<0n&&(n=-n,e=-e),n<=0n?n/e:(n-1n)/e+1n}function f(n,e){return e<0n&&(n=-n,e=-e),n>=0n?n/e:(n+1n)/e-1n}function c(n,e){return n<e?-1:n>e?1:0}function i(n){return n<0n?-n:n}function s(n,e){return n<e?n:e}function l(n,e){return n>e?n:e}function m(n,e){if(e<0n)throw new Error("negative exponent");let r=1n;for(;e>0n;)(e&1n)!==0n&&(r*=n),e>>=1n,n*=n;return r}function u(n,e){for(n=i(n),e=i(e);e>0n;){const r=e;e=n%e,n=r}return n}function v(n,e){return i(n*e)/u(n,e)}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 e=5n;for(;e*e<=n;){if(n%e===0n||n%(e+2n)===0n)return!1;e+=6n}return!0}function a(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 w(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 p(n){return n%2n===0n}function P(n){return n%2n!==0n}function d(n){return n===0n}function g(n){return n===1n}function h(n){return n<0n}function O(n){return n>0n}exports.abs=i;exports.ceilDiv=o;exports.compare=c;exports.floorDiv=f;exports.gcd=u;exports.isEven=p;exports.isNegative=h;exports.isOdd=P;exports.isOne=g;exports.isPositive=O;exports.isPrime=t;exports.isZero=d;exports.lcm=v;exports.max=l;exports.min=s;exports.nextPrime=a;exports.pow=m;exports.prevPrime=w;

package/bigint.js

@@ -1,110 +1,96 @@
-export function ceilDiv(x, y) {
-    if (y < 0n) {
-        x = -x;
-        y = -y;
-    }
-    return x <= 0n ? x / y : (x - 1n) / y + 1n;
-}
-export function floorDiv(x, y) {
-    if (y < 0n) {
-        x = -x;
-        y = -y;
-    }
-    return x >= 0n ? x / y : (x + 1n) / y - 1n;
-}
-export function compare(x, y) {
-    return x < y ? -1 : x > y ? 1 : 0;
-}
-export function abs(x) {
-    return x < 0n ? -x : x;
-}
-export function min(x, y) {
-    return x < y ? x : y;
-}
-export function max(x, y) {
-    return x > y ? x : y;
-}
-export function pow(x, y) {
-    if (y < 0n)
-        throw new Error('negative exponent');
-    let result = 1n;
-    while (y > 0n) {
-        if ((y & 1n) !== 0n)
-            result *= x;
-        y >>= 1n;
-        x *= x;
-    }
-    return result;
-}
-export function gcd(x, y) {
-    x = abs(x);
-    y = abs(y);
-    while (y > 0n) {
-        const t = y;
-        y = x % y;
-        x = t;
-    }
-    return x;
-}
-export function lcm(x, y) {
-    return abs(x * y) / gcd(x, y);
-}
-export function isPrime(x) {
-    if (x < 2n)
-        return false;
-    if (x === 2n || x === 3n)
-        return true;
-    if (x % 2n === 0n || x % 3n === 0n)
-        return false;
-    let i = 5n;
-    while (i * i <= x) {
-        if (x % i === 0n || x % (i + 2n) === 0n)
-            return false;
-        i += 6n;
-    }
-    return true;
-}
-export function nextPrime(x) {
-    if (x < 2n)
-        return 2n;
-    if (x === 2n)
-        return 3n;
-    if (x % 2n === 0n)
-        x++;
-    else
-        x += 2n;
-    while (!isPrime(x))
-        x += 2n;
-    return x;
-}
-export function prevPrime(x) {
-    if (x <= 2n)
-        throw new Error('no previous prime');
-    if (x === 3n)
-        return 2n;
-    if (x % 2n === 0n)
-        x--;
-    else
-        x -= 2n;
-    while (!isPrime(x))
-        x -= 2n;
-    return x;
-}
-export function isEven(x) {
-    return x % 2n === 0n;
-}
-export function isOdd(x) {
-    return x % 2n !== 0n;
-}
-export function isZero(x) {
-    return x === 0n;
-}
-export function isOne(x) {
-    return x === 1n;
-}
-export function isNegative(x) {
-    return x < 0n;
-}
-export function isPositive(x) {
-    return x > 0n;
-}
+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 i(n) {
+  return n < 0n ? -n : n;
+}
+function s(n, r) {
+  return n < r ? n : r;
+}
+function l(n, r) {
+  return n > r ? n : r;
+}
+function w(n, r) {
+  if (r < 0n) throw new Error("negative exponent");
+  let e = 1n;
+  for (; r > 0n; )
+    (r & 1n) !== 0n && (e *= n), r >>= 1n, n *= n;
+  return e;
+}
+function u(n, r) {
+  for (n = i(n), r = i(r); r > 0n; ) {
+    const e = r;
+    r = n % r, n = e;
+  }
+  return n;
+}
+function a(n, r) {
+  return i(n * r) / u(n, r);
+}
+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 r = 5n;
+  for (; r * r <= n; ) {
+    if (n % r === 0n || n % (r + 2n) === 0n) return !1;
+    r += 6n;
+  }
+  return !0;
+}
+function m(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 v(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 h(n) {
+  return n % 2n === 0n;
+}
+function p(n) {
+  return n % 2n !== 0n;
+}
+function P(n) {
+  return n === 0n;
+}
+function d(n) {
+  return n === 1n;
+}
+function g(n) {
+  return n < 0n;
+}
+function E(n) {
+  return n > 0n;
+}
+export {
+  i as abs,
+  f as ceilDiv,
+  c as compare,
+  o as floorDiv,
+  u as gcd,
+  h as isEven,
+  g as isNegative,
+  p as isOdd,
+  d as isOne,
+  E as isPositive,
+  t as isPrime,
+  P as isZero,
+  a as lcm,
+  l as max,
+  s as min,
+  m as nextPrime,
+  w as pow,
+  v as prevPrime
+};

package/boolean.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function t(e,r){return e===r?0:e?-1:1}function a(e){return e?1:0}function 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}}function s(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 o(e,r){return e!==r}exports.canParse=n;exports.compare=t;exports.parse=s;exports.toInt=a;exports.xor=o;

package/boolean.js

@@ -0,0 +1,44 @@
+function t(e, r) {
+  return e === r ? 0 : e ? -1 : 1;
+}
+function a(e) {
+  return e ? 1 : 0;
+}
+function 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;
+  }
+}
+function s(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 c(e, r) {
+  return e !== r;
+}
+export {
+  n as canParse,
+  t as compare,
+  s as parse,
+  a as toInt,
+  c as xor
+};

package/domain.cjs

@@ -0,0 +1 @@
+"use strict";

package/domain.d.ts

@@ -0,0 +1,22 @@
+export type IndexKey = keyof any;
+export type Primitive = string | boolean | number | null | undefined;
+export type Nothing = undefined | null;
+export type Compare<T> = (a: T, b: T) => number;
+export type Id<T> = {} & {
+    [P in keyof T]: T[P];
+};
+export type Merge<A, B> = Id<A & B>;
+export type Sample = Merge<{
+    a: number;
+}, {
+    b: string;
+}>;
+export type TupleToUnion<T extends unknown[]> = T[number];
+export type Fun0<R> = () => R;
+export type Fun1<A, R> = (a: A) => R;
+export type Fun2<A, B, R> = (a: A, b: B) => R;
+export type Fun3<A, B, C, R> = (a: A, b: B, c: C) => R;
+export type Fun4<A, B, C, D, R> = (a: A, b: B, c: C, d: D) => R;
+export type Fun5<A, B, C, D, E, R> = (a: A, b: B, c: C, d: D, e: E) => R;
+export type Fun6<A, B, C, D, E, F, R> = (a: A, b: B, c: C, d: D, e: E, f: F) => R;
+export type FirstArgument<F> = F extends Fun1<infer A, unknown> ? A : never;

package/domain.js

@@ -0,0 +1 @@
+

package/equal.cjs

@@ -0,0 +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;

package/equal.js

@@ -0,0 +1,68 @@
+function O(e, t) {
+  return e === t || e !== e && t !== t;
+}
+function 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;
+    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 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();
+    for (; ; ) {
+      const s = a.next();
+      if (s.done ?? !1) break;
+      if (!r.has(s.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();
+    for (; ; ) {
+      const f = s.next();
+      if (f.done ?? !1) break;
+      if (!i(n.get(f.value), r.get(f.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;
+    }
+    return !0;
+  }
+  return !1;
+}
+function M(e, t) {
+  return e == t;
+}
+export {
+  i as deepEqual,
+  M as looseEqual,
+  O as strictEqual
+};

package/function.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function u(...r){return t=>r.reduce((e,n)=>n(e),t)}function i(r){return r}function c(r){return t=>(...e)=>r(t,...e)}function o(r){return(...t)=>e=>r(...t.concat([e]))}function f(r){return(...t)=>r(...t.reverse())}function y(r){return r}exports.compose=u;exports.curryLeft=c;exports.curryRight=o;exports.flip=f;exports.id=y;exports.identity=i;

package/function.js

@@ -0,0 +1,29 @@
+function u(...n) {
+  return (r) => n.reduce((t, e) => e(t), r);
+}
+function c(n) {
+  return n;
+}
+function i(n) {
+  return (r) => (...t) => n(r, ...t);
+}
+function o(n) {
+  return (...r) => (
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    (t) => n(...r.concat([t]))
+  );
+}
+function f(n) {
+  return (...r) => n(...r.reverse());
+}
+function d(n) {
+  return n;
+}
+export {
+  u as compose,
+  i as curryLeft,
+  o as curryRight,
+  f as flip,
+  d as id,
+  c as identity
+};