-
Notifications
You must be signed in to change notification settings - Fork 2
/
prime.or
148 lines (148 loc) · 2.54 KB
/
prime.or
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
; Prints either 'Prime' or the smallest prime divisor of the argument
0 0 l
1 0 0
2 0 254
3 0 255
4 0 #
; (255,254) holds our 'running total'
5 0 0
6 0 254
7 0 254
; (254,254) holds our index into the argument
8 0 0
9 0 ?
10 0 cw
; This is the entry point, when we return to the 'loop'.
11 0 254
12 0 255
13 0 =
14 0 10
15 0 *
; Multiply old total by 10
16 0 255
17 0 254
18 0 254
19 0 =
20 0 =
21 0 '0
22 0 -
23 0 +
; add the converted character from index
24 0 254
25 0 255
26 0 #
27 0 cw
27 1 cw
; store it
26 1 254
25 1 254
24 1 =
23 1 1
22 1 +
21 1 @
; This duplicate is for below, where we check for nul
20 1 254
19 1 254
18 1 #
; increment index
17 1 255
16 1 ~
15 1 =
14 1 nop
13 1 nop
12 1 nop
11 1 ?
10 1 cw
; if index points to nul, go to where to prime part
; else loop
9 1 ccw
9 2 2
9 3 254
9 4 254
9 5 #
; n
; Store initial divisor of 2
9 6 254
9 7 255
9 8 =
9 9 0
9 10 ?
9 11 ccw
; Re-entry point for loop
; Get number on stack
9 12 @
; n n
9 13 254
9 14 254
9 15 =
9 16 -
9 17 !
9 18 ?
9 19 cw
; If divisor and number are equal, print 'Prime'
8 19 0
7 19 'e
6 19 'm
5 19 'i
4 19 'r
3 19 'P
2 19 s
1 19 0
0 19 c
255 19 0
254 19 ret
; else test division
9 20 @
; n n
9 21 254
9 22 254
9 23 =
; n n d
9 24 ccw
10 24 ccw
10 23 %
10 22 !
10 21 ?
10 20 cw
; If mod == 0, that's a factor
11 20 254
12 20 254
13 20 =
14 20 d
15 20 0
16 20 c
17 20 0
18 20 ret
; else increment divisor
; n
10 19 254
10 18 254
10 17 =
10 16 1
10 15 +
10 14 254
10 13 254
10 12 #
; and loop
10 11 ccw
; MIT License
;
; Copyright (c) 1994, 2016 Jeff Epler
;
; Permission is hereby granted, free of charge, to any person obtaining a copy
; of this software and associated documentation files (the "Software"), to deal
; in the Software without restriction, including without limitation the rights
; to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
; copies of the Software, and to permit persons to whom the Software is
; furnished to do so, subject to the following conditions:
;
; The above copyright notice and this permission notice shall be included in all
; copies or substantial portions of the Software.
;
; THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
; IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
; FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
; AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
; LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
; OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
; SOFTWARE.