@vinicunca/perkakas 1.8.0 → 1.9.0

package/dist/merge-deep-Dn1sRc5z.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"merge-deep-Dn1sRc5z.js","names":[],"sources":["../src/merge-deep.ts"],"sourcesContent":["import type { MergeDeep } from 'type-fest';\n\nimport { curry } from './curry';\nimport { isPlainObject } from './is-plain-object';\n\n/**\n * Merges the `source` object into the `destination` object. The merge is similar to performing `{ ...destination, ... source }` (where disjoint values from each object would be copied as-is, and for any overlapping props the value from `source` would be used); But for *each prop* (`p`), if **both** `destination` and `source` have a **plain-object** as a value, the value would be taken as the result of recursively deepMerging them (`result.p === deepMerge(destination.p, source.p)`).\n *\n * @param destination - The object to merge into. In general, this object would have it's values overridden.\n * @param source - The object to merge from. In general, shared keys would be taken from this object.\n * @returns The merged object.\n * @signature\n *    P.mergeDeep(destination, source)\n * @example\n *    P.mergeDeep({ foo: 'bar', x: 1 }, { foo: 'baz', y: 2 }) // => { foo: 'baz', x: 1, y: 2 }\n * @dataFirst\n * @category Object\n */\nexport function mergeDeep<Destination extends object, Source extends object>(\n  destination: Destination, source: Source\n): MergeDeep<Destination, Source>;\n\n/**\n * Merges the `source` object into the `destination` object. The merge is similar to performing `{ ...destination, ... source }` (where disjoint values from each object would be copied as-is, and for any overlapping props the value from `source` would be used); But for *each prop* (`p`), if **both** `destination` and `source` have a **plain-object** as a value, the value would be taken as the result of recursively deepMerging them (`result.p === deepMerge(destination.p, source.p)`).\n *\n * @param source - The object to merge from. In general, shared keys would be taken from this object.\n * @returns The merged object.\n * @signature\n *    P.mergeDeep(source)(destination)\n * @example\n *    P.pipe(\n *      { foo: 'bar', x: 1 },\n *      P.mergeDeep({ foo: 'baz', y: 2 }),\n *    );  // => { foo: 'baz', x: 1, y: 2 }\n * @dataLast\n * @category Object\n */\nexport function mergeDeep<Source extends object>(\n  source: Source,\n): <Destination extends object>(\n  target: Destination,\n) => MergeDeep<Destination, Source>;\n\nexport function mergeDeep(...args: ReadonlyArray<unknown>): unknown {\n  return curry(mergeDeepImplementation, args);\n}\n\nfunction mergeDeepImplementation<\n  Destination extends object,\n  Source extends object,\n>(destination: Destination, source: Source): MergeDeep<Destination, Source> {\n  // At this point the output is already merged, simply not deeply merged.\n  const output = { ...destination, ...source } as Record<\n    keyof Destination | keyof Source,\n    unknown\n  >;\n\n  // now just scan the output and look for values that should have been deep-merged\n  // eslint-disable-next-line no-restricted-syntax\n  for (const key in source) {\n    if (!(key in destination)) {\n      // They don't share this key.\n      continue;\n    }\n\n    const { [key]: destinationValue } = destination;\n    if (!isPlainObject(destinationValue)) {\n      // The value in destination is not a mergable object so the value from\n      // source (which was already copied in the shallow merge) would be used\n      // as-is.\n      continue;\n    }\n\n    const { [key]: sourceValue } = source;\n    if (!isPlainObject(sourceValue)) {\n      // The value in source is not a mergable object either, so it will\n      // override the object in destination.\n      continue;\n    }\n\n    // Both destination and source have a mergable object for this key, so we\n    // recursively merge them.\n    output[key] = mergeDeepImplementation(destinationValue, sourceValue);\n  }\n\n  // @ts-expect-error [ts2322] - We build the output object iteratively, I don't think it's possible to improve the types here so that typescript infers the right type.\n  return output;\n}\n"],"mappings":"0GA2CA,SAAgB,EAAU,GAAG,EAAuC,CAClE,OAAO,EAAM,EAAyB,EAAK,CAG7C,SAAS,EAGP,EAA0B,EAAgD,CAE1E,IAAM,EAAS,CAAE,GAAG,EAAa,GAAG,EAAQ,CAO5C,IAAK,IAAM,KAAO,EAAQ,CACxB,GAAI,EAAE,KAAO,GAEX,SAGF,GAAM,EAAG,GAAM,GAAqB,EACpC,GAAI,CAAC,EAAc,EAAiB,CAIlC,SAGF,GAAM,EAAG,GAAM,GAAgB,EAC1B,EAAc,EAAY,GAQ/B,EAAO,GAAO,EAAwB,EAAkB,EAAY,EAItE,OAAO"}

package/dist/multiply-BI2VvlFd.js

@@ -1,2 +0,0 @@
-import{curry as e}from"./curry-CzZjDrpv.js";function t(...t){return e(n,t)}function n(e,t){return e*t}export{t as multiply};
-//# sourceMappingURL=multiply-BI2VvlFd.js.map

package/dist/multiply-BI2VvlFd.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"multiply-BI2VvlFd.js","names":[],"sources":["../src/multiply.ts"],"sourcesContent":["import { curry } from './curry';\n\n/**\n * Multiplies two numbers.\n *\n * @param value - The number.\n * @param multiplicand - The number to multiply the value by.\n * @signature\n *    P.multiply(value, multiplicand);\n * @example\n *    P.multiply(3, 4) // => 12\n *    P.reduce([1, 2, 3, 4], P.multiply, 1) // => 24\n * @dataFirst\n * @category Number\n */\nexport function multiply(value: bigint, multiplicand: bigint): bigint;\nexport function multiply(value: number, multiplicand: number): number;\n\n/**\n * Multiplies two numbers.\n *\n * @param multiplicand - The number to multiply the value by.\n * @signature\n *    P.multiply(multiplicand)(value);\n * @example\n *    P.multiply(4)(3) // => 12\n *    P.map([1, 2, 3, 4], P.multiply(2)) // => [2, 4, 6, 8]\n * @dataLast\n * @category Number\n */\nexport function multiply(multiplicand: bigint): (value: bigint) => bigint;\nexport function multiply(multiplicand: number): (value: number) => number;\n\nexport function multiply(...args: ReadonlyArray<unknown>): unknown {\n  return curry(multiplyImplementation, args);\n}\n\n// The implementation only uses `number` types, but that's just because it's\n// hard to tell typescript that both value and multiplicand would be of the same\n// type.\nfunction multiplyImplementation(value: number, multiplicand: number): number {\n  return value * multiplicand;\n}\n"],"mappings":"4CAiCA,SAAgB,EAAS,GAAG,EAAuC,CACjE,OAAO,EAAM,EAAwB,EAAK,CAM5C,SAAS,EAAuB,EAAe,EAA8B,CAC3E,OAAO,EAAQ"}

package/dist/multiply-UBFQYNUD.d.ts

@@ -1,33 +0,0 @@
-//#region src/multiply.d.ts
-/**
- * Multiplies two numbers.
- *
- * @param value - The number.
- * @param multiplicand - The number to multiply the value by.
- * @signature
- *    P.multiply(value, multiplicand);
- * @example
- *    P.multiply(3, 4) // => 12
- *    P.reduce([1, 2, 3, 4], P.multiply, 1) // => 24
- * @dataFirst
- * @category Number
- */
-declare function multiply(value: bigint, multiplicand: bigint): bigint;
-declare function multiply(value: number, multiplicand: number): number;
-/**
- * Multiplies two numbers.
- *
- * @param multiplicand - The number to multiply the value by.
- * @signature
- *    P.multiply(multiplicand)(value);
- * @example
- *    P.multiply(4)(3) // => 12
- *    P.map([1, 2, 3, 4], P.multiply(2)) // => [2, 4, 6, 8]
- * @dataLast
- * @category Number
- */
-declare function multiply(multiplicand: bigint): (value: bigint) => bigint;
-declare function multiply(multiplicand: number): (value: number) => number;
-//#endregion
-export { multiply };
-//# sourceMappingURL=multiply-UBFQYNUD.d.ts.map

package/dist/multiply-UBFQYNUD.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"multiply-UBFQYNUD.d.ts","names":[],"sources":["../src/multiply.ts"],"sourcesContent":[],"mappings":";;AAeA;AACA;AAcA;AACA;;;;;;;;;iBAhBgB,QAAA;iBACA,QAAA;;;;;;;;;;;;;iBAcA,QAAA;iBACA,QAAA"}

package/dist/multiply-gDDdmofq.d.cts

