//keyType為key的類型，valueType為value的類型
type RWMap struct {
	Map map[keyType]valueType
	sync.RWMutex
}
func NewRWMap(capacity int) *RWMap {
	if capacity < 0 {
		capacity = 0
	}
	return &RWMap{
		Map: make(map[keyType]valueType, capacity),
	}
}
//add or update
func (m *RWMap) Set(key keyType, value valueType) {
	m.Lock()
	defer m.Unlock()
	m.Map[key] = value
}
//delete
func (m *RWMap) Delete(key int)  {
	m.Lock()
	defer m.Unlock()
	delete(m.Map, key)
}
//get
func (m *RWMap) Get(key int) valueType {
	m.RLock()
	defer m.RUnlock()
	return m.Map[key]
}

// Creates a new concurrent map.
func New[V any]() ConcurrentMap[string, V] {
	return create[string, V](fnv32)
}

package main
import (
	"fmt"
	"time"
	cmap "github.com/orcaman/concurrent-map/v2"
)
func main() {
	m := cmap.New[int]()
	for i := 0; i < 300; i++ {
		go func(i int) {
			m.Set(fmt.Sprintf("%v", i), i*2)  //并發(fā)寫(xiě)
		}(i)
	}
	time.Sleep(4 * time.Second)
	fmt.Println(len(m.Keys()))
}

PS C:\GoWork\src\asset-manager\mytest> go run main.go
300

// Map is like a Go map[interface{}]interface{} but is safe for concurrent use
// by multiple goroutines without additional locking or coordination. 
// Loads, stores, and deletes run in amortized constant time. 
//=====自注釋======
sync.Map 很像Go map[interface{}]interface{}。但sync.Map是線程安全的，能被多個(gè)協(xié)程在沒(méi)有額外的鎖或者協(xié)調(diào)的情況下并發(fā)使用。
Loads,stores，deletes操作都運(yùn)行在分?jǐn)偝?shù)時(shí)間內(nèi)。
amortized 平攤的（adj.)英  /??m??ta?zd/
//=====自注釋======
//
// The Map type is specialized. Most code should use a plain Go map instead,
// with separate locking or coordination, for better type safety and to make it
// easier to maintain other invariants along with the map content.
//=====自注釋======
invariants (n.) 不變量（invariant的復(fù)數(shù)）/?n?veri?nts/
sync.Map 類型是為特殊情況專門(mén)設(shè)計(jì)的。
大多數(shù)代碼都應(yīng)該使用普通的Go map + 單獨(dú)的鎖或者協(xié)調(diào) ，這種形式，來(lái)獲得更好的類型安全
以及使得在維護(hù)映射內(nèi)容的同時(shí)維護(hù)其他不變量更容易。
//=====自注釋======
//
// The Map type is optimized for two common use cases: (1) when the entry for a given
// key is only ever written once but read many times, as in caches that only grow,
// or (2) when multiple goroutines read, write, and overwrite entries for disjoint
// sets of keys. In these two cases, use of a Map may significantly reduce lock
// contention compared to a Go map paired with a separate Mutex or RWMutex.
//=====自注釋======
disjoint (adj.) 不連貫的，（兩個(gè)集合）不相交的 /d?s?d???nt/
sync.Map類型針對(duì)兩個(gè)常見(jiàn)用例進(jìn)行了優(yōu)化:
(1)對(duì)于一個(gè)給定的key，只會(huì)寫(xiě)一次，但是讀很多次，就像在只增長(zhǎng)的緩存中一樣。
(2)當(dāng)多個(gè)協(xié)程讀，寫(xiě)，重寫(xiě)不相交的keys。
以上兩種情況，相比于使用Go map + Mutex（或者RWMutex），使用sync.Map能顯著減少鎖競(jìng)爭(zhēng)。
//=====自注釋======
//
// The zero Map is empty and ready for use. A Map must not be copied after first use.
type Map struct {
	mu Mutex
	// read contains the portion of the map's contents that are safe for
	// concurrent access (with or without mu held).
	//
	// The read field itself is always safe to load, but must only be stored with
	// mu held.
	//
	// Entries stored in read may be updated concurrently without mu, but updating
	// a previously-expunged entry requires that the entry be copied to the dirty
	// map and unexpunged with mu held.
	read atomic.Value // readOnly
	// dirty contains the portion of the map's contents that require mu to be
	// held. To ensure that the dirty map can be promoted to the read map quickly,
	// it also includes all of the non-expunged entries in the read map.
//=====自注釋======
expunged (adj.)/?k?sp?nd?/ 被擦去的，被刪掉的
dirty map 包含map內(nèi)容的部分，該部分要求持有mu鎖。為了確保dirty map能快速提升到read map，
它還包括read map 中所有未刪除的項(xiàng)。
//=====自注釋======
	//
	// Expunged entries are not stored in the dirty map. An expunged entry in the
	// clean map must be unexpunged and added to the dirty map before a new value
	// can be stored to it.
	//
	// If the dirty map is nil, the next write to the map will initialize it by
	// making a shallow copy of the clean map, omitting stale entries.
	dirty map[any]*entry
	// misses counts the number of loads since the read map was last updated that
	// needed to lock mu to determine whether the key was present.
	//
	// Once enough misses have occurred to cover the cost of copying the dirty
	// map, the dirty map will be promoted to the read map (in the unamended
	// state) and the next store to the map will make a new dirty copy.
	misses int
}