Alex T
Alex T
This is only fast since the loop in the example terminates fast. Filtering for elements < 10'000 has `TW!` slower than `↙/+⊸
An alternative thing would be to have some primitive to find the first (or last) index at which some proposition holds. This would then easily be composable with `take` to...
I was trying to implement interval-trees in Uiua (I also wrote a [blog-post](https://tmpr.github.io/blog/intervaltrees/) about it.) -- a **tldr** is that I would like to be able to take elements up...