pub fn into_inner(self) -> Vector<Value>
Asynchronous sorting algorithm in which the comparator can make use of
VM requests (required as
builtins.sort uses comparators written in
This is a simple, optimised bubble sort implementation. The choice of algorithm is constrained by the comparator in Nix not being able to yield equality, and us being unable to use the standard library implementation of sorting (which is a lot longer, but a lot more efficient) here.