Table.sort optimizations

[SOTR654]

@mc3334

But does the compiler optimize for me and know to only call someExpensiveFunction once per entry and then cache it, or would there be multiple calls?

As the previous person said, no, you have to do it:

local cache = {}
for _, v in pairs(t) do
	cache[v] = someExpensiveFunction(v)
end
table.sort(t, function(a, b)
	return cache[a] > cache[b]
end)