@tempots/std 0.12.0 → 0.14.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.uniqueByPredicate=W;exports.uniquePrimitives=V;

package/array.d.ts

@@ -8,10 +8,9 @@ import { Compare, Maybe, Nothing, Primitive } from './domain';
  * @param arr - The input array.
  * @param f - The function to apply to each element.
  * @returns The new array with the results of applying the function to each element.
- * @category manipulation
  * @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.
  *
@@ -20,29 +19,26 @@ export declare function mapArray<A, B>(arr: A[], f: (a: A, index: number) => B):
  * @returns A new array with the flattened result of applying the mapping function to each element of the input array.
  * @typeParam A - The type of the elements in the input array.
  * @typeParam B - The type of the elements in the resulting flattened array.
- * @category manipulation
  * @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.
  *
  * @param arr - The input array.
  * @returns The first element of the array, or `undefined` if the array is empty.
  * @typeParam A - The type of elements in the array.
- * @category access
  * @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.
  *
  * @param arr - The input array.
  * @returns A new array containing all elements of the input array except for the first element.
- * @category access
  * @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.
  *
@@ -51,28 +47,25 @@ export declare function arrayTail<A>(arr: A[]): A[];
  * @param b - The second array.
  * @param equality - The custom equality function to compare elements.
  * @returns Returns `true` if the arrays are equal, `false` otherwise.
- * @category comparison
  * @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.
  *
  * @param arr - The array to check.
  * @returns `true` if the array is empty, `false` otherwise.
- * @category query
  * @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.
  *
  * @param arr - The array to check.
  * @returns `true` if the array has values, `false` otherwise.
- * @category query
  * @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.
  *
@@ -80,10 +73,9 @@ export declare function arrayHasValues<T>(arr: T[]): arr is [T, ...T[]];
  * @param arr - The array to filter.
  * @param predicate - The predicate function used to filter the elements.
  * @returns The filtered array.
- * @category manipulation
  * @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.
@@ -93,30 +85,27 @@ export declare function filterArray<T>(arr: T[], predicate: (v: T) => boolean):
  * @param arr - The input array.
  * @param f - The mapping function to apply to each element.
  * @returns The new array containing the mapped values.
- * @category manipulation
  * @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.
  *
  * @typeParam T - The type of elements in the array.
  * @param arr - The array to filter.
  * @returns The filtered array.
- * @category manipulation
  * @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.
  *
  * @param arr - The two-dimensional array to flatten.
  * @returns The flattened one-dimensional array.
  * @typeParam T - The type of elements in the array.
- * @category manipulation
  * @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.
  *
@@ -126,10 +115,9 @@ export declare function flattenArray<T>(arr: T[][]): T[];
  * @param f - The function to apply to each element.
  * @param b - The initial value of the accumulator.
  * @returns The accumulated result.
- * @category manipulation
  * @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.
  *
