@tempots/std 0.13.0 → 0.15.0

package/array.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const q=require("./object.cjs");function x(r,t){return Array.from({length:r.length},(e,n)=>t(r[n],n))}function F(r,t){const e=[];for(const n of r)e.push(...t(n));return e}function w(r){return r.length>0?r[0]:void 0}function B(r){return r.slice(1)}function P(r,t,e){if(r.length!==t.length)return!1;for(let n=0;n<r.length;n++)if(!e(r[n],t[n]))return!1;return!0}function b(r){return r.length===0}function j(r){return r.length>0}function g(r,t){const e=[];for(const n of r)t(n)&&e.push(n);return e}function M(r,t){const e=[];for(let n=0;n<r.length;n++){const l=t(r[n],n);l!=null&&e.push(l)}return e}function I(r){return g(r,t=>t!=null)}function S(r){return[].concat(...r)}function k(r,t,e){for(const n of r)e=t(e,n);return e}function D(r,t){for(const e of r)if(!t(e))return!1;return!0}function _(r,t){for(const e of r)if(t(e))return!0;return!1}function T(r,t){for(const e of r)t(e)}function H(...r){return[].concat(...r)}function N(r,t,e,n=!0){if(r.length<t.length)return-1*(n?1:-1);if(r.length>t.length)return 1*(n?1:-1);for(let l=0;l<r.length;l++){const f=e(r[l],t[l]);if(f!==0)return f}return 0}function $(r,t){return r.slice().sort(t)}function p(r,t){return Array.from({length:r},(e,n)=>t(n))}function C(r,t=0){return p(r,e=>t+e)}function L(r,t){return p(r,()=>t)}function V(r){return Array.from(new Set(r))}function W(r,t){const e={};return r.forEach(n=>{e[t(n)]=n}),q.objectKeys(e).map(n=>e[n])}function v(r,t){const e=r.indexOf(t);return e<0?!1:(r.splice(e,1),!0)}function R(r,t){let e=!1;for(;v(r,t);)e=!0;return e}function E(r,t){const e=r.findIndex(t);return e<0?!1:(r.splice(e,1),!0)}function z(r,t){let e=!1;for(;E(r,t);)e=!0;return e}function G(r){const t=[];for(let e=r.next();!(e.done??!1);e=r.next())t.push(e.value);return t}function J(r,t,e){const n={removals:[],swaps:[],inserts:[]},{removals:l,inserts:f,swaps:c}=n,i=new Map;t.forEach((a,o)=>i.set(e(a),o));const u=r.map((a,o)=>[a,o]).filter(([a])=>!i.has(e(a))).map(([a,o])=>o);for(let a=u.length-1;a>=0;a--){const o=u[a],s=l.length>0?l[l.length-1]:void 0;s!=null&&s.at===o+1?(s.at--,s.qt++):l.push({at:o,qt:1})}const y=new Map;r.forEach((a,o)=>y.set(e(a),o));const h=t.map((a,o)=>[a,o]).filter(([a])=>!y.has(e(a))).map(([a,o])=>o);for(const a of h){const o=f.length>0?f[f.length-1]:void 0;o!=null&&o.at+o.values.length===a?o.values.push(t[a]):f.push({at:a,values:[t[a]]})}const A=r.filter((a,o)=>!u.includes(o)),m=new Map;for(let a=0;a<A.length;a++)m.set(e(A[a]),a);const d=t.filter((a,o)=>!h.includes(o));for(let a=0;a<d.length;a++){const o=e(d[a]),s=m.get(o);if(s==null||a===s)continue;const O=e(A[a]);m.delete(O),c.push({from:a,to:s})}return n}function Q(r,t){const e=[...t];for(const{at:n,qt:l}of r.removals)e.splice(n,l);for(const{from:n,to:l}of r.swaps){const f=e[l];e[l]=e[n],e[n]=f}for(const n of r.inserts)e.splice(n.at,0,...n.values);return e}function U(r,t=" and ",e=", "){return r.length===0?"":r.length===1?String(r[0]):`${r.slice(0,-1).join(e)}${t}${String(r[r.length-1])}`}function X(r,t,e=!0){const n=r.map((i,u)=>[i,u]);n.sort((i,u)=>t(i[0],u[0]));const l=new Array(n.length);let f=0,c=n[0][0];for(let i=0;i<n.length;i++){const[u,y]=n[i];t(u,c)!==0&&(f=i,c=u),l[y]=f,e&&f++}return l}exports.allElements=D;exports.anyElement=_;exports.applyArrayDiffOperations=Q;exports.areArraysEqual=P;exports.arrayDiffOperations=J;exports.arrayHasValues=j;exports.arrayHead=w;exports.arrayOfIterableIterator=G;exports.arrayTail=B;exports.compareArrays=N;exports.concatArrays=H;exports.createFilledArray=L;exports.filterArray=g;exports.filterMapArray=M;exports.filterNullsFromArray=I;exports.flatMapArray=F;exports.flattenArray=S;exports.foldLeftArray=k;exports.forEachElement=T;exports.generateArray=p;exports.generateSequenceArray=C;exports.isArrayEmpty=b;exports.joinArrayWithConjunction=U;exports.mapArray=x;exports.rankArray=X;exports.removeAllFromArray=R;exports.removeAllFromArrayByPredicate=z;exports.removeOneFromArray=v;exports.removeOneFromArrayByPredicate=E;exports.sortArray=$;exports.uniqueByPredicate=W;exports.uniquePrimitives=V;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const q=require("./object.cjs"),x=(r,t)=>Array.from({length:r.length},(e,n)=>t(r[n],n)),F=(r,t)=>{const e=[];for(const n of r)e.push(...t(n));return e},w=r=>r.length>0?r[0]:void 0,B=r=>r.slice(1),P=(r,t,e)=>{if(r.length!==t.length)return!1;for(let n=0;n<r.length;n++)if(!e(r[n],t[n]))return!1;return!0},b=r=>r.length===0,j=r=>r.length>0,g=(r,t)=>{const e=[];for(const n of r)t(n)&&e.push(n);return e},M=(r,t)=>{const e=[];for(let n=0;n<r.length;n++){const s=t(r[n],n);s!=null&&e.push(s)}return e},I=r=>g(r,t=>t!=null),S=r=>[].concat(...r),k=(r,t,e)=>{for(const n of r)e=t(e,n);return e},D=(r,t)=>{for(const e of r)if(!t(e))return!1;return!0},_=(r,t)=>{for(const e of r)if(t(e))return!0;return!1},T=(r,t)=>{for(const e of r)t(e)},H=(...r)=>[].concat(...r),N=(r,t,e,n=!0)=>{if(r.length<t.length)return-1*(n?1:-1);if(r.length>t.length)return 1*(n?1:-1);for(let s=0;s<r.length;s++){const l=e(r[s],t[s]);if(l!==0)return l}return 0},$=(r,t)=>r.slice().sort(t),p=(r,t)=>Array.from({length:r},(e,n)=>t(n)),C=(r,t=0)=>p(r,e=>t+e),L=(r,t)=>p(r,()=>t),V=r=>Array.from(new Set(r)),W=(r,t)=>{const e={};return r.forEach(n=>{e[t(n)]=n}),q.objectKeys(e).map(n=>e[n])},v=(r,t)=>{const e=r.indexOf(t);return e<0?!1:(r.splice(e,1),!0)},R=(r,t)=>{let e=!1;for(;v(r,t);)e=!0;return e},E=(r,t)=>{const e=r.findIndex(t);return e<0?!1:(r.splice(e,1),!0)},z=(r,t)=>{let e=!1;for(;E(r,t);)e=!0;return e},G=r=>{const t=[];for(let e=r.next();!(e.done??!1);e=r.next())t.push(e.value);return t},J=(r,t,e)=>{const n={removals:[],swaps:[],inserts:[]},{removals:s,inserts:l,swaps:u}=n,c=new Map;t.forEach((a,o)=>c.set(e(a),o));const f=r.map((a,o)=>[a,o]).filter(([a])=>!c.has(e(a))).map(([a,o])=>o);for(let a=f.length-1;a>=0;a--){const o=f[a],i=s.length>0?s[s.length-1]:void 0;i!=null&&i.at===o+1?(i.at--,i.qt++):s.push({at:o,qt:1})}const y=new Map;r.forEach((a,o)=>y.set(e(a),o));const h=t.map((a,o)=>[a,o]).filter(([a])=>!y.has(e(a))).map(([a,o])=>o);for(const a of h){const o=l.length>0?l[l.length-1]:void 0;o!=null&&o.at+o.values.length===a?o.values.push(t[a]):l.push({at:a,values:[t[a]]})}const A=r.filter((a,o)=>!f.includes(o)),m=new Map;for(let a=0;a<A.length;a++)m.set(e(A[a]),a);const d=t.filter((a,o)=>!h.includes(o));for(let a=0;a<d.length;a++){const o=e(d[a]),i=m.get(o);if(i==null||a===i)continue;const O=e(A[a]);m.delete(O),u.push({from:a,to:i})}return n},Q=(r,t)=>{const e=[...t];for(const{at:n,qt:s}of r.removals)e.splice(n,s);for(const{from:n,to:s}of r.swaps){const l=e[s];e[s]=e[n],e[n]=l}for(const n of r.inserts)e.splice(n.at,0,...n.values);return e},U=(r,t=" and ",e=", ")=>r.length===0?"":r.length===1?String(r[0]):`${r.slice(0,-1).join(e)}${t}${String(r[r.length-1])}`,X=(r,t,e=!0)=>{const n=r.map((c,f)=>[c,f]);n.sort((c,f)=>t(c[0],f[0]));const s=new Array(n.length);let l=0,u=n[0][0];for(let c=0;c<n.length;c++){const[f,y]=n[c];t(f,u)!==0&&(l=c,u=f),s[y]=l,e&&l++}return s};exports.allElements=D;exports.anyElement=_;exports.applyArrayDiffOperations=Q;exports.areArraysEqual=P;exports.arrayDiffOperations=J;exports.arrayHasValues=j;exports.arrayHead=w;exports.arrayOfIterableIterator=G;exports.arrayTail=B;exports.compareArrays=N;exports.concatArrays=H;exports.createFilledArray=L;exports.filterArray=g;exports.filterMapArray=M;exports.filterNullsFromArray=I;exports.flatMapArray=F;exports.flattenArray=S;exports.foldLeftArray=k;exports.forEachElement=T;exports.generateArray=p;exports.generateSequenceArray=C;exports.isArrayEmpty=b;exports.joinArrayWithConjunction=U;exports.mapArray=x;exports.rankArray=X;exports.removeAllFromArray=R;exports.removeAllFromArrayByPredicate=z;exports.removeOneFromArray=v;exports.removeOneFromArrayByPredicate=E;exports.sortArray=$;exports.uniqueByPrimitive=W;exports.uniquePrimitives=V;

