CODEWITHSUNDEEP
javascriptarraysjsonhashmap
Nadvez
Nadvez

Reputation: 83

Create Hashmap like implementation using java-script for json

I am looking to create hashmap like array which will contain key and value derived from another array which has nested objects.

so i am trying the following code.

    var testhash={},data=[
      {
        "yang_type": "container",
        "name": "c1",
        "value": "",
        "children": [
          {
            "yang_type": "container",
            "name": "c2",
            "value": "",
            "children": [
              {
                "yang_type": "list",
                "name": "Car",
                "value": "",
                "children": [
                  {
                    "yang_type": "leaf",
                    "name": "wheels",
                    "value": "",
                    "children": [
                      {
                        "name": "max-elements",
                        "value": "4",
                        "children": [],
                        "yang_type": ""
                      }
                    ]
                  }
                ]
              },
              {
                "yang_type": "",
                "name": "text",
                "value": "4",
                "children": []
              }
            ]
          }
        ]
      }
    ];

 var k='';
                    function loop1(a, depth) {
                        var l,s='';
                        if(depth){s += '/';}
                        k=k+a.yang_type+a.name+a.value;
                        v=Array(depth + 1).join(s) + a.yang_type+a.name+a.value;
                        testhash.push(k:v);
                        //console.log(l);
                          //console.log(Array(depth + 1).join("/") + a.yang_type,a.name,a.value);
                          //hashServiceParams.push(Array(depth + 1).join("/") + a.yang_type,a.name,a.value);

                          Array.isArray(a.children) && a.children.forEach(function(child) {
                              loop1(child, depth + 1);
                          });
                        }
                    console.log(testhash);

The output, I am expecting is 

{"containerc1":*,"containerc2":"containerc1/containerc2","listcar":"containerc1/containerc2/listcar","leafwheels":"containerc1/containerc2/listcar/leafwheels","max-elements":"containerc1/containerc2/listcar/leafwheels/max-elements","text4":"containerc1/text4"}

The above array will act as an hash map that contains key and value , where value stores the part of that data in the tree structure.

my code just calculates the depth and adds / to each level it moves down but i expect the output to be as shown above. Any recommendation coders ?

Upvotes: 0

Views: 126

Answers (1)

George Karanikas
George Karanikas

Reputation: 1244

The following should do the trick (use either version according to your needs):

ECMAScript 6:

function parseData(data, prefix) {
  let result = {};
  data.forEach(o => {
    const key = `${o.yang_type}${o.name}`;
    result[key] = prefix ? `${prefix}/${key}` : '*';
    if (o.children) {
      const newPrefix = prefix ? `${prefix}/${key}` : key;
      result = Object.assign(result, parseData(o.children, newPrefix));
    }
  });
  return result;
}

ECMAScript 5:

function shallowMerge(obj1,obj2){
  var obj3 = {};
  for (var attrname in obj1) { obj3[attrname] = obj1[attrname]; }
  for (var attrname in obj2) { obj3[attrname] = obj2[attrname]; }
  return obj3;
}

function parseData(data, prefix) {
  var result = {};
  data.forEach(function (o) {
    var key = '' + o.yang_type + o.name;
    result[key] = prefix ? prefix + '/' + key : '*';
    if (o.children) {
      var newPrefix = prefix ? prefix + '/' + key : key;
      result = shallowMerge(result, parseData(o.children, newPrefix));
    }
  });
  return result;
}

In order to use it you simply need to do the following:

let testhash = parseData(data);

This will populate the testHash with the result you need.

Upvotes: 1

Related Questions