@vinicunca/perkakas 1.0.6 → 1.2.0

package/dist/chunk.d.cts

@@ -1,5 +1,8 @@
 import { IsNumericLiteral, LessThan, IfNever, Subtract, ValueOf, IntRange } from 'type-fest';
-import { I as IterableContainer, T as TupleParts, N as NTuple, a as NonEmptyArray } from './types-CC8iZVKO.cjs';
+import { I as IntRangeInclusive } from './int-range-inclusive-Cn-qsrAN.cjs';
+import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
+import { T as TupleParts, N as NTuple } from './tuple-parts-DcH94smG.cjs';
+import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.cjs';
 
 /**
  * This prevents typescript from failing on complex arrays and large chunks.
@@ -84,10 +87,6 @@ type SuffixChunk<T extends Array<unknown>, Item, N extends number> = T extends r
  * our output based on if we know for sure that the array is empty or not.
  */
 type GenericChunk<T extends IterableContainer> = T extends readonly [...Array<unknown>, unknown] | readonly [unknown, ...Array<unknown>] ? NonEmptyArray<NonEmptyArray<T[number]>> : Array<NonEmptyArray<T[number]>>;
-/**
- * Type-fest's IntRange doesn't include the `To` value, but we need it!
- */
-type IntRangeInclusive<From extends number, To extends number> = IntRange<From, To> | To;
 /**
  * Split an array into groups the length of `size`. If `array` can't be split evenly, the final chunk will be the remaining elements.
  *

package/dist/chunk.d.ts

@@ -1,5 +1,8 @@
 import { IsNumericLiteral, LessThan, IfNever, Subtract, ValueOf, IntRange } from 'type-fest';
-import { I as IterableContainer, T as TupleParts, N as NTuple, a as NonEmptyArray } from './types-CC8iZVKO.js';
+import { I as IntRangeInclusive } from './int-range-inclusive-Cn-qsrAN.js';
+import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
+import { T as TupleParts, N as NTuple } from './tuple-parts-DcH94smG.js';
+import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.js';
 
 /**
  * This prevents typescript from failing on complex arrays and large chunks.
@@ -84,10 +87,6 @@ type SuffixChunk<T extends Array<unknown>, Item, N extends number> = T extends r
  * our output based on if we know for sure that the array is empty or not.
  */
 type GenericChunk<T extends IterableContainer> = T extends readonly [...Array<unknown>, unknown] | readonly [unknown, ...Array<unknown>] ? NonEmptyArray<NonEmptyArray<T[number]>> : Array<NonEmptyArray<T[number]>>;