package/array.d.ts

@@ -10,7 +10,7 @@ import { Compare, Maybe, Nothing, Primitive } from './domain';
  * @returns The new array with the results of applying the function to each element.
  * @public
  */
-export declare function mapArray<A, B>(arr: A[], f: (a: A, index: number) => B): B[];
+export declare const mapArray: <A, B>(arr: A[], f: (a: A, index: number) => B) => B[];
 /**
  * Applies a mapping function to each element of an array and flattens the result.
  *
@@ -21,7 +21,7 @@ export declare function mapArray<A, B>(arr: A[], f: (a: A, index: number) => B):
  * @typeParam B - The type of the elements in the resulting flattened array.
  * @public
  */
-export declare function flatMapArray<A, B>(arr: A[], f: (a: A) => B[]): B[];
+export declare const flatMapArray: <A, B>(arr: A[], f: (a: A) => B[]) => B[];
 /**
  * Returns the first element of an array, or `undefined` if the array is empty.
  *
@@ -30,7 +30,7 @@ export declare function flatMapArray<A, B>(arr: A[], f: (a: A) => B[]): B[];
  * @typeParam A - The type of elements in the array.
  * @public
  */
-export declare function arrayHead<A>(arr: A[]): Maybe<A>;
+export declare const arrayHead: <A>(arr: A[]) => Maybe<A>;
 /**
  * Returns a new array containing all elements of the input array except for the first element.
  *
@@ -38,7 +38,7 @@ export declare function arrayHead<A>(arr: A[]): Maybe<A>;
  * @returns A new array containing all elements of the input array except for the first element.
  * @public
  */
