Dictionary 如何使用Go修复结构中的问题?

Dictionary 如何使用Go修复结构中的问题?,dictionary,go,struct,slice,Dictionary,Go,Struct,Slice,我在使用Go时遇到结构问题 示例代码: package main import ( "fmt" ) type KeyVal struct { Key interface{} Value interface{} } type KeyVals []KeyVal func (kvs *KeyVals) AddOld(key interface{}, val interface{}) { kv := KeyVal{key, val,typ} *kvs

我在使用Go时遇到结构问题

示例代码:

package main
import (
    "fmt"
)    
type KeyVal struct {
    Key   interface{}
    Value interface{}
}
type KeyVals []KeyVal
func (kvs *KeyVals) AddOld(key interface{}, val interface{}) {
    kv := KeyVal{key, val,typ}
    *kvs = append(*kvs, kv)
}
func (kvs *KeyVals) Add(key interface{}, val interface{}){
    var flag,id = kvs.Exist(key)
    if flag == true {
        //kv := KeyVal{key,"Updated!"}
        //*kvs=append(*kvs,kv)
        //fmt.Println(*kvs[0].Key)
        //update value of them
        kv := KeyVal{key,val}
        kvs[id]=kv
        //*kvs[id]=kv
        //fmt.Println("old set with id =",id,",","value =",kvs)
    }else{
        kv := KeyVal{key, val}
        *kvs = append(*kvs, kv)
    }
}
func (kvs *KeyVals) Search(skey interface{}) (bool,interface{},interface{}) {
    for n, kv := range *kvs {
        key := kv.Key
        val := kv.Value
        if(key == skey){
            return true,n,val
        }
    }
    return false,nil,nil
}
func (kvs *KeyVals) Exist(skey interface{})(bool,int) {
    for n, kv := range *kvs {
        key := kv.Key
        if(key == skey){
            return true,n
        }
    }
    return false,-1
}
func main() {
    var kvs keyval.KeyVals

    kvs.Add("key1","value1")
    kvs.Add("key2","value2")
    kvs.Add("key3","value3")
    kvs.Add("key4",5)
    kvs.Add("key5",5.2)
    kvs.Add("key5","new....")//this should update value of this key. but not work!


var flag,id,value = kvs.Search("key5")
fmt.Println(flag,id,value)


    for _, kv := range kvs {
        key := kv.Key
        val := kv.Value

        fmt.Println("", key," ==> ", val)
    }
}
我的问题:

  • 在函数Add()中,
    kvs[id]=kv
    有错误!如何修复

  • Exist()
    Search()
    的速度好吗?不能做得更好吗

  • 我尝试在代码中添加索引名:
    typekeyvals[]KeyVal
    更改为:mean:
    typekeyvals[interface{}]KeyVal
    typekeyvals[string]KeyVal
    。。。但是错误


  • 1。在函数Add()中,kvs[id]=kv有错误!如何修复?

    kvs
    属于*KeyVals类型,不支持索引 你可以用

    (*kvs)[id] = kv 
    
    2。Exist()和Search()的速度是否良好?不能做得更好吗?

    对于更快的搜索/存在函数,您可以使用哈希映射而不是数组。您可以将
    search
    exist
    组合为一个函数

    3。我尝试将索引名添加到代码:type KeyVals[]KeyVal更改为:mean:type KeyVals[interface{}]KeyVal或type KeyVals[string]KeyVal。。。但是错误

    类型声明错误。更接近这些类型的是
    map[interface{}]interface{}
    map[string]interface{}

    下面是更新后的代码,我使用Hashmap而不是数组和数组来跟踪顺序

    代码

    package main
    
    import (
        "fmt"
    )
    
    type KeyVals struct {
        keyVals     map[string]interface{}
        KeysInOrder []string
    }
    
    func (kvs *KeyVals) Add(key string, val interface{}) {
        if kvs.keyVals == nil {
            kvs.keyVals = make(map[string]interface{})
        }
        if _, ok := kvs.keyVals[key]; ok {
            kvs.keyVals[key] = val
            return
        }
        kvs.keyVals[key] = val
        kvs.KeysInOrder = append(kvs.KeysInOrder, key)
        return
    }
    
    func (kvs KeyVals) Search(key string) (interface{}, bool) {
        val, found := kvs.keyVals[key]
        return val, found
    }
    
    func main() {
        var kvs KeyVals
        kvs.Add("key1", "value1")
        kvs.Add("key2", "value2")
        kvs.Add("key3", "value3")
        kvs.Add("key4", 5)
        kvs.Add("key5", 5.2)
        kvs.Add("key5", "new....") //this should update value of this key. but not work!
    
        value, ok := kvs.Search("key5")
        fmt.Println(value, ok)
    
        for _, key := range kvs.KeysInOrder {
            value, _ = kvs.Search(key)
            fmt.Println(key, " ==> ", value)
        }
    }
    

    这里是播放链接:

    评论不用于扩展讨论;这段对话已经结束。