@vinicunca/perkakas 1.8.0 → 1.12.0

package/dist/sorted-index-with-CGyMmjPN.d.ts

@@ -1,72 +0,0 @@
-//#region src/sorted-index-with.d.ts
-/**
- * Performs a **binary search** for the index of the item at which the predicate
- * stops returning `true`. This function assumes that the array is "sorted" in
- * regards to the predicate, meaning that running the predicate as a mapper on
- * it would result in an array `[...true[], ...false[]]`.
- * This stricter requirement from the predicate provides us 2 benefits over
- * `findIndex` which does a similar thing:
- * 1. It would run at O(logN) time instead of O(N) time.
- * 2. It always returns a value (it would return `data.length` if the
- * predicate returns `true` for all items).
- *
- * This function is the basis for all other sortedIndex functions which search
- * for a specific item in a sorted array, and it could be used to perform
- * similar efficient searches.
- * `sortedIndex` - scans a sorted array with a binary search, find the first suitable index.
- * `sortedIndexBy` - like `sortedIndex`, but assumes sorting is based on a callbackfn.
- * `sortedLastIndex` - scans a sorted array with a binary search, finding the last suitable index.
- * `sortedLastIndexBy` - like `sortedLastIndex`, but assumes sorting is based on a callbackfn.
- *
- * See also:
- * `findIndex` - scans a possibly unsorted array in-order (linear search).
- * `rankBy` - scans a possibly unsorted array in-order, returning the index based on a sorting criteria.
- *
- * @param data - Array, "sorted" by `predicate`.
- * @param predicate - A predicate which also defines the array's order.
- * @returns Index (In the range 0..data.length).
- * @signature
- *    P.sortedIndexWith(data, predicate)
- * @example
- *    P.sortedIndexWith(['a','ab','abc'], (item) => item.length < 2) // => 1
- * @dataFirst
- * @category Array
- * @see findIndex, sortedIndex, sortedIndexBy, sortedLastIndex, sortedLastIndexBy
- */
-declare function sortedIndexWith<T>(data: ReadonlyArray<T>, predicate: (value: T, index: number, data: ReadonlyArray<T>) => boolean): number;
-/**
- * Performs a **binary search** for the index of the item at which the predicate
- * stops returning `true`. This function assumes that the array is "sorted" in
- * regards to the predicate, meaning that running the predicate as a mapper on
- * it would result in an array `[...true[], ...false[]]`.
- * This stricter requirement from the predicate provides us 2 benefits over
- * `findIndex` which does a similar thing:
- * 1. It would run at O(logN) time instead of O(N) time.
- * 2. It always returns a value (it would return `data.length` if the
- * predicate returns `true` for all items).
- *
- * This function is the basis for all other sortedIndex functions which search
- * for a specific item in a sorted array, and it could be used to perform
- * similar efficient searches.
- * `sortedIndex` - scans a sorted array with a binary search, find the first suitable index.
- * `sortedIndexBy` - like `sortedIndex`, but assumes sorting is based on a callbackfn.
- * `sortedLastIndex` - scans a sorted array with a binary search, finding the last suitable index.
- * `sortedLastIndexBy` - like `sortedLastIndex`, but assumes sorting is based on a callbackfn.
- *
- * See also:
- * `findIndex` - scans a possibly unsorted array in-order (linear search).
- * `rankBy` - scans a possibly unsorted array in-order, returning the index based on a sorting criteria.
- *
- * @param predicate - A predicate which also defines the array's order.
- * @returns Index (In the range 0..data.length).
- * @signature
- *    P.sortedIndexWith(predicate)(data)
- * @example
- *    P.pipe(['a','ab','abc'], P.sortedIndexWith((item) => item.length < 2)) // => 1
- * @dataLast
- * @category Array
- */
-declare function sortedIndexWith<T>(predicate: (value: T, index: number, data: ReadonlyArray<T>) => boolean): (data: ReadonlyArray<T>) => number;
-//#endregion
-export { sortedIndexWith };
-//# sourceMappingURL=sorted-index-with-CGyMmjPN.d.ts.map

package/dist/sorted-index-with-CGyMmjPN.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-index-with-CGyMmjPN.d.ts","names":[],"sources":["../src/sorted-index-with.ts"],"sourcesContent":[],"mappings":";;AAqCA;;;;;;;;AAqCA;;;;;;;;;;;;;;;;;;;;;;;;;iBArCgB,yBACR,cAAc,uBACD,wBAAwB,cAAc;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBAmC3C,sCACK,wBAAwB,cAAc,wBACjD,cAAc"}

package/dist/sorted-index-with-Cy9W9sdh.d.cts

