#go

这个 go 写的并发素数筛太妙了

// A concurrent prime sieve

package main

// Send the sequence 2, 3, 4, ... to channel 'ch'.
func Generate(ch chan&LT- int) {
 for i := 2; ; i++ {
  ch &LT- i // Send 'i' to channel 'ch'.
 }
}

// Copy the values from channel 'in' to channel 'out',
// removing those divisible by 'prime'.
func Filter(in &LT-chan int, out chan&LT- int, prime int) {
 for {
  i := &LT-in // Receive value from 'in'.
  if i%prime != 0 {
   out &LT- i // Send 'i' to 'out'.
  }
 }
}

// The prime sieve: Daisy-chain Filter processes.
func main() {
 ch := make(chan int) // Create a new channel.
 go Generate(ch)      // Launch Generate goroutine.
 for i := 0; i < 10; i++ {
  prime := &LT-ch
  print(prime, "\n")
  ch1 := make(chan int)
  go Filter(ch, ch1, prime)
  ch = ch1
 }
}

● https://golang.org/s/prime-sieve
● help understand: https://www.reddit.com/r/golang/comments/434zry/help_understanding_this_prime_sieve_concurrent/

via Memos