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.
|
|
|
|
|
2008-07-12 14:56:33 -06:00
|
|
|
package main
|
2008-03-11 19:07:22 -06:00
|
|
|
|
|
|
|
// Send the sequence 2, 3, 4, ... to channel 'ch'.
|
2009-01-16 17:12:14 -07:00
|
|
|
export func Generate(ch chan<- int) {
|
2008-07-15 21:52:07 -06:00
|
|
|
for i := 2; ; i++ {
|
2008-09-16 20:33:40 -06:00
|
|
|
ch <- i // Send 'i' to channel 'ch'.
|
2008-07-15 21:52:07 -06:00
|
|
|
}
|
2008-03-11 19:07:22 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
// Copy the values from channel 'in' to channel 'out',
|
|
|
|
// removing those divisible by 'prime'.
|
2009-01-16 17:12:14 -07:00
|
|
|
export func Filter(in <-chan int, out chan<- int, prime int) {
|
2008-07-15 21:52:07 -06:00
|
|
|
for {
|
2008-10-07 13:31:31 -06:00
|
|
|
i := <-in; // Receive value of new variable 'i' from 'in'.
|
2008-07-15 21:52:07 -06:00
|
|
|
if i % prime != 0 {
|
2008-09-16 20:33:40 -06:00
|
|
|
out <- i // Send 'i' to channel 'out'.
|
2008-07-15 21:52:07 -06:00
|
|
|
}
|
|
|
|
}
|
2008-03-11 19:07:22 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
// The prime sieve: Daisy-chain Filter processes together.
|
2009-01-16 17:12:14 -07:00
|
|
|
export func Sieve() {
|
2009-01-06 16:19:02 -07:00
|
|
|
ch := make(chan int); // Create a new channel.
|
2008-07-15 21:52:07 -06:00
|
|
|
go Generate(ch); // Start Generate() as a subprocess.
|
|
|
|
for {
|
|
|
|
prime := <-ch;
|
2008-08-11 23:07:49 -06:00
|
|
|
print(prime, "\n");
|
2009-01-06 16:19:02 -07:00
|
|
|
ch1 := make(chan int);
|
2008-07-15 21:52:07 -06:00
|
|
|
go Filter(ch, ch1, prime);
|
|
|
|
ch = ch1
|
|
|
|
}
|
2008-03-11 19:07:22 -06:00
|
|
|
}
|
|
|
|
|
2008-07-12 14:56:33 -06:00
|
|
|
func main() {
|
2008-06-27 12:36:40 -06:00
|
|
|
Sieve()
|
2008-03-11 19:07:22 -06:00
|
|
|
}
|