2008-09-16 12:00:11 -06:00
|
|
|
// 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
|
|
|
|
|
2009-03-18 15:09:16 -06:00
|
|
|
import "fmt"
|
|
|
|
|
2008-09-16 12:00:11 -06:00
|
|
|
// Send the sequence 2, 3, 4, ... to channel 'ch'.
|
2009-01-15 18:54:07 -07:00
|
|
|
func generate(ch chan int) {
|
2008-09-16 12:00:11 -06:00
|
|
|
for i := 2; ; i++ {
|
2009-10-06 12:42:55 -06:00
|
|
|
ch <- i; // Send 'i' to channel 'ch'.
|
2008-09-16 12:00:11 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Copy the values from channel 'in' to channel 'out',
|
|
|
|
// removing those divisible by 'prime'.
|
2009-01-15 18:54:07 -07:00
|
|
|
func filter(in, out chan int, prime int) {
|
2008-09-16 12:00:11 -06:00
|
|
|
for {
|
2009-10-06 12:42:55 -06:00
|
|
|
i := <-in; // Receive value of new variable 'i' from 'in'.
|
|
|
|
if i%prime != 0 {
|
|
|
|
out <- i; // Send 'i' to channel 'out'.
|
2008-09-16 12:00:11 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-01-20 20:32:36 -07:00
|
|
|
// The prime sieve: Daisy-chain filter processes together.
|
2008-09-16 12:00:11 -06:00
|
|
|
func main() {
|
2009-10-06 12:42:55 -06:00
|
|
|
ch := make(chan int); // Create a new channel.
|
|
|
|
go generate(ch); // Start generate() as a goroutine.
|
2008-09-16 12:00:11 -06:00
|
|
|
for {
|
|
|
|
prime := <-ch;
|
2009-03-18 15:09:16 -06:00
|
|
|
fmt.Println(prime);
|
2009-01-06 16:49:27 -07:00
|
|
|
ch1 := make(chan int);
|
2009-01-15 18:54:07 -07:00
|
|
|
go filter(ch, ch1, prime);
|
2009-10-06 12:42:55 -06:00
|
|
|
ch = ch1;
|
2008-09-16 12:00:11 -06:00
|
|
|
}
|
|
|
|
}
|