2019-05-11 20:47:25 +08:00
|
|
|
// 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 (
|
2019-07-13 17:48:16 +08:00
|
|
|
"encoding/json"
|
|
|
|
|
2019-09-26 20:01:48 +08:00
|
|
|
"github.com/gogf/gf/internal/empty"
|
|
|
|
|
2019-07-29 21:01:19 +08:00
|
|
|
"github.com/gogf/gf/util/gconv"
|
2019-07-13 17:48:16 +08:00
|
|
|
|
2019-07-29 21:01:19 +08:00
|
|
|
"github.com/gogf/gf/container/gvar"
|
|
|
|
"github.com/gogf/gf/internal/rwmutex"
|
2019-05-11 20:47:25 +08:00
|
|
|
)
|
|
|
|
|
|
|
|
type AnyAnyMap struct {
|
2019-06-19 09:06:52 +08:00
|
|
|
mu *rwmutex.RWMutex
|
|
|
|
data map[interface{}]interface{}
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
2019-11-30 18:33:51 +08:00
|
|
|
// NewAnyAnyMap creates and returns an empty hash map.
|
|
|
|
// The parameter <safe> is used to specify whether using map in concurrent-safety,
|
2019-07-23 23:20:27 +08:00
|
|
|
// which is false in default.
|
|
|
|
func NewAnyAnyMap(safe ...bool) *AnyAnyMap {
|
2019-05-11 20:47:25 +08:00
|
|
|
return &AnyAnyMap{
|
2019-07-23 23:20:27 +08:00
|
|
|
mu: rwmutex.New(safe...),
|
2019-06-19 09:06:52 +08:00
|
|
|
data: make(map[interface{}]interface{}),
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-11-30 18:33:51 +08:00
|
|
|
// NewAnyAnyMapFrom creates and returns a hash map from given map <data>.
|
2019-05-11 20:47:25 +08:00
|
|
|
// Note that, the param <data> map will be set as the underlying data map(no deep copy),
|
|
|
|
// there might be some concurrent-safe issues when changing the map outside.
|
2019-07-23 23:20:27 +08:00
|
|
|
func NewAnyAnyMapFrom(data map[interface{}]interface{}, safe ...bool) *AnyAnyMap {
|
2019-06-19 09:06:52 +08:00
|
|
|
return &AnyAnyMap{
|
2019-07-23 23:20:27 +08:00
|
|
|
mu: rwmutex.New(safe...),
|
2019-06-19 09:06:52 +08:00
|
|
|
data: data,
|
|
|
|
}
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Iterator iterates the hash map with custom callback function <f>.
|
|
|
|
// If <f> returns true, then it continues iterating; or false to stop.
|
2019-06-19 09:06:52 +08:00
|
|
|
func (m *AnyAnyMap) Iterator(f func(k interface{}, v interface{}) bool) {
|
|
|
|
m.mu.RLock()
|
|
|
|
defer m.mu.RUnlock()
|
|
|
|
for k, v := range m.data {
|
|
|
|
if !f(k, v) {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Clone returns a new hash map with copy of current map data.
|
2019-07-23 23:20:27 +08:00
|
|
|
func (m *AnyAnyMap) Clone(safe ...bool) *AnyAnyMap {
|
2019-09-29 14:27:09 +08:00
|
|
|
return NewFrom(m.MapCopy(), safe...)
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
2019-09-29 14:27:09 +08:00
|
|
|
// Map returns the underlying data map.
|
|
|
|
// Note that, if it's in concurrent-safe usage, it returns a copy of underlying data,
|
|
|
|
// or else a pointer to the underlying data.
|
2019-05-11 20:47:25 +08:00
|
|
|
func (m *AnyAnyMap) Map() map[interface{}]interface{} {
|
2019-06-19 09:06:52 +08:00
|
|
|
m.mu.RLock()
|
2019-09-29 14:27:09 +08:00
|
|
|
defer m.mu.RUnlock()
|
|
|
|
if !m.mu.IsSafe() {
|
|
|
|
return m.data
|
|
|
|
}
|
2019-05-12 21:11:26 +08:00
|
|
|
data := make(map[interface{}]interface{}, len(m.data))
|
2019-06-19 09:06:52 +08:00
|
|
|
for k, v := range m.data {
|
|
|
|
data[k] = v
|
|
|
|
}
|
|
|
|
return data
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
2019-11-30 18:33:51 +08:00
|
|
|
// MapCopy returns a copy of the underlying data of the hash map.
|
2019-09-29 14:27:09 +08:00
|
|
|
func (m *AnyAnyMap) MapCopy() map[interface{}]interface{} {
|
|
|
|
m.mu.RLock()
|
|
|
|
defer m.mu.RUnlock()
|
|
|
|
data := make(map[interface{}]interface{}, len(m.data))
|
|
|
|
for k, v := range m.data {
|
|
|
|
data[k] = v
|
|
|
|
}
|
|
|
|
return data
|
2019-09-26 20:01:48 +08:00
|
|
|
}
|
|
|
|
|
2019-11-30 18:33:51 +08:00
|
|
|
// MapStrAny returns a copy of the underlying data of the map as map[string]interface{}.
|
2019-09-19 19:44:46 +08:00
|
|
|
func (m *AnyAnyMap) MapStrAny() map[string]interface{} {
|
|
|
|
m.mu.RLock()
|
|
|
|
data := make(map[string]interface{}, len(m.data))
|
|
|
|
for k, v := range m.data {
|
|
|
|
data[gconv.String(k)] = v
|
|
|
|
}
|
|
|
|
m.mu.RUnlock()
|
|
|
|
return data
|
|
|
|
}
|
|
|
|
|
2019-09-26 20:01:48 +08:00
|
|
|
// FilterEmpty deletes all key-value pair of which the value is empty.
|
|
|
|
func (m *AnyAnyMap) FilterEmpty() {
|
|
|
|
m.mu.Lock()
|
|
|
|
for k, v := range m.data {
|
|
|
|
if empty.IsEmpty(v) {
|
|
|
|
delete(m.data, k)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
m.mu.Unlock()
|
|
|
|
}
|
|
|
|
|
2019-05-11 20:47:25 +08:00
|
|
|
// Set sets key-value to the hash map.
|
|
|
|
func (m *AnyAnyMap) Set(key interface{}, val interface{}) {
|
2019-06-19 09:06:52 +08:00
|
|
|
m.mu.Lock()
|
|
|
|
m.data[key] = val
|
|
|
|
m.mu.Unlock()
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Sets batch sets key-values to the hash map.
|
|
|
|
func (m *AnyAnyMap) Sets(data map[interface{}]interface{}) {
|
2019-06-19 09:06:52 +08:00
|
|
|
m.mu.Lock()
|
|
|
|
for k, v := range data {
|
|
|
|
m.data[k] = v
|
|
|
|
}
|
|
|
|
m.mu.Unlock()
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Search searches the map with given <key>.
|
|
|
|
// Second return parameter <found> is true if key was found, otherwise false.
|
|
|
|
func (m *AnyAnyMap) Search(key interface{}) (value interface{}, found bool) {
|
|
|
|
m.mu.RLock()
|
|
|
|
value, found = m.data[key]
|
|
|
|
m.mu.RUnlock()
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
// Get returns the value by given <key>.
|
|
|
|
func (m *AnyAnyMap) Get(key interface{}) interface{} {
|
2019-06-19 09:06:52 +08:00
|
|
|
m.mu.RLock()
|
|
|
|
val, _ := m.data[key]
|
|
|
|
m.mu.RUnlock()
|
|
|
|
return val
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
2019-10-16 23:33:06 +08:00
|
|
|
// Pop retrieves and deletes an item from the map.
|
|
|
|
func (m *AnyAnyMap) Pop() (key, value interface{}) {
|
|
|
|
m.mu.Lock()
|
|
|
|
defer m.mu.Unlock()
|
|
|
|
for key, value = range m.data {
|
|
|
|
delete(m.data, key)
|
|
|
|
return
|
|
|
|
}
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
// Pops retrieves and deletes <size> items from the map.
|
|
|
|
// It returns all items if size == -1.
|
|
|
|
func (m *AnyAnyMap) Pops(size int) map[interface{}]interface{} {
|
|
|
|
m.mu.Lock()
|
|
|
|
defer m.mu.Unlock()
|
|
|
|
if size > len(m.data) || size == -1 {
|
|
|
|
size = len(m.data)
|
|
|
|
}
|
|
|
|
if size == 0 {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
index := 0
|
|
|
|
newMap := make(map[interface{}]interface{}, size)
|
|
|
|
for k, v := range m.data {
|
|
|
|
delete(m.data, k)
|
|
|
|
newMap[k] = v
|
|
|
|
index++
|
|
|
|
if index == size {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return newMap
|
|
|
|
}
|
|
|
|
|
2019-05-11 20:47:25 +08:00
|
|
|
// doSetWithLockCheck checks whether value of the key exists with mutex.Lock,
|
|
|
|
// if not exists, set value to the map with given <key>,
|
|
|
|
// or else just return the existing value.
|
|
|
|
//
|
|
|
|
// When setting value, if <value> is type of <func() interface {}>,
|
|
|
|
// it will be executed with mutex.Lock of the hash map,
|
|
|
|
// and its return value will be set to the map with <key>.
|
|
|
|
//
|
|
|
|
// It returns value with given <key>.
|
|
|
|
func (m *AnyAnyMap) doSetWithLockCheck(key interface{}, value interface{}) interface{} {
|
2019-06-19 09:06:52 +08:00
|
|
|
m.mu.Lock()
|
|
|
|
defer m.mu.Unlock()
|
|
|
|
if v, ok := m.data[key]; ok {
|
|
|
|
return v
|
|
|
|
}
|
|
|
|
if f, ok := value.(func() interface{}); ok {
|
|
|
|
value = f()
|
|
|
|
}
|
2019-10-31 23:37:33 +08:00
|
|
|
if value != nil {
|
|
|
|
m.data[key] = value
|
|
|
|
}
|
2019-06-19 09:06:52 +08:00
|
|
|
return value
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// GetOrSet returns the value by key,
|
2019-11-06 20:22:20 +08:00
|
|
|
// or sets value with given <value> if it does not exist and then returns this value.
|
2019-05-11 20:47:25 +08:00
|
|
|
func (m *AnyAnyMap) GetOrSet(key interface{}, value interface{}) interface{} {
|
|
|
|
if v, ok := m.Search(key); !ok {
|
2019-06-19 09:06:52 +08:00
|
|
|
return m.doSetWithLockCheck(key, value)
|
|
|
|
} else {
|
|
|
|
return v
|
|
|
|
}
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// GetOrSetFunc returns the value by key,
|
2019-11-06 20:22:20 +08:00
|
|
|
// or sets value with returned value of callback function <f> if it does not exist
|
|
|
|
// and then returns this value.
|
2019-05-11 20:47:25 +08:00
|
|
|
func (m *AnyAnyMap) GetOrSetFunc(key interface{}, f func() interface{}) interface{} {
|
|
|
|
if v, ok := m.Search(key); !ok {
|
2019-06-19 09:06:52 +08:00
|
|
|
return m.doSetWithLockCheck(key, f())
|
|
|
|
} else {
|
|
|
|
return v
|
|
|
|
}
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// GetOrSetFuncLock returns the value by key,
|
2019-11-06 20:22:20 +08:00
|
|
|
// or sets value with returned value of callback function <f> if it does not exist
|
|
|
|
// and then returns this value.
|
2019-05-11 20:47:25 +08:00
|
|
|
//
|
|
|
|
// GetOrSetFuncLock differs with GetOrSetFunc function is that it executes function <f>
|
|
|
|
// with mutex.Lock of the hash map.
|
|
|
|
func (m *AnyAnyMap) GetOrSetFuncLock(key interface{}, f func() interface{}) interface{} {
|
|
|
|
if v, ok := m.Search(key); !ok {
|
2019-06-19 09:06:52 +08:00
|
|
|
return m.doSetWithLockCheck(key, f)
|
|
|
|
} else {
|
|
|
|
return v
|
|
|
|
}
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// GetVar returns a gvar.Var with the value by given <key>.
|
|
|
|
// The returned gvar.Var is un-concurrent safe.
|
|
|
|
func (m *AnyAnyMap) GetVar(key interface{}) *gvar.Var {
|
2019-07-23 23:20:27 +08:00
|
|
|
return gvar.New(m.Get(key))
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// GetVarOrSet returns a gvar.Var with result from GetVarOrSet.
|
|
|
|
// The returned gvar.Var is un-concurrent safe.
|
|
|
|
func (m *AnyAnyMap) GetVarOrSet(key interface{}, value interface{}) *gvar.Var {
|
2019-07-23 23:20:27 +08:00
|
|
|
return gvar.New(m.GetOrSet(key, value))
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// GetVarOrSetFunc returns a gvar.Var with result from GetOrSetFunc.
|
|
|
|
// The returned gvar.Var is un-concurrent safe.
|
|
|
|
func (m *AnyAnyMap) GetVarOrSetFunc(key interface{}, f func() interface{}) *gvar.Var {
|
2019-07-23 23:20:27 +08:00
|
|
|
return gvar.New(m.GetOrSetFunc(key, f))
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// GetVarOrSetFuncLock returns a gvar.Var with result from GetOrSetFuncLock.
|
|
|
|
// The returned gvar.Var is un-concurrent safe.
|
|
|
|
func (m *AnyAnyMap) GetVarOrSetFuncLock(key interface{}, f func() interface{}) *gvar.Var {
|
2019-07-23 23:20:27 +08:00
|
|
|
return gvar.New(m.GetOrSetFuncLock(key, f))
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
2019-11-06 20:22:20 +08:00
|
|
|
// SetIfNotExist sets <value> to the map if the <key> does not exist, and then returns true.
|
2019-05-11 20:47:25 +08:00
|
|
|
// It returns false if <key> exists, and <value> would be ignored.
|
|
|
|
func (m *AnyAnyMap) SetIfNotExist(key interface{}, value interface{}) bool {
|
2019-06-19 09:06:52 +08:00
|
|
|
if !m.Contains(key) {
|
|
|
|
m.doSetWithLockCheck(key, value)
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
return false
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
2019-11-06 20:22:20 +08:00
|
|
|
// SetIfNotExistFunc sets value with return value of callback function <f>, and then returns true.
|
2019-05-11 20:47:25 +08:00
|
|
|
// It returns false if <key> exists, and <value> would be ignored.
|
|
|
|
func (m *AnyAnyMap) SetIfNotExistFunc(key interface{}, f func() interface{}) bool {
|
|
|
|
if !m.Contains(key) {
|
|
|
|
m.doSetWithLockCheck(key, f())
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
2019-11-06 20:22:20 +08:00
|
|
|
// SetIfNotExistFuncLock sets value with return value of callback function <f>, and then returns true.
|
2019-05-11 20:47:25 +08:00
|
|
|
// It returns false if <key> exists, and <value> would be ignored.
|
|
|
|
//
|
|
|
|
// SetIfNotExistFuncLock differs with SetIfNotExistFunc function is that
|
|
|
|
// it executes function <f> with mutex.Lock of the hash map.
|
|
|
|
func (m *AnyAnyMap) SetIfNotExistFuncLock(key interface{}, f func() interface{}) bool {
|
|
|
|
if !m.Contains(key) {
|
|
|
|
m.doSetWithLockCheck(key, f)
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
|
|
|
// Remove deletes value from map by given <key>, and return this deleted value.
|
|
|
|
func (m *AnyAnyMap) Remove(key interface{}) interface{} {
|
2019-06-19 09:06:52 +08:00
|
|
|
m.mu.Lock()
|
|
|
|
val, exists := m.data[key]
|
|
|
|
if exists {
|
|
|
|
delete(m.data, key)
|
|
|
|
}
|
|
|
|
m.mu.Unlock()
|
|
|
|
return val
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Removes batch deletes values of the map by keys.
|
|
|
|
func (m *AnyAnyMap) Removes(keys []interface{}) {
|
|
|
|
m.mu.Lock()
|
|
|
|
for _, key := range keys {
|
|
|
|
delete(m.data, key)
|
|
|
|
}
|
|
|
|
m.mu.Unlock()
|
|
|
|
}
|
|
|
|
|
|
|
|
// Keys returns all keys of the map as a slice.
|
|
|
|
func (m *AnyAnyMap) Keys() []interface{} {
|
2019-06-19 09:06:52 +08:00
|
|
|
m.mu.RLock()
|
|
|
|
keys := make([]interface{}, len(m.data))
|
|
|
|
index := 0
|
|
|
|
for key := range m.data {
|
|
|
|
keys[index] = key
|
|
|
|
index++
|
|
|
|
}
|
|
|
|
m.mu.RUnlock()
|
|
|
|
return keys
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Values returns all values of the map as a slice.
|
|
|
|
func (m *AnyAnyMap) Values() []interface{} {
|
2019-06-19 09:06:52 +08:00
|
|
|
m.mu.RLock()
|
|
|
|
values := make([]interface{}, len(m.data))
|
|
|
|
index := 0
|
|
|
|
for _, value := range m.data {
|
|
|
|
values[index] = value
|
|
|
|
index++
|
|
|
|
}
|
|
|
|
m.mu.RUnlock()
|
|
|
|
return values
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Contains checks whether a key exists.
|
|
|
|
// It returns true if the <key> exists, or else false.
|
|
|
|
func (m *AnyAnyMap) Contains(key interface{}) bool {
|
2019-06-19 09:06:52 +08:00
|
|
|
m.mu.RLock()
|
|
|
|
_, exists := m.data[key]
|
|
|
|
m.mu.RUnlock()
|
|
|
|
return exists
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Size returns the size of the map.
|
|
|
|
func (m *AnyAnyMap) Size() int {
|
2019-06-19 09:06:52 +08:00
|
|
|
m.mu.RLock()
|
|
|
|
length := len(m.data)
|
|
|
|
m.mu.RUnlock()
|
|
|
|
return length
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// IsEmpty checks whether the map is empty.
|
|
|
|
// It returns true if map is empty, or else false.
|
|
|
|
func (m *AnyAnyMap) IsEmpty() bool {
|
2019-10-16 23:33:06 +08:00
|
|
|
return m.Size() == 0
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Clear deletes all data of the map, it will remake a new underlying data map.
|
|
|
|
func (m *AnyAnyMap) Clear() {
|
2019-06-19 09:06:52 +08:00
|
|
|
m.mu.Lock()
|
|
|
|
m.data = make(map[interface{}]interface{})
|
|
|
|
m.mu.Unlock()
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
2019-11-04 21:26:16 +08:00
|
|
|
// Replace the data of the map with given <data>.
|
|
|
|
func (m *AnyAnyMap) Replace(data map[interface{}]interface{}) {
|
|
|
|
m.mu.Lock()
|
|
|
|
m.data = data
|
|
|
|
m.mu.Unlock()
|
|
|
|
}
|
|
|
|
|
2019-05-11 20:47:25 +08:00
|
|
|
// LockFunc locks writing with given callback function <f> within RWMutex.Lock.
|
|
|
|
func (m *AnyAnyMap) LockFunc(f func(m map[interface{}]interface{})) {
|
2019-06-19 09:06:52 +08:00
|
|
|
m.mu.Lock()
|
|
|
|
defer m.mu.Unlock()
|
|
|
|
f(m.data)
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// RLockFunc locks reading with given callback function <f> within RWMutex.RLock.
|
|
|
|
func (m *AnyAnyMap) RLockFunc(f func(m map[interface{}]interface{})) {
|
2019-06-19 09:06:52 +08:00
|
|
|
m.mu.RLock()
|
|
|
|
defer m.mu.RUnlock()
|
|
|
|
f(m.data)
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Flip exchanges key-value of the map to value-key.
|
|
|
|
func (m *AnyAnyMap) Flip() {
|
2019-06-19 09:06:52 +08:00
|
|
|
m.mu.Lock()
|
|
|
|
defer m.mu.Unlock()
|
|
|
|
n := make(map[interface{}]interface{}, len(m.data))
|
|
|
|
for k, v := range m.data {
|
|
|
|
n[v] = k
|
|
|
|
}
|
|
|
|
m.data = n
|
2019-05-11 20:47:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Merge merges two hash maps.
|
|
|
|
// The <other> map will be merged into the map <m>.
|
|
|
|
func (m *AnyAnyMap) Merge(other *AnyAnyMap) {
|
2019-06-19 09:06:52 +08:00
|
|
|
m.mu.Lock()
|
|
|
|
defer m.mu.Unlock()
|
|
|
|
if other != m {
|
|
|
|
other.mu.RLock()
|
|
|
|
defer other.mu.RUnlock()
|
|
|
|
}
|
|
|
|
for k, v := range other.data {
|
|
|
|
m.data[k] = v
|
|
|
|
}
|
|
|
|
}
|
2019-07-13 17:48:16 +08:00
|
|
|
|
|
|
|
// MarshalJSON implements the interface MarshalJSON for json.Marshal.
|
|
|
|
func (m *AnyAnyMap) MarshalJSON() ([]byte, error) {
|
|
|
|
return json.Marshal(gconv.Map(m.Map()))
|
|
|
|
}
|
2019-09-30 14:23:15 +08:00
|
|
|
|
|
|
|
// UnmarshalJSON implements the interface UnmarshalJSON for json.Unmarshal.
|
|
|
|
func (m *AnyAnyMap) UnmarshalJSON(b []byte) error {
|
|
|
|
if m.mu == nil {
|
|
|
|
m.mu = rwmutex.New()
|
|
|
|
m.data = make(map[interface{}]interface{})
|
|
|
|
}
|
|
|
|
m.mu.Lock()
|
|
|
|
defer m.mu.Unlock()
|
|
|
|
var data map[string]interface{}
|
|
|
|
if err := json.Unmarshal(b, &data); err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
for k, v := range data {
|
|
|
|
m.data[k] = v
|
|
|
|
}
|
|
|
|
return nil
|
|
|
|
}
|
2020-01-20 19:56:42 +08:00
|
|
|
|
|
|
|
// UnmarshalValue is an interface implement which sets any type of value for map.
|
|
|
|
func (m *AnyAnyMap) UnmarshalValue(value interface{}) (err error) {
|
|
|
|
if m.mu == nil {
|
|
|
|
m.mu = rwmutex.New()
|
|
|
|
m.data = make(map[interface{}]interface{})
|
|
|
|
}
|
|
|
|
m.mu.Lock()
|
|
|
|
defer m.mu.Unlock()
|
|
|
|
for k, v := range gconv.Map(value) {
|
|
|
|
m.data[k] = v
|
|
|
|
}
|
|
|
|
return
|
|
|
|
}
|