Introduce bisection primitive

[tmpr]

I would appreciate some dyadic primitive which accepts as a first argument a sorted array and computes the second argument's rank in the first array in logarithmic time using binary search, similar to BQN bins.

[kaikalii]

Bins is non-trivial to implement yourself, but I can't remember a time when I've actually needed it. Do you have an example?

[tmpr]

I was trying to implement interval-trees in Uiua (I also wrote a blog-post about it.) --
a tldr is that I would like to be able to take elements up to a certain index from a sorted array, but doing so using do is rather slow. Either some version of a takewhile (which I propose in #709) or a binsearch would do help there.