-export declare function arrayTail<A>(arr: A[]): A[];
+export declare const arrayTail: <A>(arr: A[]) => A[];
 /**
  * Checks if two arrays are equal based on a custom equality function.
  *
@@ -49,7 +49,7 @@ export declare function arrayTail<A>(arr: A[]): A[];
  * @returns Returns `true` if the arrays are equal, `false` otherwise.
  * @public
  */
-export declare function areArraysEqual<T>(a: T[], b: T[], equality: (a: T, b: T) => boolean): boolean;
+export declare const areArraysEqual: <T>(a: T[], b: T[], equality: (a: T, b: T) => boolean) => boolean;
 /**
  * Checks if an array is empty.
  *
@@ -57,7 +57,7 @@ export declare function areArraysEqual<T>(a: T[], b: T[], equality: (a: T, b: T)
  * @returns `true` if the array is empty, `false` otherwise.
  * @public
  */
-export declare function isArrayEmpty<T>(arr: T[]): arr is [];
+export declare const isArrayEmpty: <T>(arr: T[]) => arr is [];
 /**
  * Checks if an array has values.
  *
@@ -65,7 +65,7 @@ export declare function isArrayEmpty<T>(arr: T[]): arr is [];
  * @returns `true` if the array has values, `false` otherwise.
  * @public
  */
