Function findInsertPos

web/src/js/ducks/flows/_utils.ts:98–121

(
    list: T[],
    item: T,
    sort: Comparer<T>,
)

/// Find the insertion position in a sorted array.
export function findInsertPos<T>(
    list: T[],
    item: T,
    sort: Comparer<T>,
): number {
    let low = 0,
        high = list.length;

    // fast path: insert at end
    if (high === 0 || sort(list[high - 1], item) <= 0) {
        return high;
    }

    while (low < high) {
        const middle = (low + high) >>> 1;
        if (sort(item, list[middle]) >= 0) {
            low = middle + 1;
        } else {
            high = middle;
        }
    }

    return low;
}