ts-data-forge 14.6.1 → 14.6.2

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

@@ -1,224 +1,316 @@
-import '../../collections/imap-mapped.mjs';
-import { IMap } from '../../collections/imap.mjs';
-import '../../collections/iset-mapped.mjs';
-import '../../collections/iset.mjs';
-import '@sindresorhus/is';
-import { castMutable } from '../../others/cast-mutable.mjs';
-import { tp } from '../../others/tuple.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 { asPositiveUint32 } from '../../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, Uint32 } 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';
-import { seq, newArray } from './array-utils-creation.mjs';
+import { IMap } from '../../collections/index.mjs';
+
+import { asUint32, Uint32 } from '../../number/index.mjs';
+import { tp } from '../../others/index.mjs';
+import { seq } from './array-utils-creation.mjs';
 import { isNonEmpty } from './array-utils-length-bounded-array-guard.mjs';
 import { size } from './array-utils-size.mjs';
-
-function map(...args) {
-  switch (args.length) {
-    case 2: {
-      const [array, mapFn] = args;
-      return array.map(mapFn);
-    }
-    case 1: {
-      const [mapFn] = args;
-      return (array) => map(array, mapFn);
+export function map(...args) {
+    switch (args.length) {
+        case 2: {
+            const [array, mapFn] = args;
+            // eslint-disable-next-line total-functions/no-unsafe-type-assertion
+            return array.map(mapFn);
+        }
+        case 1: {
+            const [mapFn] = args;
+            return (array) => map(array, mapFn);
+        }
     }
-  }
 }
-function scan(...args) {
-  switch (args.length) {
-    case 3:
-      return scanImpl(...args);
-    case 2:
-      return (array) => scanImpl(array, ...args);
-  }
+export function scan(...args) {
+    switch (args.length) {
+        case 3:
+            return scanImpl(...args);
+        case 2:
+            return (array) => scanImpl(array, ...args);
+    }
 }
 const scanImpl = (array, reducer, init) => {
-  const mut_result = castMutable(
-    newArray(asPositiveUint32(array.length + 1), init)
-  );
-  let mut_acc = init;
-  for (const [index, value] of array.entries()) {
-    mut_acc = reducer(mut_acc, value, asUint32(index));
-    mut_result[index + 1] = mut_acc;
-  }
-  return mut_result;
+    const mut_result = newArray(asPositiveUint32(array.length + 1), init);
+    let mut_acc = init;
+    for (const [index, value] of array.entries()) {
+        mut_acc = reducer(mut_acc, value, asUint32(index));
+        mut_result[index + 1] = mut_acc;
+    }
+    return mut_result;
 };
-const toReversed = (array) => (
-  // eslint-disable-next-line total-functions/no-unsafe-type-assertion
-  array.toReversed()
-);
-function toSorted(array, comparator) {
-  return array.toSorted(
+/**
+ * Reverses an array.
+ *
+ * @example
+ *
+ * ```ts
+ * const tuple = [1, 'two', true] as const;
+ *
+ * const reversed = Arr.toReversed(tuple);
+ *
+ * const expected = [true, 'two', 1] as const;
+ *
+ * assert.deepStrictEqual(reversed, expected);
+ * ```
+ */
+export const toReversed = (array) => 
+// eslint-disable-next-line total-functions/no-unsafe-type-assertion
+array.toReversed();
+export function toSorted(array, comparator) {
+    return array.toSorted(
     // eslint-disable-next-line total-functions/no-unsafe-type-assertion
-    comparator ?? // eslint-disable-next-line total-functions/no-unsafe-type-assertion
-    ((x, y) => x - y)
-  );
+    comparator ??
+        // eslint-disable-next-line total-functions/no-unsafe-type-assertion
+        ((x, y) => x - y));
 }
-function toSortedBy(array, comparatorValueMapper, comparator) {
-  return array.toSorted(
-    (x, y) => comparator === void 0 ? (
-      // This branch assumes V is number if comparator is undefined.
-      // The overloads should handle this, but explicit cast might be needed if V is not number.
-      // eslint-disable-next-line total-functions/no-unsafe-type-assertion
-      comparatorValueMapper(x) - // eslint-disable-next-line total-functions/no-unsafe-type-assertion
-      comparatorValueMapper(y)
-    ) : comparator(comparatorValueMapper(x), comparatorValueMapper(y))
-  );
+export function toSortedBy(array, comparatorValueMapper, comparator) {
+    return array.toSorted((x, y) => comparator === undefined
+        ? // This branch assumes V is number if comparator is undefined.
+            // The overloads should handle this, but explicit cast might be needed if V is not number.
+            // eslint-disable-next-line total-functions/no-unsafe-type-assertion
+            comparatorValueMapper(x) -
+                // eslint-disable-next-line total-functions/no-unsafe-type-assertion
+                comparatorValueMapper(y)
+        : comparator(comparatorValueMapper(x), comparatorValueMapper(y)));
 }
-function filter(...args) {
-  switch (args.length) {
-    case 2:
-      return filterImpl(...args);
-    case 1:
-      return (array) => filterImpl(array, ...args);
-  }
+export function filter(...args) {
+    switch (args.length) {
+        case 2:
+            return filterImpl(...args);
+        case 1:
+            return (array) => filterImpl(array, ...args);
+    }
 }
 const filterImpl = (array, predicate) => array.filter((a, i) => predicate(a, asUint32(i)));
-function filterNot(...args) {
-  switch (args.length) {
-    case 2:
-      return filterNotImpl(...args);
-    case 1:
-      return (array) => filterNotImpl(array, ...args);
-  }
+export function filterNot(...args) {
+    switch (args.length) {
+        case 2:
+            return filterNotImpl(...args);
+        case 1:
+            return (array) => filterNotImpl(array, ...args);
+    }
 }
 const filterNotImpl = (array, predicate) => array.filter((a, i) => !predicate(a, asUint32(i)));
-const uniq = (array) => (
-  // eslint-disable-next-line total-functions/no-unsafe-type-assertion
-  Array.from(new Set(array))
-);
-const uniqBy = (array, mapFn) => {
-  const mut_mappedValues = /* @__PURE__ */ new Set();
-  return array.filter((val) => {
-    const mappedValue = mapFn(val);
-    if (mut_mappedValues.has(mappedValue)) return false;
-    mut_mappedValues.add(mappedValue);
-    return true;
-  });
+/**
+ * Creates a new array with unique elements.
+ *
+ * @example
+ *
+ * ```ts
+ * const letters = ['a', 'b', 'a', 'c', 'b'] as const;
+ *
+ * const uniqueLetters = Arr.uniq(letters);
+ *
+ * const expected = ['a', 'b', 'c'] as const;
+ *
+ * assert.deepStrictEqual<readonly string[]>(uniqueLetters, expected);
+ * ```
+ */
+export const uniq = (array) => 
+// eslint-disable-next-line total-functions/no-unsafe-type-assertion
+Array.from(new Set(array));
+/**
+ * Creates a new array with unique elements based on a mapped value.
+ *
+ * @example
+ *
+ * ```ts
+ * const people = [
+ *   { id: 1, name: 'Ada' },
+ *   { id: 2, name: 'Brian' },
+ *   { id: 1, name: 'Alan' },
+ *   { id: 3, name: 'Grace' },
+ * ] as const;
+ *
+ * const uniqueById = Arr.uniqBy(people, (person) => person.id);
+ *
+ * const expected = [
+ *   { id: 1, name: 'Ada' },
+ *   { id: 2, name: 'Brian' },
+ *   { id: 3, name: 'Grace' },
+ * ] as const;
+ *
+ * assert.deepStrictEqual<readonly Readonly<{ id: number; name: string }>[]>(
+ *   uniqueById,
+ *   expected,
+ * );
+ * ```
+ */
+export const uniqBy = (array, mapFn) => {
+    const mut_mappedValues = new Set();
+    // eslint-disable-next-line total-functions/no-unsafe-type-assertion
+    return array.filter((val) => {
+        const mappedValue = mapFn(val);
+        if (mut_mappedValues.has(mappedValue))
+            return false;
+        mut_mappedValues.add(mappedValue);
+        return true;
+    });
 };
-function flat(...args) {
-  switch (args.length) {
-    case 2:
-      return flatImpl(...args);
-    case 1: {
-      const [arrayOrDepth] = args;
-      if (typeof arrayOrDepth === "number") {
-        const depth = arrayOrDepth;
-        return (array) => flatImpl(array, depth);
-      }
-      if (arrayOrDepth === void 0) {
-        return (array) => flatImpl(array, 1);
-      }
-      return arrayOrDepth.flat();
+export function flat(...args) {
+    switch (args.length) {
+        case 2:
+            return flatImpl(...args);
+        case 1: {
+            const [arrayOrDepth] = args;
+            if (typeof arrayOrDepth === 'number') {
+                const depth = arrayOrDepth;
+                return (array) => flatImpl(array, depth);
+            }
+            if (arrayOrDepth === undefined) {
+                return (array) => flatImpl(array, 1);
+            }
+
+            return arrayOrDepth.flat();
+        }
+        case 0:
+            return (array) => flatImpl(array, 1);
     }
-    case 0:
-      return (array) => flatImpl(array, 1);
-  }
 }
 const flatImpl = (array, depth) => array.flat(depth);
-function flatMap(...args) {
-  switch (args.length) {
-    case 2: {
-      const [array, mapFn] = args;
-      return array.flatMap((a, i) => mapFn(a, asUint32(i)));
-    }
-    case 1: {
-      const [mapFn] = args;
-      return (array) => flatMap(array, mapFn);
+export function flatMap(...args) {
+    switch (args.length) {
+        case 2: {
+            const [array, mapFn] = args;
+            return array.flatMap((a, i) => mapFn(a, asUint32(i)));
+        }
+        case 1: {
+            const [mapFn] = args;
+            return (array) => flatMap(array, mapFn);
+        }
     }
-  }
 }
-function partition(...args) {
-  switch (args.length) {
-    case 2:
-      return partitionImpl(...args);
-    case 1:
-      return (array) => partitionImpl(array, ...args);
-  }
+export function partition(...args) {
+    switch (args.length) {
+        case 2:
+            return partitionImpl(...args);
+        case 1:
+            return (array) => partitionImpl(array, ...args);
+    }
 }
-const partitionImpl = (array, chunkSize) => chunkSize < 2 ? [] : (
-  // eslint-disable-next-line total-functions/no-partial-division
-  seq(asUint32(Math.ceil(array.length / chunkSize))).map(
-    (i) => array.slice(chunkSize * i, chunkSize * (i + 1))
-  )
-);
-const chunk = partition;
-const concat = (array1, array2) => (
-  // eslint-disable-next-line total-functions/no-unsafe-type-assertion
-  [...array1, ...array2]
-);
-function groupBy(...args) {
-  switch (args.length) {
-    case 2: {
-      const [array, grouper] = args;
-      const mut_groups = /* @__PURE__ */ new Map();
-      for (const [index, e] of array.entries()) {
-        const key = grouper(e, asUint32(index));
-        const mut_group = mut_groups.get(key);
-        if (mut_group !== void 0) {
-          mut_group.push(e);
-        } else {
-          mut_groups.set(key, [e]);
+const partitionImpl = (array, chunkSize) => chunkSize < 2
+    ? []
+    : // eslint-disable-next-line total-functions/no-partial-division
+        seq(asUint32(Math.ceil(array.length / chunkSize))).map((i) => array.slice(chunkSize * i, chunkSize * (i + 1)));
+/**
+ * Alias for `partition`.
+ *
+ * @see {@link partition}
+ */
+export const chunk = partition;
+/**
+ * Concatenates two arrays.
+ *
+ * The exact tuple shape is preserved. Additionally, when either input is known
+ * to be non-empty (a non-empty tuple or a branded `NonEmptyArray`), the result
+ * is branded as non-empty so it is assignable to `NonEmptyArray`.
+ *
+ * @example
+ *
+ * ```ts
+ * const numbers = [1, 2] as const;
+ *
+ * const words = ['three', 'four'] as const;
+ *
+ * const combined = Arr.concat(numbers, words);
+ *
+ * // Because at least one input is non-empty, the result is assignable to
+ * // NonEmptyArray.
+ * const nonEmpty: NonEmptyArray<number | string> = combined;
+ *
+ * const expectedCombined = [1, 2, 'three', 'four'] as const;
+ *
+ * assert.deepStrictEqual<readonly (number | string)[]>(
+ *   combined,
+ *   expectedCombined,
+ * );
+ *
+ * assert.isTrue(nonEmpty.length >= 1);
+ * ```
+ */
+export const concat = (array1, array2) => 
+// eslint-disable-next-line total-functions/no-unsafe-type-assertion
+[...array1, ...array2];
+export function groupBy(...args) {
+    switch (args.length) {
+        case 2: {
+            const [array, grouper] = args;
+            const mut_groups = new Map(); // Store mutable arrays internally
+            for (const [index, e] of array.entries()) {
+                const key = grouper(e, asUint32(index)); // Ensure index is treated as SizeType.Arr
+                const mut_group = mut_groups.get(key);
+                if (mut_group !== undefined) {
+                    mut_group.push(e);
+                }
+                else {
+                    mut_groups.set(key, [e]);
+                }
+            }
+            // Cast to IMap<G, readonly A[]> for the public interface
+            return IMap.create(mut_groups);
+        }
+        case 1: {
+            const [grouper] = args;
+            return (array) => groupBy(array, grouper);
         }
-      }
-      return IMap.create(mut_groups);
-    }
-    case 1: {
-      const [grouper] = args;
-      return (array) => groupBy(array, grouper);
     }
-  }
 }
-const zip = (array1, array2) => (
-  // eslint-disable-next-line total-functions/no-unsafe-type-assertion
-  seq(Uint32.min(size(array1), size(array2))).map(
-    (i) => (
-      // Non-null assertion is safe here because `i` is always within bounds of both arrays up to the length of the shorter one.
-      // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-      tp(array1[i], array2[i])
-    )
-  )
-);
-const cartesianProduct = (arrays) => {
-  if (!isNonEmpty(arrays)) return [[]];
-  const [first, ...rest] = arrays;
-  if (!isNonEmpty(first)) return [];
-  const restProduct = cartesianProduct(rest);
-  return first.flatMap((item) => restProduct.map((prod) => [item, ...prod]));
+/**
+ * Creates an array of tuples by pairing corresponding elements from two arrays.
+ *
+ * @example
+ *
+ * ```ts
+ * const letters = ['a', 'b', 'c'] as const;
+ *
+ * const numbers = [1, 2, 3] as const;
+ *
+ * const pairs = Arr.zip(letters, numbers);
+ *
+ * const expectedPairs = [
+ *   ['a', 1],
+ *   ['b', 2],
+ *   ['c', 3],
+ * ] as const;
+ *
+ * assert.deepStrictEqual(pairs, expectedPairs);
+ * ```
+ */
+export const zip = (array1, array2) => 
+// eslint-disable-next-line total-functions/no-unsafe-type-assertion
+seq(Uint32.min(size(array1), size(array2))).map((i) => 
+// Non-null assertion is safe here because `i` is always within bounds of both arrays up to the length of the shorter one.
+// eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+tp(array1[i], array2[i]));
+/**
+ * Computes the cartesian product of arrays.
+ * cartesianProduct([[1,2], [3,4]]) => [[1,3], [1,4], [2,3], [2,4]]
+ *
+ * @example
+ *
+ *
+ * ```ts
+ * const sizes = ['S', 'M'] as const;
+ *
+ * const colors = ['red', 'blue'] as const;
+ *
+ * const combinations = Arr.cartesianProduct([sizes, colors]);
+ *
+ * const expectedCombinations = [
+ *   ['S', 'red'],
+ *   ['S', 'blue'],
+ *   ['M', 'red'],
+ *   ['M', 'blue'],
+ * ] as const;
+ *
+ * assert.deepStrictEqual(combinations, expectedCombinations);
+ * ```
+ */
+export const cartesianProduct = (arrays) => {
+    if (!isNonEmpty(arrays))
+        return [[]];
+    const [first, ...rest] = arrays;
+    // If first array is empty, the result is empty
+    if (!isNonEmpty(first))
+        return [];
+    const restProduct = cartesianProduct(rest);
+    return first.flatMap((item) => restProduct.map((prod) => [item, ...prod]));
 };
-
-export { cartesianProduct, chunk, concat, filter, filterNot, flat, flatMap, groupBy, map, partition, scan, toReversed, toSorted, toSortedBy, uniq, uniqBy, zip };
-//# sourceMappingURL=array-utils-transformation.mjs.map
+//# sourceMappingURL=array-utils-transformation.mjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"array-utils-transformation.mjs","sources":["../../../src/array/impl/array-utils-transformation.mts"],"sourcesContent":["import {\n  type BoundedLengthArray,\n  type ChangeArrayElement,\n  type ConstrainedList,\n  type FixedLengthTuple,\n  type HasLengthConstraint,\n  type IsFixedLengthList,\n  type NonEmptyArray,\n  type NonEmptyTuple,\n  type PositiveInt,\n  type PositiveUint32,\n  type Primitive,\n  type SafeUintWithSmallInt,\n  type SupportedLength,\n  type UnknownBrand,\n  type WithSmallInt,\n} from 'ts-type-forge';\nimport { IMap } from '../../collections/index.mjs';\nimport { expectType } from '../../expect-type.mjs';\nimport { asPositiveUint32, asUint32, Uint32 } from '../../number/index.mjs';\nimport { castMutable, tp } from '../../others/index.mjs';\nimport {\n  type ArrayIndex,\n  type MapSetKeyType,\n  type SizeType,\n} from '../../types.mjs';\nimport { newArray, seq } from './array-utils-creation.mjs';\nimport { isNonEmpty } from './array-utils-length-bounded-array-guard.mjs';\nimport { size } from './array-utils-size.mjs';\n\n/**\n * Creates a new array by transforming each element with a mapping function.\n *\n * @example\n *\n * ```ts\n * const numbers = [1, 2, 3] as const;\n *\n * const doubled = Arr.map(numbers, (value) => value * 2);\n *\n * const indexed = Arr.map<number, string>(\n *   (value, index) => `${index}:${value}`,\n * )(numbers);\n *\n * assert.deepStrictEqual(doubled, [2, 4, 6]);\n *\n * assert.deepStrictEqual(indexed, ['0:1', '1:2', '2:3']);\n * ```\n */\nexport function map<const Ar extends readonly unknown[] & UnknownBrand, B>(\n  array: Ar,\n  mapFn: (a: Ar[number], index: ArrayIndex<Ar>) => B,\n): ChangeArrayElement<Ar, B>;\n\n// A plain array or tuple carries no length brand, so the homomorphic mapping\n// is the whole answer. Stating it directly — rather than going through\n// `ChangeArrayElement`, whose `HasLengthConstraint` test a *generic* `Ar`\n// cannot decide — is what keeps `map` usable inside a function that is itself\n// generic over the tuple: a deferred conditional is not assignable to the\n// caller's own `{ [K in keyof Ar]: B }`, while this is.\nexport function map<const Ar extends readonly unknown[], B>(\n  array: Ar,\n  mapFn: (a: Ar[number], index: ArrayIndex<Ar>) => B,\n): Readonly<{ [K in keyof Ar]: B }>;\n\n// curried version\n//\n// The two cases have to be overloads *of the returned function*, not two\n// overloads of `map` itself: both curried signatures take the same single\n// argument, so overload resolution would always pick the first and the second\n// would be dead.\n//\n// Spelled as an intersection of two function types rather than one object type\n// carrying two call signatures — the `convert-to-readonly` codemod wraps an\n// inline object type in `Readonly<…>`, and a mapped type drops call\n// signatures, which would leave the curried form with none at all.\nexport function map<A, B>(\n  mapFn: (a: A, index: SizeType.Arr) => B,\n): (<const Ar extends readonly A[] & UnknownBrand>(\n  array: Ar,\n) => ChangeArrayElement<Ar, B>) &\n  (<const Ar extends readonly A[]>(\n    array: Ar,\n  ) => Readonly<{ [K in keyof Ar]: B }>);\n\nexport function map<A, B>(\n  ...args:\n    | readonly [array: readonly A[], mapFn: (a: A, index: SizeType.Arr) => B]\n    | readonly [mapFn: (a: A, index: SizeType.Arr) => B]\n): readonly B[] | ((array: readonly A[]) => readonly B[]) {\n  switch (args.length) {\n    case 2: {\n      const [array, mapFn] = args;\n\n      // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n      return array.map(mapFn as never);\n    }\n\n    case 1: {\n      const [mapFn] = args;\n\n      return (array: readonly A[]) => map(array, mapFn);\n    }\n  }\n}\n\n/**\n * Returns an array of successively reduced values from an array.\n *\n * @example\n *\n * ```ts\n * const changes = [5, -2, 3] as const;\n *\n * const runningTotals = Arr.scan(\n *   changes,\n *   (total, change) => total + change,\n *   0,\n * );\n *\n * const runningTotalsFromCurried = Arr.scan(\n *   (total: number, change: number) => total + change,\n *   10,\n * )([-5, 15]);\n *\n * const expectedTotals = [0, 5, 3, 6] as const;\n *\n * const expectedCurriedTotals = [10, 5, 20] as const;\n *\n * assert.deepStrictEqual<readonly number[]>(runningTotals, expectedTotals);\n *\n * assert.deepStrictEqual<readonly number[]>(\n *   runningTotalsFromCurried,\n *   expectedCurriedTotals,\n * );\n * ```\n */\nexport function scan<const Ar extends readonly unknown[], S>(\n  array: Ar,\n  reducer: (\n    accumulator: S,\n    currentValue: Ar[number],\n    currentIndex: ArrayIndex<Ar>,\n  ) => S,\n  init: S,\n): NonEmptyArray<S>;\n\nexport function scan<E, S>(\n  reducer: (accumulator: S, currentValue: E, currentIndex: SizeType.Arr) => S,\n  init: S,\n): (array: readonly E[]) => NonEmptyArray<S>;\n\nexport function scan<E, S>(\n  ...args:\n    | readonly [\n        array: readonly E[],\n        reducer: (\n          accumulator: S,\n          currentValue: E,\n          currentIndex: SizeType.Arr,\n        ) => S,\n        init: S,\n      ]\n    | readonly [\n        reducer: (\n          accumulator: S,\n          currentValue: E,\n          currentIndex: SizeType.Arr,\n        ) => S,\n        init: S,\n      ]\n): NonEmptyTuple<S> | ((array: readonly E[]) => NonEmptyTuple<S>) {\n  switch (args.length) {\n    case 3:\n      return scanImpl(...args);\n\n    case 2:\n      return (array) => scanImpl(array, ...args);\n  }\n}\n\nconst scanImpl = <E, S>(\n  array: readonly E[],\n  reducer: (accumulator: S, currentValue: E, currentIndex: SizeType.Arr) => S,\n  init: S,\n): NonEmptyTuple<S> => {\n  const mut_result = castMutable<NonEmptyTuple<S>>(\n    newArray<PositiveUint32, S>(asPositiveUint32(array.length + 1), init),\n  );\n\n  let mut_acc = init;\n\n  for (const [index, value] of array.entries()) {\n    mut_acc = reducer(mut_acc, value, asUint32(index));\n\n    mut_result[index + 1] = mut_acc;\n  }\n\n  return mut_result;\n};\n\n/**\n * Reverses an array.\n *\n * @example\n *\n * ```ts\n * const tuple = [1, 'two', true] as const;\n *\n * const reversed = Arr.toReversed(tuple);\n *\n * const expected = [true, 'two', 1] as const;\n *\n * assert.deepStrictEqual(reversed, expected);\n * ```\n */\nexport const toReversed = <const Ar extends readonly unknown[]>(\n  array: Ar,\n): ConstrainedList.Reverse<Ar> =>\n  // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n  array.toReversed() as never;\n\n/**\n * Sorts an array.\n *\n * @example\n *\n * ```ts\n * const numbers = [3, 1, 2] as const;\n *\n * const words = ['banana', 'apple', 'cherry'] as const;\n *\n * const ascendingNumbers = Arr.toSorted(numbers);\n *\n * const alphabetical = Arr.toSorted(words, (left, right) =>\n *   left.localeCompare(right),\n * );\n *\n * const expectedNumbers = [1, 2, 3] as const;\n *\n * const expectedWords = ['apple', 'banana', 'cherry'] as const;\n *\n * assert.deepStrictEqual(ascendingNumbers, expectedNumbers);\n *\n * assert.deepStrictEqual(alphabetical, expectedWords);\n * ```\n */\n// Numbers sort without a comparator, so it is optional for them and required\n// for everything else.\n//\n// Stated as two overloads rather than one conditional rest-parameter tuple.\n// The conditional form reads well, but a *generic* `Ar` cannot decide it, so\n// the parameter list stayed unresolved and `Arr.toSorted(xs, cmp)` inside a\n// function that is itself generic over the array was rejected outright:\n//\n//     Argument of type '[T, (a: number, b: number) => number]' is not\n//     assignable to parameter of type 'T extends readonly number[] ? ... : ...'\n//\n// Overload resolution picks a branch per call instead, so both concrete and\n// generic callers work. The *return* type stays conditional — that one a\n// generic caller handles, as `toSortedBy` (same shape) already showed.\nexport function toSorted<const Ar extends readonly number[]>(\n  array: Ar,\n  comparator?: (x: Ar[number], y: Ar[number]) => number,\n): SortedResult<Ar>;\n\nexport function toSorted<const Ar extends readonly unknown[]>(\n  array: Ar,\n  comparator: (x: Ar[number], y: Ar[number]) => number,\n): SortedResult<Ar>;\n\nexport function toSorted(\n  array: readonly unknown[],\n  comparator?: (x: never, y: never) => number,\n): readonly unknown[] {\n  return array.toSorted(\n    // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n    (comparator as ((x: unknown, y: unknown) => number) | undefined) ??\n      // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n      ((x, y) => (x as number) - (y as number)),\n  );\n}\n\n/** The result of sorting `Ar`: same elements, same length, same bounds. */\ntype SortedResult<Ar extends readonly unknown[]> =\n  HasLengthConstraint<Ar> extends true\n    ? ChangeArrayElement<Ar, Ar[number]>\n    : IsFixedLengthList<Ar> extends true\n      ? FixedLengthTuple<Ar['length'], Ar[number]>\n      : Ar extends NonEmptyTuple<unknown>\n        ? NonEmptyArray<Ar[number]>\n        : readonly Ar[number][];\n\n/**\n * Sorts an array by a mapped value.\n *\n * @example\n *\n * ```ts\n * const projects = [\n *   { name: 'compiler', issues: 7 },\n *   { name: 'docs', issues: 2 },\n *   { name: 'ui', issues: 5 },\n * ] as const;\n *\n * const byIssueCount = Arr.toSortedBy(projects, (project) => project.issues);\n *\n * const byIssueCountDescending = Arr.toSortedBy(\n *   projects,\n *   (project) => project.issues,\n *   (left, right) => right - left,\n * );\n *\n * const expectedByIssues = [\n *   { name: 'docs', issues: 2 },\n *   { name: 'ui', issues: 5 },\n *   { name: 'compiler', issues: 7 },\n * ] as const;\n *\n * const expectedByIssueCountDescending = [\n *   { name: 'compiler', issues: 7 },\n *   { name: 'ui', issues: 5 },\n *   { name: 'docs', issues: 2 },\n * ] as const;\n *\n * assert.deepStrictEqual(byIssueCount, expectedByIssues);\n *\n * assert.deepStrictEqual(\n *   byIssueCountDescending,\n *   expectedByIssueCountDescending,\n * );\n * ```\n */\nexport function toSortedBy<const Ar extends readonly unknown[]>(\n  array: Ar,\n  comparatorValueMapper: (value: Ar[number]) => number,\n  // If the array elements are mapped to numbers, comparator is optional.\n  comparator?: (x: number, y: number) => number,\n): HasLengthConstraint<Ar> extends true\n  ? ChangeArrayElement<Ar, Ar[number]>\n  : IsFixedLengthList<Ar> extends true\n    ? FixedLengthTuple<Ar['length'], Ar[number]>\n    : Ar extends NonEmptyTuple<unknown>\n      ? NonEmptyArray<Ar[number]>\n      : readonly Ar[number][];\n\nexport function toSortedBy<const Ar extends readonly unknown[], const V>(\n  array: Ar,\n  comparatorValueMapper: (value: Ar[number]) => V,\n  comparator: (x: V, y: V) => number,\n): HasLengthConstraint<Ar> extends true\n  ? ChangeArrayElement<Ar, Ar[number]>\n  : IsFixedLengthList<Ar> extends true\n    ? FixedLengthTuple<Ar['length'], Ar[number]>\n    : Ar extends NonEmptyTuple<unknown>\n      ? NonEmptyArray<Ar[number]>\n      : readonly Ar[number][];\n\nexport function toSortedBy<E, const V>(\n  array: readonly E[],\n  comparatorValueMapper: (value: E) => V,\n  comparator?: (x: V, y: V) => number,\n): readonly E[] {\n  return array.toSorted((x, y) =>\n    comparator === undefined\n      ? // This branch assumes V is number if comparator is undefined.\n        // The overloads should handle this, but explicit cast might be needed if V is not number.\n        // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n        (comparatorValueMapper(x) as number) -\n        // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n        (comparatorValueMapper(y) as number)\n      : comparator(comparatorValueMapper(x), comparatorValueMapper(y)),\n  );\n}\n\n/**\n * Filters an array based on a predicate function.\n *\n * @example\n *\n * ```ts\n * const numbers = [1, 2, 3, 4] as const;\n *\n * const evens = Arr.filter(numbers, (value) => value % 2 === 0);\n *\n * const greaterThanTwo = Arr.filter<number>((value) => value > 2)(numbers);\n *\n * assert.deepStrictEqual(evens, [2, 4]);\n *\n * assert.deepStrictEqual(greaterThanTwo, [3, 4]);\n * ```\n */\n// Type guard overloads\nexport function filter<\n  const Ar extends readonly unknown[],\n  S extends Ar[number],\n>(\n  array: Ar,\n  predicate: (a: Ar[number], index: ArrayIndex<Ar>) => a is S,\n): readonly S[];\n\nexport function filter<E, S extends E>(\n  predicate: (a: E, index: SizeType.Arr) => a is S,\n): (array: readonly E[]) => readonly S[];\n\n// Regular boolean predicate overloads\nexport function filter<const Ar extends readonly unknown[]>(\n  array: Ar,\n  predicate: (a: Ar[number], index: ArrayIndex<Ar>) => boolean,\n): readonly Ar[number][];\n\nexport function filter<E>(\n  predicate: (a: E, index: SizeType.Arr) => boolean,\n): (array: readonly E[]) => readonly E[];\n\nexport function filter<E>(\n  ...args:\n    | readonly [\n        array: readonly E[],\n        predicate: (a: E, index: SizeType.Arr) => boolean,\n      ]\n    | readonly [predicate: (a: E, index: SizeType.Arr) => boolean]\n): readonly E[] | ((array: readonly E[]) => readonly E[]) {\n  switch (args.length) {\n    case 2:\n      return filterImpl(...args);\n\n    case 1:\n      return (array) => filterImpl(array, ...args);\n  }\n}\n\nconst filterImpl = <E,>(\n  array: readonly E[],\n  predicate: (a: E, index: SizeType.Arr) => boolean,\n): readonly E[] => array.filter((a, i) => predicate(a, asUint32(i)));\n\n/**\n * Filters an array by excluding elements for which the predicate returns true.\n *\n * @example\n *\n * ```ts\n * const names = ['Ada', 'Grace', 'Linus'] as const;\n *\n * const notAda = Arr.filterNot(names, (name) => name === 'Ada');\n *\n * const notShort = Arr.filterNot<string>((name) => name.length <= 4)(names);\n *\n * assert.deepStrictEqual(notAda, ['Grace', 'Linus']);\n *\n * assert.deepStrictEqual(notShort, ['Grace', 'Linus']);\n * ```\n */\nexport function filterNot<const Ar extends readonly unknown[]>(\n  array: Ar,\n  predicate: (a: Ar[number], index: ArrayIndex<Ar>) => boolean,\n): readonly Ar[number][];\n\nexport function filterNot<E>(\n  predicate: (a: E, index: SizeType.Arr) => boolean,\n): (array: readonly E[]) => readonly E[];\n\nexport function filterNot<E>(\n  ...args:\n    | readonly [\n        array: readonly E[],\n        predicate: (a: E, index: SizeType.Arr) => boolean,\n      ]\n    | readonly [predicate: (a: E, index: SizeType.Arr) => boolean]\n): readonly E[] | ((array: readonly E[]) => readonly E[]) {\n  switch (args.length) {\n    case 2:\n      return filterNotImpl(...args);\n\n    case 1:\n      return (array) => filterNotImpl(array, ...args);\n  }\n}\n\nconst filterNotImpl = <E,>(\n  array: readonly E[],\n  predicate: (a: E, index: SizeType.Arr) => boolean,\n): readonly E[] => array.filter((a, i) => !predicate(a, asUint32(i)));\n\n/**\n * Creates a new array with unique elements.\n *\n * @example\n *\n * ```ts\n * const letters = ['a', 'b', 'a', 'c', 'b'] as const;\n *\n * const uniqueLetters = Arr.uniq(letters);\n *\n * const expected = ['a', 'b', 'c'] as const;\n *\n * assert.deepStrictEqual<readonly string[]>(uniqueLetters, expected);\n * ```\n */\nexport const uniq = <const Ar extends readonly Primitive[]>(\n  array: Ar,\n): Ar extends NonEmptyTuple<unknown>\n  ? NonEmptyArray<Ar[number]>\n  : readonly Ar[number][] =>\n  // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n  Array.from(new Set(array)) as never;\n\n/**\n * Creates a new array with unique elements based on a mapped value.\n *\n * @example\n *\n * ```ts\n * const people = [\n *   { id: 1, name: 'Ada' },\n *   { id: 2, name: 'Brian' },\n *   { id: 1, name: 'Alan' },\n *   { id: 3, name: 'Grace' },\n * ] as const;\n *\n * const uniqueById = Arr.uniqBy(people, (person) => person.id);\n *\n * const expected = [\n *   { id: 1, name: 'Ada' },\n *   { id: 2, name: 'Brian' },\n *   { id: 3, name: 'Grace' },\n * ] as const;\n *\n * assert.deepStrictEqual<readonly Readonly<{ id: number; name: string }>[]>(\n *   uniqueById,\n *   expected,\n * );\n * ```\n */\nexport const uniqBy = <\n  const Ar extends readonly unknown[],\n  P extends Primitive,\n>(\n  array: Ar,\n  mapFn: (value: Ar[number]) => P,\n): Ar extends NonEmptyTuple<unknown>\n  ? NonEmptyArray<Ar[number]>\n  : readonly Ar[number][] => {\n  const mut_mappedValues = new Set<P>();\n\n  // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n  return array.filter((val) => {\n    const mappedValue = mapFn(val);\n\n    if (mut_mappedValues.has(mappedValue)) return false;\n\n    mut_mappedValues.add(mappedValue);\n\n    return true;\n  }) satisfies readonly Ar[number][] as never;\n};\n\n/**\n * Flattens nested arrays up to the specified depth.\n *\n * @example\n *\n * ```ts\n * const nested = [\n *   [1, 2],\n *   [3, 4],\n * ] as const;\n *\n * const flatOnce = Arr.flat(nested, 1);\n *\n * const flatCurried = Arr.flat()(nested);\n *\n * assert.deepStrictEqual(flatOnce, [1, 2, 3, 4]);\n *\n * assert.deepStrictEqual(flatCurried, [1, 2, 3, 4]);\n * ```\n */\nexport function flat<\n  const Ar extends readonly unknown[],\n  D extends SafeUintWithSmallInt = 1,\n>(array: Ar, depth?: D): readonly FlatArray<Ar, D>[];\n\nexport function flat<D extends SafeUintWithSmallInt = 1>(\n  depth?: number,\n): <const Ar extends readonly unknown[]>(\n  array: Ar,\n) => readonly FlatArray<Ar, D>[];\n\nexport function flat<E, D extends SafeUintWithSmallInt = 1>(\n  ...args: readonly [array: readonly E[], depth?: D] | readonly [depth?: D]\n): readonly unknown[] | ((array: readonly unknown[]) => readonly unknown[]) {\n  switch (args.length) {\n    case 2:\n      return flatImpl(...args);\n\n    case 1: {\n      const [arrayOrDepth] = args;\n\n      if (typeof arrayOrDepth === 'number') {\n        const depth = arrayOrDepth as SafeUintWithSmallInt | undefined;\n\n        return (array) => flatImpl(array, depth);\n      }\n\n      if (arrayOrDepth === undefined) {\n        return (array) => flatImpl(array, 1);\n      }\n\n      expectType<typeof arrayOrDepth, readonly E[]>('=');\n\n      return arrayOrDepth.flat();\n    }\n\n    case 0:\n      return (array) => flatImpl(array, 1);\n  }\n}\n\nconst flatImpl = (\n  array: readonly unknown[],\n  depth?: SafeUintWithSmallInt,\n): readonly unknown[] => array.flat(depth);\n\n/**\n * Maps each element and flattens the result.\n *\n * @example\n *\n * ```ts\n * const words = ['Ada', 'AI'] as const;\n *\n * const characters = Arr.flatMap(words, (word) => word.split(''));\n *\n * const labeled = Arr.flatMap<string, string>((word, index) =>\n *   word.split('').map((char) => `${index}-${char}`),\n * )(words);\n *\n * assert.deepStrictEqual(characters, ['A', 'd', 'a', 'A', 'I']);\n *\n * assert.deepStrictEqual(labeled, ['0-A', '0-d', '0-a', '1-A', '1-I']);\n * ```\n */\nexport function flatMap<const Ar extends readonly unknown[], B>(\n  array: Ar,\n  mapFn: (a: Ar[number], index: ArrayIndex<Ar>) => readonly B[],\n): readonly B[];\n\nexport function flatMap<A, B>(\n  mapFn: (a: A, index: SizeType.Arr) => readonly B[],\n): (array: readonly A[]) => readonly B[];\n\nexport function flatMap<A, B>(\n  ...args:\n    | readonly [\n        array: readonly A[],\n        mapFn: (a: A, index: SizeType.Arr) => readonly B[],\n      ]\n    | readonly [mapFn: (a: A, index: SizeType.Arr) => readonly B[]]\n): readonly B[] | ((array: readonly A[]) => readonly B[]) {\n  switch (args.length) {\n    case 2: {\n      const [array, mapFn] = args;\n\n      return array.flatMap((a, i) => mapFn(a, asUint32(i)));\n    }\n\n    case 1: {\n      const [mapFn] = args;\n\n      return (array: readonly A[]) => flatMap(array, mapFn);\n    }\n  }\n}\n\n/**\n * Partitions an array into sub-arrays of a specified size.\n *\n * @example\n *\n * ```ts\n * const values = [1, 2, 3, 4, 5] as const;\n *\n * const pairs = Arr.partition(values, 2);\n *\n * const triples = Arr.partition(3)(values);\n *\n * // Every chunk is branded `BoundedLengthArray<1, N, …>` — `partition` never\n * // emits an empty chunk — so the expected values are annotated with the\n * // unbranded type.\n * const expectedPairs = [[1, 2], [3, 4], [5]] as const;\n *\n * assert.deepStrictEqual<readonly (readonly number[])[]>(\n *   pairs,\n *   expectedPairs,\n * );\n *\n * assert.deepStrictEqual<readonly (readonly number[])[]>(triples, [\n *   [1, 2, 3],\n *   [4, 5],\n * ]);\n *\n * const pairs2 = Arr.chunk([1, 2, 3, 4, 5, 6], 2);\n *\n * assert.deepStrictEqual<readonly (readonly number[])[]>(pairs2, [\n *   [1, 2],\n *   [3, 4],\n *   [5, 6],\n * ]);\n * ```\n */\nexport function partition<\n  E,\n  N extends WithSmallInt<PositiveInt & SizeType.Arr>,\n>(array: readonly E[], chunkSize: N): readonly PartitionChunk<N, E>[];\n\nexport function partition<N extends WithSmallInt<PositiveInt & SizeType.Arr>>(\n  chunkSize: N,\n): <E>(array: readonly E[]) => readonly PartitionChunk<N, E>[];\n\nexport function partition<\n  E,\n  N extends WithSmallInt<PositiveInt & SizeType.Arr>,\n>(\n  ...args:\n    readonly [array: readonly E[], chunkSize: N] | readonly [chunkSize: N]\n):\n  | readonly (readonly E[])[]\n  | ((array: readonly E[]) => readonly (readonly E[])[]) {\n  switch (args.length) {\n    case 2:\n      return partitionImpl(...args);\n\n    case 1:\n      return (array) => partitionImpl(array, ...args);\n  }\n}\n\n/**\n * Element type of {@link partition}'s result: a chunk holds between 1 and `N`\n * elements. The lower bound is what makes this worth spelling out — `partition`\n * never emits an empty chunk, so indexed access into a chunk is not\n * `undefined` at position `0`, unlike with a plain `readonly E[]`.\n *\n * Falls back to {@link NonEmptyArray} when `N` is not a bound the brand can\n * express, which keeps that lower bound in every case.\n */\ntype PartitionChunk<N, E> = N extends SupportedLength\n  ? BoundedLengthArray<1, N, E>\n  : NonEmptyArray<E>;\n\nconst partitionImpl = <E, N extends WithSmallInt<PositiveInt & SizeType.Arr>>(\n  array: readonly E[],\n  chunkSize: N,\n): readonly (readonly E[])[] =>\n  chunkSize < 2\n    ? ([] as const)\n    : // eslint-disable-next-line total-functions/no-partial-division\n      seq(asUint32(Math.ceil(array.length / chunkSize))).map((i: Uint32) =>\n        array.slice(chunkSize * i, chunkSize * (i + 1)),\n      );\n\n/**\n * Alias for `partition`.\n *\n * @see {@link partition}\n */\nexport const chunk = partition;\n\n/**\n * Concatenates two arrays.\n *\n * The exact tuple shape is preserved. Additionally, when either input is known\n * to be non-empty (a non-empty tuple or a branded `NonEmptyArray`), the result\n * is branded as non-empty so it is assignable to `NonEmptyArray`.\n *\n * @example\n *\n * ```ts\n * const numbers = [1, 2] as const;\n *\n * const words = ['three', 'four'] as const;\n *\n * const combined = Arr.concat(numbers, words);\n *\n * // Because at least one input is non-empty, the result is assignable to\n * // NonEmptyArray.\n * const nonEmpty: NonEmptyArray<number | string> = combined;\n *\n * const expectedCombined = [1, 2, 'three', 'four'] as const;\n *\n * assert.deepStrictEqual<readonly (number | string)[]>(\n *   combined,\n *   expectedCombined,\n * );\n *\n * assert.isTrue(nonEmpty.length >= 1);\n * ```\n */\nexport const concat = <\n  const Ar1 extends readonly unknown[],\n  const Ar2 extends readonly unknown[],\n>(\n  array1: Ar1,\n  array2: Ar2,\n): ConcatResult<Ar1, Ar2> =>\n  // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n  [...array1, ...array2] as never;\n\n/**\n * Return type of {@link concat}: the concatenated tuple `readonly [...Ar1,\n * ...Ar2]`, additionally branded as {@link NonEmptyArray} when either input is\n * a non-empty tuple (a plain non-empty tuple or a branded `NonEmptyArray`,\n * both of which extend `NonEmptyTuple<unknown>`).\n */\ntype ConcatResult<\n  Ar1 extends readonly unknown[],\n  Ar2 extends readonly unknown[],\n> =\n  Ar1 extends NonEmptyTuple<unknown>\n    ? readonly [...Ar1, ...Ar2] & NonEmptyArray<Ar1[number] | Ar2[number]>\n    : Ar2 extends NonEmptyTuple<unknown>\n      ? readonly [...Ar1, ...Ar2] & NonEmptyArray<Ar1[number] | Ar2[number]>\n      : readonly [...Ar1, ...Ar2];\n\n/**\n * Groups elements by a key derived from each element.\n *\n * @example\n *\n * ```ts\n * const animals = ['ant', 'bat', 'cat', 'dove'] as const;\n *\n * const groupedByLength = Arr.groupBy(animals, (animal) => animal.length);\n *\n * const groupedByFirstLetter = Arr.groupBy((animal: string) => animal.at(0))(\n *   animals,\n * );\n *\n * assert.deepStrictEqual(\n *   groupedByLength.get(3),\n *   Optional.some(['ant', 'bat', 'cat'] as const),\n * );\n *\n * assert.deepStrictEqual(\n *   groupedByLength.get(4),\n *   Optional.some(['dove'] as const),\n * );\n *\n * assert.deepStrictEqual(groupedByLength.get(5), Optional.none);\n *\n * assert.deepStrictEqual(\n *   groupedByFirstLetter.get('a'),\n *   Optional.some(['ant'] as const),\n * );\n *\n * assert.deepStrictEqual(\n *   groupedByFirstLetter.get('d'),\n *   Optional.some(['dove'] as const),\n * );\n * ```\n */\nexport function groupBy<\n  const Ar extends readonly unknown[],\n  G extends MapSetKeyType,\n>(\n  array: Ar,\n  grouper: (value: Ar[number], index: ArrayIndex<Ar>) => G,\n): IMap<G, readonly Ar[number][]>;\n\nexport function groupBy<E, G extends MapSetKeyType>(\n  grouper: (value: E, index: SizeType.Arr) => G,\n): (array: readonly E[]) => IMap<G, readonly E[]>;\n\nexport function groupBy<E, G extends MapSetKeyType>(\n  ...args:\n    | readonly [\n        array: readonly E[],\n        grouper: (value: E, index: SizeType.Arr) => G,\n      ]\n    | readonly [grouper: (value: E, index: SizeType.Arr) => G]\n): IMap<G, readonly E[]> | ((array: readonly E[]) => IMap<G, readonly E[]>) {\n  switch (args.length) {\n    case 2: {\n      const [array, grouper] = args;\n\n      const mut_groups = new Map<G, E[]>(); // Store mutable arrays internally\n\n      for (const [index, e] of array.entries()) {\n        const key = grouper(e, asUint32(index)); // Ensure index is treated as SizeType.Arr\n\n        const mut_group = mut_groups.get(key);\n\n        if (mut_group !== undefined) {\n          mut_group.push(e);\n        } else {\n          mut_groups.set(key, [e]);\n        }\n      }\n\n      // Cast to IMap<G, readonly A[]> for the public interface\n      return IMap.create<G, readonly E[]>(mut_groups);\n    }\n\n    case 1: {\n      const [grouper] = args;\n\n      return (array: readonly E[]) => groupBy(array, grouper);\n    }\n  }\n}\n\n/**\n * Creates an array of tuples by pairing corresponding elements from two arrays.\n *\n * @example\n *\n * ```ts\n * const letters = ['a', 'b', 'c'] as const;\n *\n * const numbers = [1, 2, 3] as const;\n *\n * const pairs = Arr.zip(letters, numbers);\n *\n * const expectedPairs = [\n *   ['a', 1],\n *   ['b', 2],\n *   ['c', 3],\n * ] as const;\n *\n * assert.deepStrictEqual(pairs, expectedPairs);\n * ```\n */\nexport const zip = <\n  const Ar1 extends readonly unknown[],\n  const Ar2 extends readonly unknown[],\n>(\n  array1: Ar1,\n  array2: Ar2,\n): ConstrainedList.Zip<Ar1, Ar2> =>\n  // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n  seq(Uint32.min(size(array1), size(array2))).map((i: Uint32) =>\n    // Non-null assertion is safe here because `i` is always within bounds of both arrays up to the length of the shorter one.\n    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n    tp(array1[i]!, array2[i]!),\n  ) as unknown as ConstrainedList.Zip<Ar1, Ar2>;\n\n/**\n * Computes the cartesian product of arrays.\n * cartesianProduct([[1,2], [3,4]]) => [[1,3], [1,4], [2,3], [2,4]]\n *\n * @example\n *\n *\n * ```ts\n * const sizes = ['S', 'M'] as const;\n *\n * const colors = ['red', 'blue'] as const;\n *\n * const combinations = Arr.cartesianProduct([sizes, colors]);\n *\n * const expectedCombinations = [\n *   ['S', 'red'],\n *   ['S', 'blue'],\n *   ['M', 'red'],\n *   ['M', 'blue'],\n * ] as const;\n *\n * assert.deepStrictEqual(combinations, expectedCombinations);\n * ```\n */\nexport const cartesianProduct = <T,>(\n  arrays: readonly (readonly T[])[],\n): readonly (readonly T[])[] => {\n  if (!isNonEmpty(arrays)) return [[]];\n\n  const [first, ...rest] = arrays;\n\n  // If first array is empty, the result is empty\n  if (!isNonEmpty(first)) return [];\n\n  const restProduct = cartesianProduct(rest);\n\n  return first.flatMap((item) => restProduct.map((prod) => [item, ...prod]));\n};\n"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqFO,SAAS,OACX,IAAA,EAGqD;AACxD,EAAA,QAAQ,KAAK,MAAA;AAAQ,IACnB,KAAK,CAAA,EAAG;AACN,MAAA,MAAM,CAAC,KAAA,EAAO,KAAK,CAAA,GAAI,IAAA;AAGvB,MAAA,OAAO,KAAA,CAAM,IAAI,KAAc,CAAA;AAAA,IAAA;AACjC,IAEA,KAAK,CAAA,EAAG;AACN,MAAA,MAAM,CAAC,KAAK,CAAA,GAAI,IAAA;AAEhB,MAAA,OAAO,CAAC,KAAA,KAAwB,GAAA,CAAI,KAAA,EAAO,KAAK,CAAA;AAAA,IAAA;AAClD;AAEJ;AAgDO,SAAS,QACX,IAAA,EAkB6D;AAChE,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,OAAA,EACA,IAAA,KACqB;AACrB,EAAA,MAAM,UAAA,GAAa,WAAA;AAAA,IACjB,SAA4B,gBAAA,CAAiB,KAAA,CAAM,MAAA,GAAS,CAAC,GAAG,IAAI;AAAA,GACtE;AAEA,EAAA,IAAI,OAAA,GAAU,IAAA;AAEd,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,KAAK,CAAA,IAAK,KAAA,CAAM,SAAQ,EAAG;AAC5C,IAAA,OAAA,GAAU,OAAA,CAAQ,OAAA,EAAS,KAAA,EAAO,QAAA,CAAS,KAAK,CAAC,CAAA;AAEjD,IAAA,UAAA,CAAW,KAAA,GAAQ,CAAC,CAAA,GAAI,OAAA;AAAA,EAAA;AAG1B,EAAA,OAAO,UAAA;AACT,CAAA;AAiBO,MAAM,aAAa,CACxB,KAAA;AAAA;AAAA,EAGA,MAAM,UAAA;AAAW;AAmDZ,SAAS,QAAA,CACd,OACA,UAAA,EACoB;AACpB,EAAA,OAAO,KAAA,CAAM,QAAA;AAAA;AAAA,IAEV,UAAA;AAAA,KAEE,CAAC,CAAA,EAAG,CAAA,KAAO,CAAA,GAAgB,CAAA;AAAA,GAChC;AACF;AA6EO,SAAS,UAAA,CACd,KAAA,EACA,qBAAA,EACA,UAAA,EACc;AACd,EAAA,OAAO,KAAA,CAAM,QAAA;AAAA,IAAS,CAAC,CAAA,EAAG,CAAA,KACxB,UAAA,KAAe,MAAA;AAAA;AAAA;AAAA;AAAA,MAIV,sBAAsB,CAAC,CAAA;AAAA,MAEvB,sBAAsB,CAAC;AAAA,QACxB,WAAW,qBAAA,CAAsB,CAAC,CAAA,EAAG,qBAAA,CAAsB,CAAC,CAAC;AAAA,GACnE;AACF;AA0CO,SAAS,UACX,IAAA,EAMqD;AACxD,EAAA,QAAQ,KAAK,MAAA;AAAQ,IACnB,KAAK,CAAA;AACH,MAAA,OAAO,UAAA,CAAW,GAAG,IAAI,CAAA;AAAA,IAE3B,KAAK,CAAA;AACH,MAAA,OAAO,CAAC,KAAA,KAAU,UAAA,CAAW,KAAA,EAAO,GAAG,IAAI,CAAA;AAAA;AAEjD;AAEA,MAAM,UAAA,GAAa,CACjB,KAAA,EACA,SAAA,KACiB,MAAM,MAAA,CAAO,CAAC,CAAA,EAAG,CAAA,KAAM,SAAA,CAAU,CAAA,EAAG,QAAA,CAAS,CAAC,CAAC,CAAC,CAAA;AA4B5D,SAAS,aACX,IAAA,EAMqD;AACxD,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,KACiB,MAAM,MAAA,CAAO,CAAC,CAAA,EAAG,CAAA,KAAM,CAAC,SAAA,CAAU,CAAA,EAAG,QAAA,CAAS,CAAC,CAAC,CAAC,CAAA;AAiB7D,MAAM,OAAO,CAClB,KAAA;AAAA;AAAA,EAKA,KAAA,CAAM,IAAA,CAAK,IAAI,GAAA,CAAI,KAAK,CAAC;AAAA;MA6Bd,MAAA,GAAS,CAIpB,KAAA,EACA,KAAA,KAG2B;AAC3B,EAAA,MAAM,gBAAA,uBAAuB,GAAA,EAAO;AAGpC,EAAA,OAAO,KAAA,CAAM,MAAA,CAAO,CAAC,GAAA,KAAQ;AAC3B,IAAA,MAAM,WAAA,GAAc,MAAM,GAAG,CAAA;AAE7B,IAAA,IAAI,gBAAA,CAAiB,GAAA,CAAI,WAAW,CAAA,EAAG,OAAO,KAAA;AAE9C,IAAA,gBAAA,CAAiB,IAAI,WAAW,CAAA;AAEhC,IAAA,OAAO,IAAA;AAAA,EAAA,CACR,CAAA;AACH;AAiCO,SAAS,QACX,IAAA,EACuE;AAC1E,EAAA,QAAQ,KAAK,MAAA;AAAQ,IACnB,KAAK,CAAA;AACH,MAAA,OAAO,QAAA,CAAS,GAAG,IAAI,CAAA;AAAA,IAEzB,KAAK,CAAA,EAAG;AACN,MAAA,MAAM,CAAC,YAAY,CAAA,GAAI,IAAA;AAEvB,MAAA,IAAI,OAAO,iBAAiB,QAAA,EAAU;AACpC,QAAA,MAAM,KAAA,GAAQ,YAAA;AAEd,QAAA,OAAO,CAAC,KAAA,KAAU,QAAA,CAAS,KAAA,EAAO,KAAK,CAAA;AAAA,MAAA;AAGzC,MAAA,IAAI,iBAAiB,MAAA,EAAW;AAC9B,QAAA,OAAO,CAAC,KAAA,KAAU,QAAA,CAAS,KAAA,EAAO,CAAC,CAAA;AAAA,MAAA;AAKrC,MAAA,OAAO,aAAa,IAAA,EAAK;AAAA,IAAA;AAC3B,IAEA,KAAK,CAAA;AACH,MAAA,OAAO,CAAC,KAAA,KAAU,QAAA,CAAS,KAAA,EAAO,CAAC,CAAA;AAAA;AAEzC;AAEA,MAAM,WAAW,CACf,KAAA,EACA,KAAA,KACuB,KAAA,CAAM,KAAK,KAAK,CAAA;AA8BlC,SAAS,WACX,IAAA,EAMqD;AACxD,EAAA,QAAQ,KAAK,MAAA;AAAQ,IACnB,KAAK,CAAA,EAAG;AACN,MAAA,MAAM,CAAC,KAAA,EAAO,KAAK,CAAA,GAAI,IAAA;AAEvB,MAAA,OAAO,KAAA,CAAM,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,KAAM,MAAM,CAAA,EAAG,QAAA,CAAS,CAAC,CAAC,CAAC,CAAA;AAAA,IAAA;AACtD,IAEA,KAAK,CAAA,EAAG;AACN,MAAA,MAAM,CAAC,KAAK,CAAA,GAAI,IAAA;AAEhB,MAAA,OAAO,CAAC,KAAA,KAAwB,OAAA,CAAQ,KAAA,EAAO,KAAK,CAAA;AAAA,IAAA;AACtD;AAEJ;AA+CO,SAAS,aAIX,IAAA,EAIoD;AACvD,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,gBAAgB,CACpB,KAAA,EACA,SAAA,KAEA,SAAA,GAAY,IACP,EAAC;AAAA;AAAA,EAEF,GAAA,CAAI,SAAS,IAAA,CAAK,IAAA,CAAK,MAAM,MAAA,GAAS,SAAS,CAAC,CAAC,CAAA,CAAE,GAAA;AAAA,IAAI,CAAC,MACtD,KAAA,CAAM,KAAA,CAAM,YAAY,CAAA,EAAG,SAAA,IAAa,IAAI,CAAA,CAAE;AAAA;AAChD,CAAA;AAOC,MAAM,KAAA,GAAQ;MAgCR,MAAA,GAAS,CAIpB,MAAA,EACA,MAAA;AAAA;AAAA,EAGA,CAAC,GAAG,MAAA,EAAQ,GAAG,MAAM;AAAA;AAmEhB,SAAS,WACX,IAAA,EAMuE;AAC1E,EAAA,QAAQ,KAAK,MAAA;AAAQ,IACnB,KAAK,CAAA,EAAG;AACN,MAAA,MAAM,CAAC,KAAA,EAAO,OAAO,CAAA,GAAI,IAAA;AAEzB,MAAA,MAAM,UAAA,uBAAiB,GAAA,EAAY;AAEnC,MAAA,KAAA,MAAW,CAAC,KAAA,EAAO,CAAC,CAAA,IAAK,KAAA,CAAM,SAAQ,EAAG;AACxC,QAAA,MAAM,GAAA,GAAM,OAAA,CAAQ,CAAA,EAAG,QAAA,CAAS,KAAK,CAAC,CAAA;AAEtC,QAAA,MAAM,SAAA,GAAY,UAAA,CAAW,GAAA,CAAI,GAAG,CAAA;AAEpC,QAAA,IAAI,cAAc,MAAA,EAAW;AAC3B,UAAA,SAAA,CAAU,KAAK,CAAC,CAAA;AAAA,QAAA,CAClB,MAAO;AACL,UAAA,UAAA,CAAW,GAAA,CAAI,GAAA,EAAK,CAAC,CAAC,CAAC,CAAA;AAAA,QAAA;AACzB,MAAA;AAIF,MAAA,OAAO,IAAA,CAAK,OAAwB,UAAU,CAAA;AAAA,IAAA;AAChD,IAEA,KAAK,CAAA,EAAG;AACN,MAAA,MAAM,CAAC,OAAO,CAAA,GAAI,IAAA;AAElB,MAAA,OAAO,CAAC,KAAA,KAAwB,OAAA,CAAQ,KAAA,EAAO,OAAO,CAAA;AAAA,IAAA;AACxD;AAEJ;MAuBa,GAAA,GAAM,CAIjB,MAAA,EACA,MAAA;AAAA;AAAA,EAGA,GAAA,CAAI,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,MAAM,GAAG,IAAA,CAAK,MAAM,CAAC,CAAC,CAAA,CAAE,GAAA;AAAA,IAAI,CAAC,CAAA;AAAA;AAAA;AAAA,MAG/C,GAAG,MAAA,CAAO,CAAC,CAAA,EAAI,MAAA,CAAO,CAAC,CAAE;AAAA;AAAA;AAC3B;AA0BK,MAAM,gBAAA,GAAmB,CAC9B,MAAA,KAC8B;AAC9B,EAAA,IAAI,CAAC,UAAA,CAAW,MAAM,GAAG,OAAO,CAAC,EAAE,CAAA;AAEnC,EAAA,MAAM,CAAC,KAAA,EAAO,GAAG,IAAI,CAAA,GAAI,MAAA;AAGzB,EAAA,IAAI,CAAC,UAAA,CAAW,KAAK,CAAA,SAAU,EAAC;AAEhC,EAAA,MAAM,WAAA,GAAc,iBAAiB,IAAI,CAAA;AAEzC,EAAA,OAAO,KAAA,CAAM,OAAA,CAAQ,CAAC,IAAA,KAAS,WAAA,CAAY,GAAA,CAAI,CAAC,IAAA,KAAS,CAAC,IAAA,EAAM,GAAG,IAAI,CAAC,CAAC,CAAA;AAC3E;;;;"}
+{"version":3,"file":"array-utils-transformation.mjs","sourceRoot":"","sources":["../../../src/array/impl/array-utils-transformation.mts"],"names":[],"mappings":"AAiBA,OAAO,EAAE,IAAI,EAAE,MAAM,6BAA6B,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,gBAAgB,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,wBAAwB,CAAC;AAC5E,OAAO,EAAE,WAAW,EAAE,EAAE,EAAE,MAAM,wBAAwB,CAAC;AAMzD,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,4BAA4B,CAAC;AAC3D,OAAO,EAAE,UAAU,EAAE,MAAM,8CAA8C,CAAC;AAC1E,OAAO,EAAE,IAAI,EAAE,MAAM,wBAAwB,CAAC;AAyD9C,MAAM,UAAU,GAAG,CACjB,GAAG,IAEmD;IAEtD,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;QACpB,KAAK,CAAC,EAAE,CAAC;YACP,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC;YAE5B,oEAAoE;YACpE,OAAO,KAAK,CAAC,GAAG,CAAC,KAAc,CAAC,CAAC;QACnC,CAAC;QAED,KAAK,CAAC,EAAE,CAAC;YACP,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;YAErB,OAAO,CAAC,KAAmB,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;AACH,CAAC;AAgDD,MAAM,UAAU,IAAI,CAClB,GAAG,IAiBE;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,OAA2E,EAC3E,IAAO,EACW,EAAE;IACpB,MAAM,UAAU,GAAG,WAAW,CAC5B,QAAQ,CAAoB,gBAAgB,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CACtE,CAAC;IAEF,IAAI,OAAO,GAAG,IAAI,CAAC;IAEnB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAC7C,OAAO,GAAG,OAAO,CAAC,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QAEnD,UAAU,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC;IAClC,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AAEF;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CACxB,KAAS,EACoB,EAAE;AAC/B,oEAAoE;AACpE,KAAK,CAAC,UAAU,EAAW,CAAC;AAmD9B,MAAM,UAAU,QAAQ,CACtB,KAAyB,EACzB,UAA2C;IAE3C,OAAO,KAAK,CAAC,QAAQ;IACnB,oEAAoE;IACnE,UAA+D;QAC9D,oEAAoE;QACpE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAE,CAAY,GAAI,CAAY,CAAC,CAC5C,CAAC;AACJ,CAAC;AA6ED,MAAM,UAAU,UAAU,CACxB,KAAmB,EACnB,qBAAsC,EACtC,UAAmC;IAEnC,OAAO,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAC7B,UAAU,KAAK,SAAS;QACtB,CAAC,CAAC,8DAA8D;YAC9D,0FAA0F;YAC1F,oEAAoE;YACnE,qBAAqB,CAAC,CAAC,CAAY;gBACpC,oEAAoE;gBACnE,qBAAqB,CAAC,CAAC,CAAY;QACtC,CAAC,CAAC,UAAU,CAAC,qBAAqB,CAAC,CAAC,CAAC,EAAE,qBAAqB,CAAC,CAAC,CAAC,CAAC,CACnE,CAAC;AACJ,CAAC;AA0CD,MAAM,UAAU,MAAM,CACpB,GAAG,IAK6D;IAEhE,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;QACpB,KAAK,CAAC;YACJ,OAAO,UAAU,CAAC,GAAG,IAAI,CAAC,CAAC;QAE7B,KAAK,CAAC;YACJ,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,CAAC;IACjD,CAAC;AACH,CAAC;AAED,MAAM,UAAU,GAAG,CACjB,KAAmB,EACnB,SAAiD,EACnC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AA4BrE,MAAM,UAAU,SAAS,CACvB,GAAG,IAK6D;IAEhE,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,SAAiD,EACnC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAEtE;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAClB,KAAS,EAGe,EAAE;AAC1B,oEAAoE;AACpE,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,CAAU,CAAC;AAEtC;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,CAIpB,KAAS,EACT,KAA+B,EAGP,EAAE;IAC1B,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAK,CAAC;IAEtC,oEAAoE;IACpE,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE;QAC1B,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QAE/B,IAAI,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC;YAAE,OAAO,KAAK,CAAC;QAEpD,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAElC,OAAO,IAAI,CAAC;IACd,CAAC,CAA0C,CAAC;AAC9C,CAAC,CAAC;AAiCF,MAAM,UAAU,IAAI,CAClB,GAAG,IAAsE;IAEzE,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;QACpB,KAAK,CAAC;YACJ,OAAO,QAAQ,CAAC,GAAG,IAAI,CAAC,CAAC;QAE3B,KAAK,CAAC,EAAE,CAAC;YACP,MAAM,CAAC,YAAY,CAAC,GAAG,IAAI,CAAC;YAE5B,IAAI,OAAO,YAAY,KAAK,QAAQ,EAAE,CAAC;gBACrC,MAAM,KAAK,GAAG,YAAgD,CAAC;gBAE/D,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3C,CAAC;YAED,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;gBAC/B,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACvC,CAAC;YAED,UAAU,CAAoC,GAAG,CAAC,CAAC;YAEnD,OAAO,YAAY,CAAC,IAAI,EAAE,CAAC;QAC7B,CAAC;QAED,KAAK,CAAC;YACJ,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACzC,CAAC;AACH,CAAC;AAED,MAAM,QAAQ,GAAG,CACf,KAAyB,EACzB,KAA4B,EACR,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AA8B3C,MAAM,UAAU,OAAO,CACrB,GAAG,IAK8D;IAEjE,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;QACpB,KAAK,CAAC,EAAE,CAAC;YACP,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC;YAE5B,OAAO,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,CAAC;QAED,KAAK,CAAC,EAAE,CAAC;YACP,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;YAErB,OAAO,CAAC,KAAmB,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;AACH,CAAC;AA+CD,MAAM,UAAU,SAAS,CAIvB,GAAG,IACqE;IAIxE,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,SAAY,EACe,EAAE,CAC7B,SAAS,GAAG,CAAC;IACX,CAAC,CAAE,EAAY;IACf,CAAC,CAAC,+DAA+D;QAC/D,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAS,EAAE,EAAE,CACnE,KAAK,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAChD,CAAC;AAER;;;;GAIG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,SAAS,CAAC;AAE/B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,CAIpB,MAAW,EACX,MAAW,EACa,EAAE;AAC1B,oEAAoE;AACpE,CAAC,GAAG,MAAM,EAAE,GAAG,MAAM,CAAU,CAAC;AAmElC,MAAM,UAAU,OAAO,CACrB,GAAG,IAKyD;IAE5D,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;QACpB,KAAK,CAAC,EAAE,CAAC;YACP,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;YAE9B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC,CAAC,kCAAkC;YAExE,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;gBACzC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,0CAA0C;gBAEnF,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAEtC,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;oBAC5B,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACpB,CAAC;qBAAM,CAAC;oBACN,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;YAED,yDAAyD;YACzD,OAAO,IAAI,CAAC,MAAM,CAAkB,UAAU,CAAC,CAAC;QAClD,CAAC;QAED,KAAK,CAAC,EAAE,CAAC;YACP,MAAM,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC;YAEvB,OAAO,CAAC,KAAmB,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,CAAC,MAAM,GAAG,GAAG,CAIjB,MAAW,EACX,MAAW,EACoB,EAAE;AACjC,oEAAoE;AACpE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAS,EAAE,EAAE;AAC5D,0HAA0H;AAC1H,oEAAoE;AACpE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAE,EAAE,MAAM,CAAC,CAAC,CAAE,CAAC,CACiB,CAAC;AAEhD;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAC9B,MAAiC,EACN,EAAE;IAC7B,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAAE,OAAO,CAAC,EAAE,CAAC,CAAC;IAErC,MAAM,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,GAAG,MAAM,CAAC;IAEhC,+CAA+C;IAC/C,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,MAAM,WAAW,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;IAE3C,OAAO,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAC7E,CAAC,CAAC"}