@@ -1,33 +0,0 @@
-//#region src/multiply.d.ts
-/**
- * Multiplies two numbers.
- *
- * @param value - The number.
- * @param multiplicand - The number to multiply the value by.
- * @signature
- *    P.multiply(value, multiplicand);
- * @example
- *    P.multiply(3, 4) // => 12
- *    P.reduce([1, 2, 3, 4], P.multiply, 1) // => 24
- * @dataFirst
- * @category Number
- */
-declare function multiply(value: bigint, multiplicand: bigint): bigint;
-declare function multiply(value: number, multiplicand: number): number;
-/**
- * Multiplies two numbers.
- *
- * @param multiplicand - The number to multiply the value by.
- * @signature
- *    P.multiply(multiplicand)(value);
- * @example
- *    P.multiply(4)(3) // => 12
- *    P.map([1, 2, 3, 4], P.multiply(2)) // => [2, 4, 6, 8]
- * @dataLast
- * @category Number
- */
-declare function multiply(multiplicand: bigint): (value: bigint) => bigint;
-declare function multiply(multiplicand: number): (value: number) => number;
-//#endregion
-export { multiply };
-//# sourceMappingURL=multiply-gDDdmofq.d.cts.map

package/dist/multiply-gDDdmofq.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"multiply-gDDdmofq.d.cts","names":[],"sources":["../src/multiply.ts"],"sourcesContent":[],"mappings":";;AAeA;AACA;AAcA;AACA;;;;;;;;;iBAhBgB,QAAA;iBACA,QAAA;;;;;;;;;;;;;iBAcA,QAAA;iBACA,QAAA"}

package/dist/n-tuple-BELi5yRe.d.ts

@@ -1,12 +0,0 @@
-//#region src/internal/types/n-tuple.d.ts
-/**
- * An array with *exactly* N elements in it.
- *
- * Only literal N values are supported. For very large N the type might result
- * in a recurse depth error. For negative N the type would result in an infinite
- * recursion. None of these have protections because this is an internal type!
- */
-type NTuple<T, N extends number, Result extends Array<unknown> = []> = Result['length'] extends N ? Result : NTuple<T, N, [...Result, T]>;
-//#endregion
-export { NTuple };
-//# sourceMappingURL=n-tuple-BELi5yRe.d.ts.map

package/dist/n-tuple-BELi5yRe.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"n-tuple-BELi5yRe.d.ts","names":[],"sources":["../src/internal/types/n-tuple.ts"],"sourcesContent":[],"mappings":";;AAOA;;;;;;AAIiD,KAJrC,MAIqC,CAAA,CAAA,EAAA,UAAA,MAAA,EAAA,eADhC,KACgC,CAAA,OAAA,CAAA,GAAA,EAAA,CAAA,GAA7C,MAA6C,CAAA,QAAA,CAAA,SAApB,CAAoB,GAAhB,MAAgB,GAAP,MAAO,CAAA,CAAA,EAAG,CAAH,EAAA,CAAA,GAAU,MAAV,EAAkB,CAAlB,CAAA,CAAA"}

package/dist/narrowed-to-C6wP224-.d.ts

@@ -1,15 +0,0 @@
-import { IsAny } from "type-fest";
-
-//#region src/internal/types/narrowed-to.d.ts
-
-/**
- * An extension of Extract for type predicates which falls back to the base
- * in order to narrow the `unknown` case.
- *
- * @example
- *   function isMyType<T>(data: T | MyType): data is NarrowedTo<T, MyType> { ... }
- */
-type NarrowedTo<T, Base> = Extract<T, Base> extends never ? Base : IsAny<T> extends true ? Base : Extract<T, Base>;
-//#endregion
-export { NarrowedTo };
-//# sourceMappingURL=narrowed-to-C6wP224-.d.ts.map

package/dist/narrowed-to-C6wP224-.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"narrowed-to-C6wP224-.d.ts","names":[],"sources":["../src/internal/types/narrowed-to.ts"],"sourcesContent":[],"mappings":";;;;;;AASA;;;;;AAEM,KAFM,UAEN,CAAA,CAAA,EAAA,IAAA,CAAA,GADF,OACE,CADM,CACN,EADS,IACT,CAAA,SAAA,KAAA,GAAA,IAAA,GACA,KADA,CACM,CADN,CAAA,SAAA,IAAA,GAEE,IAFF,GAGE,OAHF,CAGU,CAHV,EAGa,IAHb,CAAA"}

package/dist/non-empty-array-D3HWDPMt.d.ts

@@ -1,5 +0,0 @@
-//#region src/internal/types/non-empty-array.d.ts
-type NonEmptyArray<T> = [T, ...Array<T>];
-//#endregion
-export { NonEmptyArray };
-//# sourceMappingURL=non-empty-array-D3HWDPMt.d.ts.map

package/dist/non-empty-array-D3HWDPMt.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"non-empty-array-D3HWDPMt.d.ts","names":[],"sources":["../src/internal/types/non-empty-array.ts"],"sourcesContent":[],"mappings":";KAAY,oBAAoB,MAAM,MAAM"}

package/dist/nth-by-BR1fcwCZ.js

@@ -1,2 +0,0 @@
-import{curryOrderRulesWithArgument as e}from"./curry-order-rules-BuA7D1F4.js";import{swapInPlace as t}from"./swap-in-place-BBqaxzzG.js";function n(e,t,n){return t<0||t>=e.length?void 0:r([...e],0,e.length-1,t,n)}function r(e,t,n,a,o){if(t===n)return e[t];let s=i(e,t,n,o);return a===s?e[a]:r(e,a<s?t:s+1,a<s?s-1:n,a,o)}function i(e,n,r,i){let a=e[r],o=n;for(let s=n;s<r;s++)i(e[s],a)<0&&(t(e,o,s),o+=1);return t(e,o,r),o}function a(...t){return e(o,t)}function o(e,t,r){return n(e,r>=0?r:e.length+r,t)}export{a as nthBy};
-//# sourceMappingURL=nth-by-BR1fcwCZ.js.map

