ts-data-forge 3.2.0 → 3.3.1

package/dist/array/impl/array-utils-reducing-value.mjs

@@ -0,0 +1,160 @@
+import '../../collections/imap-mapped.mjs';
+import { IMap } from '../../collections/imap.mjs';
+import '../../collections/iset-mapped.mjs';
+import '../../collections/iset.mjs';
+import { isString, isUndefined } from '../../guard/is-type.mjs';
+import { Optional } from '../../functional/optional.mjs';
+import { Result } from '../../functional/result.mjs';
+import '../../number/branded-types/finite-number.mjs';
+import '../../number/branded-types/int.mjs';
+import '../../number/branded-types/int16.mjs';
+import '../../number/branded-types/int32.mjs';
+import '../../number/branded-types/non-negative-finite-number.mjs';
+import '../../number/branded-types/non-negative-int16.mjs';
+import '../../number/branded-types/non-negative-int32.mjs';
+import '../../number/branded-types/non-zero-finite-number.mjs';
+import '../../number/branded-types/non-zero-int.mjs';
+import '../../number/branded-types/non-zero-int16.mjs';
+import '../../number/branded-types/non-zero-int32.mjs';
+import '../../number/branded-types/non-zero-safe-int.mjs';
+import '../../number/branded-types/non-zero-uint16.mjs';
+import '../../number/branded-types/non-zero-uint32.mjs';
+import '../../number/branded-types/positive-finite-number.mjs';
+import '../../number/branded-types/positive-int.mjs';
+import '../../number/branded-types/positive-int16.mjs';
+import '../../number/branded-types/positive-int32.mjs';
+import '../../number/branded-types/positive-safe-int.mjs';
+import '../../number/branded-types/positive-uint16.mjs';
+import '../../number/branded-types/positive-uint32.mjs';
+import '../../number/branded-types/safe-int.mjs';
+import '../../number/branded-types/safe-uint.mjs';
+import '../../number/branded-types/uint.mjs';
+import '../../number/branded-types/uint16.mjs';
+import { Uint32, asUint32 } from '../../number/branded-types/uint32.mjs';
+import '../../number/enum/int8.mjs';
+import '../../number/enum/uint8.mjs';
+import { Num } from '../../number/num.mjs';
+import '../../number/refined-number-utils.mjs';
+import { unknownToString } from '../../others/unknown-to-string.mjs';
+import { isNonEmpty } from './array-utils-validation.mjs';
+
+function min(array, comparator) {
+    if (!isNonEmpty(array)) {
+        return Optional.none;
+    }
+    const cmp = comparator ?? ((x, y) => Num.from(x) - Num.from(y));
+    return Optional.some(array.reduce((currentMin, curr) => (cmp(curr, currentMin) < 0 ? curr : currentMin), array[0]));
+}
+function max(array, comparator) {
+    const cmp = comparator ?? ((x, y) => Num.from(x) - Num.from(y));
+    // Find max by finding min with an inverted comparator
+    return min(array, (x, y) => -cmp(x, y));
+}
+function minBy(array, comparatorValueMapper, comparator) {
+    return min(array, (x, y) => comparator === undefined
+        ? Num.from(comparatorValueMapper(x)) - Num.from(comparatorValueMapper(y))
+        : comparator(comparatorValueMapper(x), comparatorValueMapper(y)));
+}
+function maxBy(array, comparatorValueMapper, comparator) {
+    return max(array, (x, y) => comparator === undefined
+        ? Num.from(comparatorValueMapper(x)) - Num.from(comparatorValueMapper(y))
+        : comparator(comparatorValueMapper(x), comparatorValueMapper(y)));
+}
+function count(...args) {
+    switch (args.length) {
+        case 2: {
+            const [array, predicate] = args;
+            return array.reduce((acc, curr, index) => predicate(curr, asUint32(index)) ? Uint32.add(acc, 1) : acc, asUint32(0));
+        }
+        case 1: {
+            const [predicate] = args;
+            return (array) => count(array, predicate);
+        }
+    }
+}
+function countBy(...args) {
+    switch (args.length) {
+        case 2: {
+            const [array, grouper] = args;
+            const mut_groups = new Map();
+            for (const [index, e] of array.entries()) {
+                const key = grouper(e, asUint32(index));
+                const curr = mut_groups.get(key) ?? 0;
+                mut_groups.set(key, asUint32(curr + 1));
+            }
+            return IMap.create(mut_groups);
+        }
+        case 1: {
+            const [grouper] = args;
+            return (array) => countBy(array, grouper);
+        }
+    }
+}
+function foldl(...args) {
+    switch (args.length) {
+        case 3: {
+            const [array, callbackfn, initialValue] = args;
+            return array.reduce((prev, curr, index) => callbackfn(prev, curr, asUint32(index)), initialValue);
+        }
+        case 2: {
+            const [callbackfn, initialValue] = args;
+            return (array) => foldl(array, callbackfn, initialValue);
+        }
+    }
+}
+function foldr(...args) {
+    switch (args.length) {
+        case 3: {
+            const [array, callbackfn, initialValue] = args;
+            return array.reduceRight((prev, curr, index) => callbackfn(prev, curr, asUint32(index)), initialValue);
+        }
+        case 2: {
+            const [callbackfn, initialValue] = args;
+            return (array) => foldr(array, callbackfn, initialValue);
+        }
+    }
+}
+function sum(array) {
+    return array.reduce((prev, curr) => prev + curr, 0);
+}
+function join(...args) {
+    switch (args.length) {
+        case 0:
+            return (array) => joinImpl(array, undefined);
+        case 1: {
+            const [arg] = args;
+            if (isString(arg) || isUndefined(arg)) {
+                return (array) => joinImpl(array, arg);
+            }
+            return joinImpl(arg, undefined);
+        }
+        case 2: {
+            const [array, separator] = args;
+            return joinImpl(array, separator);
+        }
+    }
+}
+const joinImpl = (array, separator) => {
+    try {
+        const result = array.join(separator);
+        return Result.ok(result);
+    }
+    catch (error) {
+        return Result.err(Error.isError(error) ? error : new Error(unknownToString(error)));
+    }
+};
+/**
+ * Alias for `foldl`.
+ *
+ * @see {@link foldl}
+ */
+const reduce = foldl;
+/**
+ * Alias for `foldr`.
+ *
+ * @see {@link foldr}
+ */
+const reduceRight = foldr;
+
+export { count, countBy, foldl, foldr, join, max, maxBy, min, minBy, reduce, reduceRight, sum };
+//# sourceMappingURL=array-utils-reducing-value.mjs.map

