-IN: benchmark.nsieve
USING: math math.parser sequences sequences.private kernel
-arrays namespaces io ;
+arrays make io ;
+IN: benchmark.nsieve
: clear-flags ( step i seq -- )
2dup length >= [
3drop
] [
- f 2over set-nth-unsafe >r over + r> clear-flags
+ f 2over set-nth-unsafe [ over + ] dip clear-flags
] if ; inline recursive
: (nsieve) ( count i seq -- count )
2dup length < [
2dup nth-unsafe [
over dup 2 * pick clear-flags
- rot 1+ -rot ! increment count
- ] when >r 1+ r> (nsieve)
+ rot 1 + -rot ! increment count
+ ] when [ 1 + ] dip (nsieve)
] [
2drop
] if ; inline recursive
: nsieve ( m -- count )
- 0 2 rot 1+ t <array> (nsieve) ;
+ 0 2 rot 1 + t <array> (nsieve) ;
: nsieve. ( m -- )
[ "Primes up to " % dup # " " % nsieve # ] "" make print ;