From e1cdfd27cad943290a0233119548a8dd8876bd52 Mon Sep 17 00:00:00 2001 From: Andy Belle-Isle Date: Thu, 29 Aug 2019 20:02:35 -0400 Subject: Replaced LuaBridge with sol2 and completely encapsulated scripting within script system --- lib/LuaBridge/Tests/Lua/Lua.5.1.5/test/sieve.lua | 29 ------------------------ 1 file changed, 29 deletions(-) delete mode 100644 lib/LuaBridge/Tests/Lua/Lua.5.1.5/test/sieve.lua (limited to 'lib/LuaBridge/Tests/Lua/Lua.5.1.5/test/sieve.lua') diff --git a/lib/LuaBridge/Tests/Lua/Lua.5.1.5/test/sieve.lua b/lib/LuaBridge/Tests/Lua/Lua.5.1.5/test/sieve.lua deleted file mode 100644 index 0871bb2..0000000 --- a/lib/LuaBridge/Tests/Lua/Lua.5.1.5/test/sieve.lua +++ /dev/null @@ -1,29 +0,0 @@ --- 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 math.mod(n, p) ~= 0 then coroutine.yield(n) end - end - end) -end - -N=N or 1000 -- from command line -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 -- cgit v1.2.3