retroforth/example/Primes.forth
crc 3baec011f8 in which array: is shortend to a:
FossilOrigin-Name: 8ef48cdc551a339b816fe6123e164ced7367a1b96c081a1920cdfd3c942f1a65
2019-04-24 14:02:15 +00:00

24 lines
456 B
Forth

This is a quick and dirty way to find prime numbers in a set.
~~~
{{
#2 'NextPrime var<n>
:extract (s-s)
[ @NextPrime dup-pair eq?
[ drop-pair TRUE ]
[ mod n:-zero? ] choose ] a:filter ;
---reveal---
:get-primes (s-s)
#2 !NextPrime
dup fetch [ extract &NextPrime v:inc ] times ;
}}
~~~
And a test:
~~~
:create-set (-a)
here #3000 , #2 #3002 [ dup , n:inc ] times drop ;
create-set get-primes [ n:put sp ] a:for-each
~~~