dymokomi/luce-prism
Source of release 0.6.1
0.6.1 / src / collections / sort.lucb
## In-place lexical heapsort for borrowed text views.
from storage import less
func sift(values: str[], start: usize, count: usize):
var root = start
while root * 2 + 1 < count:
var child = root * 2 + 1
if child + 1 < count and less(values[child], values[child + 1]):
child += 1
if not less(values[root], values[child]):
return
let previous = values[root]
values[root] = values[child]
values[child] = previous
root = child
pub func text(values: str[]):
var start = values.length // 2
while start > 0:
start -= 1
sift(values, start, values.length)
var end = values.length
while end > 1:
end -= 1
let previous = values[0]
values[0] = values[end]
values[end] = previous
sift(values, 0, end)