Esempi in Golang per New

Esempio n. 1

File: equivalenttree.go Progetto: ng-vu/Exercise

func main() {
	t1 := tree.New(1)
	t2 := tree.New(1)
	fmt.Println("t1:", t1)
	fmt.Println("t2:", t2)
	fmt.Println(Same(t1, t2))
}

Esempio n. 2

File: trees_test.go Progetto: matijavizintin/tour-of-go

func TestSame(t *testing.T) {
	result := Same(tree.New(1), tree.New(1))
	fmt.Println(result)

	result = Same(tree.New(1), tree.New(2))
	fmt.Println(result)
}

Esempio n. 3

File: go_binarytree.go Progetto: Skarlso/gotour

func main() {

	ch := make(chan int)
	go Walk(tree.New(1), ch)
	fmt.Println(Same(tree.New(1), tree.New(1)))
	fmt.Println(Same(tree.New(1), tree.New(2)))
}

Esempio n. 4

File: tree_test.go Progetto: alexzabolotny/go-bootcamp

func TestWalk(t *testing.T) {
	cases := []struct {
		in   *tree.Tree
		want [10]int
	}{
		{tree.New(1), [10]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}},
		{tree.New(2), [10]int{2, 4, 6, 8, 10, 12, 14, 16, 18, 20}},
	}

	for _, c := range cases {
		ch := make(chan int)
		go Walk(c.in, ch)

		var walked [10]int

		i := 0
		for v := range ch {
			walked[i] = v
			i++
		}

		if walked != c.want {
			t.Errorf("got: %v", walked)
		} else {
			fmt.Print(".")
		}
	}
}

Esempio n. 5

File: exercise-equivalent-binary-trees.go Progetto: fernandoalmeida/studies

func main() {
	if Same(tree.New(1), tree.New(1)) && !Same(tree.New(1), tree.New(2)) {
		fmt.Println("PASSED")
	} else {
		fmt.Println("FAILED")
	}
}

Esempio n. 6

File: btrees.go Progetto: filipegoncalves/go-samples

func main() {
	for i := 0; i < 10; i++ {
		fmt.Println("Same(tree.New(1), tree.New(1)) =", Same(tree.New(1), tree.New(1)))
	}
	for i := 0; i < 10; i++ {
		fmt.Println("Same(tree.New(1), tree.New(2)) =", Same(tree.New(1), tree.New(2)))
	}
}

Esempio n. 7

File: exercise-equivalent-binary-trees.go Progetto: frankobe/goTourExerciseSolution

func main() {
	//  ch := make(chan int)
	//  go Walk(tree.New(2), ch)
	//  for v := range ch {
	//    fmt.Print(v)
	//  }
	fmt.Println(Same(tree.New(1), tree.New(1)))
	fmt.Println(Same(tree.New(1), tree.New(2)))
}

Esempio n. 8

File: equivalent_binary_trees.go Progetto: dontuta/GoLanguage

func main() {
	ch := make(chan int, 10)
	go Walk(tree.New(1), ch)
	for i := 0; i < cap(ch); i++ {
		fmt.Println(<-ch)
	}
	fmt.Println(Same(tree.New(1), tree.New(1)))
	fmt.Println(Same(tree.New(1), tree.New(2)))
}

Esempio n. 9

File: 12_EquivalentBT.go Progetto: NewRegin/Golang

func main() {

	t1 := tree.New(1)
	t2 := tree.New(2)
	t3 := tree.New(1)
	//New（）生成的树为二叉搜索树，这个方法只能解决二叉搜索树的等价分析问题。
	fmt.Println(Same(t1, t3))
	fmt.Println(Same(t1, t2))
}

Esempio n. 10

File: exercise-equivalent-binary-trees.go Progetto: bisco/shakyo

func main() {
	ch := make(chan int)
	go Walk(tree.New(1), ch)
	for i := range ch {
		fmt.Println(i)
	}
	fmt.Println(Same(tree.New(1), tree.New(1)))
	fmt.Println(Same(tree.New(1), tree.New(2)))
}

Esempio n. 11

File: 73-exercise-equivalent-binary-trees.go Progetto: FulcronZ/GoTour

func main() {
	ch := make(chan int)
	go Walk(tree.New(1), ch)
	for i := 1; i <= 10; i++ {
		fmt.Println(<-ch)
	}

	fmt.Println(Same(tree.New(1), tree.New(1)))
	fmt.Println(Same(tree.New(1), tree.New(2)))
}

Esempio n. 12