package/dist/array/impl/array-utils-reducing-value.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-utils-reducing-value.mjs","sources":["../../../src/array/impl/array-utils-reducing-value.mts"],"sourcesContent":[null],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwCM,SAAU,GAAG,CACjB,KAAmB,EACnB,UAAmC,EAAA;AAEnC,IAAA,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE;QACtB,OAAO,QAAQ,CAAC,IAAI;IACtB;IAEA,MAAM,GAAG,GAAG,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAE/D,IAAA,OAAO,QAAQ,CAAC,IAAI,CAClB,KAAK,CAAC,MAAM,CACV,CAAC,UAAU,EAAE,IAAI,MAAM,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,UAAU,CAAC,EACrE,KAAK,CAAC,CAAC,CAAC,CACT,CACF;AACH;AAgCM,SAAU,GAAG,CACjB,KAAmB,EACnB,UAAmC,EAAA;IAEnC,MAAM,GAAG,GAAG,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;AAE/D,IAAA,OAAO,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACzC;SAyCgB,KAAK,CACnB,KAAmB,EACnB,qBAAsC,EACtC,UAAmC,EAAA;AAEnC,IAAA,OAAO,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,KACrB,UAAU,KAAK;AACb,UAAE,GAAG,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC;AACxE,UAAE,UAAU,CAAC,qBAAqB,CAAC,CAAC,CAAC,EAAE,qBAAqB,CAAC,CAAC,CAAC,CAAC,CACnE;AACH;SAyCgB,KAAK,CACnB,KAAmB,EACnB,qBAAsC,EACtC,UAAmC,EAAA;AAEnC,IAAA,OAAO,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,KACrB,UAAU,KAAK;AACb,UAAE,GAAG,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC;AACxE,UAAE,UAAU,CAAC,qBAAqB,CAAC,CAAC,CAAC,EAAE,qBAAqB,CAAC,CAAC,CAAC,CAAC,CACnE;AACH;AA0BM,SAAU,KAAK,CACnB,GAAG,IAKiE,EAAA;AAEpE,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,GAAG,IAAI;AAC/B,YAAA,OAAO,KAAK,CAAC,MAAM,CACjB,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,KACf,SAAS,CAAC,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,GAAG,EAC7D,QAAQ,CAAC,CAAC,CAAC,CACZ;QACH;QACA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,SAAS,CAAC,GAAG,IAAI;YACxB,OAAO,CAAC,KAAK,KAAK,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC;QAC3C;;AAEJ;AA6BM,SAAU,OAAO,CACrB,GAAG,IAKyD,EAAA;AAE5D,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,IAAI;AAC7B,YAAA,MAAM,UAAU,GAAG,IAAI,GAAG,EAAmB;AAE7C,YAAA,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE;gBACxC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;gBACvC,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;AAErC,gBAAA,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;YACzC;AAEA,YAAA,OAAO,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC;QAChC;QACA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,OAAO,CAAC,GAAG,IAAI;YACtB,OAAO,CAAC,KAAK,KAAK,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC;QAC3C;;AAEJ;AAuCM,SAAU,KAAK,CACnB,GAAG,IAiBE,EAAA;AAEL,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;YACN,MAAM,CAAC,KAAK,EAAE,UAAU,EAAE,YAAY,CAAC,GAAG,IAAI;YAC9C,OAAO,KAAK,CAAC,MAAM,CACjB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,KAAK,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAC9D,YAAY,CACb;QACH;QACA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,UAAU,EAAE,YAAY,CAAC,GAAG,IAAI;AACvC,YAAA,OAAO,CAAC,KAAK,KAAK,KAAK,CAAC,KAAK,EAAE,UAAU,EAAE,YAAY,CAAC;QAC1D;;AAEJ;AAuCM,SAAU,KAAK,CACnB,GAAG,IAiBE,EAAA;AAEL,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;YACN,MAAM,CAAC,KAAK,EAAE,UAAU,EAAE,YAAY,CAAC,GAAG,IAAI;YAC9C,OAAO,KAAK,CAAC,WAAW,CACtB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,KAAK,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAC9D,YAAY,CACb;QACH;QACA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,UAAU,EAAE,YAAY,CAAC,GAAG,IAAI;AACvC,YAAA,OAAO,CAAC,KAAK,KAAK,KAAK,CAAC,KAAK,EAAE,UAAU,EAAE,YAAY,CAAC;QAC1D;;AAEJ;AA4BM,SAAU,GAAG,CAAC,KAAwB,EAAA;AAC1C,IAAA,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,IAAI,KAAK,IAAI,GAAG,IAAI,EAAE,CAAC,CAAC;AACrD;AA0BM,SAAU,IAAI,CAClB,GAAG,IAE8B,EAAA;AAEjC,IAAA,QAAQ,IAAI,CAAC,MAAM;AACjB,QAAA,KAAK,CAAC;YACJ,OAAO,CAAC,KAAK,KAAK,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC;QAE9C,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI;YAClB,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE;gBACrC,OAAO,CAAC,KAAK,KAAK,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC;YACxC;AACA,YAAA,OAAO,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;QACjC;QACA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,GAAG,IAAI;AAC/B,YAAA,OAAO,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC;QACnC;;AAEJ;AAEA,MAAM,QAAQ,GAAG,CACf,KAAmB,EACnB,SAA6B,KACJ;AACzB,IAAA,IAAI;QACF,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC;AACpC,QAAA,OAAO,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC;IAC1B;IAAE,OAAO,KAAK,EAAE;QACd,OAAO,MAAM,CAAC,GAAG,CACf,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,IAAI,KAAK,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CACjE;IACH;AACF,CAAC;AAED;;;;AAIG;AACI,MAAM,MAAM,GAAG;AAEtB;;;;AAIG;AACI,MAAM,WAAW,GAAG;;;;"}

