@vinicunca/perkakas 1.9.0 → 1.12.0

package/dist/sorted-index-by-D9WveGrc.d.cts

@@ -1,70 +0,0 @@
-//#region src/sorted-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 *first*
- * occurrence of the item.
- *
- * Runs in O(logN) time.
- *
- * See also:
- * `findIndex` - scans a possibly unsorted array in-order (linear search).
- * `sortedIndex` - like this function, but doesn't take a callbackfn.
- * `sortedLastIndexBy` - like this function, but finds the last suitable index.
- * `sortedLastIndex` - like `sortedIndex`, but finds the last suitable index.
- * `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.sortedIndexBy(data, item, valueFunction)
- * @example
- *    P.sortedIndexBy([{age:20},{age:22}],{age:21},prop('age')) // => 1
- * @dataFirst
- * @category Array
- */
-declare function sortedIndexBy<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 *first*
- * occurrence of the item.
- *
- * Runs in O(logN) time.
- *
- * See also:
- * `findIndex` - scans a possibly unsorted array in-order (linear search).
- * `sortedIndex` - like this function, but doesn't take a callbackfn.
- * `sortedLastIndexBy` - like this function, but finds the last suitable index.
- * `sortedLastIndex` - like `sortedIndex`, but finds the last suitable index.
- * `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`.
- * @signature
- *    P.sortedIndexBy(data, item, valueFunction)
- * @example
- *    P.sortedIndexBy([{age:20},{age:22}],{age:21},prop('age')) // => 1
- * @dataLast
- * @category Array
- */
-declare function sortedIndexBy<T>(item: T, valueFunction: (item: T, index: number | undefined, data: ReadonlyArray<T>) => NonNullable<unknown>): (data: ReadonlyArray<T>) => number;
-//#endregion
-export { sortedIndexBy };
-//# sourceMappingURL=sorted-index-by-D9WveGrc.d.cts.map

package/dist/sorted-index-by-D9WveGrc.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-index-by-D9WveGrc.d.cts","names":[],"sources":["../src/sorted-index-by.ts"],"sourcesContent":[],"mappings":";;AAoCA;;;;;;;;;;AAyCA;;;;;;;;;;;;;;;;;;;;;;iBAzCgB,uBACR,cAAc,UACd,yBAEE,oCAEA,cAAc,OACjB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBAkCS,uBACR,yBAEE,oCAEA,cAAc,OACjB,8BACG,cAAc"}

package/dist/sorted-index-by-wSsKYW7Z.d.ts

@@ -1,70 +0,0 @@
-//#region src/sorted-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 *first*
- * occurrence of the item.
- *
- * Runs in O(logN) time.
- *
- * See also:
- * `findIndex` - scans a possibly unsorted array in-order (linear search).
- * `sortedIndex` - like this function, but doesn't take a callbackfn.
- * `sortedLastIndexBy` - like this function, but finds the last suitable index.
- * `sortedLastIndex` - like `sortedIndex`, but finds the last suitable index.
- * `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.sortedIndexBy(data, item, valueFunction)
- * @example
- *    P.sortedIndexBy([{age:20},{age:22}],{age:21},prop('age')) // => 1
- * @dataFirst
- * @category Array
- */
-declare function sortedIndexBy<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 *first*
- * occurrence of the item.
- *
- * Runs in O(logN) time.
- *
- * See also:
- * `findIndex` - scans a possibly unsorted array in-order (linear search).
- * `sortedIndex` - like this function, but doesn't take a callbackfn.
- * `sortedLastIndexBy` - like this function, but finds the last suitable index.
- * `sortedLastIndex` - like `sortedIndex`, but finds the last suitable index.
- * `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`.
- * @signature
- *    P.sortedIndexBy(data, item, valueFunction)
- * @example
- *    P.sortedIndexBy([{age:20},{age:22}],{age:21},prop('age')) // => 1
- * @dataLast
- * @category Array
- */
-declare function sortedIndexBy<T>(item: T, valueFunction: (item: T, index: number | undefined, data: ReadonlyArray<T>) => NonNullable<unknown>): (data: ReadonlyArray<T>) => number;
-//#endregion
-export { sortedIndexBy };
-//# sourceMappingURL=sorted-index-by-wSsKYW7Z.d.ts.map

package/dist/sorted-index-by-wSsKYW7Z.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-index-by-wSsKYW7Z.d.ts","names":[],"sources":["../src/sorted-index-by.ts"],"sourcesContent":[],"mappings":";;AAoCA;;;;;;;;;;AAyCA;;;;;;;;;;;;;;;;;;;;;;iBAzCgB,uBACR,cAAc,UACd,yBAEE,oCAEA,cAAc,OACjB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBAkCS,uBACR,yBAEE,oCAEA,cAAc,OACjB,8BACG,cAAc"}

package/dist/sorted-index-r_y0xd5n.cjs

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

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-index-with-BAbLX5vT.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-index-with-BDoZKE2t.cjs

@@ -1 +0,0 @@
-const e=require(`./curry-BPVIsvo3.cjs`),t=require(`./binary-search-cutoff-index-BZF3GL7H.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-CKynJFKP.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-CKynJFKP.d.cts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-index-with-CKynJFKP.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-rq5dPCX_.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-rq5dPCX_.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-index-with-rq5dPCX_.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-last-index-BXVeuqVW.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-BXVeuqVW.d.cts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-last-index-BXVeuqVW.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-CwZ0vU7v.cjs

@@ -1 +0,0 @@
-const e=require(`./curry-BPVIsvo3.cjs`),t=require(`./binary-search-cutoff-index-BZF3GL7H.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-DKDuZV51.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-DKDuZV51.d.ts.map

package/dist/sorted-last-index-DKDuZV51.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-last-index-DKDuZV51.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-Bwy_FXV3.cjs

@@ -1 +0,0 @@
-const e=require(`./curry-BPVIsvo3.cjs`),t=require(`./binary-search-cutoff-index-BZF3GL7H.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-CypmQpWR.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-CypmQpWR.d.cts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-last-index-by-CypmQpWR.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/sorted-last-index-by-D6I-_BRT.js

@@ -1,2 +0,0 @@
-import{curry as e}from"./curry-CzZjDrpv.js";import{binarySearchCutoffIndex as t}from"./binary-search-cutoff-index-YVs_m4IY.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-D6I-_BRT.js.map

package/dist/sorted-last-index-by-D6I-_BRT.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-last-index-by-D6I-_BRT.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-tKmeBThm.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-tKmeBThm.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-last-index-by-tKmeBThm.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-eCG7G76u.js

@@ -1,2 +0,0 @@
-import{curry as e}from"./curry-CzZjDrpv.js";import{binarySearchCutoffIndex as t}from"./binary-search-cutoff-index-YVs_m4IY.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-eCG7G76u.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-last-index-eCG7G76u.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/splice-BAV6QQGX.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}});