File: exercise-equivalent-binary-trees.go Progetto: Tao-Ma/practise

func main() {
	ch := make(chan int)
	t := tree.New(1)
	go func() { Walk(t, ch); close(ch) }()
	for i := range ch {
		fmt.Println(i)
	}

	fmt.Println(Same(tree.New(1), tree.New(1)))
	fmt.Println(Same(tree.New(1), tree.New(2)))
}

Esempio n. 13

File: exercise-equivalent-binary-trees.go Progetto: nteissler/tourofgo

func main() {
	/*ch := make(chan int)
	go Walk(tree.New(1), ch)
	for i := 0; i < 10; i++ {
		fmt.Println(<-ch)
	}*/
	fmt.Println("going")
	fmt.Println(Same(tree.New(1), tree.New(1)))
	fmt.Println(Same(tree.New(1), tree.New(2)))
	fmt.Println("gone")
}

Esempio n. 14

File: exercise-equivalent-binary-trees.go Progetto: tangfeixiong/go-to-exercise

func main() {
	ch := make(chan int)
	go Walk(tree.New(1), ch)
	for ok := true; ok; {
		var v int
		v, ok = <-ch
		if ok {
			fmt.Print(v, ", ")
		}
	}
	fmt.Println(Same(tree.New(2), tree.New(2)))
}

Esempio n. 15

File: equivalent-binary-trees.go Progetto: Harpreet4u/goTour

func main() {
	//tree.New(2)
	ch := make(chan int)
	ch1 := make(chan int)
	go Walk(tree.New(1), ch)
	for v := range ch {
		fmt.Print(v)
	}
	fmt.Println(Same(tree.New(1), tree.New(1)))
	fmt.Println(Same(tree.New(1), tree.New(2)))

}

Esempio n. 16

File: concurrency.go Progetto: gomachan46/tour_of_go_challenge

func main() {
	// 2. テストとは、といった感じだけど
	ch := make(chan int)
	go Walk(tree.New(1), ch)
	for v := range ch {
		fmt.Println(v)
	}

	// 4.
	fmt.Println(Same(tree.New(1), tree.New(1)))
	fmt.Println(Same(tree.New(1), tree.New(2)))
}

Esempio n. 17

File: BinaryTrees.go Progetto: Valkrysa/FirstGo

//Learning material used from
//https://tour.golang.org/concurrency/7
//https://tour.golang.org/concurrency/8
//This won't work if not run on the golang site.
func main() {
	ch := make(chan int)

	go Walk(tree.New(1), ch)

	for i := 0; i < 10; i++ {
		v := <-ch
		fmt.Println(v)
	}

	fmt.Println(Same(tree.New(1), tree.New(1)))
	fmt.Println(Same(tree.New(1), tree.New(2)))
}

Esempio n. 18

File: main.go Progetto: purepennons/startLearnGolang

func main() {
	ch1 := make(chan int)
	ch2 := make(chan int)
	go Walk(tree.New(1), ch1)
	go Walk(tree.New(2), ch2)

	for i := 0; i < 10; i++ {
		fmt.Println(<-ch1)
	}
	for i := 0; i < 10; i++ {
		fmt.Println(<-ch2)
	}
	fmt.Println(Same(tree.New(1), tree.New(2)))
}

Esempio n. 19

File: 8.go Progetto: rendon/gosnippets

// Same determines whether the trees
// t1 and t2 contain the same values.
func Same(t1, t2 *tree.Tree) bool {
	ch1 := make(chan int)
	ch2 := make(chan int)
	go Walk(tree.New(10), ch1)
	go Walk(tree.New(10), ch2)
	for i := 0; i < 10; i++ {
		a, b := <-ch1, <-ch2
		if a != b {
			return false
		}
	}

	return true
}

Esempio n. 20

File: equivalentBinaryTrees.go Progetto: yuquanshan/myATourOfGoSol

func main() {
	var t *tree.Tree
	t = tree.New(2)
	if t.Left.Left.Left == nil {
		fmt.Println("haha")
	} else {
		fmt.Println("hoho")
	}
	if Same(tree.New(1), tree.New(1)) {
		fmt.Println("test1 passed")
	}
	if !Same(tree.New(1), tree.New(2)) {
		fmt.Println("test2 passed")
	}
}

Esempio n. 21

File: exercise-equivalent-binary-trees.go Progetto: toli/go-tour