package/dist/array/impl/array-utils-search.d.mts

@@ -0,0 +1,179 @@
+import { Optional } from '../../functional/index.mjs';
+/**
+ * Finds the first element that satisfies a predicate.
+ *
+ * @example
+ *
+ * ```ts
+ * const users = [
+ *   { id: 1, name: 'Ada' },
+ *   { id: 2, name: 'Grace' },
+ * ];
+ *
+ * const found = Arr.find(users, (user) => user.id === 2);
+ * const missing = Arr.find<{ id: number }>((user) => user.id === 3)(users);
+ *
+ * assert.deepStrictEqual(found, Optional.some({ id: 2, name: 'Grace' }));
+ * assert.deepStrictEqual(missing, Optional.none);
+ * ```
+ */
+export declare function find<E, F extends E>(array: readonly E[], predicate: (value: E, index: SizeType.Arr, arr: readonly E[]) => value is F): Optional<F>;
+export declare function find<const Ar extends readonly unknown[]>(array: Ar, predicate: (value: Ar[number], index: ArrayIndex<Ar>, arr: Ar) => boolean): Optional<Ar[number]>;
+export declare function find<E>(predicate: (value: E, index: SizeType.Arr, arr: readonly E[]) => boolean): (array: readonly E[]) => Optional<E>;
+/**
+ * Finds the last element that satisfies a predicate.
+ *
+ * @example
+ *
+ * ```ts
+ * const numbers = [1, 3, 2, 4, 5];
+ *
+ * const lastEven = Arr.findLast(numbers, (n) => n % 2 === 0);
+ * const none = Arr.findLast<number>((n) => n > 10)(numbers);
+ *
+ * assert.deepStrictEqual(lastEven, Optional.some(4));
+ * assert.deepStrictEqual(none, Optional.none);
+ * ```
+ */
+export declare function findLast<E, F extends E>(array: readonly E[], predicate: (value: E, index: SizeType.Arr, arr: readonly E[]) => value is F): Optional<F>;
+export declare function findLast<const Ar extends readonly unknown[]>(array: Ar, predicate: (value: Ar[number], index: ArrayIndex<Ar>, arr: Ar) => boolean): Optional<Ar[number]>;
+export declare function findLast<E>(predicate: (value: E, index: SizeType.Arr, arr: readonly E[]) => boolean): (array: readonly E[]) => Optional<E>;
+/**
+ * Finds the index of the first element that satisfies a predicate.
+ *
+ * @example
+ *
+ * ```ts
+ * const letters = ['a', 'b', 'c'];
+ *
+ * const indexOfB = Arr.findIndex(letters, (letter) => letter === 'b');
+ * // eslint-disable-next-line unicorn/prefer-array-index-of
+ * const indexOfMissing = Arr.findIndex<string>((letter) => letter === 'z')(
+ *   letters,
+ * );
+ *
+ * assert(indexOfB === 1);
+ * assert(indexOfMissing === -1);
+ * ```
+ */
+export declare function findIndex<const Ar extends readonly unknown[]>(array: Ar, predicate: (value: Ar[number], index: ArrayIndex<Ar>, arr: Ar) => boolean): ArrayIndex<Ar> | -1;
+export declare function findIndex<E>(predicate: (value: E, index: SizeType.Arr, arr: readonly E[]) => boolean): (array: readonly E[]) => SizeType.Arr | -1;
+/**
+ * Finds the index of the last element that satisfies a predicate.
+ *
+ * @example
+ *
+ * ```ts
+ * const letters = ['a', 'b', 'c', 'b'];
+ *
+ * const lastIndexOfB = Arr.findLastIndex(letters, (letter) => letter === 'b');
+ * // eslint-disable-next-line unicorn/prefer-array-index-of
+ * const notFound = Arr.findLastIndex<string>((letter) => letter === 'z')(letters);
+ *
+ * assert(lastIndexOfB === 3);
+ * assert(notFound === -1);
+ * ```
+ */
+export declare function findLastIndex<const Ar extends readonly unknown[]>(array: Ar, predicate: (value: Ar[number], index: ArrayIndex<Ar>, arr: Ar) => boolean): ArrayIndex<Ar> | -1;
+export declare function findLastIndex<E>(predicate: (value: E, index: SizeType.Arr, arr: readonly E[]) => boolean): (array: readonly E[]) => SizeType.Arr | -1;
+/**
+ * Gets the index of a value in an array.
+ *
+ * @example
+ *
+ * ```ts
+ * const fruits = ['apple', 'banana', 'orange', 'banana'];
+ *
+ * const indexOfBanana = Arr.indexOf(fruits, 'banana');
+ * const indexOfGrape = Arr.indexOf(fruits, 'grape');
+ *
+ * // Curried version
+ * const findApple = Arr.indexOf('apple');
+ * const indexOfApple = findApple(fruits);
+ *
+ * console.log(indexOfBanana); // => 1
+ * console.log(indexOfGrape); // => -1
+ * console.log(indexOfApple); // => 0
+ * ```
+ */
+export declare function indexOf<const Ar extends readonly unknown[]>(array: Ar, searchElement: Ar[number]): ArrayIndex<Ar> | -1;
+export declare function indexOf<E>(searchElement: E): (array: readonly E[]) => SizeType.Arr | -1;
+/**
+ * Gets the index of a value in an array, starting from a specified index.
+ *
+ * @example
+ *
+ * ```ts
+ * const fruits = ['apple', 'banana', 'orange', 'banana'];
+ *
+ * // Search for 'banana' starting from index 1
+ * const firstBanana = Arr.indexOfFrom(fruits, 'banana', 1);
+ * // Search for 'banana' starting from index 2
+ * const secondBanana = Arr.indexOfFrom(fruits, 'banana', 2);
+ * // Element not found
+ * const notFound = Arr.indexOfFrom(fruits, 'grape', 0);
+ *
+ * // Curried version
+ * const findBananaFrom2 = Arr.indexOfFrom('banana', 2);
+ * const index = findBananaFrom2(fruits);
+ *
+ * console.log(firstBanana); // => 1
+ * console.log(secondBanana); // => 3
+ * console.log(notFound); // => -1
+ * console.log(index); // => 3
+ * ```
+ */
+export declare function indexOfFrom<const Ar extends readonly unknown[]>(array: Ar, searchElement: Ar[number], fromIndex: ArgArrayIndexWithNegative<Ar>): ArrayIndex<Ar> | -1;
+export declare function indexOfFrom<E>(searchElement: E, fromIndex: SizeType.ArgArrWithNegative): (array: readonly E[]) => SizeType.Arr | -1;
+/**
+ * Gets the last index of a value in an array.
+ *
+ * @example
+ *
+ * ```ts
+ * const fruits = ['apple', 'banana', 'orange', 'banana'];
+ *
+ * const lastBanana = Arr.lastIndexOf(fruits, 'banana');
+ * const lastApple = Arr.lastIndexOf(fruits, 'apple');
+ * const notFound = Arr.lastIndexOf(fruits, 'grape');
+ *
+ * // Curried version
+ * const findLastBanana = Arr.lastIndexOf('banana');
+ * const index = findLastBanana(fruits);
+ *
+ * console.log(lastBanana); // => 3
+ * console.log(lastApple); // => 0
+ * console.log(notFound); // => -1
+ * console.log(index); // => 3
+ * ```
+ */
+export declare function lastIndexOf<const Ar extends readonly unknown[]>(array: Ar, searchElement: Ar[number]): ArrayIndex<Ar> | -1;
+export declare function lastIndexOf<E>(searchElement: E): (array: readonly E[]) => SizeType.Arr | -1;
+/**
+ * Gets the last index of a value in an array, starting from a specified index.
+ *
+ * @example
+ *
+ * ```ts
+ * const fruits = ['apple', 'banana', 'orange', 'banana', 'grape'];
+ *
+ * // Search backwards for 'banana' from index 3
+ * const lastBananaFrom3 = Arr.lastIndexOfFrom(fruits, 'banana', 3);
+ * // Search backwards for 'banana' from index 2
+ * const lastBananaFrom2 = Arr.lastIndexOfFrom(fruits, 'banana', 2);
+ * // Element not found
+ * const notFound = Arr.lastIndexOfFrom(fruits, 'grape', 2);
+ *
+ * // Curried version
+ * const findBananaFrom3 = Arr.lastIndexOfFrom('banana', 3);
+ * const index = findBananaFrom3(fruits);
+ *
+ * console.log(lastBananaFrom3); // => 3
+ * console.log(lastBananaFrom2); // => 1
+ * console.log(notFound); // => -1
+ * console.log(index); // => 3
+ * ```
+ */
+export declare function lastIndexOfFrom<const Ar extends readonly unknown[]>(array: Ar, searchElement: Ar[number], fromIndex: ArgArrayIndexWithNegative<Ar>): ArrayIndex<Ar> | -1;
+export declare function lastIndexOfFrom<E>(searchElement: E, fromIndex: SizeType.ArgArrWithNegative): (array: readonly E[]) => SizeType.Arr | -1;
+//# sourceMappingURL=array-utils-search.d.mts.map

