@vinicunca/perkakas 1.7.1 → 1.9.0

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

@@ -0,0 +1,15 @@
+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-BLLrlAhb.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"narrowed-to-BLLrlAhb.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/narrowed-to-BTrqm7Xt.d.cts

@@ -0,0 +1,15 @@
+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-BTrqm7Xt.d.cts.map

package/dist/narrowed-to-BTrqm7Xt.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"narrowed-to-BTrqm7Xt.d.cts","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/no-infer-CFhWzPzc.d.cts

@@ -0,0 +1,5 @@
+//#region src/internal/types/no-infer.d.ts
+type NoInfer<T> = T extends infer U ? U : never;
+//#endregion
+export { NoInfer };
+//# sourceMappingURL=no-infer-CFhWzPzc.d.cts.map

package/dist/no-infer-CFhWzPzc.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"no-infer-CFhWzPzc.d.cts","names":[],"sources":["../src/internal/types/no-infer.ts"],"sourcesContent":[],"mappings":";KACY,aAAa,oBAAoB"}

package/dist/no-infer-DmkBZblw.d.ts

@@ -0,0 +1,5 @@
+//#region src/internal/types/no-infer.d.ts
+type NoInfer<T> = T extends infer U ? U : never;
+//#endregion
+export { NoInfer };
+//# sourceMappingURL=no-infer-DmkBZblw.d.ts.map

package/dist/no-infer-DmkBZblw.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"no-infer-DmkBZblw.d.ts","names":[],"sources":["../src/internal/types/no-infer.ts"],"sourcesContent":[],"mappings":";KACY,aAAa,oBAAoB"}

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

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

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

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

package/dist/non-empty-array-D3ZRHApS.d.cts

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

package/dist/non-empty-array-D3ZRHApS.d.cts.map

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

package/dist/nth-by-BZiAVAjT.cjs

@@ -0,0 +1 @@
+const e=require(`./curry-order-rules-UcuuWkKd.cjs`),t=require(`./swap-in-place-CJrU2n1_.cjs`);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.swapInPlace(e,o,s),o+=1);return t.swapInPlace(e,o,r),o}function a(...t){return e.curryOrderRulesWithArgument(o,t)}function o(e,t,r){return n(e,r>=0?r:e.length+r,t)}Object.defineProperty(exports,`nthBy`,{enumerable:!0,get:function(){return a}});

package/dist/nth-by-CK-aOfcg.d.cts

@@ -0,0 +1,42 @@
+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-CK-aOfcg.d.cts.map

package/dist/nth-by-CK-aOfcg.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"nth-by-CK-aOfcg.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-CebpSYpY.d.ts

@@ -0,0 +1,42 @@
+import { IterableContainer } from "./iterable-container-F9CDF7ym.js";
+import { NonEmptyArray } from "./non-empty-array-BfTfvDYg.js";
+import { OrderRule } from "./curry-order-rules-D2zI7gpB.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-CebpSYpY.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"nth-by-CebpSYpY.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/nth-by-Ol9Thsua.js

@@ -0,0 +1,2 @@
+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-Ol9Thsua.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"nth-by-Ol9Thsua.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.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkTWCEO47Xcjs = require('./chunk-TWCEO47X.cjs');require('./chunk-Z6OOXW67.cjs');require('./chunk-EROXO3T4.cjs');require('./chunk-MBGSSEZN.cjs');exports.nthBy = _chunkTWCEO47Xcjs.a;
+require(`./curry-order-rules-UcuuWkKd.cjs`),require(`./swap-in-place-CJrU2n1_.cjs`);const e=require(`./nth-by-BZiAVAjT.cjs`);exports.nthBy=e.nthBy;

package/dist/nth-by.d.cts

