* Uses a binary search to determine the smallest index at which a value * should be inserted into a given sorted array in order to maintain the sort * order of the array. If a callback is provided it will be executed for * `value` and each element of `array` to compute their sort rank
(array, value, callback, thisArg)
source not stored for this graph (policy: none)