// Copyright 2017 gf Author(https://github.com/gogf/gf). All Rights Reserved. // // This Source Code Form is subject to the terms of the MIT License. // If a copy of the MIT was not distributed with gm file, // You can obtain one at https://github.com/gogf/gf. // package gmap import ( "github.com/gogf/gf/g/internal/rwmutex" "github.com/gogf/gf/g/util/gconv" ) type StringInterfaceMap struct { mu *rwmutex.RWMutex m map[string]interface{} } // NewStringInterfaceMap returns an empty StringInterfaceMap object. // The param used to specify whether using map with un-concurrent-safety, // which is false in default, means concurrent-safe. func NewStringInterfaceMap(unsafe...bool) *StringInterfaceMap { return &StringInterfaceMap{ m : make(map[string]interface{}), mu : rwmutex.New(unsafe...), } } // NewStringInterfaceMapFrom returns an StringInterfaceMap object from given map . // Notice that, the param map is a type of pointer, // there might be some concurrent-safe issues when changing the map outside. func NewStringInterfaceMapFrom(m map[string]interface{}, unsafe...bool) *StringInterfaceMap { return &StringInterfaceMap{ m : m, mu : rwmutex.New(unsafe...), } } // NewStringInterfaceMapFromArray returns an StringInterfaceMap object from given array. // The param given as the keys of the map, // and as its corresponding values. // // If length of is greater than that of , // the corresponding overflow map values will be the default value of its type. func NewStringInterfaceMapFromArray(keys []string, values []interface{}, unsafe...bool) *StringInterfaceMap { m := make(map[string]interface{}) l := len(values) for i, k := range keys { if i < l { m[k] = values[i] } else { m[k] = interface{}(nil) } } return &StringInterfaceMap{ m : m, mu : rwmutex.New(unsafe...), } } // Iterator iterates the hash map with custom callback function . // If f returns true, then continue iterating; or false to stop. func (gm *StringInterfaceMap) Iterator(f func (k string, v interface{}) bool) { gm.mu.RLock() defer gm.mu.RUnlock() for k, v := range gm.m { if !f(k, v) { break } } } // Clone returns a new hash map with copy of current map data. func (gm *StringInterfaceMap) Clone() *StringInterfaceMap { return NewStringInterfaceMapFrom(gm.Map(), !gm.mu.IsSafe()) } // Map returns a copy of the data of the hash map. func (gm *StringInterfaceMap) Map() map[string]interface{} { m := make(map[string]interface{}) gm.mu.RLock() for k, v := range gm.m { m[k] = v } gm.mu.RUnlock() return m } // Set sets key-value to the hash map. func (gm *StringInterfaceMap) Set(key string, val interface{}) { gm.mu.Lock() gm.m[key] = val gm.mu.Unlock() } // BatchSet batch sets key-values to the hash map. func (gm *StringInterfaceMap) BatchSet(m map[string]interface{}) { gm.mu.Lock() for k, v := range m { gm.m[k] = v } gm.mu.Unlock() } // Get returns the value by given . func (gm *StringInterfaceMap) Get(key string) interface{} { gm.mu.RLock() val, _ := gm.m[key] gm.mu.RUnlock() return val } // doSetWithLockCheck checks whether value of the key exists with mutex.Lock, // if not exists, set value to the map with given , // or else just return the existing value. // // When setting value, if is type of , // it will be executed with mutex.Lock of the hash map, // and its return value will be set to the map with . // // It returns value with given . func (gm *StringInterfaceMap) doSetWithLockCheck(key string, value interface{}) interface{} { gm.mu.Lock() defer gm.mu.Unlock() if v, ok := gm.m[key]; ok { return v } if f, ok := value.(func() interface {}); ok { value = f() } if value != nil { gm.m[key] = value } return value } // GetOrSet returns the value by key, // or set value with given if not exist and returns this value. func (gm *StringInterfaceMap) GetOrSet(key string, value interface{}) interface{} { if v := gm.Get(key); v == nil { return gm.doSetWithLockCheck(key, value) } else { return v } } // GetOrSetFunc returns the value by key, // or sets value with return value of callback function if not exist // and returns this value. func (gm *StringInterfaceMap) GetOrSetFunc(key string, f func() interface{}) interface{} { if v := gm.Get(key); v == nil { return gm.doSetWithLockCheck(key, f()) } else { return v } } // GetOrSetFuncLock returns the value by key, // or sets value with return value of callback function if not exist // and returns this value. // // GetOrSetFuncLock differs with GetOrSetFunc function is that it executes function // with mutex.Lock of the hash map. func (gm *StringInterfaceMap) GetOrSetFuncLock(key string, f func() interface{}) interface{} { if v := gm.Get(key); v == nil { return gm.doSetWithLockCheck(key, f) } else { return v } } // SetIfNotExist sets to the map if the does not exist, then return true. // It returns false if exists, and would be ignored. func (gm *StringInterfaceMap) SetIfNotExist(key string, value interface{}) bool { if !gm.Contains(key) { gm.doSetWithLockCheck(key, value) return true } return false } // SetIfNotExistFunc sets value with return value of callback function , then return true. // It returns false if exists, and would be ignored. func (gm *StringInterfaceMap) SetIfNotExistFunc(key string, f func() interface{}) bool { if !gm.Contains(key) { gm.doSetWithLockCheck(key, f()) return true } return false } // SetIfNotExistFuncLock sets value with return value of callback function , then return true. // It returns false if exists, and would be ignored. // // SetIfNotExistFuncLock differs with SetIfNotExistFunc function is that // it executes function with mutex.Lock of the hash map. func (gm *StringInterfaceMap) SetIfNotExistFuncLock(key string, f func() interface{}) bool { if !gm.Contains(key) { gm.doSetWithLockCheck(key, f) return true } return false } // BatchRemove batch deletes values of the map by keys. func (gm *StringInterfaceMap) BatchRemove(keys []string) { gm.mu.Lock() for _, key := range keys { delete(gm.m, key) } gm.mu.Unlock() } // Remove deletes value from map by given , and return this deleted value. func (gm *StringInterfaceMap) Remove(key string) interface{} { gm.mu.Lock() val, exists := gm.m[key] if exists { delete(gm.m, key) } gm.mu.Unlock() return val } // Keys returns all keys of the map as a slice. func (gm *StringInterfaceMap) Keys() []string { gm.mu.RLock() keys := make([]string, 0) for key, _ := range gm.m { keys = append(keys, key) } gm.mu.RUnlock() return keys } // Values returns all values of the map as a slice. func (gm *StringInterfaceMap) Values() []interface{} { gm.mu.RLock() vals := make([]interface{}, 0) for _, val := range gm.m { vals = append(vals, val) } gm.mu.RUnlock() return vals } // Contains checks whether a key exists. // It returns true if the exists, or else false. func (gm *StringInterfaceMap) Contains(key string) bool { gm.mu.RLock() _, exists := gm.m[key] gm.mu.RUnlock() return exists } // Size returns the size of the map. func (gm *StringInterfaceMap) Size() int { gm.mu.RLock() length := len(gm.m) gm.mu.RUnlock() return length } // IsEmpty checks whether the map is empty. // It returns true if map is empty, or else false. func (gm *StringInterfaceMap) IsEmpty() bool { gm.mu.RLock() empty := len(gm.m) == 0 gm.mu.RUnlock() return empty } // Clear deletes all data of the map, it will remake a new underlying map data map. func (gm *StringInterfaceMap) Clear() { gm.mu.Lock() gm.m = make(map[string]interface{}) gm.mu.Unlock() } // LockFunc locks writing with given callback function and mutex.Lock. func (gm *StringInterfaceMap) LockFunc(f func(m map[string]interface{})) { gm.mu.Lock() defer gm.mu.Unlock() f(gm.m) } // RLockFunc locks reading with given callback function and mutex.RLock. func (gm *StringInterfaceMap) RLockFunc(f func(m map[string]interface{})) { gm.mu.RLock() defer gm.mu.RUnlock() f(gm.m) } // Flip exchanges key-value of the map, it will change key-value to value-key. func (gm *StringInterfaceMap) Flip() { gm.mu.Lock() defer gm.mu.Unlock() n := make(map[string]interface{}, len(gm.m)) for k, v := range gm.m { n[gconv.String(v)] = k } gm.m = n } // Merge merges two hash maps. // The map will be merged into the map . func (gm *StringInterfaceMap) Merge(other *StringInterfaceMap) { gm.mu.Lock() defer gm.mu.Unlock() if other != gm { other.mu.RLock() defer other.mu.RUnlock() } for k, v := range other.m { gm.m[k] = v } }