@@ -1,72 +0,0 @@
-//#region src/sorted-index-with.d.ts
-/**
- * Performs a **binary search** for the index of the item at which the predicate
- * stops returning `true`. This function assumes that the array is "sorted" in
- * regards to the predicate, meaning that running the predicate as a mapper on
- * it would result in an array `[...true[], ...false[]]`.
- * This stricter requirement from the predicate provides us 2 benefits over
- * `findIndex` which does a similar thing:
- * 1. It would run at O(logN) time instead of O(N) time.
- * 2. It always returns a value (it would return `data.length` if the
- * predicate returns `true` for all items).
- *
- * This function is the basis for all other sortedIndex functions which search
- * for a specific item in a sorted array, and it could be used to perform
- * similar efficient searches.
- * `sortedIndex` - scans a sorted array with a binary search, find the first suitable index.
- * `sortedIndexBy` - like `sortedIndex`, but assumes sorting is based on a callbackfn.
- * `sortedLastIndex` - scans a sorted array with a binary search, finding the last suitable index.
- * `sortedLastIndexBy` - like `sortedLastIndex`, but assumes sorting is based on a callbackfn.
- *
- * See also:
- * `findIndex` - scans a possibly unsorted array in-order (linear search).
- * `rankBy` - scans a possibly unsorted array in-order, returning the index based on a sorting criteria.
- *
- * @param data - Array, "sorted" by `predicate`.
- * @param predicate - A predicate which also defines the array's order.
- * @returns Index (In the range 0..data.length).
- * @signature
- *    P.sortedIndexWith(data, predicate)
- * @example
- *    P.sortedIndexWith(['a','ab','abc'], (item) => item.length < 2) // => 1
- * @dataFirst
- * @category Array
- * @see findIndex, sortedIndex, sortedIndexBy, sortedLastIndex, sortedLastIndexBy
- */
-declare function sortedIndexWith<T>(data: ReadonlyArray<T>, predicate: (value: T, index: number, data: ReadonlyArray<T>) => boolean): number;
-/**
- * Performs a **binary search** for the index of the item at which the predicate
- * stops returning `true`. This function assumes that the array is "sorted" in
- * regards to the predicate, meaning that running the predicate as a mapper on
- * it would result in an array `[...true[], ...false[]]`.
- * This stricter requirement from the predicate provides us 2 benefits over
- * `findIndex` which does a similar thing:
- * 1. It would run at O(logN) time instead of O(N) time.
- * 2. It always returns a value (it would return `data.length` if the
- * predicate returns `true` for all items).
- *
- * This function is the basis for all other sortedIndex functions which search
- * for a specific item in a sorted array, and it could be used to perform
- * similar efficient searches.
- * `sortedIndex` - scans a sorted array with a binary search, find the first suitable index.
- * `sortedIndexBy` - like `sortedIndex`, but assumes sorting is based on a callbackfn.
- * `sortedLastIndex` - scans a sorted array with a binary search, finding the last suitable index.
- * `sortedLastIndexBy` - like `sortedLastIndex`, but assumes sorting is based on a callbackfn.
- *
- * See also:
- * `findIndex` - scans a possibly unsorted array in-order (linear search).
- * `rankBy` - scans a possibly unsorted array in-order, returning the index based on a sorting criteria.
- *
- * @param predicate - A predicate which also defines the array's order.
- * @returns Index (In the range 0..data.length).
- * @signature
- *    P.sortedIndexWith(predicate)(data)
- * @example
- *    P.pipe(['a','ab','abc'], P.sortedIndexWith((item) => item.length < 2)) // => 1
- * @dataLast
- * @category Array
- */
-declare function sortedIndexWith<T>(predicate: (value: T, index: number, data: ReadonlyArray<T>) => boolean): (data: ReadonlyArray<T>) => number;
-//#endregion
-export { sortedIndexWith };
-//# sourceMappingURL=sorted-index-with-Cy9W9sdh.d.cts.map

package/dist/sorted-index-with-Cy9W9sdh.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-index-with-Cy9W9sdh.d.cts","names":[],"sources":["../src/sorted-index-with.ts"],"sourcesContent":[],"mappings":";;AAqCA;;;;;;;;AAqCA;;;;;;;;;;;;;;;;;;;;;;;;;iBArCgB,yBACR,cAAc,uBACD,wBAAwB,cAAc;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBAmC3C,sCACK,wBAAwB,cAAc,wBACjD,cAAc"}

package/dist/sorted-index-with-D5BcwSL_.cjs

@@ -1 +0,0 @@
-const e=require(`./curry-BPVIsvo3.cjs`),t=require(`./binary-search-cutoff-index-B3xuP0oe.cjs`);function n(...n){return e.curry(t.binarySearchCutoffIndex,n)}Object.defineProperty(exports,`sortedIndexWith`,{enumerable:!0,get:function(){return n}});

package/dist/sorted-index-with-kTK8prmw.js

@@ -1,2 +0,0 @@
-import{curry as e}from"./curry-CzZjDrpv.js";import{binarySearchCutoffIndex as t}from"./binary-search-cutoff-index-QhLfC_4-.js";function n(...n){return e(t,n)}export{n as sortedIndexWith};
-//# sourceMappingURL=sorted-index-with-kTK8prmw.js.map

package/dist/sorted-index-with-kTK8prmw.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-index-with-kTK8prmw.js","names":[],"sources":["../src/sorted-index-with.ts"],"sourcesContent":["import { curry } from './curry';\nimport { binarySearchCutoffIndex } from './internal/binary-search-cutoff-index';\n\n/**\n * Performs a **binary search** for the index of the item at which the predicate\n * stops returning `true`. This function assumes that the array is \"sorted\" in\n * regards to the predicate, meaning that running the predicate as a mapper on\n * it would result in an array `[...true[], ...false[]]`.\n * This stricter requirement from the predicate provides us 2 benefits over\n * `findIndex` which does a similar thing:\n * 1. It would run at O(logN) time instead of O(N) time.\n * 2. It always returns a value (it would return `data.length` if the\n * predicate returns `true` for all items).\n *\n * This function is the basis for all other sortedIndex functions which search\n * for a specific item in a sorted array, and it could be used to perform\n * similar efficient searches.\n * `sortedIndex` - scans a sorted array with a binary search, find the first suitable index.\n * `sortedIndexBy` - like `sortedIndex`, but assumes sorting is based on a callbackfn.\n * `sortedLastIndex` - scans a sorted array with a binary search, finding the last suitable index.\n * `sortedLastIndexBy` - like `sortedLastIndex`, but assumes sorting is based on a callbackfn.\n *\n * See also:\n * `findIndex` - scans a possibly unsorted array in-order (linear search).\n * `rankBy` - scans a possibly unsorted array in-order, returning the index based on a sorting criteria.\n *\n * @param data - Array, \"sorted\" by `predicate`.\n * @param predicate - A predicate which also defines the array's order.\n * @returns Index (In the range 0..data.length).\n * @signature\n *    P.sortedIndexWith(data, predicate)\n * @example\n *    P.sortedIndexWith(['a','ab','abc'], (item) => item.length < 2) // => 1\n * @dataFirst\n * @category Array\n * @see findIndex, sortedIndex, sortedIndexBy, sortedLastIndex, sortedLastIndexBy\n */\nexport function sortedIndexWith<T>(\n  data: ReadonlyArray<T>,\n  predicate: (value: T, index: number, data: ReadonlyArray<T>) => boolean,\n): number;\n\n/**\n * Performs a **binary search** for the index of the item at which the predicate\n * stops returning `true`. This function assumes that the array is \"sorted\" in\n * regards to the predicate, meaning that running the predicate as a mapper on\n * it would result in an array `[...true[], ...false[]]`.\n * This stricter requirement from the predicate provides us 2 benefits over\n * `findIndex` which does a similar thing:\n * 1. It would run at O(logN) time instead of O(N) time.\n * 2. It always returns a value (it would return `data.length` if the\n * predicate returns `true` for all items).\n *\n * This function is the basis for all other sortedIndex functions which search\n * for a specific item in a sorted array, and it could be used to perform\n * similar efficient searches.\n * `sortedIndex` - scans a sorted array with a binary search, find the first suitable index.\n * `sortedIndexBy` - like `sortedIndex`, but assumes sorting is based on a callbackfn.\n * `sortedLastIndex` - scans a sorted array with a binary search, finding the last suitable index.\n * `sortedLastIndexBy` - like `sortedLastIndex`, but assumes sorting is based on a callbackfn.\n *\n * See also:\n * `findIndex` - scans a possibly unsorted array in-order (linear search).\n * `rankBy` - scans a possibly unsorted array in-order, returning the index based on a sorting criteria.\n *\n * @param predicate - A predicate which also defines the array's order.\n * @returns Index (In the range 0..data.length).\n * @signature\n *    P.sortedIndexWith(predicate)(data)\n * @example\n *    P.pipe(['a','ab','abc'], P.sortedIndexWith((item) => item.length < 2)) // => 1\n * @dataLast\n * @category Array\n */\nexport function sortedIndexWith<T>(\n  predicate: (value: T, index: number, data: ReadonlyArray<T>) => boolean,\n): (data: ReadonlyArray<T>) => number;\n\nexport function sortedIndexWith(...args: ReadonlyArray<unknown>): unknown {\n  return curry(binarySearchCutoffIndex, args);\n}\n"],"mappings":"+HA8EA,SAAgB,EAAgB,GAAG,EAAuC,CACxE,OAAO,EAAM,EAAyB,EAAK"}