-export declare function arrayHasValues<T>(arr: T[]): arr is [T, ...T[]];
+export declare const arrayHasValues: <T>(arr: T[]) => arr is [T, ...T[]];
 /**
  * Filters the elements of an array based on a predicate function.
  *
@@ -75,7 +75,7 @@ export declare function arrayHasValues<T>(arr: T[]): arr is [T, ...T[]];
  * @returns The filtered array.
  * @public
  */
-export declare function filterArray<T>(arr: T[], predicate: (v: T) => boolean): T[];
+export declare const filterArray: <T>(arr: T[], predicate: (v: T) => boolean) => T[];
 /**
  * Applies a mapping function to each element of an array and returns a new array
  * containing the mapped values, excluding any `null` or `undefined` values.
@@ -87,7 +87,7 @@ export declare function filterArray<T>(arr: T[], predicate: (v: T) => boolean):
  * @returns The new array containing the mapped values.
  * @public
  */
-export declare function filterMapArray<A, B>(arr: A[], f: (a: A, index: number) => Maybe<B>): B[];
+export declare const filterMapArray: <A, B>(arr: A[], f: (a: A, index: number) => Maybe<B>) => B[];
 /**
  * Filters out null and undefined values from an array.
  *
@@ -96,7 +96,7 @@ export declare function filterMapArray<A, B>(arr: A[], f: (a: A, index: number)
  * @returns The filtered array.
  * @public
  */
-export declare function filterNullsFromArray<T>(arr: Array<T | Nothing>): T[];
+export declare const filterNullsFromArray: <T>(arr: Array<T | Nothing>) => T[];
 /**
  * Flattens a two-dimensional array into a one-dimensional array.
  *
@@ -105,7 +105,7 @@ export declare function filterNullsFromArray<T>(arr: Array<T | Nothing>): T[];
  * @typeParam T - The type of elements in the array.
  * @public
  */
-export declare function flattenArray<T>(arr: T[][]): T[];
+export declare const flattenArray: <T>(arr: T[][]) => T[];
 /**
  * Applies a function to each element of an array, accumulating the result from left to right.
  *
@@ -117,7 +117,7 @@ export declare function flattenArray<T>(arr: T[][]): T[];
  * @returns The accumulated result.
  * @public
  */
-export declare function foldLeftArray<T, B>(arr: T[], f: (acc: B, curr: T) => B, b: B): B;
+export declare const foldLeftArray: <T, B>(arr: T[], f: (acc: B, curr: T) => B, b: B) => B;
 /**
  * Checks if all elements in an array satisfy a given predicate.
  *
@@ -127,7 +127,7 @@ export declare function foldLeftArray<T, B>(arr: T[], f: (acc: B, curr: T) => B,
  * @typeParam T - The type of elements in the array.
  * @public
  */
-export declare function allElements<T>(arr: T[], predicate: (v: T) => boolean): boolean;
+export declare const allElements: <T>(arr: T[], predicate: (v: T) => boolean) => boolean;
 /**
  * Checks if any element in the array satisfies the given predicate.
  *
@@ -137,7 +137,7 @@ export declare function allElements<T>(arr: T[], predicate: (v: T) => boolean):
  * @typeParam T - The type of elements in the array.
  * @public
  */
