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

报告相同问题?

悬赏问题

  • ¥15 关于#python#的问题:求帮写python代码
  • ¥20 MATLAB画图图形出现上下震荡的线条
  • ¥15 LiBeAs的带隙等于0.997eV,计算阴离子的N和P
  • ¥15 关于#windows#的问题:怎么用WIN 11系统的电脑 克隆WIN NT3.51-4.0系统的硬盘
  • ¥15 来真人,不要ai!matlab有关常微分方程的问题求解决,
  • ¥15 perl MISA分析p3_in脚本出错
  • ¥15 k8s部署jupyterlab,jupyterlab保存不了文件
  • ¥15 ubuntu虚拟机打包apk错误
  • ¥199 rust编程架构设计的方案 有偿
  • ¥15 回答4f系统的像差计算