package/dist/nth-by-BR1fcwCZ.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"nth-by-BR1fcwCZ.js","names":[],"sources":["../src/internal/quick-select.ts","../src/nth-by.ts"],"sourcesContent":["/**\n * A simple implementation of the *QuickSelect* algorithm.\n *\n * @see https://en.wikipedia.org/wiki/Quickselect\n */\n\nimport type { CompareFunction } from './types/compare-function';\nimport { swapInPlace } from './swap-in-place';\n\n/**\n * Perform QuickSelect on the given data. Notice that the data would be cloned\n * shallowly so that it could be mutated in-place, and then discarded once the\n * algorithm is done. This means that running this function multiple times on\n * the same array might be slower then sorting the array before.\n *\n * @param data - The data to perform the selection on.\n * @param index - The index of the item we are looking for.\n * @param compareFn - The compare function to use for sorting.\n * @returns The item at the given index, or `undefined` if the index is out-of-\n * bounds.\n */\nexport function quickSelect<T>(\n  data: ReadonlyArray<T>,\n  index: number,\n  compareFn: CompareFunction<T>,\n): T | undefined {\n  return index < 0 || index >= data.length\n  // Quickselect doesn't work with out-of-bound indices\n    ? undefined\n    : quickSelectImplementation(\n      // We need to clone the array because quickSelect mutates it in-place.\n        [...data],\n        0 /* left */,\n        data.length - 1 /* right */,\n        index,\n        compareFn,\n      );\n}\n\n/**\n * The actual implementation, called recursively.\n */\nfunction quickSelectImplementation<T>(\n  data: Array<T>,\n  left: number,\n  right: number,\n  index: number,\n  compareFn: CompareFunction<T>,\n): T {\n  if (left === right) {\n    return data[left]!;\n  }\n\n  const pivotIndex = partition(data, left, right, compareFn);\n\n  return index === pivotIndex\n    // Once a pivot is chosen it's location is final, so if it matches the\n    // index we found out item!\n    ? data[index]!\n    : quickSelectImplementation(\n        data,\n        // We continue by recursing into the partition where index would be\n        index < pivotIndex ? left : pivotIndex + 1,\n        index < pivotIndex ? pivotIndex - 1 : right,\n        index,\n        compareFn,\n      );\n}\n\nfunction partition<T>(\n  data: Array<T>,\n  left: number,\n  right: number,\n  compareFn: CompareFunction<T>,\n): number {\n  const pivot = data[right]!;\n\n  let i = left;\n  for (let j = left; j < right; j++) {\n    if (compareFn(data[j]!, pivot) < 0) {\n      // Move items smaller then the pivot to the start of the array.\n      swapInPlace(data, i, j);\n      i += 1;\n    }\n  }\n\n  swapInPlace(data, i, right);\n\n  // The location of the pivot by the end of the partition function.\n  return i;\n}\n","import type { OrderRule } from './internal/curry-order-rules';\nimport type { CompareFunction } from './internal/types/compare-function';\nimport type { IterableContainer } from './internal/types/iterable-container';\nimport type { NonEmptyArray } from './internal/types/non-empty-array';\nimport {\n  curryOrderRulesWithArgument,\n\n} from './internal/curry-order-rules';\nimport { quickSelect } from './internal/quick-select';\n\n/**\n * Retrieves the element that would be at the given index if the array were sorted according to specified rules. This function uses the *QuickSelect* algorithm running at an average complexity of *O(n)*. Semantically it is equivalent to `sortBy(data, ...rules).at(index)` which would run at *O(nlogn)*.\n *\n * See also `firstBy` which provides an even more efficient algorithm and a stricter return type, but only for `index === 0`. See `takeFirstBy` to get all the elements up to and including `index`.\n *\n * @param data - The input array.\n * @param index - The zero-based index for selecting the element in the sorted order. Negative indices count backwards from the end.\n * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, \"desc\"]` for descending order.\n * @returns The element at the specified index in the sorted order, or `undefined` if the index is out of bounds.\n * @signature\n *   P.nthBy(data, index, ...rules);\n * @example\n *   P.nthBy([2,1,4,5,3,], 2, identity()); // => 3\n * @dataFirst\n * @category Array\n */\nexport function nthBy<T extends IterableContainer>(\n  data: T,\n  index: number,\n  ...rules: Readonly<NonEmptyArray<OrderRule<T[number]>>>\n): T[number] | undefined;\n\n/**\n * Retrieves the element that would be at the given index if the array were sorted according to specified rules. This function uses the *QuickSelect* algorithm running at an average complexity of *O(n)*. Semantically it is equivalent to `sortBy(data, ...rules)[index]` which would run at *O(nlogn)*.\n *\n * See also `firstBy` which provides an even more efficient algorithm and a stricter return type, but only for `index === 0`. See `takeFirstBy` to get all the elements up to and including `index`.\n *\n * @param index - The zero-based index for selecting the element in the sorted order. Negative indices count backwards from the end.\n * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, \"desc\"]` for descending order.\n * @returns The element at the specified index in the sorted order, or `undefined` if the index is out of bounds.\n * @signature\n *   P.nthBy(index, ...rules)(data);\n * @example\n *   P.pipe([2,1,4,5,3,], P.nthBy(2, identity())); // => 3\n * @dataLast\n * @category Array\n */\nexport function nthBy<T extends IterableContainer>(\n  index: number,\n  ...rules: Readonly<NonEmptyArray<OrderRule<T[number]>>>\n): (data: T) => T[number] | undefined;\n\nexport function nthBy(...args: ReadonlyArray<unknown>): unknown {\n  return curryOrderRulesWithArgument(nthByImplementation, args);\n}\n\nfunction nthByImplementation<T>(\n  data: ReadonlyArray<T>,\n  compareFn: CompareFunction<T>,\n  index: number,\n): T | undefined {\n  return quickSelect(\n    data,\n    // Allow negative indices gracefully\n    index >= 0 ? index : data.length + index,\n    compareFn,\n  );\n}\n"],"mappings":"wIAqBA,SAAgB,EACd,EACA,EACA,EACe,CACf,OAAO,EAAQ,GAAK,GAAS,EAAK,OAE9B,IAAA,GACA,EAEE,CAAC,GAAG,EAAK,CACT,EACA,EAAK,OAAS,EACd,EACA,EACD,CAMP,SAAS,EACP,EACA,EACA,EACA,EACA,EACG,CACH,GAAI,IAAS,EACX,OAAO,EAAK,GAGd,IAAM,EAAa,EAAU,EAAM,EAAM,EAAO,EAAU,CAE1D,OAAO,IAAU,EAGb,EAAK,GACL,EACE,EAEA,EAAQ,EAAa,EAAO,EAAa,EACzC,EAAQ,EAAa,EAAa,EAAI,EACtC,EACA,EACD,CAGP,SAAS,EACP,EACA,EACA,EACA,EACQ,CACR,IAAM,EAAQ,EAAK,GAEf,EAAI,EACR,IAAK,IAAI,EAAI,EAAM,EAAI,EAAO,IACxB,EAAU,EAAK,GAAK,EAAM,CAAG,IAE/B,EAAY,EAAM,EAAG,EAAE,CACvB,GAAK,GAOT,OAHA,EAAY,EAAM,EAAG,EAAM,CAGpB,ECrCT,SAAgB,EAAM,GAAG,EAAuC,CAC9D,OAAO,EAA4B,EAAqB,EAAK,CAG/D,SAAS,EACP,EACA,EACA,EACe,CACf,OAAO,EACL,EAEA,GAAS,EAAI,EAAQ,EAAK,OAAS,EACnC,EACD"}

package/dist/nth-by-CKFOiBHp.d.cts

@@ -1,42 +0,0 @@
-import { IterableContainer } from "./iterable-container-V5sa0V_H.cjs";
-import { NonEmptyArray } from "./non-empty-array-D3ZRHApS.cjs";
-import { OrderRule } from "./curry-order-rules-1zjlAgqa.cjs";
-
-//#region src/nth-by.d.ts
-
-/**
- * Retrieves the element that would be at the given index if the array were sorted according to specified rules. This function uses the *QuickSelect* algorithm running at an average complexity of *O(n)*. Semantically it is equivalent to `sortBy(data, ...rules).at(index)` which would run at *O(nlogn)*.
- *
- * See also `firstBy` which provides an even more efficient algorithm and a stricter return type, but only for `index === 0`. See `takeFirstBy` to get all the elements up to and including `index`.
- *
- * @param data - The input array.
- * @param index - The zero-based index for selecting the element in the sorted order. Negative indices count backwards from the end.
- * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.
- * @returns The element at the specified index in the sorted order, or `undefined` if the index is out of bounds.
- * @signature
- *   P.nthBy(data, index, ...rules);
- * @example
- *   P.nthBy([2,1,4,5,3,], 2, identity()); // => 3
- * @dataFirst
- * @category Array
- */
-declare function nthBy<T extends IterableContainer>(data: T, index: number, ...rules: Readonly<NonEmptyArray<OrderRule<T[number]>>>): T[number] | undefined;
-/**
- * Retrieves the element that would be at the given index if the array were sorted according to specified rules. This function uses the *QuickSelect* algorithm running at an average complexity of *O(n)*. Semantically it is equivalent to `sortBy(data, ...rules)[index]` which would run at *O(nlogn)*.
- *
- * See also `firstBy` which provides an even more efficient algorithm and a stricter return type, but only for `index === 0`. See `takeFirstBy` to get all the elements up to and including `index`.
- *
- * @param index - The zero-based index for selecting the element in the sorted order. Negative indices count backwards from the end.
- * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.
- * @returns The element at the specified index in the sorted order, or `undefined` if the index is out of bounds.
- * @signature
- *   P.nthBy(index, ...rules)(data);
- * @example
- *   P.pipe([2,1,4,5,3,], P.nthBy(2, identity())); // => 3
- * @dataLast
- * @category Array
- */
-declare function nthBy<T extends IterableContainer>(index: number, ...rules: Readonly<NonEmptyArray<OrderRule<T[number]>>>): (data: T) => T[number] | undefined;
-//#endregion
-export { nthBy };
-//# sourceMappingURL=nth-by-CKFOiBHp.d.cts.map

package/dist/nth-by-CKFOiBHp.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"nth-by-CKFOiBHp.d.cts","names":[],"sources":["../src/nth-by.ts"],"sourcesContent":[],"mappings":";;;;;;;;AA0BA;;;;;;;;;;AAqBA;;;;AAEmC,iBAvBnB,KAuBmB,CAAA,UAvBH,iBAuBG,CAAA,CAAA,IAAA,EAtB3B,CAsB2B,EAAA,KAAA,EAAA,MAAA,EAAA,GAAA,KAAA,EApBvB,QAoBuB,CApBd,aAoBc,CApBA,SAoBA,CApBU,CAoBV,CAAA,MAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAnBhC,CAmBgC,CAAA,MAAA,CAAA,GAAA,SAAA;;;;;;;;;;;;;;;;iBAFnB,gBAAgB,4CAEpB,SAAS,cAAc,UAAU,sBACnC,MAAM"}

package/dist/nth-by-DX2PBdEe.d.ts

@@ -1,42 +0,0 @@
-import { IterableContainer } from "./iterable-container-wtkYslN_.js";
-import { NonEmptyArray } from "./non-empty-array-D3HWDPMt.js";
-import { OrderRule } from "./curry-order-rules-Cthu8rj4.js";
-
-//#region src/nth-by.d.ts
-
-/**
- * Retrieves the element that would be at the given index if the array were sorted according to specified rules. This function uses the *QuickSelect* algorithm running at an average complexity of *O(n)*. Semantically it is equivalent to `sortBy(data, ...rules).at(index)` which would run at *O(nlogn)*.
- *
- * See also `firstBy` which provides an even more efficient algorithm and a stricter return type, but only for `index === 0`. See `takeFirstBy` to get all the elements up to and including `index`.
- *
- * @param data - The input array.
- * @param index - The zero-based index for selecting the element in the sorted order. Negative indices count backwards from the end.
- * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.
- * @returns The element at the specified index in the sorted order, or `undefined` if the index is out of bounds.
- * @signature
- *   P.nthBy(data, index, ...rules);
- * @example
- *   P.nthBy([2,1,4,5,3,], 2, identity()); // => 3
- * @dataFirst
- * @category Array
- */
-declare function nthBy<T extends IterableContainer>(data: T, index: number, ...rules: Readonly<NonEmptyArray<OrderRule<T[number]>>>): T[number] | undefined;
-/**
- * Retrieves the element that would be at the given index if the array were sorted according to specified rules. This function uses the *QuickSelect* algorithm running at an average complexity of *O(n)*. Semantically it is equivalent to `sortBy(data, ...rules)[index]` which would run at *O(nlogn)*.
- *
- * See also `firstBy` which provides an even more efficient algorithm and a stricter return type, but only for `index === 0`. See `takeFirstBy` to get all the elements up to and including `index`.
- *
- * @param index - The zero-based index for selecting the element in the sorted order. Negative indices count backwards from the end.
- * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.
- * @returns The element at the specified index in the sorted order, or `undefined` if the index is out of bounds.
- * @signature
- *   P.nthBy(index, ...rules)(data);
- * @example
- *   P.pipe([2,1,4,5,3,], P.nthBy(2, identity())); // => 3
- * @dataLast
- * @category Array
- */
-declare function nthBy<T extends IterableContainer>(index: number, ...rules: Readonly<NonEmptyArray<OrderRule<T[number]>>>): (data: T) => T[number] | undefined;
-//#endregion
-export { nthBy };
-//# sourceMappingURL=nth-by-DX2PBdEe.d.ts.map

package/dist/nth-by-DX2PBdEe.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"nth-by-DX2PBdEe.d.ts","names":[],"sources":["../src/nth-by.ts"],"sourcesContent":[],"mappings":";;;;;;;;AA0BA;;;;;;;;;;AAqBA;;;;AAEmC,iBAvBnB,KAuBmB,CAAA,UAvBH,iBAuBG,CAAA,CAAA,IAAA,EAtB3B,CAsB2B,EAAA,KAAA,EAAA,MAAA,EAAA,GAAA,KAAA,EApBvB,QAoBuB,CApBd,aAoBc,CApBA,SAoBA,CApBU,CAoBV,CAAA,MAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAnBhC,CAmBgC,CAAA,MAAA,CAAA,GAAA,SAAA;;;;;;;;;;;;;;;;iBAFnB,gBAAgB,4CAEpB,SAAS,cAAc,UAAU,sBACnC,MAAM"}

package/dist/obj-of-B7t_1Jdi.d.ts

@@ -1,27 +0,0 @@
-//#region src/obj-of.d.ts
-/**
- * Creates an object containing a single `key:value` pair.
- *
- * @param value - The object value.
- * @param key - The property name.
- * @signature
- *    P.objOf(value, key)
- * @example
- *    P.objOf(10, 'a') // => { a: 10 }
- * @category Object
- */
-declare function objOf<T, K extends string>(value: T, key: K): { [x in K]: T };
-/**
- * Creates an object containing a single `key:value` pair.
- *
- * @param key - The property name.
- * @signature
- *    P.objOf(key)(value)
- * @example
- *    P.pipe(10, P.objOf('a')) // => { a: 10 }
- * @category Object
- */
-declare function objOf<T, K extends string>(key: K): (value: T) => { [x in K]: T };
-//#endregion
-export { objOf };
-//# sourceMappingURL=obj-of-B7t_1Jdi.d.ts.map

package/dist/obj-of-B7t_1Jdi.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"obj-of-B7t_1Jdi.d.ts","names":[],"sources":["../src/obj-of.ts"],"sourcesContent":[],"mappings":";;AAaA;;;;;;;AAYA;;;AAEW,iBAdK,KAcL,CAAA,CAAA,EAAA,UAAA,MAAA,CAAA,CAAA,KAAA,EAduC,CAcvC,EAAA,GAAA,EAd+C,CAc/C,CAAA,EAAA,QAd2D,CAc7C,GAdiD,CAcjD;;;;;;;;;;;iBAFT,gCACT,YACI,cAAc,IAAI"}

package/dist/obj-of-CXD9MOPS.js

@@ -1,2 +0,0 @@
-import{curry as e}from"./curry-CzZjDrpv.js";function t(...t){return e(n,t)}function n(e,t){return{[t]:e}}export{t as objOf};
-//# sourceMappingURL=obj-of-CXD9MOPS.js.map

package/dist/obj-of-CXD9MOPS.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"obj-of-CXD9MOPS.js","names":[],"sources":["../src/obj-of.ts"],"sourcesContent":["import { curry } from './curry';\n\n/**\n * Creates an object containing a single `key:value` pair.\n *\n * @param value - The object value.\n * @param key - The property name.\n * @signature\n *    P.objOf(value, key)\n * @example\n *    P.objOf(10, 'a') // => { a: 10 }\n * @category Object\n */\nexport function objOf<T, K extends string>(value: T, key: K): { [x in K]: T };\n\n/**\n * Creates an object containing a single `key:value` pair.\n *\n * @param key - The property name.\n * @signature\n *    P.objOf(key)(value)\n * @example\n *    P.pipe(10, P.objOf('a')) // => { a: 10 }\n * @category Object\n */\nexport function objOf<T, K extends string>(\n  key: K,\n): (value: T) => { [x in K]: T };\n\nexport function objOf(...args: ReadonlyArray<unknown>): unknown {\n  return curry(objOfImplementation, args);\n}\n\nfunction objOfImplementation<T, K extends string>(\n  value: T,\n  key: K,\n): { [x in K]: T } {\n  // @ts-expect-error [ts2322] - I'm not sure how to get the type right here...\n  return ({ [key]: value });\n}\n"],"mappings":"4CA6BA,SAAgB,EAAM,GAAG,EAAuC,CAC9D,OAAO,EAAM,EAAqB,EAAK,CAGzC,SAAS,EACP,EACA,EACiB,CAEjB,MAAQ,EAAG,GAAM,EAAO"}

package/dist/obj-of-OgSK6d9I.d.cts

@@ -1,27 +0,0 @@
-//#region src/obj-of.d.ts
-/**
- * Creates an object containing a single `key:value` pair.
- *
- * @param value - The object value.
- * @param key - The property name.
- * @signature
- *    P.objOf(value, key)
- * @example
- *    P.objOf(10, 'a') // => { a: 10 }
- * @category Object
- */
-declare function objOf<T, K extends string>(value: T, key: K): { [x in K]: T };
-/**
- * Creates an object containing a single `key:value` pair.
- *
- * @param key - The property name.
- * @signature
- *    P.objOf(key)(value)
- * @example
- *    P.pipe(10, P.objOf('a')) // => { a: 10 }
- * @category Object
- */
-declare function objOf<T, K extends string>(key: K): (value: T) => { [x in K]: T };
-//#endregion
-export { objOf };
-//# sourceMappingURL=obj-of-OgSK6d9I.d.cts.map

package/dist/obj-of-OgSK6d9I.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"obj-of-OgSK6d9I.d.cts","names":[],"sources":["../src/obj-of.ts"],"sourcesContent":[],"mappings":";;AAaA;;;;;;;AAYA;;;AAEW,iBAdK,KAcL,CAAA,CAAA,EAAA,UAAA,MAAA,CAAA,CAAA,KAAA,EAduC,CAcvC,EAAA,GAAA,EAd+C,CAc/C,CAAA,EAAA,QAd2D,CAc7C,GAdiD,CAcjD;;;;;;;;;;;iBAFT,gCACT,YACI,cAAc,IAAI"}

package/dist/omit-Bpyv8_An.d.ts

@@ -1,29 +0,0 @@
-//#region src/omit.d.ts
-/**
- * Returns a partial copy of an object omitting the keys specified.
- *
- * @param propNames - The property names.
- * @signature
- *    P.omit(names)(obj);
- * @example
- *    P.pipe({ a: 1, b: 2, c: 3, d: 4 }, P.omit(['a', 'd'])) // => { b: 2, c: 3 }
- * @dataLast
- * @category Object
- */
-declare function omit<T extends object, K extends keyof T>(propNames: ReadonlyArray<K>): (data: T) => Omit<T, K>;
-/**
- * Returns a partial copy of an object omitting the keys specified.
- *
- * @param data - The object.
- * @param propNames - The property names.
- * @signature
- *    P.omit(obj, names);
- * @example
- *    P.omit({ a: 1, b: 2, c: 3, d: 4 }, ['a', 'd']) // => { b: 2, c: 3 }
- * @dataFirst
- * @category Object
- */
-declare function omit<T extends object, K extends keyof T>(data: T, propNames: ReadonlyArray<K>): Omit<T, K>;
-//#endregion
-export { omit };
-//# sourceMappingURL=omit-Bpyv8_An.d.ts.map

package/dist/omit-Bpyv8_An.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"omit-Bpyv8_An.d.ts","names":[],"sources":["../src/omit.ts"],"sourcesContent":[],"mappings":";;AAcA;;;;;;;;;;AAgBgB,iBAhBA,IAgBI,CAAA,UAAA,MAAA,EAAA,UAAA,MAhBmC,CAgBnC,CAAA,CAAA,SAAA,EAfP,aAeO,CAfO,CAeP,CAAA,CAAA,EAAA,CAAA,IAAA,EAdV,CAcU,EAAA,GAdJ,IAcI,CAdC,CAcD,EAdI,CAcJ,CAAA;;;;;;;;;;;;;iBAAJ,uCAAuC,SAC/C,cACK,cAAc,KACxB,KAAK,GAAG"}

package/dist/omit-DB0YVkss.d.cts

