ts-data-forge 14.6.1 → 14.6.2

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

@@ -1,156 +1,132 @@
-import { none } from '../../functional/optional/impl/optional-none.mjs';
-import { some } from '../../functional/optional/impl/optional-some.mjs';
-import '@sindresorhus/is';
-import { pipe } from '../../functional/pipe.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/negative-finite-number.mjs';
-import '../../number/branded-types/negative-int.mjs';
-import '../../number/branded-types/negative-safe-int.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-positive-finite-number.mjs';
-import '../../number/branded-types/non-positive-int.mjs';
-import '../../number/branded-types/non-positive-safe-int.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:
-      return findImpl(...args);
-    case 1:
-      return (array) => findImpl(array, ...args);
-  }
+
+import { Optional, pipe } from '../../functional/index.mjs';
+import { asUint32 } from '../../number/index.mjs';
+export function find(...args) {
+    switch (args.length) {
+        case 2:
+            return findImpl(...args);
+        case 1:
+            return (array) => findImpl(array, ...args);
+    }
 }
 const findImpl = (array, predicate) => {
-  const foundIndex = array.findIndex(
+    const foundIndex = array.findIndex(
     // eslint-disable-next-line total-functions/no-unsafe-type-assertion
-    predicate
-  );
-  return foundIndex === -1 ? none : (
-    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-    some(array[foundIndex])
-  );
+    predicate);
+
+
+
+
+
+
+
+
+
+
+
+
+    return foundIndex === -1
+        ? Optional.none
+        : // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+            Optional.some(array[foundIndex]);
 };
