1 | import baseSortedIndex from './_baseSortedIndex';
|
2 |
|
3 | /**
|
4 | * Uses a binary search to determine the lowest index at which `value`
|
5 | * should be inserted into `array` in order to maintain its sort order.
|
6 | *
|
7 | * @static
|
8 | * @memberOf _
|
9 | * @since 0.1.0
|
10 | * @category Array
|
11 | * @param {Array} array The sorted array to inspect.
|
12 | * @param {*} value The value to evaluate.
|
13 | * @returns {number} Returns the index at which `value` should be inserted
|
14 | * into `array`.
|
15 | * @example
|
16 | *
|
17 | * _.sortedIndex([30, 50], 40);
|
18 | * // => 1
|
19 | *
|
20 | * _.sortedIndex([4, 5], 4);
|
21 | * // => 0
|
22 | */
|
23 | function sortedIndex(array, value) {
|
24 | return baseSortedIndex(array, value);
|
25 | }
|
26 |
|
27 | export default sortedIndex;
|