From 2d1df4714e2736dbde7855ddcd76b4c1de822fa5 Mon Sep 17 00:00:00 2001
From: David Walter Seikel
Date: Mon, 23 Jan 2012 21:58:02 +1000
Subject: Added a big bunch of example lua scripts for testing the speed of lua
 compiling.

---
 .../testLua/yueliang-0.4.1/test_lua/5.0/sieve.lua  | 29 ++++++++++++++++++++++
 1 file changed, 29 insertions(+)
 create mode 100644 LuaSL/testLua/yueliang-0.4.1/test_lua/5.0/sieve.lua

(limited to 'LuaSL/testLua/yueliang-0.4.1/test_lua/5.0/sieve.lua')

diff --git a/LuaSL/testLua/yueliang-0.4.1/test_lua/5.0/sieve.lua b/LuaSL/testLua/yueliang-0.4.1/test_lua/5.0/sieve.lua
new file mode 100644
index 0000000..0871bb2
--- /dev/null
+++ b/LuaSL/testLua/yueliang-0.4.1/test_lua/5.0/sieve.lua
@@ -0,0 +1,29 @@
+-- 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.1