-export declare function anyElement<T>(arr: T[], predicate: (v: T) => boolean): boolean;
+export declare const anyElement: <T>(arr: T[], predicate: (v: T) => boolean) => boolean;
 /**
  * Applies a function to each element in an array.
  *
@@ -146,7 +146,7 @@ export declare function anyElement<T>(arr: T[], predicate: (v: T) => boolean): b
  * @param f - The function to apply to each element.
  * @public
  */
-export declare function forEachElement<T>(arr: T[], f: (v: T) => void): void;
+export declare const forEachElement: <T>(arr: T[], f: (v: T) => void) => void;
 /**
  * Concatenates multiple arrays into a single array.
  *
@@ -155,7 +155,7 @@ export declare function forEachElement<T>(arr: T[], f: (v: T) => void): void;
  * @typeParam A - The type of elements in the arrays.
  * @public
  */
-export declare function concatArrays<A>(...arrs: A[][]): A[];
+export declare const concatArrays: <A>(...arrs: A[][]) => A[];
 /**
  * Compares two arrays based on their lengths and element values.
  *
@@ -163,11 +163,11 @@ export declare function concatArrays<A>(...arrs: A[][]): A[];
  * @param a - The first array to compare.
  * @param b - The second array to compare.
  * @param comparef - The compare function to use for comparing the elements of the arrays.
- * @param shorterFirst - Optional. Specifies whether shorter arrays should be considered smaller. Defaults to true.
+ * @param shorterFirst - Specifies whether shorter arrays should be considered smaller. Defaults to true.
  * @returns A compare function that can be used to compare arrays.
  * @public
  */
-export declare function compareArrays<A>(a: A[], b: A[], comparef: Compare<A>, shorterFirst?: boolean): number;
+export declare const compareArrays: <A>(a: A[], b: A[], comparef: Compare<A>, shorterFirst?: boolean) => number;
 /**
  * Sorts an array in place using the provided compare function.
  *
@@ -177,7 +177,7 @@ export declare function compareArrays<A>(a: A[], b: A[], comparef: Compare<A>, s
  * @returns The sorted array.
  * @public
  */
-export declare function sortArray<A>(arr: A[], compare: Compare<A>): A[];
+export declare const sortArray: <A>(arr: A[], compare: Compare<A>) => A[];
 /**
  * Generates an array of values by applying a function to each index.
  *
@@ -186,7 +186,7 @@ export declare function sortArray<A>(arr: A[], compare: Compare<A>): A[];
  * @returns An array of values generated by applying the function to each index.
  * @public
  */
-export declare function generateArray<A>(length: number, f: (index: number) => A): A[];
+export declare const generateArray: <A>(length: number, f: (index: number) => A) => A[];
 /**
  * Generates an array of numbers in a specified range.
  *
@@ -195,7 +195,7 @@ export declare function generateArray<A>(length: number, f: (index: number) => A
  * @returns An array of numbers in the specified range.
  * @public
  */
-export declare function generateSequenceArray(length: number, startAt?: number): number[];
+export declare const generateSequenceArray: (length: number, startAt?: number) => number[];
 /**
  * Creates a new array with the specified length and fills it with the provided value.
  *
@@ -205,7 +205,7 @@ export declare function generateSequenceArray(length: number, startAt?: number):
  * @returns A new array filled with the specified value.
  * @public
  */
-export declare function createFilledArray<A>(length: number, value: A): A[];
+export declare const createFilledArray: <A>(length: number, value: A) => A[];
 /**
  * Returns an array containing only the distinct primitive values from the input array.
  *
@@ -214,7 +214,7 @@ export declare function createFilledArray<A>(length: number, value: A): A[];
  * @returns An array containing only the distinct primitive values from the input array.
  * @public
  */
-export declare function uniquePrimitives<T extends Primitive>(values: T[]): T[];
+export declare const uniquePrimitives: <T extends Primitive>(values: T[]) => T[];
 /**
  * Returns an array of distinct elements from the input array based on the provided predicate.
  *
@@ -224,7 +224,7 @@ export declare function uniquePrimitives<T extends Primitive>(values: T[]): T[];
  * @returns An array of distinct elements.
  * @public
  */
