如何使用Go修复Struct中的问题?

时间:2017-02-04 11:39:16

标签: 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 = 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)
    }
}

我的问题:

  1. 在函数Add()中,kvs[id]=kv有错误!如何解决?

  2. Exist()Search()的速度是否合适?不能做得更好吗?

  3. 我尝试为代码添加索引名称:type KeyVals []KeyVal更改为:mean:type KeyVals [interface{}]KeyValtype KeyVals [string]KeyVal ...但错误!

1 个答案:

答案 0 :(得分:1)

1。在函数Add(),kvs [id] = kv有错误!如何解决?

kvs的类型为* KeyVals,它不支持索引    你可以使用

(*kvs)[id] = kv 

2。 Exist()和Search()的速度是好的?不能做得更好?

您可以使用散列映射而不是数组来获得更快的搜索/存在函数。您可以将searchexist组合到一个函数中。

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)
    }
}

以下是播放链接:link