mirror of
https://github.com/fluencelabs/redis
synced 2025-07-09 22:01:33 +00:00
deps
hiredis
jemalloc
linenoise
lua
doc
etc
src
test
README
bisect.lua
cf.lua
echo.lua
env.lua
factorial.lua
fib.lua
fibfor.lua
globals.lua
hello.lua
life.lua
luac.lua
printf.lua
readonly.lua
sieve.lua
sort.lua
table.lua
trace-calls.lua
trace-globals.lua
xd.lua
COPYRIGHT
HISTORY
INSTALL
Makefile
README
Makefile
README.md
update-jemalloc.sh
src
tests
utils
.gitignore
00-RELEASENOTES
BUGS
CONTRIBUTING
COPYING
INSTALL
MANIFESTO
Makefile
README.md
TLS.md
redis.conf
runtest
runtest-cluster
runtest-moduleapi
runtest-sentinel
sentinel.conf
30 lines
774 B
Lua
30 lines
774 B
Lua
![]() |
-- 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
|