/
ChanInt.dot.go
263 lines (240 loc) · 6.3 KB
/
ChanInt.dot.go
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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
// Copyright 2017 Andreas Pannewitz. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package IsNumeric
// This file was generated with dotgo
// DO NOT EDIT - Improve the pattern!
// MakeIntChan returns a new open channel
// (simply a 'chan int' that is).
//
// Note: No 'Int-producer' is launched here yet! (as is in all the other functions).
//
// This is useful to easily create corresponding variables such as
//
// var myIntPipelineStartsHere := MakeIntChan()
// // ... lot's of code to design and build Your favourite "myIntWorkflowPipeline"
// // ...
// // ... *before* You start pouring data into it, e.g. simply via:
// for drop := range water {
// myIntPipelineStartsHere <- drop
// }
// close(myIntPipelineStartsHere)
//
// Hint: especially helpful, if Your piping library operates on some hidden (non-exported) type
// (or on a type imported from elsewhere - and You don't want/need or should(!) have to care.)
//
// Note: as always (except for PipeIntBuffer) the channel is unbuffered.
//
func MakeIntChan() chan int {
return make(chan int)
}
// ChanInt returns a channel to receive all inputs before close.
func ChanInt(inp ...int) chan int {
out := make(chan int)
go func() {
defer close(out)
for i := range inp {
out <- inp[i]
}
}()
return out
}
// ChanIntSlice returns a channel to receive all inputs before close.
func ChanIntSlice(inp ...[]int) chan int {
out := make(chan int)
go func() {
defer close(out)
for i := range inp {
for j := range inp[i] {
out <- inp[i][j]
}
}
}()
return out
}
// ChanIntFuncNok returns a channel to receive all results of act until nok before close.
func ChanIntFuncNok(act func() (int, bool)) <-chan int {
out := make(chan int)
go func() {
defer close(out)
for {
res, ok := act() // Apply action
if !ok {
return
}
out <- res
}
}()
return out
}
// ChanIntFuncErr returns a channel to receive all results of act until err != nil before close.
func ChanIntFuncErr(act func() (int, error)) <-chan int {
out := make(chan int)
go func() {
defer close(out)
for {
res, err := act() // Apply action
if err != nil {
return
}
out <- res
}
}()
return out
}
// JoinInt sends inputs on the given out channel and returns a done channel to receive one signal when inp has been drained
func JoinInt(out chan<- int, inp ...int) chan struct{} {
done := make(chan struct{})
go func() {
defer close(done)
for i := range inp {
out <- inp[i]
}
done <- struct{}{}
}()
return done
}
// JoinIntSlice sends inputs on the given out channel and returns a done channel to receive one signal when inp has been drained
func JoinIntSlice(out chan<- int, inp ...[]int) chan struct{} {
done := make(chan struct{})
go func() {
defer close(done)
for i := range inp {
for j := range inp[i] {
out <- inp[i][j]
}
}
done <- struct{}{}
}()
return done
}
// JoinIntChan sends inputs on the given out channel and returns a done channel to receive one signal when inp has been drained
func JoinIntChan(out chan<- int, inp <-chan int) chan struct{} {
done := make(chan struct{})
go func() {
defer close(done)
for i := range inp {
out <- i
}
done <- struct{}{}
}()
return done
}
// DoneInt returns a channel to receive one signal before close after inp has been drained.
func DoneInt(inp <-chan int) chan struct{} {
done := make(chan struct{})
go func() {
defer close(done)
for i := range inp {
_ = i // Drain inp
}
done <- struct{}{}
}()
return done
}
// DoneIntSlice returns a channel which will receive a slice
// of all the Ints received on inp channel before close.
// Unlike DoneInt, a full slice is sent once, not just an event.
func DoneIntSlice(inp <-chan int) chan []int {
done := make(chan []int)
go func() {
defer close(done)
IntS := []int{}
for i := range inp {
IntS = append(IntS, i)
}
done <- IntS
}()
return done
}
// DoneIntFunc returns a channel to receive one signal before close after act has been applied to all inp.
func DoneIntFunc(inp <-chan int, act func(a int)) chan struct{} {
done := make(chan struct{})
if act == nil {
act = func(a int) { return }
}
go func() {
defer close(done)
for i := range inp {
act(i) // Apply action
}
done <- struct{}{}
}()
return done
}
// PipeIntBuffer returns a buffered channel with capacity cap to receive all inp before close.
func PipeIntBuffer(inp <-chan int, cap int) chan int {
out := make(chan int, cap)
go func() {
defer close(out)
for i := range inp {
out <- i
}
}()
return out
}
// PipeIntFunc returns a channel to receive every result of act applied to inp before close.
// Note: it 'could' be PipeIntMap for functional people,
// but 'map' has a very different meaning in go lang.
func PipeIntFunc(inp <-chan int, act func(a int) int) chan int {
out := make(chan int)
if act == nil {
act = func(a int) int { return a }
}
go func() {
defer close(out)
for i := range inp {
out <- act(i)
}
}()
return out
}
// PipeIntFork returns two channels to receive every result of inp before close.
// Note: Yes, it is a VERY simple fanout - but sometimes all You need.
func PipeIntFork(inp <-chan int) (chan int, chan int) {
out1 := make(chan int)
out2 := make(chan int)
go func() {
defer close(out1)
defer close(out2)
for i := range inp {
out1 <- i
out2 <- i
}
}()
return out1, out2
}
// IntTube is the signature for a pipe function.
type IntTube func(inp <-chan int, out <-chan int)
// IntDaisy returns a channel to receive all inp after having passed thru tube.
func IntDaisy(inp <-chan int, tube IntTube) (out <-chan int) {
cha := make(chan int)
go tube(inp, cha)
return cha
}
// IntDaisyChain returns a channel to receive all inp after having passed thru all tubes.
func IntDaisyChain(inp <-chan int, tubes ...IntTube) (out <-chan int) {
cha := inp
for i := range tubes {
cha = IntDaisy(cha, tubes[i])
}
return cha
}
/*
func sendOneInto(snd chan<- int) {
defer close(snd)
snd <- 1 // send a 1
}
func sendTwoInto(snd chan<- int) {
defer close(snd)
snd <- 1 // send a 1
snd <- 2 // send a 2
}
var fun = func(left chan<- int, right <-chan int) { left <- 1 + <-right }
func main() {
leftmost := make(chan int)
right := daisyChain(leftmost, fun, 10000) // the chain - right to left!
go sendTwoInto(right)
fmt.Println(<-leftmost)
}
*/