@@ -137,10 +125,9 @@ export declare function foldLeftArray<T, B>(arr: T[], f: (acc: B, curr: T) => B,
  * @param predicate - The predicate function to apply to each element.
  * @returns `true` if all elements satisfy the predicate, `false` otherwise.
  * @typeParam T - The type of elements in the array.
- * @category query
  * @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.
  *
@@ -148,30 +135,27 @@ export declare function allElements<T>(arr: T[], predicate: (v: T) => boolean):
  * @param predicate - The predicate function to apply to each element.
  * @returns `true` if any element satisfies the predicate, `false` otherwise.
  * @typeParam T - The type of elements in the array.
- * @category query
  * @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.
  *
  * @typeParam T - The type of elements in the array.
  * @param arr - The array to iterate over.
  * @param f - The function to apply to each element.
- * @category effect
  * @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.
  *
  * @param arrs - The arrays to concatenate.
  * @returns The concatenated array.
  * @typeParam A - The type of elements in the arrays.
- * @category manipulation
  * @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.
  *
@@ -179,12 +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.
- * @category comparison
  * @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.
  *
@@ -192,30 +175,27 @@ export declare function compareArrays<A>(a: A[], b: A[], comparef: Compare<A>, s
  * @param arr - The array to be sorted.
  * @param compare - The compare function used to determine the order of the elements.
  * @returns The sorted array.
- * @category manipulation
  * @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.
  *
  * @param length - The length of the resulting array.
  * @param f - The function to apply to each index. It takes the index as a parameter and returns the corresponding value.
  * @returns An array of values generated by applying the function to each index.
- * @category creation
  * @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.
  *
  * @param length - The length of the array to generate.
  * @param startAt - The starting value of the range. Default is 0.
  * @returns An array of numbers in the specified range.
- * @category creation
  * @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.
  *
@@ -223,20 +203,18 @@ export declare function generateSequenceArray(length: number, startAt?: number):
  * @param length - The length of the new array.
  * @param value - The value to fill the array with.
  * @returns A new array filled with the specified value.
- * @category creation
  * @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.
  *
  * @typeParam T - The type of the input array elements.
  * @param values - The input array.
  * @returns An array containing only the distinct primitive values from the input array.
- * @category manipulation
  * @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.
  *
@@ -244,10 +222,9 @@ export declare function uniquePrimitives<T extends Primitive>(values: T[]): T[];
  * @param values - The input array.
  * @param predicate - The predicate function used to determine uniqueness.
  * @returns An array of distinct elements.
- * @category manipulation
  * @public
  */
-export declare function uniqueByPredicate<T>(values: T[], predicate: (a: T) => string): T[];
+export declare const uniqueByPredicate: <T>(values: T[], predicate: (a: T) => string) => T[];
 /**
  * Removes the first occurrence of an item from an array.
  *
@@ -255,10 +232,9 @@ export declare function uniqueByPredicate<T>(values: T[], predicate: (a: T) => s
  * @param arr - The array from which to remove the item.
  * @param item - The item to remove from the array.
  * @returns `true` if the item was found and removed, `false` otherwise.
- * @category mutation
  * @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.
  *
@@ -266,10 +242,9 @@ export declare function removeOneFromArray<A>(arr: A[], item: A): boolean;
  * @param arr - The array from which to remove the item.
  * @param item - The item to remove from the array.
  * @returns `true` if at least one occurrence was found and removed, `false` otherwise.
- * @category mutation
  * @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.
  *
@@ -277,10 +252,9 @@ export declare function removeAllFromArray<A>(arr: A[], item: A): boolean;
  * @param arr - The array from which elements will be removed.
  * @param predicate - The predicate function used to determine which elements to remove.
  * @returns `true` if at least one element was removed, `false` otherwise.
- * @category mutation
  * @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.
  *
@@ -288,25 +262,23 @@ export declare function removeOneFromArrayByPredicate<A>(arr: A[], predicate: (a
  * @param arr - The array from which elements will be removed.
  * @param predicate - The predicate function used to determine which elements to remove.
  * @returns `true` if at least one element was removed, `false` otherwise.
- * @category mutation
  * @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.
  *
  * @param it - The IterableIterator to convert.
  * @returns An array containing the values from the IterableIterator.
- * @category creation
  * @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;
@@ -319,7 +291,7 @@ export interface ArrayDiffOperations<T> {
         at: number;
         values: T[];
     }>;
-}
+};
 /**
  * Calculates the difference operations between two arrays based on a key function.
  *
@@ -329,10 +301,9 @@ export interface ArrayDiffOperations<T> {
  * @param to - The target array.
  * @param getKey - The key function used to compare elements.
  * @returns The difference operations between the two arrays.
- * @category manipulation
  * @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.
  *
@@ -340,10 +311,9 @@ export declare function arrayDiffOperations<T, K>(from: T[], to: T[], getKey: (v
  * @param operations - The operations to apply.
  * @param start - The initial array.
  * @returns The modified array after applying the operations.
- * @category manipulation
  * @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.
  *
@@ -351,10 +321,9 @@ export declare function applyArrayDiffOperations<T>(operations: ArrayDiffOperati
  * @param conjunction - The conjunction to use between the second-to-last and last value. Default is ' and '.
  * @param separator - The separator to use between each value. Default is ', '.
  * @returns The joined string.
- * @category transformation
  * @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.
@@ -365,7 +334,6 @@ export declare function joinArrayWithConjunction<A>(arr: A[], conjunction?: stri
  * @param compare - The compare function used to determine the order of elements.
  * @param incrementDuplicates - Whether to increment the rank of duplicate values.
  * @returns An array of ranks corresponding to the elements in the input array.
- * @category transformation
  * @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[];