package/dist/array/impl/array-utils-search.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-utils-search.d.mts","sourceRoot":"","sources":["../../../src/array/impl/array-utils-search.mts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAQ,MAAM,4BAA4B,CAAC;AAG5D;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EACjC,KAAK,EAAE,SAAS,CAAC,EAAE,EACnB,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE,SAAS,CAAC,EAAE,KAAK,KAAK,IAAI,CAAC,GAC1E,QAAQ,CAAC,CAAC,CAAC,CAAC;AAEf,wBAAgB,IAAI,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EACtD,KAAK,EAAE,EAAE,EACT,SAAS,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,KAAK,OAAO,GACxE,QAAQ,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;AAExB,wBAAgB,IAAI,CAAC,CAAC,EACpB,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE,SAAS,CAAC,EAAE,KAAK,OAAO,GACvE,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC;AAwDxC;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EACrC,KAAK,EAAE,SAAS,CAAC,EAAE,EACnB,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE,SAAS,CAAC,EAAE,KAAK,KAAK,IAAI,CAAC,GAC1E,QAAQ,CAAC,CAAC,CAAC,CAAC;AAEf,wBAAgB,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAC1D,KAAK,EAAE,EAAE,EACT,SAAS,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,KAAK,OAAO,GACxE,QAAQ,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;AAExB,wBAAgB,QAAQ,CAAC,CAAC,EACxB,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE,SAAS,CAAC,EAAE,KAAK,OAAO,GACvE,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC;AAwDxC;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,SAAS,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAC3D,KAAK,EAAE,EAAE,EACT,SAAS,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,KAAK,OAAO,GACxE,UAAU,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;AAEvB,wBAAgB,SAAS,CAAC,CAAC,EACzB,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE,SAAS,CAAC,EAAE,KAAK,OAAO,GACvE,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,KAAK,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AAqC9C;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,aAAa,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAC/D,KAAK,EAAE,EAAE,EACT,SAAS,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,KAAK,OAAO,GACxE,UAAU,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;AAEvB,wBAAgB,aAAa,CAAC,CAAC,EAC7B,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE,SAAS,CAAC,EAAE,KAAK,OAAO,GACvE,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,KAAK,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AAqC9C;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,OAAO,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EACzD,KAAK,EAAE,EAAE,EACT,aAAa,EAAE,EAAE,CAAC,MAAM,CAAC,GACxB,UAAU,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;AAEvB,wBAAgB,OAAO,CAAC,CAAC,EACvB,aAAa,EAAE,CAAC,GACf,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,KAAK,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AAqB9C;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,WAAW,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAC7D,KAAK,EAAE,EAAE,EACT,aAAa,EAAE,EAAE,CAAC,MAAM,CAAC,EACzB,SAAS,EAAE,yBAAyB,CAAC,EAAE,CAAC,GACvC,UAAU,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;AAEvB,wBAAgB,WAAW,CAAC,CAAC,EAC3B,aAAa,EAAE,CAAC,EAChB,SAAS,EAAE,QAAQ,CAAC,kBAAkB,GACrC,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,KAAK,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AAwB9C;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,WAAW,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAC7D,KAAK,EAAE,EAAE,EACT,aAAa,EAAE,EAAE,CAAC,MAAM,CAAC,GACxB,UAAU,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;AAEvB,wBAAgB,WAAW,CAAC,CAAC,EAC3B,aAAa,EAAE,CAAC,GACf,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,KAAK,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AAoB9C;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,eAAe,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EACjE,KAAK,EAAE,EAAE,EACT,aAAa,EAAE,EAAE,CAAC,MAAM,CAAC,EACzB,SAAS,EAAE,yBAAyB,CAAC,EAAE,CAAC,GACvC,UAAU,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;AAEvB,wBAAgB,eAAe,CAAC,CAAC,EAC/B,aAAa,EAAE,CAAC,EAChB,SAAS,EAAE,QAAQ,CAAC,kBAAkB,GACrC,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,KAAK,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC"}

