package haxe.dsAvailable on all platforms
ListSort provides a stable implementation of merge sort through its
sortmethod. It has a O(N.log(N)) complexity and does not require additional memory allocation.
lst according to the comparison function
cmp(x,y) returns 0 if
x == y, a positive Int if
x > y and a negative Int if
x < y.
This operation modifies List
a in place and returns its head once modified. The
prev of the head is set to the tail of the sorted list.
cmp are null, the result is unspecified.
static inline sortSingleLinked<T> (list:T, cmp:T ‑> T ‑> Int):T
sort but on single linked list.
© 2005–2018 Haxe Foundation
Licensed under a MIT license.