mirror of
https://github.com/golang/go
synced 2024-11-14 08:20:21 -07:00
7839521335
*** Reason for rollback *** roll back the changes to the tutorial programs (only) since they break the automated processing used to create the tutorial. *** Original change description *** apply gofmt to the LGTM-marked files from 34501 that have not changed since I applied gofmt. R=rsc DELTA=139 (0 added, 44 deleted, 95 changed) OCL=35670 CL=35670
52 lines
860 B
Go
52 lines
860 B
Go
// 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
|
|
|
|
import "fmt"
|
|
|
|
// Send the sequence 2, 3, 4, ... to returned channel
|
|
func generate() chan int {
|
|
ch := make(chan int);
|
|
go func(){
|
|
for i := 2; ; i++ {
|
|
ch <- i
|
|
}
|
|
}();
|
|
return ch;
|
|
}
|
|
|
|
// Filter out input values divisible by 'prime', send rest to returned channel
|
|
func filter(in chan int, prime int) chan int {
|
|
out := make(chan int);
|
|
go func() {
|
|
for {
|
|
if i := <-in; i % prime != 0 {
|
|
out <- i
|
|
}
|
|
}
|
|
}();
|
|
return out;
|
|
}
|
|
|
|
func sieve() chan int {
|
|
out := make(chan int);
|
|
go func() {
|
|
ch := generate();
|
|
for {
|
|
prime := <-ch;
|
|
out <- prime;
|
|
ch = filter(ch, prime);
|
|
}
|
|
}();
|
|
return out;
|
|
}
|
|
|
|
func main() {
|
|
primes := sieve();
|
|
for {
|
|
fmt.Println(<-primes);
|
|
}
|
|
}
|