Þ - Sort By Key Function
Tags: hyper , array
The resulting link's arity is the same as the consumed link's arity. Note that the arity refers to that of the resulting link, not the number of links this quick consumes.
Stable sort by some key function.
If given a nilad, this will produce a nilad; however, it errors when you actually try to call it. If given a dyad, the resulting link is also a dyad, and it will apply the key function to each element in the left argument with the same right argument each time.
<monad/dyad>Þ- sort by key function