func main() {
	ch := make(chan int, 10)
	go Walk(tree.New(1), ch)
	for i := 0; i < cap(ch); i++ {
		v, ok := <-ch
		if ok {
			fmt.Println(v)
		}
	}

	same1 := Same(tree.New(1), tree.New(1))
	fmt.Printf("value for case 1: %v\n", same1)
	same2 := Same(tree.New(1), tree.New(2))
	fmt.Printf("value for case 2: %v\n", same2)
}

Esempio n. 22

File: binarytrees_quit.go Progetto: pythonboys/tour

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")
	}
}

Esempio n. 23

File: main.go Progetto: iplog/gotour

func main() {
	fmt.Print("Checks if tree.New(1) == tree.New(1) ")
	if Same(tree.New(1), tree.New(1)) {
		fmt.Println("PASSED")
	} else {
		fmt.Println("FAILED")
	}

	fmt.Print("Checks if tree.New(1) == tree.New(2) ")
	if Same(tree.New(1), tree.New(2)) {
		fmt.Println("PASSED")
	} else {
		fmt.Println("FAILED")
	}
}

Esempio n. 24

File: equiBTree_test.go Progetto: ng-vu/Exercise

func BenchmarkWalk(b *testing.B) {
	for n := 0; n < b.N; n++ {
		ch := make(chan int)
		go Walk(tree.New(2), ch)
		<-ch
	}
}

Esempio n. 25

File: equivalent-binary-trees.go Progetto: Ryfthink/go_learning

// 等价二叉树
func main() {
	ch := make(chan int)
	go func() {
		Walk(tree.New(1), ch)
		ch <- 0
	}()

	for {
		t := <-ch
		if t == 0 {
			break
		}
		println(t)
	}

	println(Same(tree.New(1), tree.New(2)))
}

Esempio n. 26

File: equivalent-binary-tree.go Progetto: anantpatil/gopl-workbook

func main() {
	// tree.New(k) returns a random tree of size 10 with elements
	// 1k, 2k, 3k...10k

	// first test walk by making a tree and printing it,
	// the output should be sorted 1k, 2k..10k
	ch := make(chan int)
	t := tree.New(1)
	fmt.Println(t)
	go Walk(t, ch)
	for i := 0; i < 10; i++ {
		fmt.Println(<-ch)
	}

	fmt.Println(Same(tree.New(1), tree.New(1))) // true
	fmt.Println(Same(tree.New(1), tree.New(2))) // false
}

Esempio n. 27

File: trees_test.go Progetto: matijavizintin/tour-of-go

func TestWalk(t *testing.T) {
	ch := make(chan int)
	go Walk(tree.New(1), ch)

	for i := 0; i < 10; i++ {
		fmt.Println(<-ch)
	}
}

Esempio n. 28

File: tree_test.go Progetto: alexzabolotny/go-bootcamp

func TestSame(t *testing.T) {
	cases := []struct {
		t1   *tree.Tree
		t2   *tree.Tree
		want bool
	}{
		{tree.New(1), tree.New(1), true},
		{tree.New(1), tree.New(2), false},
	}

	for _, c := range cases {
		if c.want != Same(c.t1, c.t2) {
			t.Errorf("%v is equal to %v", c.t1, c.t2)
		} else {
			fmt.Print(".")
		}
	}
}

Esempio n. 29

File: equiBTree_test.go Progetto: ng-vu/Exercise

func TestWalk(t *testing.T) {
	testcasesWalk := []struct {
		in   *tree.Tree
		want []int
	}{
		{tree.New(1), []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}},
		{tree.New(2), []int{2, 4, 6, 8, 10, 12, 14, 16, 18, 20}},
	}
	for _, c := range testcasesWalk {
		ch1 := make(chan int)
		go Walk(c.in, ch1)
		for _, w := range c.want {
			got := <-ch1
			if got != w {
				t.Errorf("Expect %d, but return %d", w, got)
			}
		}
	}
}

Esempio n. 30

File: tree-walk.go Progetto: sim4life/go_poc

func main() {
	t23 := tree.New(1)
	t2 := tree.New(2)
	t3 := tree.New(3)
	t23.Left = t2
	t23.Right = t3

	tt23 := tree.New(1)
	tt2 := tree.New(2)
	tt3 := tree.New(3)
	tt23.Left = tt2
	tt23.Right = tt3

	fmt.Println("1 and 1 same: ", Same(tree.New(1), tree.New(1)))
	fmt.Println("1 and 2 same: ", Same(tree.New(1), tree.New(2)))
	//this test fails as each tree.New() is a random generated tree of 10 nodes
	fmt.Println("t23 and tt23 same: ", Same(t23, tt23))

}