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
|
// Copyright 2009 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package main
type BinOp (a, b int) int;
type Request struct {
a, b int;
replyc *chan int;
}
func Run(op *BinOp, request *Request) {
result := op(request.a, request.b);
request.replyc -< result;
}
func Server(op *BinOp, service *chan *Request, quit *chan bool) {
for {
var request *Request;
select {
case request <- service: // can't say request := <-service here yet
go Run(op, request); // don't wait for it
case <-quit:
return;
}
}
}
func StartServer(op *BinOp) (servch *chan *Request, quitch *chan bool) {
service := new(chan *Request);
quit := new(chan bool);
go Server(op, service, quit);
return service, quit;
}
func main() {
adder, quit := StartServer(func(a, b int) int { return a + b });
const N = 100;
var reqs [N]Request;
for i := 0; i < N; i++ {
req := &reqs[i];
req.a = i;
req.b = i + N;
req.replyc = new(chan int);
adder -< req;
}
for i := N-1; i >= 0; i-- { // doesn't matter what order
if <-reqs[i].replyc != N + 2*i {
print("fail at ", i, "\n");
}
}
quit -< true;
}
|