package/dist/sorted-last-index-B4zg__sQ.js

@@ -1,2 +0,0 @@
-import{curry as e}from"./curry-CzZjDrpv.js";import{binarySearchCutoffIndex as t}from"./binary-search-cutoff-index-QhLfC_4-.js";function n(...t){return e(r,t)}function r(e,n){return t(e,e=>e<=n)}export{n as sortedLastIndex};
-//# sourceMappingURL=sorted-last-index-B4zg__sQ.js.map

package/dist/sorted-last-index-B4zg__sQ.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-last-index-B4zg__sQ.js","names":[],"sources":["../src/sorted-last-index.ts"],"sourcesContent":["import { curry } from './curry';\nimport { binarySearchCutoffIndex } from './internal/binary-search-cutoff-index';\n\n/**\n * Find the insertion position (index) of an item in an array with items sorted\n * in ascending order; so that `splice(sortedIndex, 0, item)` would result in\n * maintaining the array's sort-ness. The array can contain duplicates.\n * If the item already exists in the array the index would be of the *last*\n * occurrence of the item.\n *\n * Runs in O(logN) time.\n *\n * @param data - The (ascending) sorted array.\n * @param item - The item to insert.\n * @returns Insertion index (In the range 0..data.length).\n * @signature\n *    P.sortedLastIndex(data, item)\n * @example\n *    P.sortedLastIndex(['a','a','b','c','c'], 'c') // => 5\n * @dataFirst\n * @category Array\n * @see sortedIndex, sortedIndexBy, sortedIndexWith, sortedLastIndexBy\n */\nexport function sortedLastIndex<T>(data: ReadonlyArray<T>, item: T): number;\n\n/**\n * Find the insertion position (index) of an item in an array with items sorted\n * in ascending order; so that `splice(sortedIndex, 0, item)` would result in\n * maintaining the array's sort-ness. The array can contain duplicates.\n * If the item already exists in the array the index would be of the *last*\n * occurrence of the item.\n *\n * Runs in O(logN) time.\n *\n * @param item - The item to insert.\n * @returns Insertion index (In the range 0..data.length).\n * @signature\n *    P.sortedLastIndex(item)(data)\n * @example\n *    P.pipe(['a','a','b','c','c'], sortedLastIndex('c')) // => 5\n * @dataLast\n * @category Array\n * @see sortedIndex, sortedIndexBy, sortedIndexWith, sortedLastIndexBy\n */\nexport function sortedLastIndex<T>(item: T): (data: ReadonlyArray<T>) => number;\n\nexport function sortedLastIndex(...args: ReadonlyArray<unknown>): unknown {\n  return curry(sortedLastIndexImplementation, args);\n}\n\nfunction sortedLastIndexImplementation<T>(\n  array: ReadonlyArray<T>,\n  item: T,\n): number {\n  return binarySearchCutoffIndex(\n    array,\n    // The only difference between the regular implementation and the \"last\"\n    // variation is that we consider the pivot with equality too, so that we\n    // skip all equal values in addition to the lower ones.\n    (pivot) => pivot <= item,\n  );\n}\n"],"mappings":"+HA8CA,SAAgB,EAAgB,GAAG,EAAuC,CACxE,OAAO,EAAM,EAA+B,EAAK,CAGnD,SAAS,EACP,EACA,EACQ,CACR,OAAO,EACL,EAIC,GAAU,GAAS,EACrB"}

package/dist/sorted-last-index-CHvbfpBS.d.cts

@@ -1,45 +0,0 @@
-//#region src/sorted-last-index.d.ts
-/**
- * Find the insertion position (index) of an item in an array with items sorted
- * in ascending order; so that `splice(sortedIndex, 0, item)` would result in
- * maintaining the array's sort-ness. The array can contain duplicates.
- * If the item already exists in the array the index would be of the *last*
- * occurrence of the item.
- *
- * Runs in O(logN) time.
- *
- * @param data - The (ascending) sorted array.
- * @param item - The item to insert.
- * @returns Insertion index (In the range 0..data.length).
- * @signature
- *    P.sortedLastIndex(data, item)
- * @example
- *    P.sortedLastIndex(['a','a','b','c','c'], 'c') // => 5
- * @dataFirst
- * @category Array
- * @see sortedIndex, sortedIndexBy, sortedIndexWith, sortedLastIndexBy
- */
-declare function sortedLastIndex<T>(data: ReadonlyArray<T>, item: T): number;
-/**
- * Find the insertion position (index) of an item in an array with items sorted
- * in ascending order; so that `splice(sortedIndex, 0, item)` would result in
- * maintaining the array's sort-ness. The array can contain duplicates.
- * If the item already exists in the array the index would be of the *last*
- * occurrence of the item.
- *
- * Runs in O(logN) time.
- *
- * @param item - The item to insert.
- * @returns Insertion index (In the range 0..data.length).
- * @signature
- *    P.sortedLastIndex(item)(data)
- * @example
- *    P.pipe(['a','a','b','c','c'], sortedLastIndex('c')) // => 5
- * @dataLast
- * @category Array
- * @see sortedIndex, sortedIndexBy, sortedIndexWith, sortedLastIndexBy
- */
-declare function sortedLastIndex<T>(item: T): (data: ReadonlyArray<T>) => number;
-//#endregion
-export { sortedLastIndex };
-//# sourceMappingURL=sorted-last-index-CHvbfpBS.d.cts.map

package/dist/sorted-last-index-CHvbfpBS.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-last-index-CHvbfpBS.d.cts","names":[],"sources":["../src/sorted-last-index.ts"],"sourcesContent":[],"mappings":";;AAuBA;;;;;;AAqBA;;;;;;;;;;;;;iBArBgB,yBAAyB,cAAc,UAAU;;;;;;;;;;;;;;;;;;;;iBAqBjD,yBAAyB,WAAW,cAAc"}

package/dist/sorted-last-index-CdPROn6x.cjs

@@ -1 +0,0 @@
-const e=require(`./curry-BPVIsvo3.cjs`),t=require(`./binary-search-cutoff-index-B3xuP0oe.cjs`);function n(...t){return e.curry(r,t)}function r(e,n){return t.binarySearchCutoffIndex(e,e=>e<=n)}Object.defineProperty(exports,`sortedLastIndex`,{enumerable:!0,get:function(){return n}});

package/dist/sorted-last-index-DnqTn-Ev.d.ts

@@ -1,45 +0,0 @@
-//#region src/sorted-last-index.d.ts
-/**
- * Find the insertion position (index) of an item in an array with items sorted
- * in ascending order; so that `splice(sortedIndex, 0, item)` would result in
- * maintaining the array's sort-ness. The array can contain duplicates.
- * If the item already exists in the array the index would be of the *last*
- * occurrence of the item.
- *
- * Runs in O(logN) time.
- *
- * @param data - The (ascending) sorted array.
- * @param item - The item to insert.
- * @returns Insertion index (In the range 0..data.length).
- * @signature
- *    P.sortedLastIndex(data, item)
- * @example
- *    P.sortedLastIndex(['a','a','b','c','c'], 'c') // => 5
- * @dataFirst
- * @category Array
- * @see sortedIndex, sortedIndexBy, sortedIndexWith, sortedLastIndexBy
- */
-declare function sortedLastIndex<T>(data: ReadonlyArray<T>, item: T): number;
-/**
- * Find the insertion position (index) of an item in an array with items sorted
- * in ascending order; so that `splice(sortedIndex, 0, item)` would result in
- * maintaining the array's sort-ness. The array can contain duplicates.
- * If the item already exists in the array the index would be of the *last*
- * occurrence of the item.
- *
- * Runs in O(logN) time.
- *
- * @param item - The item to insert.
- * @returns Insertion index (In the range 0..data.length).
- * @signature
- *    P.sortedLastIndex(item)(data)
- * @example
- *    P.pipe(['a','a','b','c','c'], sortedLastIndex('c')) // => 5
- * @dataLast
- * @category Array
- * @see sortedIndex, sortedIndexBy, sortedIndexWith, sortedLastIndexBy
- */
-declare function sortedLastIndex<T>(item: T): (data: ReadonlyArray<T>) => number;
-//#endregion
-export { sortedLastIndex };
-//# sourceMappingURL=sorted-last-index-DnqTn-Ev.d.ts.map

package/dist/sorted-last-index-DnqTn-Ev.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-last-index-DnqTn-Ev.d.ts","names":[],"sources":["../src/sorted-last-index.ts"],"sourcesContent":[],"mappings":";;AAuBA;;;;;;AAqBA;;;;;;;;;;;;;iBArBgB,yBAAyB,cAAc,UAAU;;;;;;;;;;;;;;;;;;;;iBAqBjD,yBAAyB,WAAW,cAAc"}

package/dist/sorted-last-index-by-B-IP-O5g.cjs

@@ -1 +0,0 @@
-const e=require(`./curry-BPVIsvo3.cjs`),t=require(`./binary-search-cutoff-index-B3xuP0oe.cjs`);function n(...t){return e.curry(r,t)}function r(e,n,r){let i=r(n,void 0,e);return t.binarySearchCutoffIndex(e,(t,n)=>r(t,n,e)<=i)}Object.defineProperty(exports,`sortedLastIndexBy`,{enumerable:!0,get:function(){return n}});

package/dist/sorted-last-index-by-BGr5WioW.js

@@ -1,2 +0,0 @@
-import{curry as e}from"./curry-CzZjDrpv.js";import{binarySearchCutoffIndex as t}from"./binary-search-cutoff-index-QhLfC_4-.js";function n(...t){return e(r,t)}function r(e,n,r){let i=r(n,void 0,e);return t(e,(t,n)=>r(t,n,e)<=i)}export{n as sortedLastIndexBy};
-//# sourceMappingURL=sorted-last-index-by-BGr5WioW.js.map

package/dist/sorted-last-index-by-BGr5WioW.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-last-index-by-BGr5WioW.js","names":[],"sources":["../src/sorted-last-index-by.ts"],"sourcesContent":["import { curry } from './curry';\nimport { binarySearchCutoffIndex } from './internal/binary-search-cutoff-index';\n\n/**\n * Find the insertion position (index) of an item in an array with items sorted\n * in ascending order using a value function; so that\n * `splice(sortedIndex, 0, item)` would result in maintaining the arrays sort-\n * ness. The array can contain duplicates.\n * If the item already exists in the array the index would be of the *last*\n * occurrence of the item.\n *\n * Runs in O(logN) time.\n *\n * See also:\n * `findIndex` - scans a possibly unsorted array in-order (linear search).\n * `sortedLastIndex` - a simplified version of this function, without a callbackfn.\n * `sortedIndexBy` - like this function, but returns the first suitable index.\n * `sortedIndex` - like `sortedLastIndex` but without a callbackfn.\n * `rankBy` - scans a possibly unsorted array in-order, returning the index based on a sorting criteria.\n *\n * @param data - The (ascending) sorted array.\n * @param item - The item to insert.\n * @param valueFunction - All comparisons would be performed on the result of\n * calling this function on each compared item. Preferably this function should\n * return a `number` or `string`. This function should be the same as the one\n * provided to sortBy to sort the array. The function is called exactly once on\n * each items that is compared against in the array, and once at the beginning\n * on `item`. When called on `item` the `index` argument is `undefined`.\n * @returns Insertion index (In the range 0..data.length).\n * @signature\n *    P.sortedLastIndexBy(data, item, valueFunction)\n * @example\n *    P.sortedLastIndexBy([{age:20},{age:22}],{age:21},prop('age')) // => 1\n * @dataFirst\n * @category Array\n */\nexport function sortedLastIndexBy<T>(\n  data: ReadonlyArray<T>,\n  item: T,\n  valueFunction: (\n    item: T,\n    index: number | undefined,\n    data: ReadonlyArray<T>,\n  ) => NonNullable<unknown>,\n): number;\n\n/**\n * Find the insertion position (index) of an item in an array with items sorted\n * in ascending order using a value function; so that\n * `splice(sortedIndex, 0, item)` would result in maintaining the arrays sort-\n * ness. The array can contain duplicates.\n * If the item already exists in the array the index would be of the *last*\n * occurrence of the item.\n *\n * Runs in O(logN) time.\n *\n * See also:\n * `findIndex` - scans a possibly unsorted array in-order (linear search).\n * `sortedLastIndex` - a simplified version of this function, without a callbackfn.\n * `sortedIndexBy` - like this function, but returns the first suitable index.\n * `sortedIndex` - like `sortedLastIndex` but without a callbackfn.\n * `rankBy` - scans a possibly unsorted array in-order, returning the index based on a sorting criteria.\n *\n * @param item - The item to insert.\n * @param valueFunction - All comparisons would be performed on the result of\n * calling this function on each compared item. Preferably this function should\n * return a `number` or `string`. This function should be the same as the one\n * provided to sortBy to sort the array. The function is called exactly once on\n * each items that is compared against in the array, and once at the beginning\n * on `item`. When called on `item` the `index` argument is `undefined`.\n * @returns Insertion index (In the range 0..data.length).\n * @signature\n *    P.sortedLastIndexBy(item, valueFunction)(data)\n * @example\n *    P.pipe([{age:20},{age:22}],sortedLastIndexBy({age:21},prop('age'))) // => 1\n * @dataLast\n * @category Array\n * @see sortedIndex, sortedIndexBy, sortedIndexWith, sortedLastIndex\n */\nexport function sortedLastIndexBy<T>(\n  item: T,\n  valueFunction: (\n    item: T,\n    index: number | undefined,\n    data: ReadonlyArray<T>,\n  ) => NonNullable<unknown>,\n): (data: ReadonlyArray<T>) => number;\n\nexport function sortedLastIndexBy(...args: ReadonlyArray<unknown>): unknown {\n  return curry(sortedLastIndexByImplementation, args);\n}\n\nfunction sortedLastIndexByImplementation<T>(\n  array: ReadonlyArray<T>,\n  item: T,\n  valueFunction: (\n    item: T,\n    index: number | undefined,\n    data: ReadonlyArray<T>,\n  ) => NonNullable<unknown>,\n): number {\n  const value = valueFunction(item, undefined /* index */, array);\n  return binarySearchCutoffIndex(\n    array,\n    // The only difference between the regular implementation and the \"last\"\n    // variation is that we consider the pivot with equality too, so that we\n    // skip all equal values in addition to the lower ones.\n    (pivot, index) => valueFunction(pivot, index, array) <= value,\n  );\n}\n"],"mappings":"+HAwFA,SAAgB,EAAkB,GAAG,EAAuC,CAC1E,OAAO,EAAM,EAAiC,EAAK,CAGrD,SAAS,EACP,EACA,EACA,EAKQ,CACR,IAAM,EAAQ,EAAc,EAAM,IAAA,GAAuB,EAAM,CAC/D,OAAO,EACL,GAIC,EAAO,IAAU,EAAc,EAAO,EAAO,EAAM,EAAI,EACzD"}

package/dist/sorted-last-index-by-BipSOnBS.d.ts

@@ -1,72 +0,0 @@
-//#region src/sorted-last-index-by.d.ts
-/**
- * Find the insertion position (index) of an item in an array with items sorted
- * in ascending order using a value function; so that
- * `splice(sortedIndex, 0, item)` would result in maintaining the arrays sort-
- * ness. The array can contain duplicates.
- * If the item already exists in the array the index would be of the *last*
- * occurrence of the item.
- *
- * Runs in O(logN) time.
- *
- * See also:
- * `findIndex` - scans a possibly unsorted array in-order (linear search).
- * `sortedLastIndex` - a simplified version of this function, without a callbackfn.
- * `sortedIndexBy` - like this function, but returns the first suitable index.
- * `sortedIndex` - like `sortedLastIndex` but without a callbackfn.
- * `rankBy` - scans a possibly unsorted array in-order, returning the index based on a sorting criteria.
- *
- * @param data - The (ascending) sorted array.
- * @param item - The item to insert.
- * @param valueFunction - All comparisons would be performed on the result of
- * calling this function on each compared item. Preferably this function should
- * return a `number` or `string`. This function should be the same as the one
- * provided to sortBy to sort the array. The function is called exactly once on
- * each items that is compared against in the array, and once at the beginning
- * on `item`. When called on `item` the `index` argument is `undefined`.
- * @returns Insertion index (In the range 0..data.length).
- * @signature
- *    P.sortedLastIndexBy(data, item, valueFunction)
- * @example
- *    P.sortedLastIndexBy([{age:20},{age:22}],{age:21},prop('age')) // => 1
- * @dataFirst
- * @category Array
- */
-declare function sortedLastIndexBy<T>(data: ReadonlyArray<T>, item: T, valueFunction: (item: T, index: number | undefined, data: ReadonlyArray<T>) => NonNullable<unknown>): number;
-/**
- * Find the insertion position (index) of an item in an array with items sorted
- * in ascending order using a value function; so that
- * `splice(sortedIndex, 0, item)` would result in maintaining the arrays sort-
- * ness. The array can contain duplicates.
- * If the item already exists in the array the index would be of the *last*
- * occurrence of the item.
- *
- * Runs in O(logN) time.
- *
- * See also:
- * `findIndex` - scans a possibly unsorted array in-order (linear search).
- * `sortedLastIndex` - a simplified version of this function, without a callbackfn.
- * `sortedIndexBy` - like this function, but returns the first suitable index.
- * `sortedIndex` - like `sortedLastIndex` but without a callbackfn.
- * `rankBy` - scans a possibly unsorted array in-order, returning the index based on a sorting criteria.
- *
- * @param item - The item to insert.
- * @param valueFunction - All comparisons would be performed on the result of
- * calling this function on each compared item. Preferably this function should
- * return a `number` or `string`. This function should be the same as the one
- * provided to sortBy to sort the array. The function is called exactly once on
- * each items that is compared against in the array, and once at the beginning
- * on `item`. When called on `item` the `index` argument is `undefined`.
- * @returns Insertion index (In the range 0..data.length).
- * @signature
- *    P.sortedLastIndexBy(item, valueFunction)(data)
- * @example
- *    P.pipe([{age:20},{age:22}],sortedLastIndexBy({age:21},prop('age'))) // => 1
- * @dataLast
- * @category Array
- * @see sortedIndex, sortedIndexBy, sortedIndexWith, sortedLastIndex
- */
-declare function sortedLastIndexBy<T>(item: T, valueFunction: (item: T, index: number | undefined, data: ReadonlyArray<T>) => NonNullable<unknown>): (data: ReadonlyArray<T>) => number;
-//#endregion
-export { sortedLastIndexBy };
-//# sourceMappingURL=sorted-last-index-by-BipSOnBS.d.ts.map

package/dist/sorted-last-index-by-BipSOnBS.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-last-index-by-BipSOnBS.d.ts","names":[],"sources":["../src/sorted-last-index-by.ts"],"sourcesContent":[],"mappings":";;AAoCA;;;;;;;;;;AA2CA;;;;;;;;;;;;;;;;;;;;;;iBA3CgB,2BACR,cAAc,UACd,yBAEE,oCAEA,cAAc,OACjB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBAoCS,2BACR,yBAEE,oCAEA,cAAc,OACjB,8BACG,cAAc"}

package/dist/sorted-last-index-by-u7mPctkh.d.cts

@@ -1,72 +0,0 @@
-//#region src/sorted-last-index-by.d.ts
-/**
- * Find the insertion position (index) of an item in an array with items sorted
- * in ascending order using a value function; so that
- * `splice(sortedIndex, 0, item)` would result in maintaining the arrays sort-
- * ness. The array can contain duplicates.
- * If the item already exists in the array the index would be of the *last*
- * occurrence of the item.
- *
- * Runs in O(logN) time.
- *
- * See also:
- * `findIndex` - scans a possibly unsorted array in-order (linear search).
- * `sortedLastIndex` - a simplified version of this function, without a callbackfn.
- * `sortedIndexBy` - like this function, but returns the first suitable index.
- * `sortedIndex` - like `sortedLastIndex` but without a callbackfn.
- * `rankBy` - scans a possibly unsorted array in-order, returning the index based on a sorting criteria.
- *
- * @param data - The (ascending) sorted array.
- * @param item - The item to insert.
- * @param valueFunction - All comparisons would be performed on the result of
- * calling this function on each compared item. Preferably this function should
- * return a `number` or `string`. This function should be the same as the one
- * provided to sortBy to sort the array. The function is called exactly once on
- * each items that is compared against in the array, and once at the beginning
- * on `item`. When called on `item` the `index` argument is `undefined`.
- * @returns Insertion index (In the range 0..data.length).
- * @signature
- *    P.sortedLastIndexBy(data, item, valueFunction)
- * @example
- *    P.sortedLastIndexBy([{age:20},{age:22}],{age:21},prop('age')) // => 1
- * @dataFirst
- * @category Array
- */
-declare function sortedLastIndexBy<T>(data: ReadonlyArray<T>, item: T, valueFunction: (item: T, index: number | undefined, data: ReadonlyArray<T>) => NonNullable<unknown>): number;
-/**
- * Find the insertion position (index) of an item in an array with items sorted
- * in ascending order using a value function; so that
- * `splice(sortedIndex, 0, item)` would result in maintaining the arrays sort-
- * ness. The array can contain duplicates.
- * If the item already exists in the array the index would be of the *last*
- * occurrence of the item.
- *
- * Runs in O(logN) time.
- *
- * See also:
- * `findIndex` - scans a possibly unsorted array in-order (linear search).
- * `sortedLastIndex` - a simplified version of this function, without a callbackfn.
- * `sortedIndexBy` - like this function, but returns the first suitable index.
- * `sortedIndex` - like `sortedLastIndex` but without a callbackfn.
- * `rankBy` - scans a possibly unsorted array in-order, returning the index based on a sorting criteria.
- *
- * @param item - The item to insert.
- * @param valueFunction - All comparisons would be performed on the result of
- * calling this function on each compared item. Preferably this function should
- * return a `number` or `string`. This function should be the same as the one
- * provided to sortBy to sort the array. The function is called exactly once on
- * each items that is compared against in the array, and once at the beginning
- * on `item`. When called on `item` the `index` argument is `undefined`.
- * @returns Insertion index (In the range 0..data.length).
- * @signature
- *    P.sortedLastIndexBy(item, valueFunction)(data)
- * @example
- *    P.pipe([{age:20},{age:22}],sortedLastIndexBy({age:21},prop('age'))) // => 1
- * @dataLast
- * @category Array
- * @see sortedIndex, sortedIndexBy, sortedIndexWith, sortedLastIndex
- */
-declare function sortedLastIndexBy<T>(item: T, valueFunction: (item: T, index: number | undefined, data: ReadonlyArray<T>) => NonNullable<unknown>): (data: ReadonlyArray<T>) => number;
-//#endregion
-export { sortedLastIndexBy };
-//# sourceMappingURL=sorted-last-index-by-u7mPctkh.d.cts.map

package/dist/sorted-last-index-by-u7mPctkh.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-last-index-by-u7mPctkh.d.cts","names":[],"sources":["../src/sorted-last-index-by.ts"],"sourcesContent":[],"mappings":";;AAoCA;;;;;;;;;;AA2CA;;;;;;;;;;;;;;;;;;;;;;iBA3CgB,2BACR,cAAc,UACd,yBAEE,oCAEA,cAAc,OACjB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBAoCS,2BACR,yBAEE,oCAEA,cAAc,OACjB,8BACG,cAAc"}

package/dist/splice-BwsAFdV8.cjs

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

package/dist/splice-CR6DLiFm.d.cts

@@ -1,35 +0,0 @@
-//#region src/splice.d.ts
-/**
- * Removes elements from an array and, inserts new elements in their place.
- *
- * @param items - The array to splice.
- * @param start - The index from which to start removing elements.
- * @param deleteCount - The number of elements to remove.
- * @param replacement - The elements to insert into the array in place of the deleted elements.
- * @signature
- *    P.splice(items, start, deleteCount, replacement)
- * @example
- *    P.splice([1,2,3,4,5,6,7,8], 2, 3, []); //=> [1,2,6,7,8]
- *    P.splice([1,2,3,4,5,6,7,8], 2, 3, [9, 10]); //=> [1,2,9,10,6,7,8]
- * @dataFirst
- * @category Array
- */
-declare function splice<T>(items: ReadonlyArray<T>, start: number, deleteCount: number, replacement: ReadonlyArray<T>): Array<T>;
-/**
- * Removes elements from an array and, inserts new elements in their place.
- *
- * @param start - The index from which to start removing elements.
- * @param deleteCount - The number of elements to remove.
- * @param replacement - The elements to insert into the array in place of the deleted elements.
- * @signature
- *    P.splice(start, deleteCount, replacement)(items)
- * @example
- *    P.pipe([1,2,3,4,5,6,7,8], P.splice(2, 3, [])) // => [1,2,6,7,8]
- *    P.pipe([1,2,3,4,5,6,7,8], P.splice(2, 3, [9, 10])) // => [1,2,9,10,6,7,8]
- * @dataLast
- * @category Array
- */
-declare function splice<T>(start: number, deleteCount: number, replacement: ReadonlyArray<T>): (items: ReadonlyArray<T>) => Array<T>;
-//#endregion
-export { splice };
-//# sourceMappingURL=splice-CR6DLiFm.d.cts.map

package/dist/splice-CR6DLiFm.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"splice-CR6DLiFm.d.cts","names":[],"sources":["../src/splice.ts"],"sourcesContent":[],"mappings":";;AAiBA;;;;;;;;;AAqBA;;;;;AAIW,iBAzBK,MAyBL,CAAA,CAAA,CAAA,CAAA,KAAA,EAxBF,aAwBE,CAxBY,CAwBZ,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,WAAA,EAAA,MAAA,EAAA,WAAA,EArBI,aAqBJ,CArBkB,CAqBlB,CAAA,CAAA,EApBR,KAoBQ,CApBF,CAoBE,CAAA;;;;;;;;;;;;;;;iBAJK,2DAGD,cAAc,aAClB,cAAc,OAAO,MAAM"}

package/dist/splice-CRabhu-x.d.ts

@@ -1,35 +0,0 @@
-//#region src/splice.d.ts
-/**
- * Removes elements from an array and, inserts new elements in their place.
- *
- * @param items - The array to splice.
- * @param start - The index from which to start removing elements.
- * @param deleteCount - The number of elements to remove.
- * @param replacement - The elements to insert into the array in place of the deleted elements.
- * @signature
- *    P.splice(items, start, deleteCount, replacement)
- * @example
- *    P.splice([1,2,3,4,5,6,7,8], 2, 3, []); //=> [1,2,6,7,8]
- *    P.splice([1,2,3,4,5,6,7,8], 2, 3, [9, 10]); //=> [1,2,9,10,6,7,8]
- * @dataFirst
- * @category Array
- */
-declare function splice<T>(items: ReadonlyArray<T>, start: number, deleteCount: number, replacement: ReadonlyArray<T>): Array<T>;
-/**
- * Removes elements from an array and, inserts new elements in their place.
- *
- * @param start - The index from which to start removing elements.
- * @param deleteCount - The number of elements to remove.
- * @param replacement - The elements to insert into the array in place of the deleted elements.
- * @signature
- *    P.splice(start, deleteCount, replacement)(items)
- * @example
- *    P.pipe([1,2,3,4,5,6,7,8], P.splice(2, 3, [])) // => [1,2,6,7,8]
- *    P.pipe([1,2,3,4,5,6,7,8], P.splice(2, 3, [9, 10])) // => [1,2,9,10,6,7,8]
- * @dataLast
- * @category Array
- */
-declare function splice<T>(start: number, deleteCount: number, replacement: ReadonlyArray<T>): (items: ReadonlyArray<T>) => Array<T>;
-//#endregion
-export { splice };
-//# sourceMappingURL=splice-CRabhu-x.d.ts.map

package/dist/splice-CRabhu-x.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"splice-CRabhu-x.d.ts","names":[],"sources":["../src/splice.ts"],"sourcesContent":[],"mappings":";;AAiBA;;;;;;;;;AAqBA;;;;;AAIW,iBAzBK,MAyBL,CAAA,CAAA,CAAA,CAAA,KAAA,EAxBF,aAwBE,CAxBY,CAwBZ,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,WAAA,EAAA,MAAA,EAAA,WAAA,EArBI,aAqBJ,CArBkB,CAqBlB,CAAA,CAAA,EApBR,KAoBQ,CApBF,CAoBE,CAAA;;;;;;;;;;;;;;;iBAJK,2DAGD,cAAc,aAClB,cAAc,OAAO,MAAM"}

package/dist/splice-DCOBlrIJ.js

@@ -1,2 +0,0 @@
-import{curry as e}from"./curry-CzZjDrpv.js";function t(...t){return e(n,t)}function n(e,t,n,r){let i=[...e];return i.splice(t,n,...r),i}export{t as splice};
-//# sourceMappingURL=splice-DCOBlrIJ.js.map

package/dist/splice-DCOBlrIJ.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"splice-DCOBlrIJ.js","names":[],"sources":["../src/splice.ts"],"sourcesContent":["import { curry } from './curry';\n\n/**\n * Removes elements from an array and, inserts new elements in their place.\n *\n * @param items - The array to splice.\n * @param start - The index from which to start removing elements.\n * @param deleteCount - The number of elements to remove.\n * @param replacement - The elements to insert into the array in place of the deleted elements.\n * @signature\n *    P.splice(items, start, deleteCount, replacement)\n * @example\n *    P.splice([1,2,3,4,5,6,7,8], 2, 3, []); //=> [1,2,6,7,8]\n *    P.splice([1,2,3,4,5,6,7,8], 2, 3, [9, 10]); //=> [1,2,9,10,6,7,8]\n * @dataFirst\n * @category Array\n */\nexport function splice<T>(\n  items: ReadonlyArray<T>,\n  start: number,\n  deleteCount: number,\n  replacement: ReadonlyArray<T>,\n): Array<T>;\n\n/**\n * Removes elements from an array and, inserts new elements in their place.\n *\n * @param start - The index from which to start removing elements.\n * @param deleteCount - The number of elements to remove.\n * @param replacement - The elements to insert into the array in place of the deleted elements.\n * @signature\n *    P.splice(start, deleteCount, replacement)(items)\n * @example\n *    P.pipe([1,2,3,4,5,6,7,8], P.splice(2, 3, [])) // => [1,2,6,7,8]\n *    P.pipe([1,2,3,4,5,6,7,8], P.splice(2, 3, [9, 10])) // => [1,2,9,10,6,7,8]\n * @dataLast\n * @category Array\n */\nexport function splice<T>(\n  start: number,\n  deleteCount: number,\n  replacement: ReadonlyArray<T>,\n): (items: ReadonlyArray<T>) => Array<T>;\n\nexport function splice(...args: ReadonlyArray<unknown>): unknown {\n  return curry(spliceImplementation, args);\n}\n\nfunction spliceImplementation<T>(\n  items: ReadonlyArray<T>,\n  start: number,\n  deleteCount: number,\n  replacement: ReadonlyArray<T>,\n): Array<T> {\n  // TODO: When node 18 reaches end-of-life bump target lib to ES2023+ and use `Array.prototype.toSpliced` here.\n  const result = [...items];\n  result.splice(start, deleteCount, ...replacement);\n  return result;\n}\n"],"mappings":"4CA4CA,SAAgB,EAAO,GAAG,EAAuC,CAC/D,OAAO,EAAM,EAAsB,EAAK,CAG1C,SAAS,EACP,EACA,EACA,EACA,EACU,CAEV,IAAM,EAAS,CAAC,GAAG,EAAM,CAEzB,OADA,EAAO,OAAO,EAAO,EAAa,GAAG,EAAY,CAC1C"}

package/dist/split-BMnz50TJ.d.ts

@@ -1,62 +0,0 @@
-import { ArraySlice, IsFloat, NonNegative, Split } from "type-fest";
-
-//#region src/split.d.ts
-type Split$1<S extends string, Separator extends string, N extends number | undefined = undefined> = string extends S ? Array<string> : string extends Separator ? Array<string> : number extends N ? Array<string> : IsFloat<N> extends true ? Array<string> : ArraySlice<Split<S, Separator>, 0, N extends number ? NonNegative<N> : never>;
-/**
- * Takes a pattern and divides this string into an ordered list of substrings by
- * searching for the pattern, puts these substrings into an array, and returns
- * the array. This function mirrors the built-in [`String.prototype.split`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/split)
- * method.
- *
- * @param data - The string to split.
- * @param separator - The pattern describing where each split should occur. Can
- * be a string, or a regular expression.
- * @param limit - A non-negative integer specifying a limit on the number of
- * substrings to be included in the array. If provided, splits the string at
- * each occurrence of the specified separator, but stops when limit entries have
- * been placed in the array. Any leftover text is not included in the array at
- * all. The array may contain fewer entries than limit if the end of the string
- * is reached before the limit is reached. If limit is 0, [] is returned.
- * @returns An Array of strings, split at each point where the separator occurs
- * in the given string.
- * @signature
- *   R.split(data, separator, limit);
- * @example
- *   R.split("a,b,c", ","); //=> ["a", "b", "c"]
- *   R.split("a,b,c", ",", 2); //=> ["a", "b"]
- *   R.split("a1b2c3d", /\d/u); //=> ["a", "b", "c", "d"]
- * @dataFirst
- * @category String
- */
-declare function split(data: string, separator: RegExp, limit?: number): Array<string>;
-declare function split<S extends string, Separator extends string, N extends number | undefined = undefined>(data: S, separator: Separator, limit?: N): Split$1<S, Separator, N>;
-/**
- * Takes a pattern and divides this string into an ordered list of substrings by
- * searching for the pattern, puts these substrings into an array, and returns
- * the array. This function mirrors the built-in [`String.prototype.split`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/split)
- * method.
- *
- * @param separator - The pattern describing where each split should occur. Can
- * be a string, or a regular expression.
- * @param limit - A non-negative integer specifying a limit on the number of
- * substrings to be included in the array. If provided, splits the string at
- * each occurrence of the specified separator, but stops when limit entries have
- * been placed in the array. Any leftover text is not included in the array at
- * all. The array may contain fewer entries than limit if the end of the string
- * is reached before the limit is reached. If limit is 0, [] is returned.
- * @returns An Array of strings, split at each point where the separator occurs
- * in the given string.
- * @signature
- *   R.split(separator, limit)(data);
- * @example
- *   R.pipe("a,b,c", R.split(",")); //=> ["a", "b", "c"]
- *   R.pipe("a,b,c", R.split(",", 2)); //=> ["a", "b"]
- *   R.pipe("a1b2c3d", R.split(/\d/u)); //=> ["a", "b", "c", "d"]
- * @dataLast
- * @category String
- */
-declare function split(separator: RegExp, limit?: number): (data: string) => Array<string>;
-declare function split<S extends string, Separator extends string, N extends number | undefined = undefined>(separator: Separator, limit?: N): (data: S) => Split$1<S, Separator, N>;
-//#endregion
-export { split };
-//# sourceMappingURL=split-BMnz50TJ.d.ts.map

package/dist/split-BMnz50TJ.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"split-BMnz50TJ.d.ts","names":[],"sources":["../src/split.ts"],"sourcesContent":[],"mappings":";;;KAOK,+GAIc,IACf,+BACe,YACb,+BACe,IACb,gBAEF,QAAQ,kBACJ,gBACA,WAIE,MAAU,GAAG,eAIb,mBAAmB,YAAY;;AAvBxB;;;;;;;;;;;;;;;;;;;AAoDnB;;;;;AAKA;AAAqB,iBALL,KAAA,CAKK,IAAA,EAAA,MAAA,EAAA,SAAA,EAHR,MAGQ,EAAA,KAAA,CAAA,EAAA,MAAA,CAAA,EADlB,KACkB,CAAA,MAAA,CAAA;AAIb,iBAJQ,KAIR,CAAA,UAAA,MAAA,EAAA,kBAAA,MAAA,EAAA,UAAA,MAAA,GAAA,SAAA,GAAA,SAAA,CAAA,CAAA,IAAA,EAAA,CAAA,EAAA,SAAA,EAAc,SAAd,EAAA,KAAA,CAAA,EAAiC,CAAjC,CAAA,EAAqC,OAArC,CAA2C,CAA3C,EAA8C,SAA9C,EAAyD,CAAzD,CAAA;;;;;;;;AA2BR;;;;;AAIA;;;;;;;;;;;;;iBAJgB,KAAA,YACH,2CAEQ;iBACL,uGAIH,mBAAmB,WAAW,MAAM,QAAM,GAAG,WAAW"}