-function findLast(...args) {
-  switch (args.length) {
-    case 2:
-      return findLastImpl(...args);
-    case 1:
-      return (array) => findLastImpl(array, ...args);
-  }
+export function findLast(...args) {
+    switch (args.length) {
+        case 2:
+            return findLastImpl(...args);
+        case 1:
+            return (array) => findLastImpl(array, ...args);
+    }
 }
 const findLastImpl = (array, predicate) => {
-  const foundIndex = array.findLastIndex(
+    const foundIndex = array.findLastIndex(
     // eslint-disable-next-line total-functions/no-unsafe-type-assertion
-    predicate
-  );
-  return foundIndex === -1 ? none : (
-    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-    some(array[foundIndex])
-  );
+    predicate);
+
+
+
+
+
+
+
+
+
+
+
+
+    return foundIndex === -1
+        ? Optional.none
+        : // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+            Optional.some(array[foundIndex]);
 };
-function findIndex(...args) {
-  switch (args.length) {
-    case 2:
-      return findIndexImpl(...args);
-    case 1:
-      return (array) => findIndexImpl(array, ...args);
-  }
+export function findIndex(...args) {
+    switch (args.length) {
+        case 2:
+            return findIndexImpl(...args);
+        case 1:
+            return (array) => findIndexImpl(array, ...args);
+    }
 }
-const findIndexImpl = (array, predicate) => pipe(
-  array.findIndex(
-    // eslint-disable-next-line total-functions/no-unsafe-type-assertion
-    predicate
-  )
-).map((idx) => idx >= 0 ? asUint32(idx) : -1).value;
-function findLastIndex(...args) {
-  switch (args.length) {
-    case 2:
-      return findLastIndexImpl(...args);
-    case 1:
-      return (array) => findLastIndexImpl(array, ...args);
-  }
+const findIndexImpl = (array, predicate) => pipe(array.findIndex(
+// eslint-disable-next-line total-functions/no-unsafe-type-assertion
+predicate)).map((idx) => (idx >= 0 ? asUint32(idx) : -1)).value;
+export function findLastIndex(...args) {
+    switch (args.length) {
+        case 2:
+            return findLastIndexImpl(...args);
+        case 1:
+            return (array) => findLastIndexImpl(array, ...args);
+    }
 }
-const findLastIndexImpl = (array, predicate) => pipe(
-  array.findLastIndex(
-    // eslint-disable-next-line total-functions/no-unsafe-type-assertion
-    predicate
-  )
-).map((idx) => idx >= 0 ? asUint32(idx) : -1).value;
-function indexOf(...args) {
-  switch (args.length) {
-    case 2:
-      return indexOfImpl(...args);
-    case 1:
-      return (array) => indexOfImpl(array, ...args);
-  }
+const findLastIndexImpl = (array, predicate) => pipe(array.findLastIndex(
+// eslint-disable-next-line total-functions/no-unsafe-type-assertion
+predicate)).map((idx) => (idx >= 0 ? asUint32(idx) : -1)).value;
+export function indexOf(...args) {
+    switch (args.length) {
+        case 2:
+            return indexOfImpl(...args);
+        case 1:
+            return (array) => indexOfImpl(array, ...args);
+    }
 }
 const indexOfImpl = (array, searchElement) => {
-  const index = array.indexOf(searchElement);
-  return index !== -1 ? asUint32(index) : -1;
+    const index = array.indexOf(searchElement);
+    return index !== -1 ? asUint32(index) : -1;
 };
-function indexOfFrom(...args) {
-  switch (args.length) {
-    case 3:
-      return indexOfFromImpl(...args);
-    case 2:
-      return (array) => indexOfFromImpl(array, ...args);
-  }
+export function indexOfFrom(...args) {
+    switch (args.length) {
+        case 3:
+            return indexOfFromImpl(...args);
+        case 2:
+            return (array) => indexOfFromImpl(array, ...args);
+    }
 }
 const indexOfFromImpl = (array, searchElement, fromIndex) => {
-  const index = array.indexOf(searchElement, fromIndex);
-  return index !== -1 ? asUint32(index) : -1;
+    const index = array.indexOf(searchElement, fromIndex);
+    return index !== -1 ? asUint32(index) : -1;
 };
-function lastIndexOf(...args) {
-  switch (args.length) {
-    case 2:
-      return lastIndexOfImpl(...args);
-    case 1:
-      return (array) => lastIndexOfImpl(array, ...args);
-  }
+export function lastIndexOf(...args) {
+    switch (args.length) {
+        case 2:
+            return lastIndexOfImpl(...args);
+        case 1:
+            return (array) => lastIndexOfImpl(array, ...args);
+    }
 }
 const lastIndexOfImpl = (array, searchElement) => {
-  const index = array.lastIndexOf(searchElement);
-  return index !== -1 ? asUint32(index) : -1;
+    const index = array.lastIndexOf(searchElement);
+    return index !== -1 ? asUint32(index) : -1;
 };
-function lastIndexOfFrom(...args) {
-  switch (args.length) {
-    case 3:
-      return lastIndexOfFromImpl(...args);
-    case 2:
-      return (array) => lastIndexOfFromImpl(array, ...args);
-  }
+export function lastIndexOfFrom(...args) {
+    switch (args.length) {
+        case 3:
+            return lastIndexOfFromImpl(...args);
+        case 2:
+            return (array) => lastIndexOfFromImpl(array, ...args);
+    }
 }
 const lastIndexOfFromImpl = (array, searchElement, fromIndex) => {
-  const index = array.lastIndexOf(searchElement, fromIndex);
-  return index !== -1 ? asUint32(index) : -1;
+    const index = array.lastIndexOf(searchElement, fromIndex);
+    return index !== -1 ? asUint32(index) : -1;
 };
-
-export { find, findIndex, findLast, findLastIndex, indexOf, indexOfFrom, lastIndexOf, lastIndexOfFrom };
-//# sourceMappingURL=array-utils-search.mjs.map
+//# sourceMappingURL=array-utils-search.mjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"array-utils-search.mjs","sources":["../../../src/array/impl/array-utils-search.mts"],"sourcesContent":["import { expectType } from '../../expect-type.mjs';\nimport { Optional, pipe } from '../../functional/index.mjs';\nimport { asUint32 } from '../../number/index.mjs';\nimport {\n  type ArgArrayIndexWithNegative,\n  type ArrayIndex,\n  type SizeType,\n} from '../../types.mjs';\n\n/**\n * Finds the first element that satisfies a predicate.\n *\n * @example\n *\n * ```ts\n * const users = [\n *   { id: 1, name: 'Ada' },\n *   { id: 2, name: 'Grace' },\n * ] as const;\n *\n * const found = Arr.find(users, (user) => user.id === 2);\n *\n * const missing = Arr.find<Readonly<{ id: number }>>((user) => user.id === 3)(\n *   users,\n * );\n *\n * assert.deepStrictEqual(found, Optional.some({ id: 2, name: 'Grace' }));\n *\n * assert.deepStrictEqual(missing, Optional.none);\n * ```\n */\nexport function find<E, F extends E>(\n  array: readonly E[],\n  predicate: (value: E, index: SizeType.Arr, arr: readonly E[]) => value is F,\n): Optional<F>;\n\nexport function find<const Ar extends readonly unknown[]>(\n  array: Ar,\n  predicate: (value: Ar[number], index: ArrayIndex<Ar>, arr: Ar) => boolean,\n): Optional<Ar[number]>;\n\nexport function find<E>(\n  predicate: (value: E, index: SizeType.Arr, arr: readonly E[]) => boolean,\n): (array: readonly E[]) => Optional<E>;\n\nexport function find<E>(\n  ...args:\n    | readonly [\n        array: readonly E[],\n        predicate: (\n          value: E,\n          index: SizeType.Arr,\n          arr: readonly E[],\n        ) => boolean,\n      ]\n    | readonly [\n        predicate: (\n          value: E,\n          index: SizeType.Arr,\n          arr: readonly E[],\n        ) => boolean,\n      ]\n): Optional<E> | ((array: readonly E[]) => Optional<E>) {\n  switch (args.length) {\n    case 2:\n      return findImpl(...args);\n\n    case 1:\n      return (array) => findImpl(array, ...args);\n  }\n}\n\nconst findImpl = <E,>(\n  array: readonly E[],\n  predicate: (value: E, index: SizeType.Arr, arr: readonly E[]) => boolean,\n): Optional<E> => {\n  const foundIndex = array.findIndex(\n    // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n    predicate as () => boolean,\n  );\n\n  // Left as a comment rather than asserted. This pinned the shape of the\n  // standard library's `findIndex`, and the shape differs between the stock\n  // library and the strict one — `(value, index, obj: this) => boolean` there\n  // against `(value, index, arr: readonly E[]) => unknown` here. `src` ships\n  // to consumers so that \"Go to Definition\" reaches it, so an assertion that\n  // only holds under one of them shows up as an error in their editor.\n  //\n  // expectType<\n  //   Parameters<typeof array.findIndex>[0],\n  //   (value: E, index: number, arr: readonly E[]) => unknown\n  // >('=');\n\n  expectType<\n    typeof predicate,\n    (value: E, index: SizeType.Arr, arr: readonly E[]) => boolean\n  >('=');\n\n  return foundIndex === -1\n    ? Optional.none\n    : // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n      Optional.some(array[foundIndex]!);\n};\n\n/**\n * Finds the last element that satisfies a predicate.\n *\n * @example\n *\n * ```ts\n * const numbers = [1, 3, 2, 4, 5] as const;\n *\n * const lastEven = Arr.findLast(numbers, (n) => n % 2 === 0);\n *\n * const none = Arr.findLast<number>((n) => n > 10)(numbers);\n *\n * assert.deepStrictEqual(lastEven, Optional.some(4));\n *\n * assert.deepStrictEqual(none, Optional.none);\n * ```\n */\nexport function findLast<E, F extends E>(\n  array: readonly E[],\n  predicate: (value: E, index: SizeType.Arr, arr: readonly E[]) => value is F,\n): Optional<F>;\n\nexport function findLast<const Ar extends readonly unknown[]>(\n  array: Ar,\n  predicate: (value: Ar[number], index: ArrayIndex<Ar>, arr: Ar) => boolean,\n): Optional<Ar[number]>;\n\nexport function findLast<E>(\n  predicate: (value: E, index: SizeType.Arr, arr: readonly E[]) => boolean,\n): (array: readonly E[]) => Optional<E>;\n\nexport function findLast<E>(\n  ...args:\n    | readonly [\n        array: readonly E[],\n        predicate: (\n          value: E,\n          index: SizeType.Arr,\n          arr: readonly E[],\n        ) => boolean,\n      ]\n    | readonly [\n        predicate: (\n          value: E,\n          index: SizeType.Arr,\n          arr: readonly E[],\n        ) => boolean,\n      ]\n): Optional<E> | ((array: readonly E[]) => Optional<E>) {\n  switch (args.length) {\n    case 2:\n      return findLastImpl(...args);\n\n    case 1:\n      return (array) => findLastImpl(array, ...args);\n  }\n}\n\nconst findLastImpl = <E,>(\n  array: readonly E[],\n  predicate: (value: E, index: SizeType.Arr, arr: readonly E[]) => boolean,\n): Optional<E> => {\n  const foundIndex = array.findLastIndex(\n    // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n    predicate as () => boolean,\n  );\n\n  // Left as a comment rather than asserted. This pinned the shape of the\n  // standard library's `findIndex`, and the shape differs between the stock\n  // library and the strict one — `(value, index, obj: this) => boolean` there\n  // against `(value, index, arr: readonly E[]) => unknown` here. `src` ships\n  // to consumers so that \"Go to Definition\" reaches it, so an assertion that\n  // only holds under one of them shows up as an error in their editor.\n  //\n  // expectType<\n  //   Parameters<typeof array.findIndex>[0],\n  //   (value: E, index: number, arr: readonly E[]) => unknown\n  // >('=');\n\n  expectType<\n    typeof predicate,\n    (value: E, index: SizeType.Arr, arr: readonly E[]) => boolean\n  >('=');\n\n  return foundIndex === -1\n    ? Optional.none\n    : // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n      Optional.some(array[foundIndex]!);\n};\n\n/**\n * Finds the index of the first element that satisfies a predicate.\n *\n * @example\n *\n * ```ts\n * const letters = ['a', 'b', 'c'] as const;\n *\n * const indexOfB = Arr.findIndex(letters, (letter) => letter === 'b');\n *\n * const indexOfMissing = Arr.findIndex<string>((letter) => letter === 'z')(\n *   letters,\n * );\n *\n * assert.isTrue(indexOfB === 1);\n *\n * assert.isTrue(indexOfMissing === -1);\n * ```\n */\nexport function findIndex<const Ar extends readonly unknown[]>(\n  array: Ar,\n  predicate: (value: Ar[number], index: ArrayIndex<Ar>, arr: Ar) => boolean,\n): ArrayIndex<Ar> | -1;\n\nexport function findIndex<E>(\n  predicate: (value: E, index: SizeType.Arr, arr: readonly E[]) => boolean,\n): (array: readonly E[]) => SizeType.Arr | -1;\n\nexport function findIndex<E>(\n  ...args:\n    | readonly [\n        array: readonly E[],\n        predicate: (\n          value: E,\n          index: SizeType.Arr,\n          arr: readonly E[],\n        ) => boolean,\n      ]\n    | readonly [\n        predicate: (\n          value: E,\n          index: SizeType.Arr,\n          arr: readonly E[],\n        ) => boolean,\n      ]\n): SizeType.Arr | ((array: readonly E[]) => SizeType.Arr | -1) | -1 {\n  switch (args.length) {\n    case 2:\n      return findIndexImpl(...args);\n\n    case 1:\n      return (array) => findIndexImpl(array, ...args);\n  }\n}\n\nconst findIndexImpl = <E,>(\n  array: readonly E[],\n  predicate: (value: E, index: SizeType.Arr, arr: readonly E[]) => boolean,\n): SizeType.Arr | -1 =>\n  pipe(\n    array.findIndex(\n      // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n      predicate as (value: E, index: number) => boolean,\n    ),\n  ).map((idx) => (idx >= 0 ? asUint32(idx) : -1)).value;\n\n/**\n * Finds the index of the last element that satisfies a predicate.\n *\n * @example\n *\n * ```ts\n * const letters = ['a', 'b', 'c', 'b'] as const;\n *\n * const lastIndexOfB = Arr.findLastIndex(letters, (letter) => letter === 'b');\n *\n * const notFound = Arr.findLastIndex<string>((letter) => letter === 'z')(\n *   letters,\n * );\n *\n * assert.isTrue(lastIndexOfB === 3);\n *\n * assert.isTrue(notFound === -1);\n * ```\n */\nexport function findLastIndex<const Ar extends readonly unknown[]>(\n  array: Ar,\n  predicate: (value: Ar[number], index: ArrayIndex<Ar>, arr: Ar) => boolean,\n): ArrayIndex<Ar> | -1;\n\nexport function findLastIndex<E>(\n  predicate: (value: E, index: SizeType.Arr, arr: readonly E[]) => boolean,\n): (array: readonly E[]) => SizeType.Arr | -1;\n\nexport function findLastIndex<E>(\n  ...args:\n    | readonly [\n        array: readonly E[],\n        predicate: (\n          value: E,\n          index: SizeType.Arr,\n          arr: readonly E[],\n        ) => boolean,\n      ]\n    | readonly [\n        predicate: (\n          value: E,\n          index: SizeType.Arr,\n          arr: readonly E[],\n        ) => boolean,\n      ]\n): SizeType.Arr | ((array: readonly E[]) => SizeType.Arr | -1) | -1 {\n  switch (args.length) {\n    case 2:\n      return findLastIndexImpl(...args);\n\n    case 1:\n      return (array) => findLastIndexImpl(array, ...args);\n  }\n}\n\nconst findLastIndexImpl = <E,>(\n  array: readonly E[],\n  predicate: (value: E, index: SizeType.Arr, arr: readonly E[]) => boolean,\n): SizeType.Arr | -1 =>\n  pipe(\n    array.findLastIndex(\n      // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n      predicate as (value: E, index: number) => boolean,\n    ),\n  ).map((idx) => (idx >= 0 ? asUint32(idx) : -1)).value;\n\n/**\n * Gets the index of a value in an array.\n *\n * @example\n *\n * ```ts\n * const fruits = ['apple', 'banana', 'orange', 'banana'] as readonly string[];\n *\n * const indexOfBanana = Arr.indexOf(fruits, 'banana');\n *\n * const indexOfGrape = Arr.indexOf(fruits, 'grape');\n *\n * // Curried version\n * const findApple = Arr.indexOf('apple');\n *\n * const indexOfApple = findApple(fruits);\n *\n * console.log(indexOfBanana); // => 1\n *\n * console.log(indexOfGrape); // => -1\n *\n * console.log(indexOfApple); // => 0\n * ```\n */\nexport function indexOf<const Ar extends readonly unknown[]>(\n  array: Ar,\n  searchElement: Ar[number],\n): ArrayIndex<Ar> | -1;\n\nexport function indexOf<E>(\n  searchElement: E,\n): (array: readonly E[]) => SizeType.Arr | -1;\n\nexport function indexOf<E>(\n  ...args:\n    | readonly [array: readonly E[], searchElement: E]\n    | readonly [searchElement: E]\n): SizeType.Arr | ((array: readonly E[]) => SizeType.Arr | -1) | -1 {\n  switch (args.length) {\n    case 2:\n      return indexOfImpl(...args);\n\n    case 1:\n      return (array) => indexOfImpl(array, ...args);\n  }\n}\n\nconst indexOfImpl = <E,>(\n  array: readonly E[],\n  searchElement: E,\n): SizeType.Arr | -1 => {\n  const index = array.indexOf(searchElement);\n\n  return index !== -1 ? asUint32(index) : -1;\n};\n\n/**\n * Gets the index of a value in an array, starting from a specified index.\n *\n * @example\n *\n * ```ts\n * const fruits = ['apple', 'banana', 'orange', 'banana'] as readonly string[];\n *\n * // Search for 'banana' starting from index 1\n * const firstBanana = Arr.indexOfFrom(fruits, 'banana', 1);\n *\n * // Search for 'banana' starting from index 2\n * const secondBanana = Arr.indexOfFrom(fruits, 'banana', 2);\n *\n * // Element not found\n * const notFound = Arr.indexOfFrom(fruits, 'grape', 0);\n *\n * // Curried version\n * const findBananaFrom2 = Arr.indexOfFrom('banana', 2);\n *\n * const index = findBananaFrom2(fruits);\n *\n * console.log(firstBanana); // => 1\n *\n * console.log(secondBanana); // => 3\n *\n * console.log(notFound); // => -1\n *\n * console.log(index); // => 3\n * ```\n */\nexport function indexOfFrom<const Ar extends readonly unknown[]>(\n  array: Ar,\n  searchElement: Ar[number],\n  fromIndex: ArgArrayIndexWithNegative<Ar>,\n): ArrayIndex<Ar> | -1;\n\nexport function indexOfFrom<E>(\n  searchElement: E,\n  fromIndex: SizeType.ArgArrWithNegative,\n): (array: readonly E[]) => SizeType.Arr | -1;\n\nexport function indexOfFrom<E>(\n  ...args:\n    | readonly [\n        array: readonly E[],\n        searchElement: E,\n        fromIndex: SizeType.ArgArrWithNegative,\n      ]\n    | readonly [searchElement: E, fromIndex: SizeType.ArgArrWithNegative]\n): SizeType.Arr | ((array: readonly E[]) => SizeType.Arr | -1) | -1 {\n  switch (args.length) {\n    case 3:\n      return indexOfFromImpl(...args);\n\n    case 2:\n      return (array) => indexOfFromImpl(array, ...args);\n  }\n}\n\nconst indexOfFromImpl = <E,>(\n  array: readonly E[],\n  searchElement: E,\n  fromIndex: SizeType.ArgArrWithNegative,\n): SizeType.Arr | -1 => {\n  const index = array.indexOf(searchElement, fromIndex);\n\n  return index !== -1 ? asUint32(index) : -1;\n};\n\n/**\n * Gets the last index of a value in an array.\n *\n * @example\n *\n * ```ts\n * const fruits = ['apple', 'banana', 'orange', 'banana'] as readonly string[];\n *\n * const lastBanana = Arr.lastIndexOf(fruits, 'banana');\n *\n * const lastApple = Arr.lastIndexOf(fruits, 'apple');\n *\n * const notFound = Arr.lastIndexOf(fruits, 'grape');\n *\n * // Curried version\n * const findLastBanana = Arr.lastIndexOf('banana');\n *\n * const index = findLastBanana(fruits);\n *\n * console.log(lastBanana); // => 3\n *\n * console.log(lastApple); // => 0\n *\n * console.log(notFound); // => -1\n *\n * console.log(index); // => 3\n * ```\n */\nexport function lastIndexOf<const Ar extends readonly unknown[]>(\n  array: Ar,\n  searchElement: Ar[number],\n): ArrayIndex<Ar> | -1;\n\nexport function lastIndexOf<E>(\n  searchElement: E,\n): (array: readonly E[]) => SizeType.Arr | -1;\n\nexport function lastIndexOf<E>(\n  ...args:\n    | readonly [array: readonly E[], searchElement: E]\n    | readonly [searchElement: E]\n): SizeType.Arr | ((array: readonly E[]) => SizeType.Arr | -1) | -1 {\n  switch (args.length) {\n    case 2:\n      return lastIndexOfImpl(...args);\n\n    case 1:\n      return (array) => lastIndexOfImpl(array, ...args);\n  }\n}\n\nconst lastIndexOfImpl = <E,>(\n  array: readonly E[],\n  searchElement: E,\n): SizeType.Arr | -1 => {\n  const index = array.lastIndexOf(searchElement);\n\n  return index !== -1 ? asUint32(index) : -1;\n};\n\n/**\n * Gets the last index of a value in an array, starting from a specified index.\n *\n * @example\n *\n * ```ts\n * const fruits = ['apple', 'banana', 'orange', 'banana', 'grape'] as const;\n *\n * // Search backwards for 'banana' from index 3\n * const lastBananaFrom3 = Arr.lastIndexOfFrom(fruits, 'banana', 3);\n *\n * // Search backwards for 'banana' from index 2\n * const lastBananaFrom2 = Arr.lastIndexOfFrom(fruits, 'banana', 2);\n *\n * // Element not found\n * const notFound = Arr.lastIndexOfFrom(fruits, 'grape', 2);\n *\n * // Curried version\n * const findBananaFrom3 = Arr.lastIndexOfFrom('banana', 3);\n *\n * const index = findBananaFrom3(fruits);\n *\n * console.log(lastBananaFrom3); // => 3\n *\n * console.log(lastBananaFrom2); // => 1\n *\n * console.log(notFound); // => -1\n *\n * console.log(index); // => 3\n * ```\n */\nexport function lastIndexOfFrom<const Ar extends readonly unknown[]>(\n  array: Ar,\n  searchElement: Ar[number],\n  fromIndex: ArgArrayIndexWithNegative<Ar>,\n): ArrayIndex<Ar> | -1;\n\nexport function lastIndexOfFrom<E>(\n  searchElement: E,\n  fromIndex: SizeType.ArgArrWithNegative,\n): (array: readonly E[]) => SizeType.Arr | -1;\n\nexport function lastIndexOfFrom<E>(\n  ...args:\n    | readonly [\n        array: readonly E[],\n        searchElement: E,\n        fromIndex: SizeType.ArgArrWithNegative,\n      ]\n    | readonly [searchElement: E, fromIndex: SizeType.ArgArrWithNegative]\n): SizeType.Arr | ((array: readonly E[]) => SizeType.Arr | -1) | -1 {\n  switch (args.length) {\n    case 3:\n      return lastIndexOfFromImpl(...args);\n\n    case 2:\n      return (array) => lastIndexOfFromImpl(array, ...args);\n  }\n}\n\nconst lastIndexOfFromImpl = <E,>(\n  array: readonly E[],\n  searchElement: E,\n  fromIndex: SizeType.ArgArrWithNegative,\n): SizeType.Arr | -1 => {\n  const index = array.lastIndexOf(searchElement, fromIndex);\n\n  return index !== -1 ? asUint32(index) : -1;\n};\n"],"names":["Optional.none","Optional.some"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6CO,SAAS,QACX,IAAA,EAgBmD;AACtD,EAAA,QAAQ,KAAK,MAAA;AAAQ,IACnB,KAAK,CAAA;AACH,MAAA,OAAO,QAAA,CAAS,GAAG,IAAI,CAAA;AAAA,IAEzB,KAAK,CAAA;AACH,MAAA,OAAO,CAAC,KAAA,KAAU,QAAA,CAAS,KAAA,EAAO,GAAG,IAAI,CAAA;AAAA;AAE/C;AAEA,MAAM,QAAA,GAAW,CACf,KAAA,EACA,SAAA,KACgB;AAChB,EAAA,MAAM,aAAa,KAAA,CAAM,SAAA;AAAA;AAAA,IAEvB;AAAA,GACF;AAmBA,EAAA,OAAO,UAAA,KAAe,KAClBA,IAAS;AAAA;AAAA,IAETC,IAAS,CAAK,KAAA,CAAM,UAAU,CAAE;AAAA,GAAA;AACtC,CAAA;AAiCO,SAAS,YACX,IAAA,EAgBmD;AACtD,EAAA,QAAQ,KAAK,MAAA;AAAQ,IACnB,KAAK,CAAA;AACH,MAAA,OAAO,YAAA,CAAa,GAAG,IAAI,CAAA;AAAA,IAE7B,KAAK,CAAA;AACH,MAAA,OAAO,CAAC,KAAA,KAAU,YAAA,CAAa,KAAA,EAAO,GAAG,IAAI,CAAA;AAAA;AAEnD;AAEA,MAAM,YAAA,GAAe,CACnB,KAAA,EACA,SAAA,KACgB;AAChB,EAAA,MAAM,aAAa,KAAA,CAAM,aAAA;AAAA;AAAA,IAEvB;AAAA,GACF;AAmBA,EAAA,OAAO,UAAA,KAAe,KAClBD,IAAS;AAAA;AAAA,IAETC,IAAS,CAAK,KAAA,CAAM,UAAU,CAAE;AAAA,GAAA;AACtC,CAAA;AA8BO,SAAS,aACX,IAAA,EAgB+D;AAClE,EAAA,QAAQ,KAAK,MAAA;AAAQ,IACnB,KAAK,CAAA;AACH,MAAA,OAAO,aAAA,CAAc,GAAG,IAAI,CAAA;AAAA,IAE9B,KAAK,CAAA;AACH,MAAA,OAAO,CAAC,KAAA,KAAU,aAAA,CAAc,KAAA,EAAO,GAAG,IAAI,CAAA;AAAA;AAEpD;AAEA,MAAM,aAAA,GAAgB,CACpB,KAAA,EACA,SAAA,KAEA,IAAA;AAAA,EACE,KAAA,CAAM,SAAA;AAAA;AAAA,IAEJ;AAAA;AAEJ,CAAA,CAAE,GAAA,CAAI,CAAC,GAAA,KAAS,GAAA,IAAO,IAAI,QAAA,CAAS,GAAG,CAAA,GAAI,EAAG,CAAA,CAAE,KAAA;AA8B3C,SAAS,iBACX,IAAA,EAgB+D;AAClE,EAAA,QAAQ,KAAK,MAAA;AAAQ,IACnB,KAAK,CAAA;AACH,MAAA,OAAO,iBAAA,CAAkB,GAAG,IAAI,CAAA;AAAA,IAElC,KAAK,CAAA;AACH,MAAA,OAAO,CAAC,KAAA,KAAU,iBAAA,CAAkB,KAAA,EAAO,GAAG,IAAI,CAAA;AAAA;AAExD;AAEA,MAAM,iBAAA,GAAoB,CACxB,KAAA,EACA,SAAA,KAEA,IAAA;AAAA,EACE,KAAA,CAAM,aAAA;AAAA;AAAA,IAEJ;AAAA;AAEJ,CAAA,CAAE,GAAA,CAAI,CAAC,GAAA,KAAS,GAAA,IAAO,IAAI,QAAA,CAAS,GAAG,CAAA,GAAI,EAAG,CAAA,CAAE,KAAA;AAmC3C,SAAS,WACX,IAAA,EAG+D;AAClE,EAAA,QAAQ,KAAK,MAAA;AAAQ,IACnB,KAAK,CAAA;AACH,MAAA,OAAO,WAAA,CAAY,GAAG,IAAI,CAAA;AAAA,IAE5B,KAAK,CAAA;AACH,MAAA,OAAO,CAAC,KAAA,KAAU,WAAA,CAAY,KAAA,EAAO,GAAG,IAAI,CAAA;AAAA;AAElD;AAEA,MAAM,WAAA,GAAc,CAClB,KAAA,EACA,aAAA,KACsB;AACtB,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,OAAA,CAAQ,aAAa,CAAA;AAEzC,EAAA,OAAO,KAAA,KAAU,EAAA,GAAK,QAAA,CAAS,KAAK,CAAA,GAAI,EAAA;AAC1C,CAAA;AA4CO,SAAS,eACX,IAAA,EAO+D;AAClE,EAAA,QAAQ,KAAK,MAAA;AAAQ,IACnB,KAAK,CAAA;AACH,MAAA,OAAO,eAAA,CAAgB,GAAG,IAAI,CAAA;AAAA,IAEhC,KAAK,CAAA;AACH,MAAA,OAAO,CAAC,KAAA,KAAU,eAAA,CAAgB,KAAA,EAAO,GAAG,IAAI,CAAA;AAAA;AAEtD;AAEA,MAAM,eAAA,GAAkB,CACtB,KAAA,EACA,aAAA,EACA,SAAA,KACsB;AACtB,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,OAAA,CAAQ,aAAA,EAAe,SAAS,CAAA;AAEpD,EAAA,OAAO,KAAA,KAAU,EAAA,GAAK,QAAA,CAAS,KAAK,CAAA,GAAI,EAAA;AAC1C,CAAA;AAuCO,SAAS,eACX,IAAA,EAG+D;AAClE,EAAA,QAAQ,KAAK,MAAA;AAAQ,IACnB,KAAK,CAAA;AACH,MAAA,OAAO,eAAA,CAAgB,GAAG,IAAI,CAAA;AAAA,IAEhC,KAAK,CAAA;AACH,MAAA,OAAO,CAAC,KAAA,KAAU,eAAA,CAAgB,KAAA,EAAO,GAAG,IAAI,CAAA;AAAA;AAEtD;AAEA,MAAM,eAAA,GAAkB,CACtB,KAAA,EACA,aAAA,KACsB;AACtB,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,WAAA,CAAY,aAAa,CAAA;AAE7C,EAAA,OAAO,KAAA,KAAU,EAAA,GAAK,QAAA,CAAS,KAAK,CAAA,GAAI,EAAA;AAC1C,CAAA;AA4CO,SAAS,mBACX,IAAA,EAO+D;AAClE,EAAA,QAAQ,KAAK,MAAA;AAAQ,IACnB,KAAK,CAAA;AACH,MAAA,OAAO,mBAAA,CAAoB,GAAG,IAAI,CAAA;AAAA,IAEpC,KAAK,CAAA;AACH,MAAA,OAAO,CAAC,KAAA,KAAU,mBAAA,CAAoB,KAAA,EAAO,GAAG,IAAI,CAAA;AAAA;AAE1D;AAEA,MAAM,mBAAA,GAAsB,CAC1B,KAAA,EACA,aAAA,EACA,SAAA,KACsB;AACtB,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,WAAA,CAAY,aAAA,EAAe,SAAS,CAAA;AAExD,EAAA,OAAO,KAAA,KAAU,EAAA,GAAK,QAAA,CAAS,KAAK,CAAA,GAAI,EAAA;AAC1C,CAAA;;;;"}
+{"version":3,"file":"array-utils-search.mjs","sourceRoot":"","sources":["../../../src/array/impl/array-utils-search.mts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,4BAA4B,CAAC;AAC5D,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AA2ClD,MAAM,UAAU,IAAI,CAClB,GAAG,IAeE;IAEL,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;QACpB,KAAK,CAAC;YACJ,OAAO,QAAQ,CAAC,GAAG,IAAI,CAAC,CAAC;QAE3B,KAAK,CAAC;YACJ,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,CAAC;IAC/C,CAAC;AACH,CAAC;AAED,MAAM,QAAQ,GAAG,CACf,KAAmB,EACnB,SAAwE,EAC3D,EAAE;IACf,MAAM,UAAU,GAAG,KAAK,CAAC,SAAS;IAChC,oEAAoE;IACpE,SAA0B,CAC3B,CAAC;IAEF,uEAAuE;IACvE,0EAA0E;IAC1E,4EAA4E;IAC5E,2EAA2E;IAC3E,2EAA2E;IAC3E,qEAAqE;IACrE,EAAE;IACF,cAAc;IACd,2CAA2C;IAC3C,4DAA4D;IAC5D,UAAU;IAEV,UAAU,CAGR,GAAG,CAAC,CAAC;IAEP,OAAO,UAAU,KAAK,CAAC,CAAC;QACtB,CAAC,CAAC,QAAQ,CAAC,IAAI;QACf,CAAC,CAAC,oEAAoE;YACpE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAE,CAAC,CAAC;AACxC,CAAC,CAAC;AAiCF,MAAM,UAAU,QAAQ,CACtB,GAAG,IAeE;IAEL,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;QACpB,KAAK,CAAC;YACJ,OAAO,YAAY,CAAC,GAAG,IAAI,CAAC,CAAC;QAE/B,KAAK,CAAC;YACJ,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,CAAC;IACnD,CAAC;AACH,CAAC;AAED,MAAM,YAAY,GAAG,CACnB,KAAmB,EACnB,SAAwE,EAC3D,EAAE;IACf,MAAM,UAAU,GAAG,KAAK,CAAC,aAAa;IACpC,oEAAoE;IACpE,SAA0B,CAC3B,CAAC;IAEF,uEAAuE;IACvE,0EAA0E;IAC1E,4EAA4E;IAC5E,2EAA2E;IAC3E,2EAA2E;IAC3E,qEAAqE;IACrE,EAAE;IACF,cAAc;IACd,2CAA2C;IAC3C,4DAA4D;IAC5D,UAAU;IAEV,UAAU,CAGR,GAAG,CAAC,CAAC;IAEP,OAAO,UAAU,KAAK,CAAC,CAAC;QACtB,CAAC,CAAC,QAAQ,CAAC,IAAI;QACf,CAAC,CAAC,oEAAoE;YACpE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAE,CAAC,CAAC;AACxC,CAAC,CAAC;AA8BF,MAAM,UAAU,SAAS,CACvB,GAAG,IAeE;IAEL,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;QACpB,KAAK,CAAC;YACJ,OAAO,aAAa,CAAC,GAAG,IAAI,CAAC,CAAC;QAEhC,KAAK,CAAC;YACJ,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,aAAa,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,CAAC;IACpD,CAAC;AACH,CAAC;AAED,MAAM,aAAa,GAAG,CACpB,KAAmB,EACnB,SAAwE,EACrD,EAAE,CACrB,IAAI,CACF,KAAK,CAAC,SAAS;AACb,oEAAoE;AACpE,SAAiD,CAClD,CACF,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AA8BxD,MAAM,UAAU,aAAa,CAC3B,GAAG,IAeE;IAEL,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;QACpB,KAAK,CAAC;YACJ,OAAO,iBAAiB,CAAC,GAAG,IAAI,CAAC,CAAC;QAEpC,KAAK,CAAC;YACJ,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,iBAAiB,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,CAAC;IACxD,CAAC;AACH,CAAC;AAED,MAAM,iBAAiB,GAAG,CACxB,KAAmB,EACnB,SAAwE,EACrD,EAAE,CACrB,IAAI,CACF,KAAK,CAAC,aAAa;AACjB,oEAAoE;AACpE,SAAiD,CAClD,CACF,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AAmCxD,MAAM,UAAU,OAAO,CACrB,GAAG,IAE4B;IAE/B,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;QACpB,KAAK,CAAC;YACJ,OAAO,WAAW,CAAC,GAAG,IAAI,CAAC,CAAC;QAE9B,KAAK,CAAC;YACJ,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,WAAW,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,CAAC;IAClD,CAAC;AACH,CAAC;AAED,MAAM,WAAW,GAAG,CAClB,KAAmB,EACnB,aAAgB,EACG,EAAE;IACrB,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;IAE3C,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7C,CAAC,CAAC;AA4CF,MAAM,UAAU,WAAW,CACzB,GAAG,IAMoE;IAEvE,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;QACpB,KAAK,CAAC;YACJ,OAAO,eAAe,CAAC,GAAG,IAAI,CAAC,CAAC;QAElC,KAAK,CAAC;YACJ,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,eAAe,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,CAAC;IACtD,CAAC;AACH,CAAC;AAED,MAAM,eAAe,GAAG,CACtB,KAAmB,EACnB,aAAgB,EAChB,SAAsC,EACnB,EAAE;IACrB,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IAEtD,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7C,CAAC,CAAC;AAuCF,MAAM,UAAU,WAAW,CACzB,GAAG,IAE4B;IAE/B,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;QACpB,KAAK,CAAC;YACJ,OAAO,eAAe,CAAC,GAAG,IAAI,CAAC,CAAC;QAElC,KAAK,CAAC;YACJ,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,eAAe,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,CAAC;IACtD,CAAC;AACH,CAAC;AAED,MAAM,eAAe,GAAG,CACtB,KAAmB,EACnB,aAAgB,EACG,EAAE;IACrB,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC;IAE/C,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7C,CAAC,CAAC;AA4CF,MAAM,UAAU,eAAe,CAC7B,GAAG,IAMoE;IAEvE,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;QACpB,KAAK,CAAC;YACJ,OAAO,mBAAmB,CAAC,GAAG,IAAI,CAAC,CAAC;QAEtC,KAAK,CAAC;YACJ,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,mBAAmB,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,CAAC;IAC1D,CAAC;AACH,CAAC;AAED,MAAM,mBAAmB,GAAG,CAC1B,KAAmB,EACnB,aAAgB,EAChB,SAAsC,EACnB,EAAE;IACrB,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IAE1D,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7C,CAAC,CAAC"}

package/dist/array/impl/array-utils-set-op.mjs

@@ -1,40 +1,148 @@
-const eq = (array1, array2, equality = Object.is) => array1.length === array2.length && // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-array1.every((v, i) => equality(v, array2[i]));
-const equal = eq;
-const isSubset = (array1, array2) => array1.every(
-  (a) => (
-    // eslint-disable-next-line total-functions/no-unsafe-type-assertion
-    array2.includes(a)
-  )
-);
-const isSuperset = (array1, array2) => isSubset(array2, array1);
-const setIntersection = (array1, array2) => (
-  // eslint-disable-next-line total-functions/no-unsafe-type-assertion
-  array1.filter((e) => array2.includes(e))
-);
-const setDifference = (array1, array2) => array1.filter((e) => !array2.includes(e));
-const sortedNumSetDifference = (sortedList1, sortedList2) => {
-  const mut_result = [];
-  let mut_it1 = 0;
-  let mut_it2 = 0;
-  while (mut_it1 < sortedList1.length && mut_it2 < sortedList2.length) {
-    const val1 = sortedList1[mut_it1];
-    const val2 = sortedList2[mut_it2];
-    if (val1 === val2) {
-      mut_it1 += 1;
-      mut_it2 += 1;
-    } else if (val1 < val2) {
-      mut_result.push(val1);
-      mut_it1 += 1;
-    } else {
-      mut_it2 += 1;
+/**
+ * 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.isTrue(Arr.eq(numbers, sameNumbers));
+ *
+ * assert.isFalse(Arr.eq(numbers, differentNumbers));
+ * ```
+ */
+export const eq = (array1, array2, equality = Object.is) => array1.length === array2.length &&
+    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+    array1.every((v, i) => equality(v, array2[i]));
+/**
+ * Alias for `eq`.
+ *
+ * @see {@link eq}
+ */
+export const equal = eq;
+/**
+ * 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.isTrue(Arr.isSubset(subset, superset));
+ *
+ * assert.isFalse(Arr.isSubset(notSubset, superset));
+ * ```
+ */
+export const isSubset = (array1, array2) => array1.every((a) => 
+// eslint-disable-next-line total-functions/no-unsafe-type-assertion
+array2.includes(a));
+/**
+ * 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.isTrue(Arr.isSuperset(potentialSuperset, subset));
+ *
+ * assert.isFalse(Arr.isSuperset(subset, potentialSuperset));
+ *
+ * assert.isFalse(Arr.isSuperset(potentialSuperset, notSuperset));
+ * ```
+ */
+export const isSuperset = (array1, array2) => isSubset(array2, array1);
+/**
+ * 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 const setIntersection = (array1, array2) => 
+// eslint-disable-next-line total-functions/no-unsafe-type-assertion
+array1.filter((e) => array2.includes(e));
+/**
+ * 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 const setDifference = (array1, array2) => array1.filter((e) => !array2.includes(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 const sortedNumSetDifference = (sortedList1, sortedList2) => {
+    const mut_result = [];
+    let mut_it1 = 0; // iterator for sortedList1
+    let mut_it2 = 0; // iterator for sortedList2
+    while (mut_it1 < sortedList1.length && mut_it2 < sortedList2.length) {
+        // Non-null assertions are safe due to loop condition
+        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+        const val1 = sortedList1[mut_it1];
+        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+        const val2 = sortedList2[mut_it2];
+        if (val1 === val2) {
+            mut_it1 += 1;
+            mut_it2 += 1;
+        }
+        else if (val1 < val2) {
+            mut_result.push(val1);
+            mut_it1 += 1;
+        }
+        else {
+            // val1 > val2
+            mut_it2 += 1;
+        }
     }
-  }
-  for (; mut_it1 < sortedList1.length; mut_it1 += 1) {
-    mut_result.push(sortedList1[mut_it1]);
-  }
-  return mut_result;
+    // Add remaining elements from sortedList1
+    for (; mut_it1 < sortedList1.length; mut_it1 += 1) {
+        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+        mut_result.push(sortedList1[mut_it1]);
+    }
+    return mut_result;
 };
-
-export { eq, equal, isSubset, isSuperset, setDifference, setIntersection, sortedNumSetDifference };
-//# sourceMappingURL=array-utils-set-op.mjs.map
+//# sourceMappingURL=array-utils-set-op.mjs.map

package/dist/array/impl/array-utils-set-op.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"array-utils-set-op.mjs","sources":["../../../src/array/impl/array-utils-set-op.mts"],"sourcesContent":["import { type Primitive } from 'ts-type-forge';\n\n/**\n * Checks if two arrays are equal by comparing their elements.\n *\n * @example\n *\n * ```ts\n * const numbers = [1, 2, 3] as const;\n *\n * const sameNumbers = [1, 2, 3] as const;\n *\n * const differentNumbers = [1, 2, 4] as const;\n *\n * assert.isTrue(Arr.eq(numbers, sameNumbers));\n *\n * assert.isFalse(Arr.eq(numbers, differentNumbers));\n * ```\n */\nexport const eq = <E,>(\n  array1: readonly E[],\n  array2: readonly E[],\n  equality: (a: E, b: E) => boolean = Object.is,\n): boolean =>\n  array1.length === array2.length &&\n  // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n  array1.every((v, i) => equality(v, array2[i]!));\n\n/**\n * Alias for `eq`.\n *\n * @see {@link eq}\n */\nexport const equal = eq;\n\n/**\n * Checks if the first array is a subset of the second array.\n *\n * @example\n *\n * ```ts\n * const subset = [1, 2] as const;\n *\n * const superset = [1, 2, 3] as const;\n *\n * const notSubset = [2, 4] as const;\n *\n * assert.isTrue(Arr.isSubset(subset, superset));\n *\n * assert.isFalse(Arr.isSubset(notSubset, superset));\n * ```\n */\nexport const isSubset = <E1 extends Primitive, E2 extends Primitive = E1>(\n  array1: readonly E1[],\n  array2: readonly E2[],\n): boolean =>\n  array1.every((a) =>\n    // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n    array2.includes(a as E1 & E2),\n  );\n\n/**\n * Checks if the first array is a superset of the second array.\n *\n * @example\n *\n * ```ts\n * const potentialSuperset = ['a', 'b', 'c'] as const;\n *\n * const subset = ['a', 'c'] as const;\n *\n * const notSuperset = ['a', 'd'] as const;\n *\n * assert.isTrue(Arr.isSuperset(potentialSuperset, subset));\n *\n * assert.isFalse(Arr.isSuperset(subset, potentialSuperset));\n *\n * assert.isFalse(Arr.isSuperset(potentialSuperset, notSuperset));\n * ```\n */\nexport const isSuperset = <E1 extends Primitive, E2 extends Primitive = E1>(\n  array1: readonly E1[],\n  array2: readonly E2[],\n): boolean => isSubset(array2, array1);\n\n/**\n * Returns the intersection of two arrays.\n *\n * @example\n *\n * ```ts\n * const refs = ['Ada', 'Alan', 'Grace'] as const;\n *\n * const attendees = ['Grace', 'Alan', 'Barbara'] as const;\n *\n * const both = Arr.setIntersection(refs, attendees);\n *\n * assert.deepStrictEqual(both, ['Alan', 'Grace']);\n * ```\n */\nexport const setIntersection = <\n  E1 extends Primitive,\n  E2 extends Primitive = E1,\n>(\n  array1: readonly E1[],\n  array2: readonly E2[],\n): readonly (E1 & E2)[] =>\n  // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n  (array1 as readonly (E1 & E2)[]).filter((e) => array2.includes(e));\n\n/**\n * Returns the set difference of two arrays (elements in first but not in second).\n *\n * @example\n *\n * ```ts\n * const baseline = [1, 2, 3, 4] as const;\n *\n * const removed = [2, 4] as const;\n *\n * const remaining = Arr.setDifference(baseline, removed);\n *\n * assert.deepStrictEqual(remaining, [1, 3]);\n * ```\n */\nexport const setDifference = <E extends Primitive>(\n  array1: readonly E[],\n  array2: readonly E[],\n): readonly E[] => array1.filter((e) => !array2.includes(e));\n\n/**\n * Returns the set difference of two sorted numeric arrays (optimized for sorted arrays).\n *\n * @example\n *\n * ```ts\n * const upcoming = [1, 3, 5, 7, 9] as const;\n *\n * const completed = [3, 4, 7] as const;\n *\n * const remaining = Arr.sortedNumSetDifference(upcoming, completed);\n *\n * const expected = [1, 5, 9] as const;\n *\n * assert.deepStrictEqual(remaining, expected);\n * ```\n */\nexport const sortedNumSetDifference = <E extends number>(\n  sortedList1: readonly E[],\n  sortedList2: readonly E[],\n): readonly E[] => {\n  const mut_result: E[] = [];\n\n  let mut_it1 = 0; // iterator for sortedList1\n\n  let mut_it2 = 0; // iterator for sortedList2\n\n  while (mut_it1 < sortedList1.length && mut_it2 < sortedList2.length) {\n    // Non-null assertions are safe due to loop condition\n    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n    const val1 = sortedList1[mut_it1]!;\n\n    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n    const val2 = sortedList2[mut_it2]!;\n\n    if (val1 === val2) {\n      mut_it1 += 1;\n\n      mut_it2 += 1;\n    } else if (val1 < val2) {\n      mut_result.push(val1);\n\n      mut_it1 += 1;\n    } else {\n      // val1 > val2\n      mut_it2 += 1;\n    }\n  }\n\n  // Add remaining elements from sortedList1\n  for (; mut_it1 < sortedList1.length; mut_it1 += 1) {\n    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n    mut_result.push(sortedList1[mut_it1]!);\n  }\n\n  return mut_result;\n};\n"],"names":[],"mappings":"AAmBO,MAAM,EAAA,GAAK,CAChB,MAAA,EACA,MAAA,EACA,WAAoC,MAAA,CAAO,EAAA,KAE3C,MAAA,CAAO,MAAA,KAAW,MAAA,CAAO,MAAA;AAEzB,MAAA,CAAO,KAAA,CAAM,CAAC,CAAA,EAAG,CAAA,KAAM,SAAS,CAAA,EAAG,MAAA,CAAO,CAAC,CAAE,CAAC;AAOzC,MAAM,KAAA,GAAQ;AAmBd,MAAM,QAAA,GAAW,CACtB,MAAA,EACA,MAAA,KAEA,MAAA,CAAO,KAAA;AAAA,EAAM,CAAC,CAAA;AAAA;AAAA,IAEZ,MAAA,CAAO,SAAS,CAAY;AAAA;AAC9B;AAqBK,MAAM,aAAa,CACxB,MAAA,EACA,MAAA,KACY,QAAA,CAAS,QAAQ,MAAM;AAiB9B,MAAM,eAAA,GAAkB,CAI7B,MAAA,EACA,MAAA;AAAA;AAAA,EAGC,OAAgC,MAAA,CAAO,CAAC,MAAM,MAAA,CAAO,QAAA,CAAS,CAAC,CAAC;AAAA;AAiB5D,MAAM,aAAA,GAAgB,CAC3B,MAAA,EACA,MAAA,KACiB,MAAA,CAAO,MAAA,CAAO,CAAC,CAAA,KAAM,CAAC,MAAA,CAAO,QAAA,CAAS,CAAC,CAAC;AAmBpD,MAAM,sBAAA,GAAyB,CACpC,WAAA,EACA,WAAA,KACiB;AACjB,EAAA,MAAM,aAAkB,EAAC;AAEzB,EAAA,IAAI,OAAA,GAAU,CAAA;AAEd,EAAA,IAAI,OAAA,GAAU,CAAA;AAEd,EAAA,OAAO,OAAA,GAAU,WAAA,CAAY,MAAA,IAAU,OAAA,GAAU,YAAY,MAAA,EAAQ;AAGnE,IAAA,MAAM,IAAA,GAAO,YAAY,OAAO,CAAA;AAGhC,IAAA,MAAM,IAAA,GAAO,YAAY,OAAO,CAAA;AAEhC,IAAA,IAAI,SAAS,IAAA,EAAM;AACjB,MAAA,OAAA,IAAW,CAAA;AAEX,MAAA,OAAA,IAAW,CAAA;AAAA,IACb,CAAA,MAAA,IAAW,OAAO,IAAA,EAAM;AACtB,MAAA,UAAA,CAAW,KAAK,IAAI,CAAA;AAEpB,MAAA,OAAA,IAAW,CAAA;AAAA,IACb,CAAA,MAAO;AAEL,MAAA,OAAA,IAAW,CAAA;AAAA,IACb;AAAA,EACF;AAGA,EAAA,OAAO,OAAA,GAAU,WAAA,CAAY,MAAA,EAAQ,OAAA,IAAW,CAAA,EAAG;AAEjD,IAAA,UAAA,CAAW,IAAA,CAAK,WAAA,CAAY,OAAO,CAAE,CAAA;AAAA,EACvC;AAEA,EAAA,OAAO,UAAA;AACT;;;;"}
+{"version":3,"file":"array-utils-set-op.mjs","sourceRoot":"","sources":["../../../src/array/impl/array-utils-set-op.mts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,CAAC,MAAM,EAAE,GAAG,CAChB,MAAoB,EACpB,MAAoB,EACpB,QAAQ,GAA4B,MAAM,CAAC,EAAE,EACpC,EAAE,CACX,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM;IAC/B,oEAAoE;IACpE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;AAElD;;;;GAIG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,EAAE,CAAC;AAExB;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,CACtB,MAAqB,EACrB,MAAqB,EACZ,EAAE,CACX,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE;AACjB,oEAAoE;AACpE,MAAM,CAAC,QAAQ,CAAC,CAAY,CAAC,CAC9B,CAAC;AAEJ;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CACxB,MAAqB,EACrB,MAAqB,EACZ,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAEvC;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAI7B,MAAqB,EACrB,MAAqB,EACC,EAAE;AACxB,oEAAoE;AACnE,MAA+B,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;AAErE;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,MAAoB,EACpB,MAAoB,EACN,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;AAE7D;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CACpC,WAAyB,EACzB,WAAyB,EACX,EAAE;IAChB,MAAM,UAAU,GAAQ,EAAE,CAAC;IAE3B,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC,2BAA2B;IAE5C,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC,2BAA2B;IAE5C,OAAO,OAAO,GAAG,WAAW,CAAC,MAAM,IAAI,OAAO,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC;QACpE,qDAAqD;QACrD,oEAAoE;QACpE,MAAM,IAAI,GAAG,WAAW,CAAC,OAAO,CAAE,CAAC;QAEnC,oEAAoE;QACpE,MAAM,IAAI,GAAG,WAAW,CAAC,OAAO,CAAE,CAAC;QAEnC,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,OAAO,IAAI,CAAC,CAAC;YAEb,OAAO,IAAI,CAAC,CAAC;QACf,CAAC;aAAM,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;YACvB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAEtB,OAAO,IAAI,CAAC,CAAC;QACf,CAAC;aAAM,CAAC;YACN,cAAc;YACd,OAAO,IAAI,CAAC,CAAC;QACf,CAAC;IACH,CAAC;IAED,0CAA0C;IAC1C,OAAO,OAAO,GAAG,WAAW,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,EAAE,CAAC;QAClD,oEAAoE;QACpE,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAE,CAAC,CAAC;IACzC,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC"}

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

@@ -1,8 +1,10 @@
-const size = (array) => (
-  // eslint-disable-next-line total-functions/no-unsafe-type-assertion
-  array.length
-);
-const length = size;
-
-export { length, size };
-//# sourceMappingURL=array-utils-size.mjs.map
+export const size = (array) => 
+// eslint-disable-next-line total-functions/no-unsafe-type-assertion
+array.length;
+/**
+ * Alias for `size`.
+ *
+ * @see {@link size}
+ */
+export const length = size;
+//# sourceMappingURL=array-utils-size.mjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"array-utils-size.mjs","sources":["../../../src/array/impl/array-utils-size.mts"],"sourcesContent":["import {\n  type IntersectBrand,\n  type NonEmptyTuple,\n  type PositiveNumber,\n} from 'ts-type-forge';\n/**\n * Returns the size (length) of an array.\n *\n * @example\n *\n * ```ts\n * const numbers = [1, 2, 3] as const;\n *\n * const letters: readonly string[] = [] as const;\n *\n * const sizeOfNumbers = Arr.size(numbers);\n *\n * const sizeOfLetters = Arr.size(letters);\n *\n * assert.isTrue(sizeOfNumbers === 3);\n *\n * assert.isTrue(sizeOfLetters === 0);\n * ```\n */\nimport { type SizeType } from '../../types.mjs';\n\nexport const size = <const Ar extends readonly unknown[]>(\n  array: Ar,\n): Ar extends NonEmptyTuple<unknown>\n  ? IntersectBrand<PositiveNumber, SizeType.Arr>\n  : SizeType.Arr =>\n  // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n  array.length as never;\n\n/**\n * Alias for `size`.\n *\n * @see {@link size}\n */\nexport const length = size;\n"],"names":[],"mappings":"AA0BO,MAAM,OAAO,CAClB,KAAA;AAAA;AAAA,EAKA,KAAA,CAAM;AAAA;AAOD,MAAM,MAAA,GAAS;;;;"}
+{"version":3,"file":"array-utils-size.mjs","sourceRoot":"","sources":["../../../src/array/impl/array-utils-size.mts"],"names":[],"mappings":"AA0BA,MAAM,CAAC,MAAM,IAAI,GAAG,CAClB,KAAS,EAGM,EAAE;AACjB,oEAAoE;AACpE,KAAK,CAAC,MAAe,CAAC;AAExB;;;;GAIG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,IAAI,CAAC"}

package/dist/array/impl/array-utils-slice-clamped.mjs

@@ -1,53 +1,16 @@
-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/negative-finite-number.mjs';
-import '../../number/branded-types/negative-int.mjs';
-import '../../number/branded-types/negative-safe-int.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-positive-finite-number.mjs';
-import '../../number/branded-types/non-positive-int.mjs';
-import '../../number/branded-types/non-positive-safe-int.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 '../../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';
-
-function sliceClamped(...args) {
-  switch (args.length) {
-    case 3:
-      return sliceClampedImpl(...args);
-    case 2:
-      return (array) => sliceClampedImpl(array, ...args);
-  }
+import { Num } from '../../number/index.mjs';
+export function sliceClamped(...args) {
+    switch (args.length) {
+        case 3:
+            return sliceClampedImpl(...args);
+        case 2:
+            return (array) => sliceClampedImpl(array, ...args);
+    }
 }
 const sliceClampedImpl = (array, start, end) => {
-  const startClamped = Num.clamp(0, array.length)(start);
-  const endClamped = Num.clamp(startClamped, array.length)(end);
-  return array.slice(startClamped, endClamped);
+    const startClamped = Num.clamp(0, array.length)(start);
+    // Ensure endClamped is not less than startClamped.
+    const endClamped = Num.clamp(startClamped, array.length)(end);
+    return array.slice(startClamped, endClamped);
 };
-
-export { sliceClamped };
-//# sourceMappingURL=array-utils-slice-clamped.mjs.map
+//# sourceMappingURL=array-utils-slice-clamped.mjs.map