Alex T

Introduce takewhile/dropwhile

5

A primitive to idiomatically look for the first elements which fulfill some condition would be useful. For example, in [the (contrived) example](https://uiua.org/pad?src=0_17_0-dev_1__4oqZ4peM4o2cbm93KOKWveKfnDwxMCnih6EzZTYK4oqZ4peM4o2cbm93KOKGmS8r4oq4PDEwKeKHoTNlNgriipnil4zijZxub3co4oaZMTAp4oehM2U2Cg==) of finding the first elements which are smaller...

Introduce bisection primitive

2

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...