luau/bench/tests/sunspider/fannkuch.lua

92 lines
2.1 KiB
Lua
Raw Normal View History

--[[
The Great Computer Language Shootout
http://shootout.alioth.debian.org/
contributed by Isaac Gouy
]]
Sync to upstream/release/655 (#1563) ## New Solver * Type functions should be able to signal whether or not irreducibility is due to an error * Do not generate extra expansion constraint for uninvoked user-defined type functions * Print in a user-defined type function reports as an error instead of logging to stdout * Many e-graphs bugfixes and performance improvements * Many general bugfixes and improvements to the new solver as a whole * Fixed issue with used-defined type functions not being able to call each other * Infer types of globals under new type solver ## Fragment Autocomplete * Miscellaneous fixes to make interop with the old solver better ## Runtime * Support disabling specific built-in functions from being fast-called or constant-evaluated (Closes #1538) * New compiler option `disabledBuiltins` accepts a list of library function names like "tonumber" or "math.cos" * Added constant folding for vector arithmetic * Added constant propagation and type inference for vector globals (Fixes #1511) * New compiler option `librariesWithKnownMembers` accepts a list of libraries for members of which a request for constant value and/or type will be made * `libraryMemberTypeCb` callback is called to get the type of a global, return one of the `LuauBytecodeType` values. 'boolean', 'number', 'string' and 'vector' type are supported. * `libraryMemberConstantCb` callback is called to setup the constant value of a global. To set a value, C API `luau_set_compile_constant_*` or C++ API `setCompileConstant*` functions should be used. --- Co-authored-by: Aaron Weiss <aaronweiss@roblox.com> Co-authored-by: Andy Friesen <afriesen@roblox.com> Co-authored-by: Aviral Goel <agoel@roblox.com> Co-authored-by: Daniel Angel <danielangel@roblox.com> Co-authored-by: Jonathan Kelaty <jkelaty@roblox.com> Co-authored-by: Hunter Goldstein <hgoldstein@roblox.com> Co-authored-by: Varun Saini <vsaini@roblox.com> Co-authored-by: Vighnesh Vijay <vvijay@roblox.com> Co-authored-by: Vyacheslav Egorov <vegorov@roblox.com> --------- Co-authored-by: Aaron Weiss <aaronweiss@roblox.com> Co-authored-by: Alexander McCord <amccord@roblox.com> Co-authored-by: Andy Friesen <afriesen@roblox.com> Co-authored-by: Aviral Goel <agoel@roblox.com> Co-authored-by: David Cope <dcope@roblox.com> Co-authored-by: Lily Brown <lbrown@roblox.com> Co-authored-by: Vyacheslav Egorov <vegorov@roblox.com> Co-authored-by: Junseo Yoo <jyoo@roblox.com> Co-authored-by: Hunter Goldstein <hgoldstein@roblox.com> Co-authored-by: Varun Saini <61795485+vrn-sn@users.noreply.github.com> Co-authored-by: Alexander Youngblood <ayoungblood@roblox.com> Co-authored-by: Varun Saini <vsaini@roblox.com> Co-authored-by: Andrew Miranti <amiranti@roblox.com> Co-authored-by: Shiqi Ai <sai@roblox.com> Co-authored-by: Yohoo Lin <yohoo@roblox.com> Co-authored-by: Daniel Angel <danielangel@roblox.com> Co-authored-by: Jonathan Kelaty <jkelaty@roblox.com>
2024-12-13 21:02:30 +00:00
local function prequire(name) local success, result = pcall(require, name); return success and result end
local bench = script and require(script.Parent.bench_support) or prequire("bench_support") or require("../../bench_support")
function test()
local function fannkuch(n)
local check = 0;
local perm = {};
local perm1 = {};
local count = {};
local maxPerm = {};
local maxFlipsCount = 0;
local m = n - 1;
for i = 1,n do perm1[i] = i - 1; end
local r = n;
while (true) do
-- write-out the first 30 permutations
if (check < 30) then
local s = "";
for i = 1,n do s = s .. tostring(perm1[i]+1); end
check = check + 1;
end
while (r ~= 1) do count[r] = r; r = r - 1; end
if (not (perm1[1] == 0 or perm1[m + 1] == m)) then
for i = 1,n do perm[i] = perm1[i]; end
local flipsCount = 0;
local k;
k = perm[1]
while (not (k == 0)) do
local k2 = math.floor((k + 1) / 2);
for i = 0,k2-1 do
local temp = perm[i + 1];
perm[i + 1] = perm[k - i + 1];
perm[k - i + 1] = temp;
end
flipsCount = flipsCount + 1;
k = perm[1]
end
if (flipsCount > maxFlipsCount) then
maxFlipsCount = flipsCount;
for i = 1,n do maxPerm[i] = perm1[i]; end
end
end
while (true) do
if (r == n) then return maxFlipsCount; end
local perm0 = perm1[1];
local i = 0;
while (i < r) do
local j = i + 1;
perm1[i + 1] = perm1[j + 1];
i = j;
end
perm1[r + 1] = perm0;
count[r + 1] = count[r + 1] - 1;
if (count[r + 1] > 0) then break; end
r = r + 1;
end
end
return 0
end
local n = 8;
local ret = fannkuch(n);
local expected = 22;
if (ret ~= expected) then
assert(false, "ERROR: bad result: expected " .. expected .. " but got " .. ret);
end
end
bench.runCode(test, "fannkuch")