mirror of
https://github.com/luau-lang/luau.git
synced 2025-01-19 17:28:06 +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>
45 lines
No EOL
1.2 KiB
Lua
45 lines
No EOL
1.2 KiB
Lua
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()
|
|
|
|
-- the sieve of of Eratosthenes programmed with coroutines
|
|
-- typical usage: lua -e N=1000 sieve.lua | column
|
|
|
|
-- generate all the numbers from 2 to n
|
|
function gen (n)
|
|
return coroutine.wrap(function ()
|
|
for i=2,n do coroutine.yield(i) end
|
|
end)
|
|
end
|
|
|
|
-- filter the numbers generated by `g', removing multiples of `p'
|
|
function filter (p, g)
|
|
return coroutine.wrap(function ()
|
|
while 1 do
|
|
local n = g()
|
|
if n == nil then return end
|
|
if n % p ~= 0 then coroutine.yield(n) end
|
|
end
|
|
end)
|
|
end
|
|
|
|
local ts0 = os.clock()
|
|
|
|
for loops=1,100 do
|
|
N = 1000
|
|
x = gen(N) -- generate primes up to N
|
|
while 1 do
|
|
local n = x() -- pick a number until done
|
|
if n == nil then break end
|
|
-- print(n) -- must be a prime number
|
|
x = filter(n, x) -- now remove its multiples
|
|
end
|
|
end
|
|
|
|
local ts1 = os.clock()
|
|
|
|
return ts1-ts0
|
|
end
|
|
|
|
bench.runCode(test, "sieve") |