@@ -1,29 +0,0 @@
-//#region src/omit.d.ts
-/**
- * Returns a partial copy of an object omitting the keys specified.
- *
- * @param propNames - The property names.
- * @signature
- *    P.omit(names)(obj);
- * @example
- *    P.pipe({ a: 1, b: 2, c: 3, d: 4 }, P.omit(['a', 'd'])) // => { b: 2, c: 3 }
- * @dataLast
- * @category Object
- */
-declare function omit<T extends object, K extends keyof T>(propNames: ReadonlyArray<K>): (data: T) => Omit<T, K>;
-/**
- * Returns a partial copy of an object omitting the keys specified.
- *
- * @param data - The object.
- * @param propNames - The property names.
- * @signature
- *    P.omit(obj, names);
- * @example
- *    P.omit({ a: 1, b: 2, c: 3, d: 4 }, ['a', 'd']) // => { b: 2, c: 3 }
- * @dataFirst
- * @category Object
- */
-declare function omit<T extends object, K extends keyof T>(data: T, propNames: ReadonlyArray<K>): Omit<T, K>;
-//#endregion
-export { omit };
-//# sourceMappingURL=omit-DB0YVkss.d.cts.map

package/dist/omit-DB0YVkss.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"omit-DB0YVkss.d.cts","names":[],"sources":["../src/omit.ts"],"sourcesContent":[],"mappings":";;AAcA;;;;;;;;;;AAgBgB,iBAhBA,IAgBI,CAAA,UAAA,MAAA,EAAA,UAAA,MAhBmC,CAgBnC,CAAA,CAAA,SAAA,EAfP,aAeO,CAfO,CAeP,CAAA,CAAA,EAAA,CAAA,IAAA,EAdV,CAcU,EAAA,GAdJ,IAcI,CAdC,CAcD,EAdI,CAcJ,CAAA;;;;;;;;;;;;;iBAAJ,uCAAuC,SAC/C,cACK,cAAc,KACxB,KAAK,GAAG"}

package/dist/omit-Dgi9IFmV.js

@@ -1,2 +0,0 @@
-import{curry as e}from"./curry-CzZjDrpv.js";import{hasAtLeast as t}from"./has-at-least-6iRvhsST.js";function n(...t){return e(r,t)}function r(e,n){if(!t(n,1))return{...e};if(!t(n,2)){let{[n[0]]:t,...r}=e;return r}let r={...e};for(let e of n)delete r[e];return r}export{n as omit};
-//# sourceMappingURL=omit-Dgi9IFmV.js.map

package/dist/omit-Dgi9IFmV.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"omit-Dgi9IFmV.js","names":[],"sources":["../src/omit.ts"],"sourcesContent":["import { curry } from './curry';\nimport { hasAtLeast } from './has-at-least';\n\n/**\n * Returns a partial copy of an object omitting the keys specified.\n *\n * @param propNames - The property names.\n * @signature\n *    P.omit(names)(obj);\n * @example\n *    P.pipe({ a: 1, b: 2, c: 3, d: 4 }, P.omit(['a', 'd'])) // => { b: 2, c: 3 }\n * @dataLast\n * @category Object\n */\nexport function omit<T extends object, K extends keyof T>(\n  propNames: ReadonlyArray<K>,\n): (data: T) => Omit<T, K>;\n\n/**\n * Returns a partial copy of an object omitting the keys specified.\n *\n * @param data - The object.\n * @param propNames - The property names.\n * @signature\n *    P.omit(obj, names);\n * @example\n *    P.omit({ a: 1, b: 2, c: 3, d: 4 }, ['a', 'd']) // => { b: 2, c: 3 }\n * @dataFirst\n * @category Object\n */\nexport function omit<T extends object, K extends keyof T>(\n  data: T,\n  propNames: ReadonlyArray<K>,\n): Omit<T, K>;\n\nexport function omit(...args: ReadonlyArray<unknown>): unknown {\n  return curry(omitImplementation, args);\n}\n\nfunction omitImplementation<T extends object, K extends keyof T>(\n  data: T,\n  propNames: ReadonlyArray<K>,\n): Omit<T, K> {\n  if (!hasAtLeast(propNames, 1)) {\n    // No props to omit at all!\n    return { ...data };\n  }\n\n  if (!hasAtLeast(propNames, 2)) {\n    // Only one prop to omit.\n    const { [propNames[0]]: _omitted, ...remaining } = data;\n    return remaining;\n  }\n\n  // Multiple props to omit...\n\n  const out = { ...data };\n  for (const prop of propNames) {\n    // eslint-disable-next-line ts/no-dynamic-delete -- This is the best way to do it!\n    delete out[prop];\n  }\n  return out;\n}\n"],"mappings":"oGAmCA,SAAgB,EAAK,GAAG,EAAuC,CAC7D,OAAO,EAAM,EAAoB,EAAK,CAGxC,SAAS,EACP,EACA,EACY,CACZ,GAAI,CAAC,EAAW,EAAW,EAAE,CAE3B,MAAO,CAAE,GAAG,EAAM,CAGpB,GAAI,CAAC,EAAW,EAAW,EAAE,CAAE,CAE7B,GAAM,EAAG,EAAU,IAAK,EAAU,GAAG,GAAc,EACnD,OAAO,EAKT,IAAM,EAAM,CAAE,GAAG,EAAM,CACvB,IAAK,IAAM,KAAQ,EAEjB,OAAO,EAAI,GAEb,OAAO"}

package/dist/omit-by-6UKJmELm.d.cts

@@ -1,52 +0,0 @@
-import { IsBoundedRecord } from "./is-bounded-record-kpsb1wQA.cjs";
-import { EnumerableStringKeyOf } from "./enumerable-string-key-of-D2OpyD6n.cjs";
-import { EnumerableStringKeyedValueOf } from "./enumerable-string-keyed-value-of-aov5dXss.cjs";
-import { IsNever, Or, Simplify } from "type-fest";
-
-//#region src/omit-by.d.ts
-type PickSymbolKeys<T extends object> = { -readonly [P in keyof T as P extends symbol ? P : never]: T[P] };
-type PartialEnumerableKeys<T extends object> = T extends unknown ? Simplify<IsBoundedRecord<T> extends true ? PickSymbolKeys<T> & { -readonly [P in keyof T as P extends symbol ? never : P]?: Required<T>[P] } : Record<EnumerableStringKeyOf<T>, EnumerableStringKeyedValueOf<T>>> : never;
-type PartialEnumerableKeysNarrowed<T extends object, S> = Simplify<ExactProps<T, S> & PartialProps<T, S> & PickSymbolKeys<T>>;
-type ExactProps<T, S> = { -readonly [P in keyof T as IsExactProp<T, P, S> extends true ? P : never]: Exclude<T[P], S> };
-type PartialProps<T, S> = { -readonly [P in keyof T as IsPartialProp<T, P, S> extends true ? P : never]?: Exclude<T[P], S> };
-type IsExactProp<T, P extends keyof T, S> = P extends symbol ? false : T[P] extends Exclude<T[P], S> ? S extends T[P] ? false : true : false;
-type IsPartialProp<T, P extends keyof T, S> = P extends symbol ? false : Or<IsExactProp<T, P, S>, IsNever<Exclude<Required<T>[P], S>>> extends true ? false : true;
-/**
- * Creates a shallow copy of the data, and then removes any keys that the
- * predicate rejects. Symbol keys are not passed to the predicate and would be
- * passed through to the output as-is.
- *
- * See `pickBy` for a complementary function which starts with an empty object
- * and adds the entries that the predicate accepts. Because it is additive,
- * symbol keys will not be passed through to the output object.
- *
- * @param data - The target object.
- * @param predicate - A function that takes the value, key, and the data itself
- * and returns `true` if the entry shouldn't be part of the output object, or
- * `false` to keep it. If the function is a type-guard on the value the output
- * type would be narrowed accordingly.
- * @returns A shallow copy of the input object with the rejected entries
- * removed.
- * @signature P.omitBy(data, predicate)
- * @example
- *    P.omitBy({a: 1, b: 2, A: 3, B: 4}, (val, key) => key.toUpperCase() === key) // => {a: 1, b: 2}
- * @dataFirst
- * @category Object
- */
-declare function omitBy<T extends object, S extends EnumerableStringKeyedValueOf<T>>(data: T, predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => value is S): PartialEnumerableKeysNarrowed<T, S>;
-declare function omitBy<T extends object>(data: T, predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => boolean): PartialEnumerableKeys<T>;
-/**
- * Returns a partial copy of an object omitting the keys matching predicate.
- *
- * @param predicate - The predicate.
- * @signature P.omitBy(fn)(object)
- * @example
- *    P.omitBy((val, key) => key.toUpperCase() === key)({a: 1, b: 2, A: 3, B: 4}) // => {a: 1, b: 2}
- * @dataLast
- * @category Object
- */
-declare function omitBy<T extends object, S extends EnumerableStringKeyedValueOf<T>>(predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => value is S): (data: T) => PartialEnumerableKeysNarrowed<T, S>;
-declare function omitBy<T extends object>(predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => boolean): (data: T) => PartialEnumerableKeys<T>;
-//#endregion
-export { omitBy };
-//# sourceMappingURL=omit-by-6UKJmELm.d.cts.map

