2008-03-11 19:07:22 -06:00
|
|
|
// $G $F.go && $L $F.$A # don't run it - goes forever
|
|
|
|
|
|
|
|
// 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
|
|
|
|
|
|
|
|
// Send the sequence 2, 3, 4, ... to channel 'ch'.
|
|
|
|
func Generate(ch *chan> int) {
|
|
|
|
for i := 2; ; i++ {
|
2008-06-06 14:28:03 -06:00
|
|
|
>ch = i; // Send 'i' to channel 'ch'.
|
2008-03-11 19:07:22 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Copy the values from channel 'in' to channel 'out',
|
|
|
|
// removing those divisible by 'prime'.
|
|
|
|
func Filter(in *chan< int, out *chan> int, prime int) {
|
|
|
|
for {
|
|
|
|
i := <in; // Receive value of new variable 'i' from 'in'.
|
|
|
|
if i % prime != 0 {
|
2008-06-06 14:28:03 -06:00
|
|
|
>out = i; // Send 'i' to channel 'out'.
|
2008-03-11 19:07:22 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// The prime sieve: Daisy-chain Filter processes together.
|
|
|
|
func Sieve() {
|
|
|
|
ch := new(chan int); // Create a new channel.
|
|
|
|
go Generate(ch); // Start Generate() as a subprocess.
|
|
|
|
for {
|
|
|
|
prime := <ch;
|
2008-05-01 19:48:52 -06:00
|
|
|
print "%d\n", prime;
|
2008-03-11 19:07:22 -06:00
|
|
|
ch1 := new(chan int);
|
|
|
|
go Filter(ch, ch1, prime);
|
2008-06-06 14:28:03 -06:00
|
|
|
ch = ch1;
|
2008-03-11 19:07:22 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func Main() {
|
2008-06-06 14:28:03 -06:00
|
|
|
Sieve();
|
2008-03-11 19:07:22 -06:00
|
|
|
}
|