dp13668681869 2017-09-25 12:43
浏览 425
已采纳

将扁平化的json转换为嵌套的json

Currently I'm using the following code to convert nested json into flattened json:

import (
    "fmt"

    "github.com/nytlabs/gojsonexplode"
)
func main() {
    input := `{"person":{"name":"Joe", "address":{"street":"123 Main St."}}}`
    out, err := gojsonexplode.Explodejsonstr(input, ".")
    if err != nil {
        // handle error
    }
    fmt.Println(out)
}

This is the output: {"person.address.street":"123 Main St.","person.name":"Joe"}

After some processing, now I want to restore this data into normal nested json, but I'm unable to do so.

My closest guess is usage of nested maps, but I don't know how to create nested map with N levels.

EDIT: Reason why I need this: I'm storing data in Redis, and if I store json into Redis then I can't search for keys, that's why I convert keys into key1:key2:key3: some_value

  • 写回答

2条回答 默认 最新

  • dongxun2089 2017-09-25 14:17
    关注

    In order to "unflatten" the data you need to split each of the keys at the dot and create nested objects. Here is an example with your data on the Go Playground.

    func unflatten(flat map[string]interface{}) (map[string]interface{}, error) {
        unflat := map[string]interface{}{}
    
        for key, value := range flat {
            keyParts := strings.Split(key, ".")
    
            // Walk the keys until we get to a leaf node.
            m := unflat
            for i, k := range keyParts[:len(keyParts)-1] {
                v, exists := m[k]
                if !exists {
                    newMap := map[string]interface{}{}
                    m[k] = newMap
                    m = newMap
                    continue
                }   
    
                innerMap, ok := v.(map[string]interface{})
                if !ok {
                    return nil, fmt.Errorf("key=%v is not an object", strings.Join(keyParts[0:i+1], "."))
                }   
                m = innerMap
            }   
    
            leafKey := keyParts[len(keyParts)-1]
            if _, exists := m[leafKey]; exists {
                return nil, fmt.Errorf("key=%v already exists", key)
            }   
            m[keyParts[len(keyParts)-1]] = value
        }   
    
        return unflat, nil 
    } 
    
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论
查看更多回答(1条)

报告相同问题?

悬赏问题

  • ¥35 平滑拟合曲线该如何生成
  • ¥100 c语言,请帮蒟蒻写一个题的范例作参考
  • ¥15 名为“Product”的列已属于此 DataTable
  • ¥15 安卓adb backup备份应用数据失败
  • ¥15 eclipse运行项目时遇到的问题
  • ¥15 关于#c##的问题:最近需要用CAT工具Trados进行一些开发
  • ¥15 南大pa1 小游戏没有界面,并且报了如下错误,尝试过换显卡驱动,但是好像不行
  • ¥15 自己瞎改改,结果现在又运行不了了
  • ¥15 链式存储应该如何解决
  • ¥15 没有证书,nginx怎么反向代理到只能接受https的公网网站