git.iko.soy/urbit.org
on master help sign in
updated sieve.hoon to new syntax as well
4016255Joshua Reagan
docs/hoon/examples.md+14−14
compare with master
unifiedsplit
@@ -20,24 +20,24 @@ A function that produces the list of primes less than or equal to
20its argument, an atom:
20its argument, an atom:
21
21
22```
22```
23−|= thru/@ :: 1
23+|= thru=@ :: 1
24^- (list @) :: 2
24^- (list @) :: 2
25−=/ field/(set @) (silt (gulf 2 thru)) :: 3
25+=/ field=(set @) (sy (gulf 2 thru)) :: 3
26=< abet:main :: 4
26=< abet:main :: 4
27|% :: 5
27|% :: 5
28++ abet :: 6
28++ abet :: 6
29 (sort ~(tap in field) lth) :: 7
29 (sort ~(tap in field) lth) :: 7
30:: :: 8
30:: :: 8
31++ main :: 9
31++ main :: 9
32− =/ factor/@ 2 :: 10
32+ =/ factor=@ 2 :: 10
33 |- ^+ ..main :: 11
33 |- ^+ ..main :: 11
34 ?: (gth (mul factor factor) thru) :: 12
34 ?: (gth (mul factor factor) thru) :: 12
35 ..main :: 13
35 ..main :: 13
36 $(factor +(factor), ..main (reap factor)) :: 14
36 $(factor +(factor), ..main (reap factor)) :: 14
37:: :: 15
37:: :: 15
38++ reap :: 16
38++ reap :: 16
39− |= factor/@ :: 17
39+ |= factor=@ :: 17
40− =/ count/@ (mul 2 factor) :: 18
40+ =/ count=@ (mul 2 factor) :: 18
41 |- ^+ ..reap :: 19
41 |- ^+ ..reap :: 19
42 ?: (gth count thru) :: 20
42 ?: (gth count thru) :: 20
43 ..reap :: 21
43 ..reap :: 21
@@ -51,9 +51,9 @@ its argument, an atom:
51## `sieve`: explanation
51## `sieve`: explanation
52
52
53```
53```
54−|= thru/@ :: 1
54+|= thru=@ :: 1
55^- (list @) :: 2
55^- (list @) :: 2
56−=/ field/(set @) (silt (gulf 2 thru)) :: 3
56+=/ field=(set @) (sy (gulf 2 thru)) :: 3
57```
57```
58
58
59Line `1`: we are building a gate (function) whose sample
59Line `1`: we are building a gate (function) whose sample
@@ -62,7 +62,7 @@ Line `1`: we are building a gate (function) whose sample
62Line `2`: the product of this gate is a list of atoms.
62Line `2`: the product of this gate is a list of atoms.
63
63
64Line `3`: we introduce a variable `field`, whose type is a set of
64Line `3`: we introduce a variable `field`, whose type is a set of
65−atoms. The `silt` function converts a list to a set. The `gulf`
65+atoms. The `sy` function converts a list to a set. The `gulf`
66function creates the range `2` through `thru` inclusive, as a
66function creates the range `2` through `thru` inclusive, as a
67list of atoms.
67list of atoms.
68
68
@@ -90,7 +90,7 @@ the set as a list. We sort this list in ascending order with
90
90
91```
91```
92++ main :: 9
92++ main :: 9
93− =/ factor/@ 2 :: 10
93+ =/ factor=@ 2 :: 10
94 |- ^+ ..main :: 11
94 |- ^+ ..main :: 11
95```
95```
96
96
@@ -116,8 +116,8 @@ replacing the core with a version sieved by `reap`.
116
116
117```
117```
118++ reap :: 16
118++ reap :: 16
119− |= factor/@ :: 17
119+ |= factor=@ :: 17
120− =/ count/@ (mul 2 factor) :: 18
120+ =/ count=@ (mul 2 factor) :: 18
121```
121```
122
122
123Lines `16` and `17`: the `reap` arm, which produces a gate that
123Lines `16` and `17`: the `reap` arm, which produces a gate that
@@ -149,9 +149,9 @@ multiple of `factor`, and deleting it from `field`.
149
149
150Finally, the same code in a more concise "kernel" style.
150Finally, the same code in a more concise "kernel" style.
151```
151```
152−|= top/@
152+|= top=@
153^- (list @)
153^- (list @)
154−=+ fed=(silt (gulf 2 top))
154+=+ fed=(sy (gulf 2 top))
155=< abet:main
155=< abet:main
156|%
156|%
157++ abet (sort (~(tap in fed)) lth)
157++ abet (sort (~(tap in fed)) lth)
@@ -163,7 +163,7 @@ Finally, the same code in a more concise "kernel" style.
163 $(fac +(fac), ..main (reap fac))
163 $(fac +(fac), ..main (reap fac))
164::
164::
165++ reap
165++ reap
166− |= fac/@
166+ |= fac=@
167 =+ cot=(mul 2 fac)
167 =+ cot=(mul 2 fac)
168 |- ^+ ..reap
168 |- ^+ ..reap
169 ?: (gth cot top)
169 ?: (gth cot top)