0
0
Fork 0
mirror of https://git.sr.ht/~rabbits/uxn synced 2024-11-30 17:53:01 +00:00
uxn/projects/examples/exercises/primes.tal
2022-03-10 09:37:11 -08:00

43 lines
785 B
Tal

(
An integer greater than one is called a prime number
if its only positive divisors are one and itself. )
|0100 ( -> ) @main
#0000 #0001
&loop
DUP2 ,is-prime JSR #00 EQU ,&skip JCN
DUP2 ,print/short JSR
#20 ( emit ) #18 DEO
&skip
INC2 NEQ2k ,&loop JCN
POP2 POP2
#0101 #0e DEO2
BRK
@is-prime ( number* -- flag )
DUP2 #0001 NEQ2 ,&not-one JCN
POP2 #00 JMP2r
&not-one
STH2k
( range ) #01 SFT2 #0002
&loop
STH2kr OVR2 ( mod2 ) [ DIV2k MUL2 SUB2 ] ORA ,&continue JCN
POP2 POP2
POP2r #00 JMP2r
&continue
INC2 GTH2k ,&loop JCN
POP2 POP2
POP2r #01
JMP2r
@print ( short* -- )
&short ( short* -- ) SWP ,&byte JSR
&byte ( byte -- ) DUP #04 SFT ,&char JSR
&char ( char -- ) #0f AND DUP #09 GTH #27 MUL ADD #30 ADD ( emit ) #18 DEO
JMP2r