-export declare function uniqueByPredicate<T>(values: T[], predicate: (a: T) => string): T[];
+export declare const uniqueByPrimitive: <T>(values: T[], predicate: (a: T) => string | number | symbol) => T[];
 /**
  * Removes the first occurrence of an item from an array.
  *
@@ -234,7 +234,7 @@ export declare function uniqueByPredicate<T>(values: T[], predicate: (a: T) => s
  * @returns `true` if the item was found and removed, `false` otherwise.
  * @public
  */
-export declare function removeOneFromArray<A>(arr: A[], item: A): boolean;
+export declare const removeOneFromArray: <A>(arr: A[], item: A) => boolean;
 /**
  * Removes all occurrences of an item from an array.
  *
@@ -244,7 +244,7 @@ export declare function removeOneFromArray<A>(arr: A[], item: A): boolean;
  * @returns `true` if at least one occurrence was found and removed, `false` otherwise.
  * @public
  */
-export declare function removeAllFromArray<A>(arr: A[], item: A): boolean;
+export declare const removeAllFromArray: <A>(arr: A[], item: A) => boolean;
 /**
  * Removes the first occurrence in an array that satisfy the given predicate.
  *
@@ -254,7 +254,7 @@ export declare function removeAllFromArray<A>(arr: A[], item: A): boolean;
  * @returns `true` if at least one element was removed, `false` otherwise.
  * @public
  */
-export declare function removeOneFromArrayByPredicate<A>(arr: A[], predicate: (a: A) => boolean): boolean;
+export declare const removeOneFromArrayByPredicate: <A>(arr: A[], predicate: (a: A) => boolean) => boolean;
 /**
  * Removes all occurrences in an array that satisfy the given predicate.
  *
@@ -264,7 +264,7 @@ export declare function removeOneFromArrayByPredicate<A>(arr: A[], predicate: (a
  * @returns `true` if at least one element was removed, `false` otherwise.
  * @public
  */
-export declare function removeAllFromArrayByPredicate<A>(arr: A[], predicate: (a: A) => boolean): boolean;
+export declare const removeAllFromArrayByPredicate: <A>(arr: A[], predicate: (a: A) => boolean) => boolean;
 /**
  * Converts an IterableIterator to an array.
  *
@@ -272,13 +272,13 @@ export declare function removeAllFromArrayByPredicate<A>(arr: A[], predicate: (a
  * @returns An array containing the values from the IterableIterator.
  * @public
  */
-export declare function arrayOfIterableIterator<A>(it: IterableIterator<A>): A[];
+export declare const arrayOfIterableIterator: <A>(it: IterableIterator<A>) => A[];
 /**
  * Represents the different operations that can be performed on an array.
  *
  * @public
  */