-/**
- * Type-fest's IntRange doesn't include the `To` value, but we need it!
- */
-type IntRangeInclusive<From extends number, To extends number> = IntRange<From, To> | To;
 /**
  * Split an array into groups the length of `size`. If `array` can't be split evenly, the final chunk will be the remaining elements.
  *

package/dist/chunk.js

@@ -1 +1 @@
-import{a}from"./chunk-BT3FI7L7.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as chunk};
+import{a}from"./chunk-CUCNZMQN.js";import"./chunk-ENYMRDJU.js";import"./chunk-K2EX7PYH.js";export{a as chunk};

package/dist/clamp.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkQYFACQ7Pcjs = require('./chunk-QYFACQ7P.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.clamp = _chunkQYFACQ7Pcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkTTO5FQC7cjs = require('./chunk-TTO5FQC7.cjs');require('./chunk-4MAOF3ZP.cjs');require('./chunk-4YUDBZFA.cjs');exports.clamp = _chunkTTO5FQC7cjs.a;

package/dist/clamp.d.cts

@@ -2,10 +2,6 @@ interface Limits {
     readonly max?: number;
     readonly min?: number;
 }
-interface Limits {
-    readonly max?: number;
-    readonly min?: number;
-}
 /**
  * Clamp the given value within the inclusive min and max bounds.
  *

package/dist/clamp.d.ts

@@ -2,10 +2,6 @@ interface Limits {
     readonly max?: number;
     readonly min?: number;
 }
-interface Limits {
-    readonly max?: number;
-    readonly min?: number;
-}
 /**
  * Clamp the given value within the inclusive min and max bounds.
  *

package/dist/clamp.js

@@ -1 +1 @@
-import{a}from"./chunk-UO2ELCGC.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as clamp};
+import{a}from"./chunk-LDSQEYGI.js";import"./chunk-ENYMRDJU.js";import"./chunk-K2EX7PYH.js";export{a as clamp};

package/dist/clone.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkU3YJZ66Ocjs = require('./chunk-U3YJZ66O.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.clone = _chunkU3YJZ66Ocjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkY52SHFCPcjs = require('./chunk-Y52SHFCP.cjs');require('./chunk-4MAOF3ZP.cjs');require('./chunk-4YUDBZFA.cjs');exports.clone = _chunkY52SHFCPcjs.a;

package/dist/clone.d.cts

@@ -1,6 +1,9 @@
 /**
- * Creates a deep copy of the value. Supported types. Functions are assigned by
- * reference rather than copied.
+ * Creates a deep copy of the value. Supported types: [plain objects](#isPlainObject),
+ * `Array`, `number`, `string`, `boolean`, `Date`, and `RegExp`. Functions are
+ * assigned by reference rather than copied. Class instances or any other
+ * built-in type that isn't mentioned above are not supported (but might
+ * work).
  *
  * @param data - The object to clone.
  * @signature
@@ -12,8 +15,11 @@
  */
 declare function clone<T>(data: T): T;
 /**
- * Creates a deep copy of the value. Supported types. Functions are assigned by
- * reference rather than copied.
+ * Creates a deep copy of the value. Supported types: [plain objects](#isPlainObject),
+ * `Array`, `number`, `string`, `boolean`, `Date`, and `RegExp`. Functions are
+ * assigned by reference rather than copied. Class instances or any other
+ * built-in type that isn't mentioned above are not supported (but might
+ * work).
  *
  * @signature
  *   P.clone()(data)

package/dist/clone.d.ts

@@ -1,6 +1,9 @@
 /**
- * Creates a deep copy of the value. Supported types. Functions are assigned by
- * reference rather than copied.
+ * Creates a deep copy of the value. Supported types: [plain objects](#isPlainObject),
+ * `Array`, `number`, `string`, `boolean`, `Date`, and `RegExp`. Functions are
+ * assigned by reference rather than copied. Class instances or any other
+ * built-in type that isn't mentioned above are not supported (but might
+ * work).
  *
  * @param data - The object to clone.
  * @signature
@@ -12,8 +15,11 @@
  */
 declare function clone<T>(data: T): T;
 /**
- * Creates a deep copy of the value. Supported types. Functions are assigned by
- * reference rather than copied.
+ * Creates a deep copy of the value. Supported types: [plain objects](#isPlainObject),
+ * `Array`, `number`, `string`, `boolean`, `Date`, and `RegExp`. Functions are
+ * assigned by reference rather than copied. Class instances or any other
+ * built-in type that isn't mentioned above are not supported (but might
+ * work).
  *
  * @signature
  *   P.clone()(data)

package/dist/clone.js

@@ -1 +1 @@
-import{a}from"./chunk-5XZK5BDM.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as clone};
+import{a}from"./chunk-DDJKFY7F.js";import"./chunk-ENYMRDJU.js";import"./chunk-K2EX7PYH.js";export{a as clone};

package/dist/concat.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkJ2THP74Pcjs = require('./chunk-J2THP74P.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.concat = _chunkJ2THP74Pcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkA2HUSITFcjs = require('./chunk-A2HUSITF.cjs');require('./chunk-4MAOF3ZP.cjs');require('./chunk-4YUDBZFA.cjs');exports.concat = _chunkA2HUSITFcjs.a;

package/dist/concat.d.cts

@@ -1,5 +1,4 @@
-import { I as IterableContainer } from './types-CC8iZVKO.cjs';
-import 'type-fest';
+import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
 
 /**
  * Merge two or more arrays. This method does not change the existing arrays,

package/dist/concat.d.ts

@@ -1,5 +1,4 @@
-import { I as IterableContainer } from './types-CC8iZVKO.js';
-import 'type-fest';
+import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
 
 /**
  * Merge two or more arrays. This method does not change the existing arrays,

package/dist/concat.js

@@ -1 +1 @@
-import{a}from"./chunk-QU5PCAYZ.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as concat};
+import{a}from"./chunk-7FMUBMHT.js";import"./chunk-ENYMRDJU.js";import"./chunk-K2EX7PYH.js";export{a as concat};

package/dist/conditional.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkE6JSDI5Scjs = require('./chunk-E6JSDI5S.cjs');exports.conditional = _chunkE6JSDI5Scjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkWYM2JV5Tcjs = require('./chunk-WYM2JV5T.cjs');exports.conditional = _chunkWYM2JV5Tcjs.a;

package/dist/conditional.d.cts

@@ -1,5 +1,11 @@
-import { G as GuardType } from './types-CC8iZVKO.cjs';
-import 'type-fest';
+/**
+ * Extracts a type predicate from a type guard function for the first argument.
+ *
+ * @example
+ * type TypeGuardFn = (x: unknown) => x is string;
+ * type Result = GuardType<TypeGuardFn>; // `string`
+ */
+type GuardType<T, Fallback = never> = T extends (x: any, ...rest: any) => x is infer U ? U : Fallback;
 
 type Case<In, Out, When extends (x: In) => boolean = (x: In) => boolean> = readonly [when: When, then: (x: GuardType<When, In> & In) => Out];
 declare const conditionalPlus: typeof conditional & {

package/dist/conditional.d.ts

@@ -1,5 +1,11 @@
-import { G as GuardType } from './types-CC8iZVKO.js';
-import 'type-fest';
+/**
+ * Extracts a type predicate from a type guard function for the first argument.
+ *
+ * @example
+ * type TypeGuardFn = (x: unknown) => x is string;
+ * type Result = GuardType<TypeGuardFn>; // `string`
+ */
+type GuardType<T, Fallback = never> = T extends (x: any, ...rest: any) => x is infer U ? U : Fallback;
 
 type Case<In, Out, When extends (x: In) => boolean = (x: In) => boolean> = readonly [when: When, then: (x: GuardType<When, In> & In) => Out];
 declare const conditionalPlus: typeof conditional & {

package/dist/conditional.js

@@ -1 +1 @@
-import{a}from"./chunk-H2E5GCCP.js";export{a as conditional};
+import{a}from"./chunk-A2PAJNYA.js";export{a as conditional};

package/dist/count-by.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk6YAVWI3Xcjs = require('./chunk-6YAVWI3X.cjs');require('./chunk-4MAOF3ZP.cjs');require('./chunk-4YUDBZFA.cjs');exports.countBy = _chunk6YAVWI3Xcjs.a;

package/dist/count-by.d.cts

@@ -0,0 +1,41 @@
+import { E as ExactRecord } from './exact-record-h-jwajoM.cjs';
+import './if-bounded-record-DVYSMNKL.cjs';
+import 'type-fest';
+
+/**
+ * Categorize and count elements in an array using a defined callback function.
+ * The callback function is applied to each element in the array to determine
+ * its category and then counts how many elements fall into each category.
+ *
+ * @param data - The array.
+ * @param categorizationFn - The categorization function.
+ * @signature
+ *   P.countBy(data, categorizationFn)
+ * @example
+ *    P.countBy(
+ *      ["a", "b", "c", "B", "A", "a"],
+ *      toLowerCase
+ *    ); //=> { a: 3, b: 2, c: 1 }
+ * @dataFirst
+ * @category Array
+ */
+declare function countBy<T, K extends PropertyKey>(data: ReadonlyArray<T>, categorizationFn: (value: T, index: number, data: ReadonlyArray<T>) => K | undefined): ExactRecord<K, number>;
+/**
+ * Categorize and count elements in an array using a defined callback function.
+ * The callback function is applied to each element in the array to determine
+ * its category and then counts how many elements fall into each category.
+ *
+ * @param categorizationFn - The categorization function.
+ * @signature
+ *   P.countBy(categorizationFn)(data)
+ * @example
+ *    P.pipe(
+ *      ["a", "b", "c", "B", "A", "a"],
+ *      P.countBy(toLowerCase),
+ *    ); //=> { a: 3, b: 2, c: 1 }
+ * @dataLast
+ * @category Array
+ */
+declare function countBy<T, K extends PropertyKey>(categorizationFn: (value: T, index: number, data: ReadonlyArray<T>) => K | undefined): (data: ReadonlyArray<T>) => ExactRecord<K, number>;
+
+export { countBy };

package/dist/count-by.d.ts

@@ -0,0 +1,41 @@
+import { E as ExactRecord } from './exact-record-Bf4LoPyZ.js';
+import './if-bounded-record-DVYSMNKL.js';
+import 'type-fest';
+
+/**
+ * Categorize and count elements in an array using a defined callback function.
+ * The callback function is applied to each element in the array to determine
+ * its category and then counts how many elements fall into each category.
+ *
+ * @param data - The array.
+ * @param categorizationFn - The categorization function.
+ * @signature
+ *   P.countBy(data, categorizationFn)
+ * @example
+ *    P.countBy(
+ *      ["a", "b", "c", "B", "A", "a"],
+ *      toLowerCase
+ *    ); //=> { a: 3, b: 2, c: 1 }
+ * @dataFirst
+ * @category Array
+ */
+declare function countBy<T, K extends PropertyKey>(data: ReadonlyArray<T>, categorizationFn: (value: T, index: number, data: ReadonlyArray<T>) => K | undefined): ExactRecord<K, number>;
+/**
+ * Categorize and count elements in an array using a defined callback function.
+ * The callback function is applied to each element in the array to determine
+ * its category and then counts how many elements fall into each category.
+ *
+ * @param categorizationFn - The categorization function.
+ * @signature
+ *   P.countBy(categorizationFn)(data)
+ * @example
+ *    P.pipe(
+ *      ["a", "b", "c", "B", "A", "a"],
+ *      P.countBy(toLowerCase),
+ *    ); //=> { a: 3, b: 2, c: 1 }
+ * @dataLast
+ * @category Array
+ */
+declare function countBy<T, K extends PropertyKey>(categorizationFn: (value: T, index: number, data: ReadonlyArray<T>) => K | undefined): (data: ReadonlyArray<T>) => ExactRecord<K, number>;
+
+export { countBy };

package/dist/count-by.js

@@ -0,0 +1 @@
+import{a}from"./chunk-C3NLWEGJ.js";import"./chunk-ENYMRDJU.js";import"./chunk-K2EX7PYH.js";export{a as countBy};

package/dist/curry-order-rules-BKXCPBNx.d.cts

@@ -0,0 +1,37 @@
+declare const COMPARATORS: {
+    readonly asc: <T>(x: T, y: T) => boolean;
+    readonly desc: <T>(x: T, y: T) => boolean;
+};
+/**
+ * An order rule defines a projection/extractor that returns a comparable from
+ * the data being compared. It would be run on each item being compared, and a
+ * comparator would then be used on the results to determine the order.
+ *
+ * There are 2 forms of the order rule, a simple one which only provides the
+ * projection function and assumes ordering is ascending, and a 2-tuple where
+ * the first element is the projection function and the second is the direction;
+ * this allows changing the direction without defining a more complex projection
+ * to simply negate the value (e.g. `(x) => -x`).
+ *
+ * We rely on the javascript implementation of `<` and `>` for comparison, which
+ * will attempt to transform both operands into a primitive comparable value via
+ * the built in `valueOf` function (and then `toString`). It's up to the caller
+ * to make sure that the projection is returning a value that makes sense for
+ * this logic.
+ *
+ * It's important to note that there is no built-in caching/memoization of
+ * projection function and therefore no guarantee that it would only be called
+ * once.
+ */
+type OrderRule<T> = Projection<T> | readonly [projection: Projection<T>, direction: keyof typeof COMPARATORS];
+type Projection<T> = (x: T) => Comparable;
+type Comparable = ComparablePrimitive | {
+    [Symbol.toPrimitive]: (hint: string) => ComparablePrimitive;
+} | {
+    toString: () => string;
+} | {
+    valueOf: () => ComparablePrimitive;
+};
+type ComparablePrimitive = bigint | boolean | number | string;
+
+export type { OrderRule as O };

package/dist/curry-order-rules-BKXCPBNx.d.ts

@@ -0,0 +1,37 @@
+declare const COMPARATORS: {
+    readonly asc: <T>(x: T, y: T) => boolean;
+    readonly desc: <T>(x: T, y: T) => boolean;
+};
+/**
+ * An order rule defines a projection/extractor that returns a comparable from
+ * the data being compared. It would be run on each item being compared, and a
+ * comparator would then be used on the results to determine the order.
+ *
+ * There are 2 forms of the order rule, a simple one which only provides the
+ * projection function and assumes ordering is ascending, and a 2-tuple where
+ * the first element is the projection function and the second is the direction;
+ * this allows changing the direction without defining a more complex projection
+ * to simply negate the value (e.g. `(x) => -x`).
+ *
+ * We rely on the javascript implementation of `<` and `>` for comparison, which
+ * will attempt to transform both operands into a primitive comparable value via
+ * the built in `valueOf` function (and then `toString`). It's up to the caller
+ * to make sure that the projection is returning a value that makes sense for
+ * this logic.
+ *
+ * It's important to note that there is no built-in caching/memoization of
+ * projection function and therefore no guarantee that it would only be called
+ * once.
+ */
+type OrderRule<T> = Projection<T> | readonly [projection: Projection<T>, direction: keyof typeof COMPARATORS];
+type Projection<T> = (x: T) => Comparable;
+type Comparable = ComparablePrimitive | {
+    [Symbol.toPrimitive]: (hint: string) => ComparablePrimitive;
+} | {
+    toString: () => string;
+} | {
+    valueOf: () => ComparablePrimitive;
+};
+type ComparablePrimitive = bigint | boolean | number | string;
+
+export type { OrderRule as O };

package/dist/curry.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkY74ER22Ocjs = require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.curry = _chunkY74ER22Ocjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk4MAOF3ZPcjs = require('./chunk-4MAOF3ZP.cjs');require('./chunk-4YUDBZFA.cjs');exports.curry = _chunk4MAOF3ZPcjs.a;

package/dist/curry.js

@@ -1 +1 @@
-import{a}from"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as curry};
+import{a}from"./chunk-ENYMRDJU.js";import"./chunk-K2EX7PYH.js";export{a as curry};

package/dist/deduped-CagGlWg1.d.cts

@@ -0,0 +1,23 @@
+import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
+import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.cjs';
+
+/**
+ * The result of running a function that would dedupe an array (`unique`,
+ * `uniqueBy`, and `uniqueWith`).
+ *
+ * There are certain traits of the output which are unique to a deduped array
+ * that allow us to create a better type; see comments inline.
+ *
+ * !Note: We can build better types for each of the unique functions
+ * _separately_ by taking advantage of _other_ characteristics that are unique
+ * to each one (e.g. in `unique` we know that each item that has a disjoint type
+ * to all previous items would be part of the output, even when it isn't the
+ * first), but to make this utility the most useful we kept it simple and
+ * generic for now.
+ */
+type Deduped<T extends IterableContainer> = T extends readonly [] ? [] : T extends readonly [infer Head, ...infer Rest] ? [
+    Head,
+    ...Array<Rest[number]>
+] : T extends readonly [...Array<unknown>, unknown] ? NonEmptyArray<T[number]> : Array<T[number]>;
+
+export type { Deduped as D };

package/dist/deduped-DWYYywHn.d.ts

@@ -0,0 +1,23 @@
+import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
+import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.js';
+
+/**
+ * The result of running a function that would dedupe an array (`unique`,
+ * `uniqueBy`, and `uniqueWith`).
+ *
+ * There are certain traits of the output which are unique to a deduped array
+ * that allow us to create a better type; see comments inline.
+ *
+ * !Note: We can build better types for each of the unique functions
+ * _separately_ by taking advantage of _other_ characteristics that are unique
+ * to each one (e.g. in `unique` we know that each item that has a disjoint type
+ * to all previous items would be part of the output, even when it isn't the
+ * first), but to make this utility the most useful we kept it simple and
+ * generic for now.
+ */
+type Deduped<T extends IterableContainer> = T extends readonly [] ? [] : T extends readonly [infer Head, ...infer Rest] ? [
+    Head,
+    ...Array<Rest[number]>
+] : T extends readonly [...Array<unknown>, unknown] ? NonEmptyArray<T[number]> : Array<T[number]>;
+
+export type { Deduped as D };

package/dist/difference-with.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkS4XCRT2Bcjs = require('./chunk-S4XCRT2B.cjs');require('./chunk-SU7H3HVP.cjs');require('./chunk-Y7L64OLN.cjs');require('./chunk-SW6GJ7UA.cjs');exports.differenceWith = _chunkS4XCRT2Bcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkJ3DPGMAEcjs = require('./chunk-J3DPGMAE.cjs');require('./chunk-I6KKO3TI.cjs');require('./chunk-DGMGGT4A.cjs');require('./chunk-BGYDTTCY.cjs');exports.differenceWith = _chunkJ3DPGMAEcjs.a;

package/dist/difference-with.js

@@ -1 +1 @@
-import{a}from"./chunk-TYOJTJP6.js";import"./chunk-SS3ILCPB.js";import"./chunk-FOP5KNRT.js";import"./chunk-T4LCVT74.js";export{a as differenceWith};
+import{a}from"./chunk-PRI7GNFW.js";import"./chunk-VEZP7VBA.js";import"./chunk-LSSVVDEJ.js";import"./chunk-YK4IY5DJ.js";export{a as differenceWith};

package/dist/difference.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkNWEPH7CDcjs = require('./chunk-NWEPH7CD.cjs');require('./chunk-SU7H3HVP.cjs');require('./chunk-Y7L64OLN.cjs');require('./chunk-SW6GJ7UA.cjs');exports.difference = _chunkNWEPH7CDcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkFJX3YNGWcjs = require('./chunk-FJX3YNGW.cjs');require('./chunk-I6KKO3TI.cjs');require('./chunk-DGMGGT4A.cjs');require('./chunk-BGYDTTCY.cjs');exports.difference = _chunkFJX3YNGWcjs.a;

package/dist/difference.js

@@ -1 +1 @@
-import{a}from"./chunk-23TPDBES.js";import"./chunk-SS3ILCPB.js";import"./chunk-FOP5KNRT.js";import"./chunk-T4LCVT74.js";export{a as difference};
+import{a}from"./chunk-6VSPLMEZ.js";import"./chunk-VEZP7VBA.js";import"./chunk-LSSVVDEJ.js";import"./chunk-YK4IY5DJ.js";export{a as difference};

package/dist/divide.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkHBZ5F2DDcjs = require('./chunk-HBZ5F2DD.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.divide = _chunkHBZ5F2DDcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk2JSUJZJRcjs = require('./chunk-2JSUJZJR.cjs');require('./chunk-4MAOF3ZP.cjs');require('./chunk-4YUDBZFA.cjs');exports.divide = _chunk2JSUJZJRcjs.a;

package/dist/divide.js

@@ -1 +1 @@
-import{a}from"./chunk-P3LGW6WA.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as divide};
+import{a}from"./chunk-XXNSQDJF.js";import"./chunk-ENYMRDJU.js";import"./chunk-K2EX7PYH.js";export{a as divide};

package/dist/drop-first-by.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkBIAJ5KWRcjs = require('./chunk-BIAJ5KWR.cjs');require('./chunk-BWJDD26T.cjs');require('./chunk-5KO77UXQ.cjs');require('./chunk-FWQYL4Y4.cjs');require('./chunk-G66EZBJS.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.dropFirstBy = _chunkBIAJ5KWRcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkE374WHO7cjs = require('./chunk-E374WHO7.cjs');require('./chunk-PEYRR7GN.cjs');require('./chunk-Z6OOXW67.cjs');require('./chunk-EROXO3T4.cjs');require('./chunk-6DKD76DK.cjs');require('./chunk-4MAOF3ZP.cjs');require('./chunk-4YUDBZFA.cjs');exports.dropFirstBy = _chunkE374WHO7cjs.a;

package/dist/drop-first-by.d.cts

@@ -1,6 +1,5 @@
-import { a as NonEmptyArray } from './types-CC8iZVKO.cjs';
-import { O as OrderRule } from './curry-order-rules-DETxSzle.cjs';
-import 'type-fest';
+import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.cjs';
+import { O as OrderRule } from './curry-order-rules-BKXCPBNx.cjs';
 
 /**
  * Drop the first `n` items from `data` based on the provided ordering criteria. This allows you to avoid sorting the array before dropping the items. The complexity of this function is *O(Nlogn)* where `N` is the length of the array.

package/dist/drop-first-by.d.ts

@@ -1,6 +1,5 @@
-import { a as NonEmptyArray } from './types-CC8iZVKO.js';
-import { O as OrderRule } from './curry-order-rules-DETxSzle.js';
-import 'type-fest';
+import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.js';
+import { O as OrderRule } from './curry-order-rules-BKXCPBNx.js';
 
 /**
  * Drop the first `n` items from `data` based on the provided ordering criteria. This allows you to avoid sorting the array before dropping the items. The complexity of this function is *O(Nlogn)* where `N` is the length of the array.

package/dist/drop-first-by.js

@@ -1 +1 @@
-import{a}from"./chunk-IA53O34Y.js";import"./chunk-JU4UCCME.js";import"./chunk-UYH64IBH.js";import"./chunk-JXXXUJM5.js";import"./chunk-73BYESBE.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as dropFirstBy};
+import{a}from"./chunk-HTYL3XQS.js";import"./chunk-QNK2WMNL.js";import"./chunk-YYEJOSR3.js";import"./chunk-7KBK2RWQ.js";import"./chunk-AFLCNPZB.js";import"./chunk-ENYMRDJU.js";import"./chunk-K2EX7PYH.js";export{a as dropFirstBy};

package/dist/drop-last-while.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkG7BJFBAZcjs = require('./chunk-G7BJFBAZ.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.dropLastWhile = _chunkG7BJFBAZcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkMIQQGQM6cjs = require('./chunk-MIQQGQM6.cjs');require('./chunk-4MAOF3ZP.cjs');require('./chunk-4YUDBZFA.cjs');exports.dropLastWhile = _chunkMIQQGQM6cjs.a;

package/dist/drop-last-while.d.cts

@@ -1,5 +1,4 @@
-import { I as IterableContainer } from './types-CC8iZVKO.cjs';
-import 'type-fest';
+import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
 
 /**
  * Removes elements from the end of the array until the predicate returns false.

package/dist/drop-last-while.d.ts

@@ -1,5 +1,4 @@
-import { I as IterableContainer } from './types-CC8iZVKO.js';
-import 'type-fest';
+import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
 
 /**
  * Removes elements from the end of the array until the predicate returns false.

package/dist/drop-last-while.js

@@ -1 +1 @@
-import{a}from"./chunk-QTQTKNWA.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as dropLastWhile};
+import{a}from"./chunk-HW7P5ZFZ.js";import"./chunk-ENYMRDJU.js";import"./chunk-K2EX7PYH.js";export{a as dropLastWhile};

package/dist/drop-last.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkAACZ5UGGcjs = require('./chunk-AACZ5UGG.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.dropLast = _chunkAACZ5UGGcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkBBVARAQQcjs = require('./chunk-BBVARAQQ.cjs');require('./chunk-4MAOF3ZP.cjs');require('./chunk-4YUDBZFA.cjs');exports.dropLast = _chunkBBVARAQQcjs.a;

package/dist/drop-last.d.cts

@@ -1,5 +1,4 @@
-import { I as IterableContainer } from './types-CC8iZVKO.cjs';
-import 'type-fest';
+import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
 
 /**
  * Removes last `n` elements from the `array`.

package/dist/drop-last.d.ts

@@ -1,5 +1,4 @@
-import { I as IterableContainer } from './types-CC8iZVKO.js';
-import 'type-fest';
+import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
 
 /**
  * Removes last `n` elements from the `array`.

package/dist/drop-last.js

@@ -1 +1 @@
-import{a}from"./chunk-U2BXIRBJ.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as dropLast};
+import{a}from"./chunk-BUJTXQXW.js";import"./chunk-ENYMRDJU.js";import"./chunk-K2EX7PYH.js";export{a as dropLast};

package/dist/drop-while.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkRJAVPEJTcjs = require('./chunk-RJAVPEJT.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.dropWhile = _chunkRJAVPEJTcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkD6F22MNScjs = require('./chunk-D6F22MNS.cjs');require('./chunk-4MAOF3ZP.cjs');require('./chunk-4YUDBZFA.cjs');exports.dropWhile = _chunkD6F22MNScjs.a;

package/dist/drop-while.d.cts

@@ -1,5 +1,4 @@
-import { I as IterableContainer } from './types-CC8iZVKO.cjs';
-import 'type-fest';
+import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
 
 /**
  * Removes elements from the beginning of the array until the predicate returns false.

package/dist/drop-while.d.ts

@@ -1,5 +1,4 @@
-import { I as IterableContainer } from './types-CC8iZVKO.js';
-import 'type-fest';
+import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
 
 /**
  * Removes elements from the beginning of the array until the predicate returns false.

package/dist/drop-while.js

@@ -1 +1 @@
-import{a}from"./chunk-IABWIMQT.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as dropWhile};
+import{a}from"./chunk-2VBBLHTV.js";import"./chunk-ENYMRDJU.js";import"./chunk-K2EX7PYH.js";export{a as dropWhile};

package/dist/drop.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkG5M5BNF3cjs = require('./chunk-G5M5BNF3.cjs');require('./chunk-SW6GJ7UA.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.drop = _chunkG5M5BNF3cjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkHR3IUTNWcjs = require('./chunk-HR3IUTNW.cjs');require('./chunk-BGYDTTCY.cjs');require('./chunk-4MAOF3ZP.cjs');require('./chunk-4YUDBZFA.cjs');exports.drop = _chunkHR3IUTNWcjs.a;

package/dist/drop.d.cts

@@ -1,5 +1,17 @@
-import { IsNegative, IsInteger, Subtract } from 'type-fest';
-import { I as IterableContainer, T as TupleParts, N as NTuple, C as CoercedArray } from './types-CC8iZVKO.cjs';
+import { IfNever, IsNegative, IsInteger, Subtract } from 'type-fest';
+import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
+import { T as TupleParts, N as NTuple } from './tuple-parts-DcH94smG.cjs';
+
+/**
+ * `never[]` and `[]` are not the same type, and in some cases they aren't
+ * interchangeable.
+ *
+ * This type makes it easier to use the result of TupleParts when the input is a
+ * fixed-length tuple but we still want to spread the rest of the array. e.g.
+ * `[...CoercedArray<TupleParts<T>["item"]>, ...TupleParts<T>["suffix"]]`.
+ *
+ */
+type CoercedArray<T> = IfNever<T, [], Array<T>>;
 
 type Drop<T extends IterableContainer, N extends number> = IsNegative<N> extends true ? T : IsInteger<N> extends false ? Array<T[number]> : TupleParts<T>['prefix'] extends [
     ...NTuple<unknown, N>,