golang数据结构之sync.Map篇

最新推荐文章于 2024-07-23 17:37:05 发布

dobe85601

最新推荐文章于 2024-07-23 17:37:05 发布

阅读量338

点赞数

文章标签：数据结构与算法 golang

原文链接：http://www.cnblogs.com/LittleLee/p/9387915.html

版权

package main

import (
   "fmt"
   "sync"
)

func main() {
   var mapInt = new(sync.Map)
   //add elem
   mapInt.Store(1, 1)
   mapInt.Store(2, 2)
   mapInt.Store(3, 3)
   fmt.Println("before delete key:")
   // iterator
   mapInt.Range(func(key, value interface{}) bool {
      fmt.Println(key, value)
      return true
   })
   // del
   mapInt.Delete(2)
   fmt.Println("after delete key:")
   mapInt.Range(func(key, value interface{}) bool {
      fmt.Println(key, value)
      return true
   })
   // query
   v, ok := mapInt.Load(1)
   if ok {
      fmt.Println(v)
   }
   // load or store
   v, ok = mapInt.LoadOrStore(2, 10)
   fmt.Println("load or store:", v, ", ok:", ok)

}
output: 
before delete key:
1 1
2 2
3 3
after delete key:
1 1
3 3
1
load or store: 10 , ok: false

转载于:https://www.cnblogs.com/LittleLee/p/9387915.html