package/dist/omit-by-6UKJmELm.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"omit-by-6UKJmELm.d.cts","names":[],"sources":["../src/omit-by.ts"],"sourcesContent":[],"mappings":";;;;;;KAUK,2DACmB,KAAK,mBAAmB,YAAY,EAAE,IARY;KAerE,qBARc,CAAA,UAAA,MAAA,CAAA,GAWf,CAXe,SAAA,OAAA,GAYb,QAZa,CAaX,eAbW,CAaK,CAbL,CAAA,SAAA,IAAA,GAauB,cAbvB,CAasC,CAbtC,CAAA,GAAA,kBACK,MAaQ,CAbR,IAaa,CAbb,SAAA,MAAA,GAAA,KAAA,GAeV,CAfU,IAeL,QAfK,CAeI,CAfJ,CAAA,CAeO,CAfP,CAAA,KAmBZ,MAnBiB,CAmBV,qBAnBU,CAmBY,CAnBZ,CAAA,EAmBgB,4BAnBhB,CAmB6C,CAnB7C,CAAA,CAAA,CAAA,GAAA,KAAA;KAiCxB,6BAjC2C,CAAA,UAAA,MAAA,EAAA,CAAA,CAAA,GAiCU,QAjCV,CAkC9C,UAlC8C,CAkCnC,CAlCmC,EAkChC,CAlCgC,CAAA,GAkC3B,YAlC2B,CAkCd,CAlCc,EAkCX,CAlCW,CAAA,GAkCN,cAlCM,CAkCS,CAlCT,CAAA,CAAA;KAsC3C,UAtCuD,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,kBAAE,MAuCtC,CAvCsC,IAuCjC,WAvCiC,CAuCrB,CAvCqB,EAuClB,CAvCkB,EAuCf,CAvCe,CAAA,SAAA,IAAA,GAwCxD,CAxCwD,GAAA,KAAA,GAyChD,OAzCgD,CAyCxC,CAzCwC,CAyCtC,CAzCsC,CAAA,EAyClC,CAzCkC,CAAA,EAAC;AAAA,KA8C1D,YAvCA,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,kBAAqB,MAwCF,CAxCE,IAwCG,aAxCH,CAwCiB,CAxCjB,EAwCoB,CAxCpB,EAwCuB,CAxCvB,CAAA,SAAA,IAAA,GAyCpB,CAzCoB,GAAA,KAAA,IA0CX,OA1CW,CA0CH,CA1CG,CA0CD,CA1CC,CAAA,EA0CG,CA1CH,CAAA;KAgDrB,WA3CmB,CAAA,CAAA,EAAA,UAAA,MA2CY,CA3CZ,EAAA,CAAA,CAAA,GA2CoB,CA3CpB,SAAA,MAAA,GAAA,KAAA,GA8CpB,CA9CoB,CA8ClB,CA9CkB,CAAA,SA8CP,OA9CO,CA8CC,CA9CD,CA8CG,CA9CH,CAAA,EA8CO,CA9CP,CAAA,GA+ClB,CA/CkB,SA+CR,CA/CQ,CA+CN,CA/CM,CAAA,GAAA,KAAA,GAAA,IAAA,GAAA,KAAA;KA6DnB,aA7DG,CAAA,CAAA,EAAA,UAAA,MA6D8B,CA7D9B,EAAA,CAAA,CAAA,GA6DsC,CA7DtC,SAAA,MAAA,GAAA,KAAA,GAgEJ,EAhEI,CAgED,WAhEC,CAgEW,CAhEX,EAgEc,CAhEd,EAgEiB,CAhEjB,CAAA,EAgEqB,OAhErB,CAgE6B,OAhE7B,CAgEqC,QAhErC,CAgE8C,CAhE9C,CAAA,CAgEiD,CAhEjD,CAAA,EAgEqD,CAhErD,CAAA,CAAA,CAAA,SAAA,IAAA,GAAA,KAAA,GAAA,IAAA;;;;;;;;;;;;;;;;AADM;;;;;;;AAuBO,iBAoEL,MApEK,CAAA,UAAA,MAAA,EAAA,UAsET,4BAtES,CAsEoB,CAtEpB,CAAA,CAAA,CAAA,IAAA,EAwEb,CAxEa,EAAA,SAAA,EAAA,CAAA,KAAA,EA0EV,4BA1EU,CA0EmB,CA1EnB,CAAA,EAAA,GAAA,EA2EZ,qBA3EY,CA2EU,CA3EV,CAAA,EAAA,IAAA,EA4EX,CA5EW,EAAA,GAAA,KAAA,IA6EL,CA7EK,CAAA,EA8ElB,6BA9EkB,CA8EY,CA9EZ,EA8Ee,CA9Ef,CAAA;AAAoC,iBA+EzC,MA/EyC,CAAA,UAAA,MAAA,CAAA,CAAA,IAAA,EAgFjD,CAhFiD,EAAA,SAAA,EAAA,CAAA,KAAA,EAkF9C,4BAlF8C,CAkFjB,CAlFiB,CAAA,EAAA,GAAA,EAmFhD,qBAnFgD,CAmF1B,CAnF0B,CAAA,EAAA,IAAA,EAoF/C,CApF+C,EAAA,GAAA,OAAA,CAAA,EAsFtD,qBAtFsD,CAsFhC,CAtFgC,CAAA;;;;AADS;;;;;;;AAO5D,iBA4FU,MA5FV,CAAA,UAAA,MAAA,EAAA,UA8FM,4BA9FN,CA8FmC,CA9FnC,CAAA,CAAA,CAAA,SAAA,EAAA,CAAA,KAAA,EAiGK,4BAjGL,CAiGkC,CAjGlC,CAAA,EAAA,GAAA,EAkGG,qBAlGH,CAkGyB,CAlGzB,CAAA,EAAA,IAAA,EAmGI,CAnGJ,EAAA,GAAA,KAAA,IAoGU,CApGV,CAAA,EAAA,CAAA,IAAA,EAqGI,CArGJ,EAAA,GAqGU,6BArGV,CAqGwC,CArGxC,EAqG2C,CArG3C,CAAA;AACgB,iBAqGN,MArGM,CAAA,UAAA,MAAA,CAAA,CAAA,SAAA,EAAA,CAAA,KAAA,EAuGX,4BAvGW,CAuGkB,CAvGlB,CAAA,EAAA,GAAA,EAwGb,qBAxGa,CAwGS,CAxGT,CAAA,EAAA,IAAA,EAyGZ,CAzGY,EAAA,GAAA,OAAA,CAAA,EAAA,CAAA,IAAA,EA2GZ,CA3GY,EAAA,GA2GN,qBA3GM,CA2GgB,CA3GhB,CAAA"}

package/dist/omit-by-BUnyJURX.js

@@ -1,2 +0,0 @@
-import{curry as e}from"./curry-CzZjDrpv.js";function t(...t){return e(n,t)}function n(e,t){let n={...e};for(let[r,i]of Object.entries(n))t(i,r,e)&&delete n[r];return n}export{t as omitBy};
-//# sourceMappingURL=omit-by-BUnyJURX.js.map

