ts-data-forge 14.6.0 → 14.6.2

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

@@ -1 +1 @@
-{"version":3,"file":"array-utils-slice-clamped.mjs","sources":["../../../src/array/impl/array-utils-slice-clamped.mts"],"sourcesContent":["import { type FixedLengthTuple } from 'ts-type-forge';\nimport { Num } from '../../number/index.mjs';\nimport { type ArgArrayIndexWithNegative, type SizeType } from '../../types.mjs';\n\n/**\n * Slices an array with automatically clamped start and end indices.\n *\n * @example\n *\n * ```ts\n * const letters = ['a', 'b', 'c', 'd', 'e'] as readonly string[];\n *\n * const lastThree = Arr.sliceClamped(letters, -3, 10);\n *\n * const middleTwo = Arr.sliceClamped(1, 3)(letters);\n *\n * assert.deepStrictEqual(lastThree, ['a', 'b', 'c', 'd', 'e']);\n *\n * assert.deepStrictEqual(middleTwo, ['b', 'c']);\n * ```\n */\nexport function sliceClamped<const Ar extends readonly unknown[]>(\n  array: Ar,\n  start: ArgArrayIndexWithNegative<Ar>,\n  end: ArgArrayIndexWithNegative<Ar>,\n): readonly Ar[number][];\n\nexport function sliceClamped(\n  start: SizeType.ArgArrWithNegative,\n  end: SizeType.ArgArrWithNegative,\n): <E>(array: readonly E[]) => readonly E[];\n\nexport function sliceClamped<E>(\n  ...args:\n    | readonly [\n        readonly E[],\n        SizeType.ArgArrWithNegative,\n        SizeType.ArgArrWithNegative,\n      ]\n    | FixedLengthTuple<2, SizeType.ArgArrWithNegative>\n): readonly E[] | ((array: readonly E[]) => readonly E[]) {\n  switch (args.length) {\n    case 3:\n      return sliceClampedImpl(...args);\n\n    case 2:\n      return (array) => sliceClampedImpl(array, ...args);\n  }\n}\n\nconst sliceClampedImpl = <E,>(\n  array: readonly E[],\n  start: SizeType.ArgArrWithNegative,\n  end: SizeType.ArgArrWithNegative,\n): readonly E[] => {\n  const startClamped = Num.clamp(0, array.length)(start);\n\n  // Ensure endClamped is not less than startClamped.\n  const endClamped = Num.clamp(startClamped, array.length)(end);\n\n  return array.slice(startClamped, endClamped);\n};\n"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgCO,SAAS,gBACX,IAAA,EAOqD;AACxD,EAAA,QAAQ,KAAK,MAAA;AAAQ,IACnB,KAAK,CAAA;AACH,MAAA,OAAO,gBAAA,CAAiB,GAAG,IAAI,CAAA;AAAA,IAEjC,KAAK,CAAA;AACH,MAAA,OAAO,CAAC,KAAA,KAAU,gBAAA,CAAiB,KAAA,EAAO,GAAG,IAAI,CAAA;AAAA;AAEvD;AAEA,MAAM,gBAAA,GAAmB,CACvB,KAAA,EACA,KAAA,EACA,GAAA,KACiB;AACjB,EAAA,MAAM,eAAe,GAAA,CAAI,KAAA,CAAM,GAAG,KAAA,CAAM,MAAM,EAAE,KAAK,CAAA;AAGrD,EAAA,MAAM,aAAa,GAAA,CAAI,KAAA,CAAM,cAAc,KAAA,CAAM,MAAM,EAAE,GAAG,CAAA;AAE5D,EAAA,OAAO,KAAA,CAAM,KAAA,CAAM,YAAA,EAAc,UAAU,CAAA;AAC7C,CAAA;;;;"}
+{"version":3,"file":"array-utils-slice-clamped.mjs","sourceRoot":"","sources":["../../../src/array/impl/array-utils-slice-clamped.mts"],"names":[],"mappings":"AACA,OAAO,EAAE,GAAG,EAAE,MAAM,wBAAwB,CAAC;AA+B7C,MAAM,UAAU,YAAY,CAC1B,GAAG,IAMiD;IAEpD,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;QACpB,KAAK,CAAC;YACJ,OAAO,gBAAgB,CAAC,GAAG,IAAI,CAAC,CAAC;QAEnC,KAAK,CAAC;YACJ,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,gBAAgB,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,CAAC;IACvD,CAAC;AACH,CAAC;AAED,MAAM,gBAAgB,GAAG,CACvB,KAAmB,EACnB,KAAkC,EAClC,GAAgC,EAClB,EAAE;IAChB,MAAM,YAAY,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC;IAEvD,mDAAmD;IACnD,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,YAAY,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;IAE9D,OAAO,KAAK,CAAC,KAAK,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;AAC/C,CAAC,CAAC"}

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

@@ -1,89 +1,105 @@
-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 { 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 { Uint32 } from '../../number/index.mjs';
 import { isEmpty } from './array-utils-length-bounded-array-guard.mjs';
 import { size } from './array-utils-size.mjs';
 import { sliceClamped } from './array-utils-slice-clamped.mjs';
-
-const tail = (array) => (
-  // eslint-disable-next-line total-functions/no-unsafe-type-assertion
-  array.slice(1)
-);
-const butLast = (array) => (
-  // eslint-disable-next-line total-functions/no-unsafe-type-assertion
-  isEmpty(array) ? [] : array.slice(0, -1)
-);
-function take(...args) {
-  switch (args.length) {
-    case 2:
-      return takeImpl(...args);
-    case 1:
-      return (array) => takeImpl(array, ...args);
-  }
+/**
+ * Returns all elements of an array except the first one.
+ *
+ * @example
+ *
+ * ```ts
+ * {
+ *   const scientists = ['Ada', 'Grace', 'Katherine'] as const;
+ *
+ *   const remainder = Arr.tail(scientists);
+ *
+ *   assert.deepStrictEqual(remainder, ['Grace', 'Katherine']);
+ *
+ *   assert.isTrue(remainder.length === 2);
+ * }
+ *
+ * {
+ *   const values = [1, 2, 3] as const;
+ *
+ *   const remainder = Arr.rest(values);
+ *
+ *   const emptyRemainder = Arr.rest([1] as const);
+ *
+ *   assert.deepStrictEqual(remainder, [2, 3] as const);
+ *
+ *   assert.deepStrictEqual(emptyRemainder, [] as const);
+ * }
+ * ```
+ */
+export const tail = (array) => 
+// eslint-disable-next-line total-functions/no-unsafe-type-assertion
+array.slice(1);
+/**
+ * Returns all elements of an array except the last one.
+ *
+ * @example
+ *
+ * ```ts
+ * const queue = ['task-1', 'task-2', 'task-3'] as const;
+ *
+ * const withoutLast = Arr.butLast(queue);
+ *
+ * assert.deepStrictEqual(withoutLast, ['task-1', 'task-2']);
+ *
+ * assert.isTrue(withoutLast.length === 2);
+ * ```
+ */
+export const butLast = (array) => 
+// eslint-disable-next-line total-functions/no-unsafe-type-assertion
+(isEmpty(array)
+    ? []
+    : array.slice(0, -1));
+export function take(...args) {
+    switch (args.length) {
+        case 2:
+            return takeImpl(...args);
+        case 1:
+            return (array) => takeImpl(array, ...args);
+    }
 }
 const takeImpl = (array, num) => sliceClamped(array, 0, num);
-function takeLast(...args) {
-  switch (args.length) {
-    case 2:
-      return takeLastImpl(...args);
-    case 1:
-      return (array) => takeLastImpl(array, ...args);
-  }
+export function takeLast(...args) {
+    switch (args.length) {
+        case 2:
+            return takeLastImpl(...args);
+        case 1:
+            return (array) => takeLastImpl(array, ...args);
+    }
 }
 const takeLastImpl = (array, num) => sliceClamped(array, Uint32.sub(size(array), num), size(array));
-function skip(...args) {
-  switch (args.length) {
-    case 2:
-      return skipImpl(...args);
-    case 1:
-      return (array) => skipImpl(array, ...args);
-  }
+export function skip(...args) {
+    switch (args.length) {
+        case 2:
+            return skipImpl(...args);
+        case 1:
+            return (array) => skipImpl(array, ...args);
+    }
 }
 const skipImpl = (array, num) => sliceClamped(array, num, size(array));
-function skipLast(...args) {
-  switch (args.length) {
-    case 2:
-      return skipLastImpl(...args);
-    case 1:
-      return (array) => skipLastImpl(array, ...args);
-  }
+export function skipLast(...args) {
+    switch (args.length) {
+        case 2:
+            return skipLastImpl(...args);
+        case 1:
+            return (array) => skipLastImpl(array, ...args);
+    }
 }
 const skipLastImpl = (array, num) => sliceClamped(array, 0, Uint32.sub(size(array), num));
-const rest = tail;
-const drop = skip;
-
-export { butLast, drop, rest, skip, skipLast, tail, take, takeLast };
-//# sourceMappingURL=array-utils-slicing.mjs.map
+/**
+ * Alias for `tail`.
+ *
+ * @see {@link tail}
+ */
+export const rest = tail;
+/**
+ * Alias for `skip`.
+ *
+ * @see {@link skip}
+ */
+export const drop = skip;
+//# sourceMappingURL=array-utils-slicing.mjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"array-utils-slicing.mjs","sources":["../../../src/array/impl/array-utils-slicing.mts"],"sourcesContent":["import {\n  type ConstrainedList,\n  type HasLengthConstraint,\n  type List,\n  type NonEmptyArray,\n  type NonEmptyTuple,\n  type StructuralPrefixLength,\n} from 'ts-type-forge';\nimport { Uint32 } from '../../number/index.mjs';\nimport { type SizeType } from '../../types.mjs';\nimport { isEmpty } from './array-utils-length-bounded-array-guard.mjs';\nimport { size } from './array-utils-size.mjs';\nimport { sliceClamped } from './array-utils-slice-clamped.mjs';\n\n/**\n * Returns all elements of an array except the first one.\n *\n * @example\n *\n * ```ts\n * {\n *   const scientists = ['Ada', 'Grace', 'Katherine'] as const;\n *\n *   const remainder = Arr.tail(scientists);\n *\n *   assert.deepStrictEqual(remainder, ['Grace', 'Katherine']);\n *\n *   assert.isTrue(remainder.length === 2);\n * }\n *\n * {\n *   const values = [1, 2, 3] as const;\n *\n *   const remainder = Arr.rest(values);\n *\n *   const emptyRemainder = Arr.rest([1] as const);\n *\n *   assert.deepStrictEqual(remainder, [2, 3] as const);\n *\n *   assert.deepStrictEqual(emptyRemainder, [] as const);\n * }\n * ```\n */\nexport const tail = <const Ar extends readonly unknown[]>(\n  array: Ar,\n): ConstrainedList.Tail<Ar> =>\n  // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n  array.slice(1) as unknown as ConstrainedList.Tail<Ar>;\n\n/**\n * Returns all elements of an array except the last one.\n *\n * @example\n *\n * ```ts\n * const queue = ['task-1', 'task-2', 'task-3'] as const;\n *\n * const withoutLast = Arr.butLast(queue);\n *\n * assert.deepStrictEqual(withoutLast, ['task-1', 'task-2']);\n *\n * assert.isTrue(withoutLast.length === 2);\n * ```\n */\nexport const butLast = <const Ar extends readonly unknown[]>(\n  array: Ar,\n): ConstrainedList.ButLast<Ar> =>\n  // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n  (isEmpty(array)\n    ? []\n    : array.slice(0, -1)) as unknown as ConstrainedList.ButLast<Ar>;\n\n/**\n * Takes the first N elements from an array.\n *\n * @example\n *\n * ```ts\n * const values = [1, 2, 3, 4] as const;\n *\n * const firstTwo = Arr.take(values, 2);\n *\n * const firstThree = Arr.take(3)(values);\n *\n * assert.deepStrictEqual(firstTwo, [1, 2]);\n *\n * assert.deepStrictEqual(firstThree, [1, 2, 3]);\n * ```\n */\nexport function take<\n  const Ar extends readonly unknown[],\n  N extends SizeType.ArgArr,\n>(\n  array: Ar,\n  num: N,\n): HasLengthConstraint<Ar> extends true\n  ? readonly Ar[number][]\n  : N extends StructuralPrefixLength\n    ? List.Take<N, Ar>\n    : N extends SizeType.ArgArrPositive\n      ? Ar extends NonEmptyTuple<unknown>\n        ? NonEmptyArray<Ar[number]>\n        : readonly Ar[number][]\n      : readonly Ar[number][];\n\nexport function take<N extends SizeType.ArgArr>(\n  num: N,\n): <const Ar extends readonly unknown[]>(\n  array: Ar,\n) => HasLengthConstraint<Ar> extends true\n  ? readonly Ar[number][]\n  : N extends StructuralPrefixLength\n    ? List.Take<N, Ar>\n    : N extends SizeType.ArgArrPositive\n      ? Ar extends NonEmptyTuple<unknown>\n        ? NonEmptyArray<Ar[number]>\n        : readonly Ar[number][]\n      : readonly Ar[number][];\n\nexport function take<E>(\n  ...args:\n    | readonly [array: readonly E[], num: SizeType.ArgArr]\n    | readonly [num: SizeType.ArgArr]\n): readonly E[] | ((array: readonly E[]) => readonly E[]) {\n  switch (args.length) {\n    case 2:\n      return takeImpl(...args);\n\n    case 1:\n      return (array) => takeImpl(array, ...args);\n  }\n}\n\nconst takeImpl = <E,>(\n  array: readonly E[],\n  num: SizeType.ArgArr,\n): readonly E[] => sliceClamped(array, 0, num);\n\n/**\n * Takes the last N elements from an array.\n *\n * @example\n *\n * ```ts\n * const values = [1, 2, 3, 4] as const;\n *\n * const lastTwo = Arr.takeLast(values, 2);\n *\n * const lastThree = Arr.takeLast(3)(values);\n *\n * assert.deepStrictEqual(lastTwo, [3, 4]);\n *\n * assert.deepStrictEqual(lastThree, [2, 3, 4]);\n * ```\n */\nexport function takeLast<\n  const Ar extends readonly unknown[],\n  N extends SizeType.ArgArr,\n>(\n  array: Ar,\n  num: N,\n): HasLengthConstraint<Ar> extends true\n  ? readonly Ar[number][]\n  : N extends StructuralPrefixLength\n    ? List.TakeLast<N, Ar>\n    : N extends SizeType.ArgArrPositive\n      ? Ar extends NonEmptyTuple<unknown>\n        ? NonEmptyArray<Ar[number]>\n        : readonly Ar[number][]\n      : readonly Ar[number][];\n\nexport function takeLast<N extends SizeType.ArgArr>(\n  num: N,\n): <const Ar extends readonly unknown[]>(\n  array: Ar,\n) => HasLengthConstraint<Ar> extends true\n  ? readonly Ar[number][]\n  : N extends StructuralPrefixLength\n    ? List.TakeLast<N, Ar>\n    : N extends SizeType.ArgArrPositive\n      ? Ar extends NonEmptyTuple<unknown>\n        ? NonEmptyArray<Ar[number]>\n        : readonly Ar[number][]\n      : readonly Ar[number][];\n\nexport function takeLast<E>(\n  ...args:\n    | readonly [array: readonly E[], num: SizeType.ArgArr]\n    | readonly [num: SizeType.ArgArr]\n): readonly E[] | ((array: readonly E[]) => readonly E[]) {\n  switch (args.length) {\n    case 2:\n      return takeLastImpl(...args);\n\n    case 1:\n      return (array) => takeLastImpl(array, ...args);\n  }\n}\n\nconst takeLastImpl = <E,>(\n  array: readonly E[],\n  num: SizeType.ArgArr,\n): readonly E[] =>\n  sliceClamped(array, Uint32.sub(size(array), num), size(array));\n\n/**\n * Skips the first N elements of an array.\n *\n * @example\n *\n * ```ts\n * const values = ['a', 'b', 'c', 'd'] as const;\n *\n * const withoutFirstTwo = Arr.skip(values, 2);\n *\n * const withoutFirstThree = Arr.skip(3)(values);\n *\n * assert.deepStrictEqual(withoutFirstTwo, ['c', 'd']);\n *\n * assert.deepStrictEqual(withoutFirstThree, ['d']);\n * ```\n */\nexport function skip<\n  const Ar extends readonly unknown[],\n  N extends SizeType.ArgArr,\n>(\n  array: Ar,\n  num: N,\n): HasLengthConstraint<Ar> extends true\n  ? readonly Ar[number][]\n  : N extends StructuralPrefixLength\n    ? List.Skip<N, Ar>\n    : readonly Ar[number][];\n\n// curried version\nexport function skip<N extends SizeType.ArgArr>(\n  num: N,\n): <const Ar extends readonly unknown[]>(\n  array: Ar,\n) => HasLengthConstraint<Ar> extends true\n  ? readonly Ar[number][]\n  : N extends StructuralPrefixLength\n    ? List.Skip<N, Ar>\n    : readonly Ar[number][];\n\nexport function skip<E>(\n  ...args: readonly [readonly E[], SizeType.ArgArr] | readonly [SizeType.ArgArr]\n): readonly E[] | ((array: readonly E[]) => readonly E[]) {\n  switch (args.length) {\n    case 2:\n      return skipImpl(...args);\n\n    case 1:\n      return (array) => skipImpl(array, ...args);\n  }\n}\n\nconst skipImpl = <E,>(\n  array: readonly E[],\n  num: SizeType.ArgArr,\n): readonly E[] => sliceClamped(array, num, size(array));\n\n/**\n * Skips the last N elements of an array.\n *\n * @example\n *\n * ```ts\n * const values = ['a', 'b', 'c', 'd'] as const;\n *\n * const withoutLastTwo = Arr.skipLast(values, 2);\n *\n * const withoutLastThree = Arr.skipLast(3)(values);\n *\n * assert.deepStrictEqual(withoutLastTwo, ['a', 'b']);\n *\n * assert.deepStrictEqual(withoutLastThree, ['a']);\n * ```\n */\nexport function skipLast<\n  const Ar extends readonly unknown[],\n  N extends SizeType.ArgArr,\n>(\n  array: Ar,\n  num: N,\n): HasLengthConstraint<Ar> extends true\n  ? readonly Ar[number][]\n  : N extends StructuralPrefixLength\n    ? List.SkipLast<N, Ar>\n    : readonly Ar[number][];\n\n// curried version\nexport function skipLast<N extends SizeType.ArgArr>(\n  num: N,\n): <const Ar extends readonly unknown[]>(\n  array: Ar,\n) => HasLengthConstraint<Ar> extends true\n  ? readonly Ar[number][]\n  : N extends StructuralPrefixLength\n    ? List.SkipLast<N, Ar>\n    : readonly Ar[number][];\n\nexport function skipLast<E>(\n  ...args:\n    | readonly [array: readonly E[], num: SizeType.ArgArr]\n    | readonly [num: SizeType.ArgArr]\n): readonly E[] | ((array: readonly E[]) => readonly E[]) {\n  switch (args.length) {\n    case 2:\n      return skipLastImpl(...args);\n\n    case 1:\n      return (array) => skipLastImpl(array, ...args);\n  }\n}\n\nconst skipLastImpl = <E,>(\n  array: readonly E[],\n  num: SizeType.ArgArr,\n): readonly E[] => sliceClamped(array, 0, Uint32.sub(size(array), num));\n\n/**\n * Alias for `tail`.\n *\n * @see {@link tail}\n */\nexport const rest = tail;\n\n/**\n * Alias for `skip`.\n *\n * @see {@link skip}\n */\nexport const drop = skip;\n"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2CO,MAAM,OAAO,CAClB,KAAA;AAAA;AAAA,EAGA,KAAA,CAAM,MAAM,CAAC;AAAA;AAiBR,MAAM,UAAU,CACrB,KAAA;AAAA;AAAA,EAGC,OAAA,CAAQ,KAAK,CAAA,GACV,KACA,KAAA,CAAM,KAAA,CAAM,GAAG,EAAE;AAAA;AAiDhB,SAAS,QACX,IAAA,EAGqD;AACxD,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,WAAW,CACf,KAAA,EACA,QACiB,YAAA,CAAa,KAAA,EAAO,GAAG,GAAG,CAAA;AAiDtC,SAAS,YACX,IAAA,EAGqD;AACxD,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,GAAA,KAEA,aAAa,KAAA,EAAO,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,KAAK,CAAA,EAAG,GAAG,CAAA,EAAG,IAAA,CAAK,KAAK,CAAC,CAAA;AA0CxD,SAAS,QACX,IAAA,EACqD;AACxD,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,GAAA,KACiB,aAAa,KAAA,EAAO,GAAA,EAAK,IAAA,CAAK,KAAK,CAAC,CAAA;AA0ChD,SAAS,YACX,IAAA,EAGqD;AACxD,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,GAAA,KACiB,YAAA,CAAa,KAAA,EAAO,CAAA,EAAG,MAAA,CAAO,GAAA,CAAI,IAAA,CAAK,KAAK,CAAA,EAAG,GAAG,CAAC,CAAA;AAO/D,MAAM,IAAA,GAAO;AAOb,MAAM,IAAA,GAAO;;;;"}
+{"version":3,"file":"array-utils-slicing.mjs","sourceRoot":"","sources":["../../../src/array/impl/array-utils-slicing.mts"],"names":[],"mappings":"AAQA,OAAO,EAAE,MAAM,EAAE,MAAM,wBAAwB,CAAC;AAEhD,OAAO,EAAE,OAAO,EAAE,MAAM,8CAA8C,CAAC;AACvE,OAAO,EAAE,IAAI,EAAE,MAAM,wBAAwB,CAAC;AAC9C,OAAO,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AAE/D;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAClB,KAAS,EACiB,EAAE;AAC5B,oEAAoE;AACpE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAwC,CAAC;AAExD;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CACrB,KAAS,EACoB,EAAE;AAC/B,oEAAoE;AACpE,CAAC,OAAO,CAAC,KAAK,CAAC;IACb,CAAC,CAAC,EAAE;IACJ,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAA2C,CAAC;AAiDpE,MAAM,UAAU,IAAI,CAClB,GAAG,IAEgC;IAEnC,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,GAAoB,EACN,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;AAiD/C,MAAM,UAAU,QAAQ,CACtB,GAAG,IAEgC;IAEnC,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,GAAoB,EACN,EAAE,CAChB,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AA0CjE,MAAM,UAAU,IAAI,CAClB,GAAG,IAA2E;IAE9E,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,GAAoB,EACN,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AA0CzD,MAAM,UAAU,QAAQ,CACtB,GAAG,IAEgC;IAEnC,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,GAAoB,EACN,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;AAExE;;;;GAIG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,IAAI,CAAC;AAEzB;;;;GAIG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,IAAI,CAAC"}