@@ -1,39 +1,5 @@
-import { O as OrderRule } from './curry-order-rules-BKXCPBNx.cjs';
-import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
-import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.cjs';
-
-/**
- * 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;
-
-export { nthBy };
+import "./iterable-container-V5sa0V_H.cjs";
+import "./non-empty-array-D3ZRHApS.cjs";
+import "./curry-order-rules-1zjlAgqa.cjs";
+import { nthBy } from "./nth-by-CK-aOfcg.cjs";
+export { nthBy };

package/dist/nth-by.d.ts

@@ -1,39 +1,5 @@
-import { O as OrderRule } from './curry-order-rules-BKXCPBNx.js';
-import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
-import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.js';
-
-/**
- * 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;
-
-export { nthBy };
+import "./iterable-container-F9CDF7ym.js";
+import "./non-empty-array-BfTfvDYg.js";
+import "./curry-order-rules-D2zI7gpB.js";
+import { nthBy } from "./nth-by-CebpSYpY.js";
+export { nthBy };

package/dist/nth-by.js

@@ -1 +1 @@
-import{a}from"./chunk-BKBHW2XJ.js";import"./chunk-YYEJOSR3.js";import"./chunk-7KBK2RWQ.js";import"./chunk-EK7ODJWE.js";export{a as nthBy};
+import"./curry-order-rules-BuA7D1F4.js";import"./swap-in-place-BBqaxzzG.js";import{nthBy as e}from"./nth-by-Ol9Thsua.js";export{e as nthBy};

package/dist/obj-of-BHle5r-f.js

@@ -0,0 +1,2 @@
+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-BHle5r-f.js.map

package/dist/obj-of-BHle5r-f.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"obj-of-BHle5r-f.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-CWMITxro.d.cts

@@ -0,0 +1,27 @@
+//#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-CWMITxro.d.cts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"obj-of-CWMITxro.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/obj-of-D8oOjocO.d.ts

@@ -0,0 +1,27 @@
+//#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-D8oOjocO.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"obj-of-D8oOjocO.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-UU0PjTXp.cjs

@@ -0,0 +1 @@
+const e=require(`./curry-BPVIsvo3.cjs`);function t(...t){return e.curry(n,t)}function n(e,t){return{[t]:e}}Object.defineProperty(exports,`objOf`,{enumerable:!0,get:function(){return t}});

package/dist/obj-of.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk5XH2VMVFcjs = require('./chunk-5XH2VMVF.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');require('./chunk-MBGSSEZN.cjs');exports.objOf = _chunk5XH2VMVFcjs.a;
+require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`);const e=require(`./obj-of-UU0PjTXp.cjs`);exports.objOf=e.objOf;

package/dist/obj-of.d.cts

@@ -1,29 +1,2 @@
-/**
- * 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;
-};
-
-export { objOf };
+import { objOf } from "./obj-of-CWMITxro.cjs";
+export { objOf };

package/dist/obj-of.d.ts

@@ -1,29 +1,2 @@
-/**
- * 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;
-};
-
-export { objOf };
+import { objOf } from "./obj-of-D8oOjocO.js";
+export { objOf };

package/dist/obj-of.js

@@ -1 +1 @@
-import{a}from"./chunk-YHDBKFF6.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";import"./chunk-EK7ODJWE.js";export{a as objOf};
+import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import{objOf as e}from"./obj-of-BHle5r-f.js";export{e as objOf};

package/dist/omit-CbVbZe6B.js

@@ -0,0 +1,2 @@
+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-CbVbZe6B.js.map

package/dist/omit-CbVbZe6B.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"omit-CbVbZe6B.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-DJ4Q7wfp.d.cts

@@ -0,0 +1,29 @@
+//#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-DJ4Q7wfp.d.cts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"omit-DJ4Q7wfp.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-DY21j6I-.d.ts

@@ -0,0 +1,29 @@
+//#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-DY21j6I-.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"omit-DY21j6I-.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-Ljg-nRSD.cjs

@@ -0,0 +1 @@
+const e=require(`./curry-BPVIsvo3.cjs`),t=require(`./has-at-least-D-ahiJB6.cjs`);function n(...t){return e.curry(r,t)}function r(e,n){if(!t.hasAtLeast(n,1))return{...e};if(!t.hasAtLeast(n,2)){let{[n[0]]:t,...r}=e;return r}let r={...e};for(let e of n)delete r[e];return r}Object.defineProperty(exports,`omit`,{enumerable:!0,get:function(){return n}});

package/dist/omit-by-DO-qeqAW.cjs

@@ -0,0 +1 @@
+const e=require(`./curry-BPVIsvo3.cjs`);function t(...t){return e.curry(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}Object.defineProperty(exports,`omitBy`,{enumerable:!0,get:function(){return t}});

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

@@ -0,0 +1,52 @@
+import { IsBoundedRecord } from "./is-bounded-record-DEQ2a3_Y.js";
+import { EnumerableStringKeyOf } from "./enumerable-string-key-of-nnI9DYHk.js";
+import { EnumerableStringKeyedValueOf } from "./enumerable-string-keyed-value-of-D0kMm_yz.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-DTipg3uJ.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"omit-by-DTipg3uJ.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"}