package/dist/omit-by-BUnyJURX.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"omit-by-BUnyJURX.js","names":["out: Partial<Record<string, unknown>>"],"sources":["../src/omit-by.ts"],"sourcesContent":["import type { IsNever, Or, Simplify } from 'type-fest';\nimport type { EnumerableStringKeyOf } from './internal/types/enumerable-string-key-of';\nimport type { EnumerableStringKeyedValueOf } from './internal/types/enumerable-string-keyed-value-of';\nimport type { IsBoundedRecord } from './internal/types/is-bounded-record';\nimport { curry } from './curry';\n\n// Symbols are not passed to the predicate (because they can't be enumerated\n// with the `Object.entries` function) and the output object is built from a\n// shallow copy of the input; meaning symbols would just be passed through as-\n// is.\ntype PickSymbolKeys<T extends object> = {\n  -readonly [P in keyof T as P extends symbol ? P : never]: T[P];\n};\n\n// When we don't use a type-predicate we can't say anything about what props\n// would be omitted from the output, so we need to assume any of them could be\n// filtered out. This means that we effectively make all (enumerable) keys\n// optional.\ntype PartialEnumerableKeys<T extends object>\n  // `extends unknown` is always going to be the case and is used to convert any\n  // union into a [distributive conditional type](https://www.typescriptlang.org/docs/handbook/release-notes/typescript-2-8.html#distributive-conditional-types).\n  = T extends unknown\n    ? Simplify<\n        IsBoundedRecord<T> extends true ? PickSymbolKeys<T> & {\n          -readonly [P in keyof T as P extends symbol\n            ? never\n            : P]?: Required<T>[P];\n        }\n          // This is the type you'd get from doing:\n          // `Object.fromEntries(Object.entries(x))`.\n          : Record<EnumerableStringKeyOf<T>, EnumerableStringKeyedValueOf<T>>\n      >\n    : never;\n\n// When the predicate is a type-guard we have more information to work with when\n// constructing the type of the output object. We can safely remove any property\n// which value would always be true for the predicate, AND we can also\n// assume that properties that are rejected by the predicate perfectly would\n// **always** show up in the output object. Hence to build the output object we\n// need to build and merge 2 output objects: One for the properties which have a\n// value of at type that would always yield a `false` result from the predicate,\n// these are the \"matches\", which would not change the \"optionality\" of the\n// input object's props, and one for partial matches which would also make the\n// props optional (as they could have a value that would be filtered out).\ntype PartialEnumerableKeysNarrowed<T extends object, S> = Simplify<\n  ExactProps<T, S> & PartialProps<T, S> & PickSymbolKeys<T>\n>;\n\n// The exact case, props here would always be part of the output object\ntype ExactProps<T, S> = {\n  -readonly [P in keyof T as IsExactProp<T, P, S> extends true\n    ? P\n    : never]: Exclude<T[P], S>;\n};\n\n// The partial case, props here might be part of the output object, but might\n// not be, hence they are optional.\ntype PartialProps<T, S> = {\n  -readonly [P in keyof T as IsPartialProp<T, P, S> extends true\n    ? P\n    : never]?: Exclude<T[P], S>;\n};\n\n// If the input object's value type extends itself when the type-guard is\n// excluded from it we can safely assume that the predicate would always return\n// `false` for any value of that property.\ntype IsExactProp<T, P extends keyof T, S> = P extends symbol\n  // Symbols are passed through via the PickSymbolKeys type\n  ? false\n  : T[P] extends Exclude<T[P], S>\n    ? S extends T[P]\n      // If S extends the T[P] it means the type the predicate is narrowing to\n      // can't narrow the rejected value any further, so we can't say what\n      // would happen for a concrete value in runtime (e.g. if T[P] is\n      // `number` and S is `1`: `Exclude<number, 1> === number`.\n      ? false\n      : true\n    : false;\n\n// ...and if the input object's value type isn't an exact match, but still has\n// some partial match (i.g. the extracted type-guard isn't completely disjoint)\n// then we can assume that the property can sometimes return true, and sometimes\n// false when passed to the predicate, hence it should be optional in the\n// output.\ntype IsPartialProp<T, P extends keyof T, S> = P extends symbol\n  // Symbols are passed through via the PickSymbolKeys type\n  ? false\n  : Or<IsExactProp<T, P, S>, IsNever<Exclude<Required<T>[P], S>>> extends true\n    ? false\n    : true;\n\n/**\n * Creates a shallow copy of the data, and then removes any keys that the\n * predicate rejects. Symbol keys are not passed to the predicate and would be\n * passed through to the output as-is.\n *\n * See `pickBy` for a complementary function which starts with an empty object\n * and adds the entries that the predicate accepts. Because it is additive,\n * symbol keys will not be passed through to the output object.\n *\n * @param data - The target object.\n * @param predicate - A function that takes the value, key, and the data itself\n * and returns `true` if the entry shouldn't be part of the output object, or\n * `false` to keep it. If the function is a type-guard on the value the output\n * type would be narrowed accordingly.\n * @returns A shallow copy of the input object with the rejected entries\n * removed.\n * @signature P.omitBy(data, predicate)\n * @example\n *    P.omitBy({a: 1, b: 2, A: 3, B: 4}, (val, key) => key.toUpperCase() === key) // => {a: 1, b: 2}\n * @dataFirst\n * @category Object\n */\nexport function omitBy<\n  T extends object,\n  S extends EnumerableStringKeyedValueOf<T>,\n>(\n  data: T,\n  predicate: (\n    value: EnumerableStringKeyedValueOf<T>,\n    key: EnumerableStringKeyOf<T>,\n    data: T,\n  ) => value is S,\n): PartialEnumerableKeysNarrowed<T, S>;\nexport function omitBy<T extends object>(\n  data: T,\n  predicate: (\n    value: EnumerableStringKeyedValueOf<T>,\n    key: EnumerableStringKeyOf<T>,\n    data: T,\n  ) => boolean,\n): PartialEnumerableKeys<T>;\n\n/**\n * Returns a partial copy of an object omitting the keys matching predicate.\n *\n * @param predicate - The predicate.\n * @signature P.omitBy(fn)(object)\n * @example\n *    P.omitBy((val, key) => key.toUpperCase() === key)({a: 1, b: 2, A: 3, B: 4}) // => {a: 1, b: 2}\n * @dataLast\n * @category Object\n */\nexport function omitBy<\n  T extends object,\n  S extends EnumerableStringKeyedValueOf<T>,\n>(\n  predicate: (\n    value: EnumerableStringKeyedValueOf<T>,\n    key: EnumerableStringKeyOf<T>,\n    data: T,\n  ) => value is S,\n): (data: T) => PartialEnumerableKeysNarrowed<T, S>;\nexport function omitBy<T extends object>(\n  predicate: (\n    value: EnumerableStringKeyedValueOf<T>,\n    key: EnumerableStringKeyOf<T>,\n    data: T,\n  ) => boolean,\n): (data: T) => PartialEnumerableKeys<T>;\n\nexport function omitBy(...args: ReadonlyArray<unknown>): unknown {\n  return curry(omitByImplementation, args);\n}\n\nfunction omitByImplementation<T extends object>(\n  data: T,\n  predicate: (value: unknown, key: string, data: T) => boolean,\n): Record<string, unknown> {\n  const out: Partial<Record<string, unknown>> = { ...data };\n\n  for (const [key, value] of Object.entries(out)) {\n    if (predicate(value, key, data)) {\n      // eslint-disable-next-line ts/no-dynamic-delete -- This is the best way to do it!\n      delete out[key];\n    }\n  }\n\n  return out;\n}\n"],"mappings":"4CAiKA,SAAgB,EAAO,GAAG,EAAuC,CAC/D,OAAO,EAAM,EAAsB,EAAK,CAG1C,SAAS,EACP,EACA,EACyB,CACzB,IAAMA,EAAwC,CAAE,GAAG,EAAM,CAEzD,IAAK,GAAM,CAAC,EAAK,KAAU,OAAO,QAAQ,EAAI,CACxC,EAAU,EAAO,EAAK,EAAK,EAE7B,OAAO,EAAI,GAIf,OAAO"}

package/dist/omit-by-BwOILpho.d.ts

@@ -1,52 +0,0 @@
-import { IsBoundedRecord } from "./is-bounded-record-DCEYRY41.js";
-import { EnumerableStringKeyOf } from "./enumerable-string-key-of-DKzYIarp.js";
-import { EnumerableStringKeyedValueOf } from "./enumerable-string-keyed-value-of-Bf_owt8O.js";
-import { IsNever, Or, Simplify } from "type-fest";
-
-//#region src/omit-by.d.ts
-type PickSymbolKeys<T extends object> = { -readonly [P in keyof T as P extends symbol ? P : never]: T[P] };
-type PartialEnumerableKeys<T extends object> = T extends unknown ? Simplify<IsBoundedRecord<T> extends true ? PickSymbolKeys<T> & { -readonly [P in keyof T as P extends symbol ? never : P]?: Required<T>[P] } : Record<EnumerableStringKeyOf<T>, EnumerableStringKeyedValueOf<T>>> : never;
-type PartialEnumerableKeysNarrowed<T extends object, S> = Simplify<ExactProps<T, S> & PartialProps<T, S> & PickSymbolKeys<T>>;
-type ExactProps<T, S> = { -readonly [P in keyof T as IsExactProp<T, P, S> extends true ? P : never]: Exclude<T[P], S> };
-type PartialProps<T, S> = { -readonly [P in keyof T as IsPartialProp<T, P, S> extends true ? P : never]?: Exclude<T[P], S> };
-type IsExactProp<T, P extends keyof T, S> = P extends symbol ? false : T[P] extends Exclude<T[P], S> ? S extends T[P] ? false : true : false;
-type IsPartialProp<T, P extends keyof T, S> = P extends symbol ? false : Or<IsExactProp<T, P, S>, IsNever<Exclude<Required<T>[P], S>>> extends true ? false : true;
-/**
- * Creates a shallow copy of the data, and then removes any keys that the
- * predicate rejects. Symbol keys are not passed to the predicate and would be
- * passed through to the output as-is.
- *
- * See `pickBy` for a complementary function which starts with an empty object
- * and adds the entries that the predicate accepts. Because it is additive,
- * symbol keys will not be passed through to the output object.
- *
- * @param data - The target object.
- * @param predicate - A function that takes the value, key, and the data itself
- * and returns `true` if the entry shouldn't be part of the output object, or
- * `false` to keep it. If the function is a type-guard on the value the output
- * type would be narrowed accordingly.
- * @returns A shallow copy of the input object with the rejected entries
- * removed.
- * @signature P.omitBy(data, predicate)
- * @example
- *    P.omitBy({a: 1, b: 2, A: 3, B: 4}, (val, key) => key.toUpperCase() === key) // => {a: 1, b: 2}
- * @dataFirst
- * @category Object
- */
-declare function omitBy<T extends object, S extends EnumerableStringKeyedValueOf<T>>(data: T, predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => value is S): PartialEnumerableKeysNarrowed<T, S>;
-declare function omitBy<T extends object>(data: T, predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => boolean): PartialEnumerableKeys<T>;
-/**
- * Returns a partial copy of an object omitting the keys matching predicate.
- *
- * @param predicate - The predicate.
- * @signature P.omitBy(fn)(object)
- * @example
- *    P.omitBy((val, key) => key.toUpperCase() === key)({a: 1, b: 2, A: 3, B: 4}) // => {a: 1, b: 2}
- * @dataLast
- * @category Object
- */
-declare function omitBy<T extends object, S extends EnumerableStringKeyedValueOf<T>>(predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => value is S): (data: T) => PartialEnumerableKeysNarrowed<T, S>;
-declare function omitBy<T extends object>(predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => boolean): (data: T) => PartialEnumerableKeys<T>;
-//#endregion
-export { omitBy };
-//# sourceMappingURL=omit-by-BwOILpho.d.ts.map

