code review 5656082: test: use testlib (first 100)

test/chan/sieve1.go

-// $G $D/$F.go && $L $F.$A && ./$A.out
+// run
 
 // 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.
 
 // Generate primes up to 100 using channels, checking the results.
 // This sieve consists of a linear chain of divisibility filters,
 // equivalent to trial-dividing each n by all primes p ≤ n.
 
 package main
@@ skipping 33 matching lines @@
         primes := make(chan int)
         go Sieve(primes)
         a := []int{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97}
         for i := 0; i < len(a); i++ {
                 if x := <-primes; x != a[i] {
                         println(x, " != ", a[i])
                         panic("fail")
                 }
         }
 }