@extra-array/bsearch-right/index.mjs

Binary searches rightmost value in sorted array.

import id from './_id';
import cmp from './_cmp';
/**
 * Binary searches rightmost value in sorted array.
 * @param x an array (sorted)
 * @param v search value
 * @param fc compare function (a, b)
 * @param fm map function (v, i, x)
 * @returns last index of value | ~(index of closest value)
 */
function bsearchRight(x, v, fc = null, fm = null) {
    var fc = fc || cmp, fm = fm || id;
    var v1 = fm(v, 0, null);
    for (var i = 0, I = x.length; i < I;) {
        var m = i + I >>> 1;
        var u1 = fm(x[m], m, x);
        var c = fc(u1, v1);
        if (c <= 0)
            i = m + 1;
        else
            I = m;
    }
    return i <= 0 || fc(fm(x[i - 1], i - 1, x), v1) !== 0 ? ~i : i - 1;
}
export default bsearchRight;
//# sourceMappingURL=index.js.map