-export interface ArrayDiffOperations<T> {
+export type ArrayDiffOperations<T> = {
     removals: Array<{
         at: number;
         qt: number;
@@ -291,7 +291,7 @@ export interface ArrayDiffOperations<T> {
         at: number;
         values: T[];
     }>;
-}
+};
 /**
  * Calculates the difference operations between two arrays based on a key function.
  *
@@ -303,7 +303,7 @@ export interface ArrayDiffOperations<T> {
  * @returns The difference operations between the two arrays.
  * @public
  */
-export declare function arrayDiffOperations<T, K>(from: T[], to: T[], getKey: (v: T) => K): ArrayDiffOperations<T>;
+export declare const arrayDiffOperations: <T, K>(from: T[], to: T[], getKey: (v: T) => K) => ArrayDiffOperations<T>;
 /**
  * Applies a series of operations to an array and returns the modified array.
  *
@@ -313,7 +313,7 @@ export declare function arrayDiffOperations<T, K>(from: T[], to: T[], getKey: (v
  * @returns The modified array after applying the operations.
  * @public
  */
-export declare function applyArrayDiffOperations<T>(operations: ArrayDiffOperations<T>, start: T[]): T[];
+export declare const applyArrayDiffOperations: <T>(operations: ArrayDiffOperations<T>, start: T[]) => T[];
 /**
  * Joins an array of values into a string using a conjunction and separator.
  *
@@ -323,7 +323,7 @@ export declare function applyArrayDiffOperations<T>(operations: ArrayDiffOperati
  * @returns The joined string.
  * @public
  */
-export declare function joinArrayWithConjunction<A>(arr: A[], conjunction?: string, separator?: string): string;
+export declare const joinArrayWithConjunction: <A>(arr: A[], conjunction?: string, separator?: string) => string;
 /**
  * Assigns ranks to the elements in the array based on the provided compare function.
  * The ranks are assigned in ascending order, with the lowest value receiving a rank of 0.
@@ -336,4 +336,4 @@ export declare function joinArrayWithConjunction<A>(arr: A[], conjunction?: stri
  * @returns An array of ranks corresponding to the elements in the input array.
  * @public
  */
-export declare function rankArray<T>(array: T[], compare: (a: T, b: T) => number, incrementDuplicates?: boolean): number[];
+export declare const rankArray: <T>(array: T[], compare: (a: T, b: T) => number, incrementDuplicates?: boolean) => number[];

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,
@@ -214,6 +155,6 @@ export {
   E as removeOneFromArray,
   w as removeOneFromArrayByPredicate,
   C as sortArray,
-  W as uniqueByPredicate,
+  W as uniqueByPrimitive,
   V as uniquePrimitives
 };

package/async-result.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s={notAsked:{type:"NotAsked"},loading(e=void 0){return{type:"Loading",previousValue:e}},success(e){return{type:"AsyncSuccess",value:e}},failure(e){return{type:"AsyncFailure",error:e}},isSuccess(e){return e.type==="AsyncSuccess"},isFailure(e){return e.type==="AsyncFailure"},isNotAsked(e){return e.type==="NotAsked"},isLoading(e){return e.type==="Loading"},getOrElse(e,u){return s.isSuccess(e)?e.value:u},getOrElseLazy(e,u){return s.isSuccess(e)?e.value:u()},getOrNull(e){return s.isSuccess(e)?e.value:null},getOrUndefined(e){return s.isSuccess(e)?e.value:void 0},match:(e,{success:u,failure:r,loading:t,notAsked:i=t})=>s.isSuccess(e)?u(e.value):s.isFailure(e)?r(e.error):s.isNotAsked(e)?i():t(e.previousValue),whenSuccess:(e,u)=>(s.isSuccess(e)&&u(e.value),e),whenFailure:(e,u)=>(s.isFailure(e)&&u(e.error),e)};exports.AsyncResult=s;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u={notAsked:{type:"NotAsked"},loading(e=void 0){return{type:"Loading",previousValue:e}},success(e){return{type:"AsyncSuccess",value:e}},failure(e){return{type:"AsyncFailure",error:e}},isSuccess(e){return e.type==="AsyncSuccess"},isFailure(e){return e.type==="AsyncFailure"},isNotAsked(e){return e.type==="NotAsked"},isLoading(e){return e.type==="Loading"},getOrElse(e,s){return u.isSuccess(e)?e.value:s},getOrElseLazy(e,s){return u.isSuccess(e)?e.value:s()},getOrNull(e){return u.isSuccess(e)?e.value:null},getOrUndefined(e){return u.isSuccess(e)?e.value:void 0},getUnsafe:e=>{if(u.isSuccess(e))return e.value;throw u.isFailure(e)?e.error:new Error("Cannot get value from a not-asked or loading result")},match:(e,{success:s,failure:r,loading:t,notAsked:l=t})=>u.isSuccess(e)?s(e.value):u.isFailure(e)?r(e.error):u.isNotAsked(e)?l():t(e.previousValue),whenSuccess:(e,s)=>(u.isSuccess(e)&&s(e.value),e),whenFailure:(e,s)=>(u.isFailure(e)&&s(e.error),e),equals:(e,s,r={valueEquals:(t,l)=>t===l,errorEquals:(t,l)=>t===l})=>e.type==="AsyncSuccess"&&s.type==="AsyncSuccess"?r.valueEquals(e.value,s.value):e.type==="AsyncFailure"&&s.type==="AsyncFailure"?r.errorEquals(e.error,s.error):e.type==="Loading"&&s.type==="Loading"?r.valueEquals(e.previousValue,s.previousValue):e.type==="NotAsked"&&s.type==="NotAsked",all:e=>{const s=[];for(const r of e)if(u.isSuccess(r))s.push(r.value);else return r;return u.success(s)}};exports.AsyncResult=u;