package/dist/omit-by-BwOILpho.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"omit-by-BwOILpho.d.ts","names":[],"sources":["../src/omit-by.ts"],"sourcesContent":[],"mappings":";;;;;;KAUK,2DACmB,KAAK,mBAAmB,YAAY,EAAE,IARY;KAerE,qBARc,CAAA,UAAA,MAAA,CAAA,GAWf,CAXe,SAAA,OAAA,GAYb,QAZa,CAaX,eAbW,CAaK,CAbL,CAAA,SAAA,IAAA,GAauB,cAbvB,CAasC,CAbtC,CAAA,GAAA,kBACK,MAaQ,CAbR,IAaa,CAbb,SAAA,MAAA,GAAA,KAAA,GAeV,CAfU,IAeL,QAfK,CAeI,CAfJ,CAAA,CAeO,CAfP,CAAA,KAmBZ,MAnBiB,CAmBV,qBAnBU,CAmBY,CAnBZ,CAAA,EAmBgB,4BAnBhB,CAmB6C,CAnB7C,CAAA,CAAA,CAAA,GAAA,KAAA;KAiCxB,6BAjC2C,CAAA,UAAA,MAAA,EAAA,CAAA,CAAA,GAiCU,QAjCV,CAkC9C,UAlC8C,CAkCnC,CAlCmC,EAkChC,CAlCgC,CAAA,GAkC3B,YAlC2B,CAkCd,CAlCc,EAkCX,CAlCW,CAAA,GAkCN,cAlCM,CAkCS,CAlCT,CAAA,CAAA;KAsC3C,UAtCuD,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,kBAAE,MAuCtC,CAvCsC,IAuCjC,WAvCiC,CAuCrB,CAvCqB,EAuClB,CAvCkB,EAuCf,CAvCe,CAAA,SAAA,IAAA,GAwCxD,CAxCwD,GAAA,KAAA,GAyChD,OAzCgD,CAyCxC,CAzCwC,CAyCtC,CAzCsC,CAAA,EAyClC,CAzCkC,CAAA,EAAC;AAAA,KA8C1D,YAvCA,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,kBAAqB,MAwCF,CAxCE,IAwCG,aAxCH,CAwCiB,CAxCjB,EAwCoB,CAxCpB,EAwCuB,CAxCvB,CAAA,SAAA,IAAA,GAyCpB,CAzCoB,GAAA,KAAA,IA0CX,OA1CW,CA0CH,CA1CG,CA0CD,CA1CC,CAAA,EA0CG,CA1CH,CAAA;KAgDrB,WA3CmB,CAAA,CAAA,EAAA,UAAA,MA2CY,CA3CZ,EAAA,CAAA,CAAA,GA2CoB,CA3CpB,SAAA,MAAA,GAAA,KAAA,GA8CpB,CA9CoB,CA8ClB,CA9CkB,CAAA,SA8CP,OA9CO,CA8CC,CA9CD,CA8CG,CA9CH,CAAA,EA8CO,CA9CP,CAAA,GA+ClB,CA/CkB,SA+CR,CA/CQ,CA+CN,CA/CM,CAAA,GAAA,KAAA,GAAA,IAAA,GAAA,KAAA;KA6DnB,aA7DG,CAAA,CAAA,EAAA,UAAA,MA6D8B,CA7D9B,EAAA,CAAA,CAAA,GA6DsC,CA7DtC,SAAA,MAAA,GAAA,KAAA,GAgEJ,EAhEI,CAgED,WAhEC,CAgEW,CAhEX,EAgEc,CAhEd,EAgEiB,CAhEjB,CAAA,EAgEqB,OAhErB,CAgE6B,OAhE7B,CAgEqC,QAhErC,CAgE8C,CAhE9C,CAAA,CAgEiD,CAhEjD,CAAA,EAgEqD,CAhErD,CAAA,CAAA,CAAA,SAAA,IAAA,GAAA,KAAA,GAAA,IAAA;;;;;;;;;;;;;;;;AADM;;;;;;;AAuBO,iBAoEL,MApEK,CAAA,UAAA,MAAA,EAAA,UAsET,4BAtES,CAsEoB,CAtEpB,CAAA,CAAA,CAAA,IAAA,EAwEb,CAxEa,EAAA,SAAA,EAAA,CAAA,KAAA,EA0EV,4BA1EU,CA0EmB,CA1EnB,CAAA,EAAA,GAAA,EA2EZ,qBA3EY,CA2EU,CA3EV,CAAA,EAAA,IAAA,EA4EX,CA5EW,EAAA,GAAA,KAAA,IA6EL,CA7EK,CAAA,EA8ElB,6BA9EkB,CA8EY,CA9EZ,EA8Ee,CA9Ef,CAAA;AAAoC,iBA+EzC,MA/EyC,CAAA,UAAA,MAAA,CAAA,CAAA,IAAA,EAgFjD,CAhFiD,EAAA,SAAA,EAAA,CAAA,KAAA,EAkF9C,4BAlF8C,CAkFjB,CAlFiB,CAAA,EAAA,GAAA,EAmFhD,qBAnFgD,CAmF1B,CAnF0B,CAAA,EAAA,IAAA,EAoF/C,CApF+C,EAAA,GAAA,OAAA,CAAA,EAsFtD,qBAtFsD,CAsFhC,CAtFgC,CAAA;;;;AADS;;;;;;;AAO5D,iBA4FU,MA5FV,CAAA,UAAA,MAAA,EAAA,UA8FM,4BA9FN,CA8FmC,CA9FnC,CAAA,CAAA,CAAA,SAAA,EAAA,CAAA,KAAA,EAiGK,4BAjGL,CAiGkC,CAjGlC,CAAA,EAAA,GAAA,EAkGG,qBAlGH,CAkGyB,CAlGzB,CAAA,EAAA,IAAA,EAmGI,CAnGJ,EAAA,GAAA,KAAA,IAoGU,CApGV,CAAA,EAAA,CAAA,IAAA,EAqGI,CArGJ,EAAA,GAqGU,6BArGV,CAqGwC,CArGxC,EAqG2C,CArG3C,CAAA;AACgB,iBAqGN,MArGM,CAAA,UAAA,MAAA,CAAA,CAAA,SAAA,EAAA,CAAA,KAAA,EAuGX,4BAvGW,CAuGkB,CAvGlB,CAAA,EAAA,GAAA,EAwGb,qBAxGa,CAwGS,CAxGT,CAAA,EAAA,IAAA,EAyGZ,CAzGY,EAAA,GAAA,OAAA,CAAA,EAAA,CAAA,IAAA,EA2GZ,CA3GY,EAAA,GA2GN,qBA3GM,CA2GgB,CA3GhB,CAAA"}

package/dist/once-CDA15oHo.js

@@ -1,2 +0,0 @@
-function e(e){let t=!1,n;return()=>(t||=(n=e(),!0),n)}export{e as once};
-//# sourceMappingURL=once-CDA15oHo.js.map

package/dist/once-CDA15oHo.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"once-CDA15oHo.js","names":["ret: T"],"sources":["../src/once.ts"],"sourcesContent":["/**\n * Creates a function that is restricted to invoking `func` once. Repeat calls to the function return the value of the first invocation.\n *\n * @param fn - The function to wrap.\n * @signature P.once(fn)\n * @example\n * const initialize = P.once(createApplication);\n * initialize();\n * initialize();\n * // => `createApplication` is invoked once\n * @category Function\n */\nexport function once<T>(fn: () => T): () => T {\n  let called = false;\n  let ret: T;\n  return () => {\n    if (!called) {\n      ret = fn();\n      called = true;\n    }\n    return ret;\n  };\n}\n"],"mappings":"AAYA,SAAgB,EAAQ,EAAsB,CAC5C,IAAI,EAAS,GACTA,EACJ,WACE,AAEE,KADA,EAAM,GAAI,CACD,IAEJ"}

package/dist/once-CKjmehD8.d.cts

@@ -1,17 +0,0 @@
-//#region src/once.d.ts
-/**
- * Creates a function that is restricted to invoking `func` once. Repeat calls to the function return the value of the first invocation.
- *
- * @param fn - The function to wrap.
- * @signature P.once(fn)
- * @example
- * const initialize = P.once(createApplication);
- * initialize();
- * initialize();
- * // => `createApplication` is invoked once
- * @category Function
- */
-declare function once<T>(fn: () => T): () => T;
-//#endregion
-export { once };
-//# sourceMappingURL=once-CKjmehD8.d.cts.map

package/dist/once-CKjmehD8.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"once-CKjmehD8.d.cts","names":[],"sources":["../src/once.ts"],"sourcesContent":[],"mappings":";;AAYA;;;;;;;;;;;iBAAgB,kBAAkB,UAAU"}