fn pdq(comptime T: type, items: []T, context: anytype, comptime lessThanFn: fn (@TypeOf(context), T, T) bool) void
[src]
Unstable in-place sort. n best case, n*log(n) worst case and average case. log(n) memory (no allocator required).
Sorts in ascending order with respect to the given lessThan
function.