package/dist/array/impl/array-utils-search.mjs

@@ -0,0 +1,153 @@
+import { Optional } from '../../functional/optional.mjs';
+import { pipe } from '../../functional/pipe.mjs';
+import '../../functional/result.mjs';
+import '../../number/branded-types/finite-number.mjs';
+import '../../number/branded-types/int.mjs';
+import '../../number/branded-types/int16.mjs';
+import '../../number/branded-types/int32.mjs';
+import '../../number/branded-types/non-negative-finite-number.mjs';
+import '../../number/branded-types/non-negative-int16.mjs';
+import '../../number/branded-types/non-negative-int32.mjs';
+import '../../number/branded-types/non-zero-finite-number.mjs';
+import '../../number/branded-types/non-zero-int.mjs';
+import '../../number/branded-types/non-zero-int16.mjs';
+import '../../number/branded-types/non-zero-int32.mjs';
+import '../../number/branded-types/non-zero-safe-int.mjs';
+import '../../number/branded-types/non-zero-uint16.mjs';
+import '../../number/branded-types/non-zero-uint32.mjs';
+import '../../number/branded-types/positive-finite-number.mjs';
+import '../../number/branded-types/positive-int.mjs';
+import '../../number/branded-types/positive-int16.mjs';
+import '../../number/branded-types/positive-int32.mjs';
+import '../../number/branded-types/positive-safe-int.mjs';
+import '../../number/branded-types/positive-uint16.mjs';
+import '../../number/branded-types/positive-uint32.mjs';
+import '../../number/branded-types/safe-int.mjs';
+import '../../number/branded-types/safe-uint.mjs';
+import '../../number/branded-types/uint.mjs';
+import '../../number/branded-types/uint16.mjs';
+import { asUint32 } from '../../number/branded-types/uint32.mjs';
+import '../../number/enum/int8.mjs';
+import '../../number/enum/uint8.mjs';
+import '../../number/num.mjs';
+import '../../number/refined-number-utils.mjs';
+
+function find(...args) {
+    switch (args.length) {
+        case 2: {
+            const [array, predicate] = args;
+            const foundIndex = array.findIndex(
+            // eslint-disable-next-line total-functions/no-unsafe-type-assertion
+            predicate);
+            return foundIndex === -1
+                ? Optional.none
+                : // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+                    Optional.some(array[foundIndex]);
+        }
+        case 1: {
+            const [predicate] = args;
+            return (array) => find(array, predicate);
+        }
+    }
+}
+function findLast(...args) {
+    switch (args.length) {
+        case 2: {
+            const [array, predicate] = args;
+            const foundIndex = array.findLastIndex(
+            // eslint-disable-next-line total-functions/no-unsafe-type-assertion
+            predicate);
+            return foundIndex === -1
+                ? Optional.none
+                : // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+                    Optional.some(array[foundIndex]);
+        }
+        case 1: {
+            const [predicate] = args;
+            return (array) => findLast(array, predicate);
+        }
+    }
+}
+function findIndex(...args) {
+    switch (args.length) {
+        case 2: {
+            const [array, predicate] = args;
+            return pipe(array.findIndex(
+            // eslint-disable-next-line total-functions/no-unsafe-type-assertion
+            predicate)).map((idx) => (idx >= 0 ? asUint32(idx) : -1)).value;
+        }
+        case 1: {
+            const [predicate] = args;
+            return (array) => findIndex(array, predicate);
+        }
+    }
+}
+function findLastIndex(...args) {
+    switch (args.length) {
+        case 2: {
+            const [array, predicate] = args;
+            return pipe(array.findLastIndex(
+            // eslint-disable-next-line total-functions/no-unsafe-type-assertion
+            predicate)).map((idx) => (idx >= 0 ? asUint32(idx) : -1)).value;
+        }
+        case 1: {
+            const [predicate] = args;
+            return (array) => findLastIndex(array, predicate);
+        }
+    }
+}
+function indexOf(...args) {
+    switch (args.length) {
+        case 2: {
+            const [array, searchElement] = args;
+            const index = array.indexOf(searchElement);
+            return index !== -1 ? asUint32(index) : -1;
+        }
+        case 1: {
+            const [searchElement] = args;
+            return (array) => indexOf(array, searchElement);
+        }
+    }
+}
+function indexOfFrom(...args) {
+    switch (args.length) {
+        case 3: {
+            const [array, searchElement, fromIndex] = args;
+            const index = array.indexOf(searchElement, fromIndex);
+            return index !== -1 ? asUint32(index) : -1;
+        }
+        case 2: {
+            const [searchElement, fromIndex] = args;
+            return (array) => indexOfFrom(array, searchElement, fromIndex);
+        }
+    }
+}
+function lastIndexOf(...args) {
+    switch (args.length) {
+        case 2: {
+            const [array, searchElement] = args;
+            const index = array.lastIndexOf(searchElement);
+            return index !== -1 ? asUint32(index) : -1;
+        }
+        case 1: {
+            const [searchElement] = args;
+            return (array) => lastIndexOf(array, searchElement);
+        }
+    }
+}
+function lastIndexOfFrom(...args) {
+    switch (args.length) {
+        case 3: {
+            const [array, searchElement, fromIndex] = args;
+            const index = array.lastIndexOf(searchElement, fromIndex);
+            return index !== -1 ? asUint32(index) : -1;
+        }
+        case 2: {
+            const [searchElement, fromIndex] = args;
+            return (array) => lastIndexOfFrom(array, searchElement, fromIndex);
+        }
+    }
+}
+
+export { find, findIndex, findLast, findLastIndex, indexOf, indexOfFrom, lastIndexOf, lastIndexOfFrom };
+//# sourceMappingURL=array-utils-search.mjs.map

