mirror of
https://github.com/DanielnetoDotCom/YouPHPTube
synced 2025-10-04 10:19:24 +02:00
Git update
This commit is contained in:
parent
bd8d7eedb6
commit
602ca1128e
3123 changed files with 521005 additions and 521005 deletions
48
node_modules/lodash/sortedIndex.js
generated
vendored
48
node_modules/lodash/sortedIndex.js
generated
vendored
|
@ -1,24 +1,24 @@
|
|||
var baseSortedIndex = require('./_baseSortedIndex');
|
||||
|
||||
/**
|
||||
* Uses a binary search to determine the lowest index at which `value`
|
||||
* should be inserted into `array` in order to maintain its sort order.
|
||||
*
|
||||
* @static
|
||||
* @memberOf _
|
||||
* @since 0.1.0
|
||||
* @category Array
|
||||
* @param {Array} array The sorted array to inspect.
|
||||
* @param {*} value The value to evaluate.
|
||||
* @returns {number} Returns the index at which `value` should be inserted
|
||||
* into `array`.
|
||||
* @example
|
||||
*
|
||||
* _.sortedIndex([30, 50], 40);
|
||||
* // => 1
|
||||
*/
|
||||
function sortedIndex(array, value) {
|
||||
return baseSortedIndex(array, value);
|
||||
}
|
||||
|
||||
module.exports = sortedIndex;
|
||||
var baseSortedIndex = require('./_baseSortedIndex');
|
||||
|
||||
/**
|
||||
* Uses a binary search to determine the lowest index at which `value`
|
||||
* should be inserted into `array` in order to maintain its sort order.
|
||||
*
|
||||
* @static
|
||||
* @memberOf _
|
||||
* @since 0.1.0
|
||||
* @category Array
|
||||
* @param {Array} array The sorted array to inspect.
|
||||
* @param {*} value The value to evaluate.
|
||||
* @returns {number} Returns the index at which `value` should be inserted
|
||||
* into `array`.
|
||||
* @example
|
||||
*
|
||||
* _.sortedIndex([30, 50], 40);
|
||||
* // => 1
|
||||
*/
|
||||
function sortedIndex(array, value) {
|
||||
return baseSortedIndex(array, value);
|
||||
}
|
||||
|
||||
module.exports = sortedIndex;
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue