mirror of
https://github.com/luau-lang/luau.git
synced 2025-01-10 13:29:09 +00:00
906a00d498
* General - Fix the benchmark require wrapper function to work in Lua - Fix memory leak in the new Luau C API test * New Solver - Luau: 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 should be reported 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 Luau used-defined type functions not having all environments initialized - Infer types of globals under new type solver * Fragment Autocomplete - Miscellaneous fixes to make interop with the old solver better * Runtime - Support disabling specific Luau built-in functions from being fast-called or constant-evaluated - Added constant folding for vector arithmetic - Added constant propagation and type inference for Vector3 globals ---------------------------------------------------------- 9 contributors: 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>
43 lines
1 KiB
Lua
43 lines
1 KiB
Lua
--[[
|
|
The Great Computer Language Shootout
|
|
http://shootout.alioth.debian.org/
|
|
contributed by Isaac Gouy
|
|
]]
|
|
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 ack(m,n)
|
|
if (m==0) then return n+1; end
|
|
if (n==0) then return ack(m-1,1); end
|
|
return ack(m-1, ack(m,n-1) );
|
|
end
|
|
|
|
local function fib(n)
|
|
if (n < 2) then return 1; end
|
|
return fib(n-2) + fib(n-1);
|
|
end
|
|
|
|
local function tak(x,y,z)
|
|
if (y >= x) then return z; end
|
|
return tak(tak(x-1,y,z), tak(y-1,z,x), tak(z-1,x,y));
|
|
end
|
|
|
|
local result = 0;
|
|
|
|
for i = 3,5 do
|
|
result = result + ack(3,i);
|
|
result = result + fib(17+i);
|
|
result = result + tak(3*i+3,2*i+2,i+1);
|
|
end
|
|
|
|
local expected = 57775;
|
|
|
|
if (result ~= expected) then
|
|
assert(false, "ERROR: bad result: expected " .. expected .. " but got " .. result);
|
|
end
|
|
|
|
end
|
|
|
|
bench.runCode(test, "controlflow-recursive")
|