package/dist/array/impl/array-utils-search.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-utils-search.mjs","sources":["../../../src/array/impl/array-utils-search.mts"],"sourcesContent":[null],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCM,SAAU,IAAI,CAClB,GAAG,IAeE,EAAA;AAEL,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,GAAG,IAAI;AAC/B,YAAA,MAAM,UAAU,GAAG,KAAK,CAAC,SAAS;;AAEhC,YAAA,SAA0B,CAC3B;YAYD,OAAO,UAAU,KAAK;kBAClB,QAAQ,CAAC;AACX;oBACE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAE,CAAC;;QAEvC,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,SAAS,CAAC,GAAG,IAAI;YAOxB,OAAO,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC;;;AAG9C;AA+BM,SAAU,QAAQ,CACtB,GAAG,IAeE,EAAA;AAEL,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,GAAG,IAAI;AAC/B,YAAA,MAAM,UAAU,GAAG,KAAK,CAAC,aAAa;;AAEpC,YAAA,SAA0B,CAC3B;YAYD,OAAO,UAAU,KAAK;kBAClB,QAAQ,CAAC;AACX;oBACE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAE,CAAC;;QAEvC,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,SAAS,CAAC,GAAG,IAAI;YAOxB,OAAO,CAAC,KAAK,KAAK,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC;;;AAGlD;AA6BM,SAAU,SAAS,CACvB,GAAG,IAeE,EAAA;AAEL,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,GAAG,IAAI;AAC/B,YAAA,OAAO,IAAI,CACT,KAAK,CAAC,SAAS;;AAEb,YAAA,SAAiD,CAClD,CACF,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK;;QAEvD,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,SAAS,CAAC,GAAG,IAAI;YACxB,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC;;;AAGnD;AA2BM,SAAU,aAAa,CAC3B,GAAG,IAeE,EAAA;AAEL,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,GAAG,IAAI;AAC/B,YAAA,OAAO,IAAI,CACT,KAAK,CAAC,aAAa;;AAEjB,YAAA,SAAiD,CAClD,CACF,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK;;QAEvD,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,SAAS,CAAC,GAAG,IAAI;YACxB,OAAO,CAAC,KAAK,KAAK,aAAa,CAAC,KAAK,EAAE,SAAS,CAAC;;;AAGvD;AA+BM,SAAU,OAAO,CACrB,GAAG,IAE4B,EAAA;AAE/B,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,aAAa,CAAC,GAAG,IAAI;YAEnC,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC;AAC1C,YAAA,OAAO,KAAK,KAAK,EAAE,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,EAAE;;QAE5C,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,aAAa,CAAC,GAAG,IAAI;YAC5B,OAAO,CAAC,KAAK,KAAK,OAAO,CAAC,KAAK,EAAE,aAAa,CAAC;;;AAGrD;AAsCM,SAAU,WAAW,CACzB,GAAG,IAMoE,EAAA;AAEvE,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;YACN,MAAM,CAAC,KAAK,EAAE,aAAa,EAAE,SAAS,CAAC,GAAG,IAAI;YAC9C,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,EAAE,SAAS,CAAC;AACrD,YAAA,OAAO,KAAK,KAAK,EAAE,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,EAAE;;QAE5C,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,aAAa,EAAE,SAAS,CAAC,GAAG,IAAI;AACvC,YAAA,OAAO,CAAC,KAAK,KAAK,WAAW,CAAC,KAAK,EAAE,aAAa,EAAE,SAAS,CAAC;;;AAGpE;AAiCM,SAAU,WAAW,CACzB,GAAG,IAE4B,EAAA;AAE/B,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,aAAa,CAAC,GAAG,IAAI;YACnC,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,CAAC,aAAa,CAAC;AAC9C,YAAA,OAAO,KAAK,KAAK,EAAE,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,EAAE;;QAE5C,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,aAAa,CAAC,GAAG,IAAI;YAC5B,OAAO,CAAC,KAAK,KAAK,WAAW,CAAC,KAAK,EAAE,aAAa,CAAC;;;AAGzD;AAsCM,SAAU,eAAe,CAC7B,GAAG,IAMoE,EAAA;AAEvE,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;YACN,MAAM,CAAC,KAAK,EAAE,aAAa,EAAE,SAAS,CAAC,GAAG,IAAI;YAE9C,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC;AAEzD,YAAA,OAAO,KAAK,KAAK,EAAE,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,EAAE;;QAE5C,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,aAAa,EAAE,SAAS,CAAC,GAAG,IAAI;AACvC,YAAA,OAAO,CAAC,KAAK,KAAK,eAAe,CAAC,KAAK,EAAE,aAAa,EAAE,SAAS,CAAC;;;AAGxE;;;;"}

