Methods used in golang

Load(key interface{}) (value interface{}, ok bool)
//By providing a key key, find the corresponding value value, and if it does not exist, return nil.  The result of ok indicates whether the value is found in the map
Store(key, value interface{})
//This is equivalent to writing a map (update or add). The first parameter is the key and the second parameter is the value.
LoadOrStore(key, value interface{}) (actual interface{}, loaded bool)
//By providing a key key, find the corresponding value value, if there is an existing value of the return key, otherwise store and return the given value, return true if it is read, return false if it is stored
Delete(key interface{})
//Delete the corresponding value of the key by providing a key key
Range(f func(key, value interface{}) bool)
//Loop to read the value in the map.//becausefor ... range mapIt is a built-in language feature，So there is no way to usefor rangeTraversal, But you can use itRangemethod，Through callback

package main

import (
	"fmt"
	"sync"
)

var num = 0
var addTest *AddTest

func init() {
	addTest = &AddTest{}
}

type AddTest struct {
	m 
}

func (at *AddTest) increment(wg *) {
	//Mutual Exclusion Lock	() //When a thread goes in and adds a lock	num++
	() //Unlock it after it comes out, and other threads can enter	()
}

func (at *AddTest) decrement(wg *) {
	//Mutual Exclusion Lock	() //When a thread goes in and adds a lock	num--
	() //Unlock it after it comes out, and other threads can enter	()
}

var w 

var aa map[int]int

func main() {
	var bb 
	var wg 
	//aa = make(map[int]int)
	(2)
	go func() {
		//(1)
		for i:=0 ;i <100; i++{
			//aa[i] = i+1
			//("a")
			(i, i+1)
		}
		()
	}()

	go func() {

		for i:=0 ;i <100; i++{
			//aa[i] = i+1
			//("a")
			(i, i+1)
		}
		()
	}()
	()
	(func(k, v interface{}) bool {
		("iterate:", k, v)
		return true
	}
}