// Copyright 2012 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.
// +build ignore
package main
import (
"fmt"
"code.google.com/p/go-tour/tree"
)
func walkImpl(t *tree.Tree, ch chan int) {
if t == nil {
return
}
walkImpl(t.Left, ch)
ch <- t.Value
walkImpl(t.Right, ch)
}
// Walk walks the tree t sending all values
// from the tree to the channel ch.
func Walk(t *tree.Tree, ch chan int) {
walkImpl(t, ch)
// Need to close the channel here
close(ch)
}
// Same determines whether the trees
// t1 and t2 contain the same values.
// NOTE: The implementation leaks goroutines when trees are different.
// See binarytrees_quit.go for a better solution.
func Same(t1, t2 *tree.Tree) bool {
w1, w2 := make(chan int), make(chan int)
go Walk(t1, w1)
go Walk(t2, w2)
for {
v1, ok1 := <-w1
v2, ok2 := <-w2
if !ok1 || !ok2 {
return ok1 == ok2
}
if v1 != v2 {
return false
}
}
}
func main() {
fmt.Print("tree.New(1) == tree.New(1): ")
if Same(tree.New(1), tree.New(1)) {
fmt.Println("PASSED")
} else {
fmt.Println("FAILED")
}
fmt.Print("tree.New(1) != tree.New(2): ")
if !Same(tree.New(1), tree.New(2)) {
fmt.Println("PASSED")
} else {
fmt.Println("FAILED")
}
}
在此代码中,http://tour.golang.org/concurrency/8的解决方案
为什么对Same()函数Same(t1,t2 * tree.Tree)bool有评论说它泄漏goroutine?怎么会这样?它还提到了解决此问题的第二个文件:
// Copyright 2015 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.
// +build ignore
package main
import (
"fmt"
"code.google.com/p/go-tour/tree"
)
func walkImpl(t *tree.Tree, ch, quit chan int) {
if t == nil {
return
}
walkImpl(t.Left, ch, quit)
select {
case ch <- t.Value:
// Value successfully sent.
case <-quit:
return
}
walkImpl(t.Right, ch, quit)
}
// Walk walks the tree t sending all values
// from the tree to the channel ch.
func Walk(t *tree.Tree, ch, quit chan int) {
walkImpl(t, ch, quit)
close(ch)
}
// Same determines whether the trees
// t1 and t2 contain the same values.
func Same(t1, t2 *tree.Tree) bool {
w1, w2 := make(chan int), make(chan int)
quit := make(chan int)
defer close(quit)
go Walk(t1, w1, quit)
go Walk(t2, w2, quit)
for {
v1, ok1 := <-w1
v2, ok2 := <-w2
if !ok1 || !ok2 {
return ok1 == ok2
}
if v1 != v2 {
return false
}
}
}
func main() {
fmt.Print("tree.New(1) == tree.New(1): ")
if Same(tree.New(1), tree.New(1)) {
fmt.Println("PASSED")
} else {
fmt.Println("FAILED")
}
fmt.Print("tree.New(1) != tree.New(2): ")
if !Same(tree.New(1), tree.New(2)) {
fmt.Println("PASSED")
} else {
fmt.Println("FAILED")
}
}
它是如何做到的?这个泄漏在哪里? (要测试代码,您必须在http://tour.golang.org/concurrency/8上运行它)。非常困惑,不胜感激,谢谢!
最佳答案
当检测到差异时,程序将停止在 channel 上接收。
步态goroutine一直运行,直到它们阻止发送到 channel 为止。他们从不退出。这就是泄漏。
关于memory-leaks - Golang Goroutine泄漏,我们在Stack Overflow上找到一个类似的问题:https://stackoverflow.com/questions/29190333/