package/dist/array/impl/array-utils-set-op.d.mts

@@ -0,0 +1,100 @@
+/**
+ * Checks if two arrays are equal by comparing their elements.
+ *
+ * @example
+ *
+ * ```ts
+ * const numbers = [1, 2, 3] as const;
+ * const sameNumbers = [1, 2, 3] as const;
+ * const differentNumbers = [1, 2, 4] as const;
+ *
+ * assert.ok(Arr.eq(numbers, sameNumbers));
+ * assert.notOk(Arr.eq(numbers, differentNumbers));
+ * ```
+ */
+export declare const eq: <E>(array1: readonly E[], array2: readonly E[], equality?: (a: E, b: E) => boolean) => boolean;
+/**
+ * Alias for `eq`.
+ *
+ * @see {@link eq}
+ */
+export declare const equal: <E>(array1: readonly E[], array2: readonly E[], equality?: (a: E, b: E) => boolean) => boolean;
+/**
+ * Checks if the first array is a subset of the second array.
+ *
+ * @example
+ *
+ * ```ts
+ * const subset = [1, 2] as const;
+ * const superset = [1, 2, 3] as const;
+ * const notSubset = [2, 4] as const;
+ *
+ * assert.ok(Arr.isSubset(subset, superset));
+ * assert.notOk(Arr.isSubset(notSubset, superset));
+ * ```
+ */
+export declare const isSubset: <E1 extends Primitive, E2 extends Primitive = E1>(array1: readonly E1[], array2: readonly E2[]) => boolean;
+/**
+ * Checks if the first array is a superset of the second array.
+ *
+ * @example
+ *
+ * ```ts
+ * const potentialSuperset = ['a', 'b', 'c'] as const;
+ * const subset = ['a', 'c'] as const;
+ * const notSuperset = ['a', 'd'] as const;
+ *
+ * assert.ok(Arr.isSuperset(potentialSuperset, subset));
+ * assert.notOk(Arr.isSuperset(subset, potentialSuperset));
+ * assert.notOk(Arr.isSuperset(potentialSuperset, notSuperset));
+ * ```
+ */
+export declare const isSuperset: <E1 extends Primitive, E2 extends Primitive = E1>(array1: readonly E1[], array2: readonly E2[]) => boolean;
+/**
+ * Returns the intersection of two arrays.
+ *
+ * @example
+ *
+ * ```ts
+ * const refs = ['Ada', 'Alan', 'Grace'] as const;
+ * const attendees = ['Grace', 'Alan', 'Barbara'] as const;
+ *
+ * const both = Arr.setIntersection(refs, attendees);
+ *
+ * assert.deepStrictEqual(both, ['Alan', 'Grace']);
+ * ```
+ */
+export declare const setIntersection: <E1 extends Primitive, E2 extends Primitive = E1>(array1: readonly E1[], array2: readonly E2[]) => readonly (E1 & E2)[];
+/**
+ * Returns the set difference of two arrays (elements in first but not in second).
+ *
+ * @example
+ *
+ * ```ts
+ * const baseline = [1, 2, 3, 4] as const;
+ * const removed = [2, 4] as const;
+ *
+ * const remaining = Arr.setDifference(baseline, removed);
+ *
+ * assert.deepStrictEqual(remaining, [1, 3]);
+ * ```
+ */
+export declare const setDifference: <E extends Primitive>(array1: readonly E[], array2: readonly E[]) => readonly E[];
+/**
+ * Returns the set difference of two sorted numeric arrays (optimized for sorted arrays).
+ *
+ * @example
+ *
+ * ```ts
+ * const upcoming = [1, 3, 5, 7, 9] as const;
+ * const completed = [3, 4, 7] as const;
+ *
+ * const remaining = Arr.sortedNumSetDifference(upcoming, completed);
+ *
+ * const expected = [1, 5, 9] as const;
+ *
+ * assert.deepStrictEqual(remaining, expected);
+ * ```
+ */
+export declare const sortedNumSetDifference: <E extends number>(sortedList1: readonly E[], sortedList2: readonly E[]) => readonly E[];
+//# sourceMappingURL=array-utils-set-op.d.mts.map

