Ultra performant binary search to find nearest less than a value

indexOfNearestLessThan.js

function indexOfNearestLessThan(array, needle) {
	if (array.length === 0) return -1;

	var high = array.length - 1,
		low = 0,
		mid,
		item,
		target = -1;
	
	if (array[high] < needle) {
		return high;
	}

	while (low <= high) {
		mid = (low + high) >> 1;
		item = array[mid];
		if (item > needle) {
			high = mid - 1;
		} else if (item < needle) {
			target = mid;
			low = mid + 1;
		} else {
			return low;
		}
	}

	return target;
}

return mid; instead of return low;

I could be wrong but: indexOfNearest Less Than.

yeah, sorry. After a moment I understood that my task is less or equal :)
Thank you!!!

🙇