Added concepts such as mutexes under go_basics/goroutines, added examples for trees to learn about channels. Finished close to every concept in go programming language :)

Author: anarchymonkey

go_basics/goroutines/mutexes/go.mod

@@ -0,0 +1,3 @@
+module anarchymonkey.com/go-basics/goroutines/mutexes
+
+go 1.20

go_basics/goroutines/mutexes/go.sum

@@ -0,0 +1,2 @@
+golang.org/x/tour v0.1.0 h1:OWzbINRoGf1wwBhKdFDpYwM88NM0d1SL/Nj6PagS6YE=
+golang.org/x/tour v0.1.0/go.mod h1:DUZC6G8mR1AXgXy73r8qt/G5RsefKIlSj6jBMc8b9Wc=

go_basics/goroutines/mutexes/mutexes.go

@@ -0,0 +1,40 @@
+package main
+
+import (
+	"fmt"
+	"math/rand"
+	"sync"
+)
+
+type Unique struct {
+	mu          sync.Mutex
+	valueMapper map[int]int
+}
+
+func (u *Unique) generateUniqueIdCollector(index int, wg *sync.WaitGroup) {
+	defer wg.Done()
+	fmt.Println("index is", index)
+	u.mu.Lock()
+	u.valueMapper[index] = int(rand.Intn(255))
+	u.mu.Unlock()
+
+}
+
+func main() {
+
+	var uniq Unique = Unique{
+		valueMapper: make(map[int]int),
+	}
+
+	var wg sync.WaitGroup
+
+	for i := 0; i < 5; i++ {
+		wg.Add(1)
+		go uniq.generateUniqueIdCollector(i, &wg)
+	}
+
+	wg.Wait()
+	// time.Sleep(time.Second)
+	fmt.Println(uniq.valueMapper)
+	// wg.Done()
+}

go_basics/goroutines/trees/go.mod

@@ -0,0 +1,5 @@
+module anarchymonkey.com/go-basics/goroutines/trees
+
+go 1.20
+
+require golang.org/x/tour v0.1.0

go_basics/goroutines/trees/go.sum

@@ -0,0 +1,2 @@
+golang.org/x/tour v0.1.0 h1:OWzbINRoGf1wwBhKdFDpYwM88NM0d1SL/Nj6PagS6YE=
+golang.org/x/tour v0.1.0/go.mod h1:DUZC6G8mR1AXgXy73r8qt/G5RsefKIlSj6jBMc8b9Wc=

go_basics/goroutines/trees/trees.go

@@ -0,0 +1,46 @@
+package main
+
+import (
+	"fmt"
+
+	"golang.org/x/tour/tree"
+)
+
+func Walk(t *tree.Tree, ch chan int) {
+
+	if t == nil {
+		return
+	}
+
+	Walk(t.Left, ch)
+	ch <- t.Value
+	Walk(t.Right, ch)
+}
+
+func Same(t1 *tree.Tree, t2 *tree.Tree) bool {
+
+	ch1, ch2 := make(chan int, 20), make(chan int, 20)
+
+	go Walk(t1, ch1)
+	go Walk(t2, ch2)
+
+	for i := 0; i < 10; i++ {
+
+		v1, v2 := <-ch1, <-ch2
+
+		if v1 != v2 {
+			return false
+		}
+	}
+
+	return true
+}
+
+func main() {
+	t1 := tree.New(1)
+
+	t2 := tree.New(1)
+
+	fmt.Println(Same(t1, t2))
+
+}