package/dist/array/impl/array-utils-set-op.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-utils-set-op.d.mts","sourceRoot":"","sources":["../../../src/array/impl/array-utils-set-op.mts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,EAAE,GAAI,CAAC,EAClB,QAAQ,SAAS,CAAC,EAAE,EACpB,QAAQ,SAAS,CAAC,EAAE,EACpB,WAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAmB,KAC5C,OAG8C,CAAC;AAElD;;;;GAIG;AACH,eAAO,MAAM,KAAK,GAdC,CAAC,UACV,SAAS,CAAC,EAAE,UACZ,SAAS,CAAC,EAAE,aACV,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,KAChC,OAUoB,CAAC;AAExB;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,QAAQ,GAAI,EAAE,SAAS,SAAS,EAAE,EAAE,SAAS,SAAS,GAAG,EAAE,EACtE,QAAQ,SAAS,EAAE,EAAE,EACrB,QAAQ,SAAS,EAAE,EAAE,KACpB,OAIA,CAAC;AAEJ;;;;;;;;;;;;;;GAcG;AACH,eAAO,MAAM,UAAU,GAAI,EAAE,SAAS,SAAS,EAAE,EAAE,SAAS,SAAS,GAAG,EAAE,EACxE,QAAQ,SAAS,EAAE,EAAE,EACrB,QAAQ,SAAS,EAAE,EAAE,KACpB,OAAmC,CAAC;AAEvC;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,eAAe,GAC1B,EAAE,SAAS,SAAS,EACpB,EAAE,SAAS,SAAS,GAAG,EAAE,EAEzB,QAAQ,SAAS,EAAE,EAAE,EACrB,QAAQ,SAAS,EAAE,EAAE,KACpB,SAAS,CAAC,EAAE,GAAG,EAAE,CAAC,EAE+C,CAAC;AAErE;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,aAAa,GAAI,CAAC,SAAS,SAAS,EAC/C,QAAQ,SAAS,CAAC,EAAE,EACpB,QAAQ,SAAS,CAAC,EAAE,KACnB,SAAS,CAAC,EAA+C,CAAC;AAE7D;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,sBAAsB,GAAI,CAAC,SAAS,MAAM,EACrD,aAAa,SAAS,CAAC,EAAE,EACzB,aAAa,SAAS,CAAC,EAAE,KACxB,SAAS,CAAC,EA8BZ,CAAC"}