flowsamples 0.44.0

A set of sample 'flow' programs
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

flow = "composites"

[[input]]
name = "limit"
type = "Number"

[[output]]
name = "composites"
type = "Number"

[[output]]
name = "last"
type = "Number"

# Generate a set of divisors from 2 .. SQRT(limit)
[[process]]
alias = "sqrt"
source = "lib://flowstdlib/math/sqrt"

[[connection]]
from = "input/limit"
to = "sqrt"

[[process]]
alias = "divisors"
source = "lib://flowstdlib/math/sequence"
input.start = {once =  2}
input.step = {once =  1}

[[connection]]
from = "sqrt"
to = "divisors/end"

[[process]]
source = "generate_composites"

[[connection]]
from = "divisors/sequence"
to = "generate_composites/start"

[[connection]]
from = "input/limit"
to = "generate_composites/limit"

[[connection]]
from = "generate_composites/composites"
to = "output/composites"

# accumulate a count of sub-sequences generated so we know when we're done - adding an extra 1
[[process]]
alias = "join"
source = "lib://flowstdlib/control/join"
input.data = { always =  1 }

[[connection]]
from = "generate_composites/subsequence-end"
to = "join/control"

[[process]]
alias = "subsequence-count"
source = "lib://flowstdlib/math/add"
input.i1 = { once =  1 }

[[connection]]
from = "join"
to = "subsequence-count/i2"

[[connection]]
from = "subsequence-count"
to = "subsequence-count/i1"

# compare the count of subsequences to how many we expect
[[process]]
alias = "compare"
source = "lib://flowstdlib/control/compare_switch"

[[connection]]
from = "divisors/last"
to = "compare/left"

[[connection]]
from = "subsequence-count"
to = "compare/right"

[[connection]]
from = "compare/equal"
to = "output/last"