Change the key value in the tree structure

const target = [{
    "title": "",
    "value": "",
    "children": [{
        "title": "",
        "value": "361,123",
        "children": null
      },
      {
        "title": "",
        "value": "361,123",
        "children": null
      },
      {
        "title": "",
        "value": "361,123",
        "children": null
      },
      {
        "title": "",
        "value": "361,123",
        "children": [{
            "title": "",
            "value": "361,123",
            "children": null
          },
          {
            "title": "",
            "value": "361,123",
            "children": null
          }
        ]
      }
    ]
  },
  {
    "title": "",
    "value": "",
    "children": null
  }
]

has the following data structure, how to change the title into name, how to use recursive writing can not come around, please expert advice.

Javascript
May.13,2022 
function trans (data) {
  data.forEach(item => {
    item.name = item.title // titlename
    delete item.title // title

    item.children && trans(item.children) // children
  })
}

trans(target)
console.log(target)


replace(target);

function replace(target) {
  if (target instanceof Array) {
    target.forEach(element => {
      replace(element);
    });
  } else if (target && typeof target === "object") {
    Object.keys(target).forEach(key => {
      if (target[key] && typeof target[key] === "object") {
        replace(target[key]);
      }
      if (key === 'title') {
        target['name'] = target[key];
        delete target['title'];
      }
    });
  } else {
    return;
  }
}
console.log(target);

first converts to a JSON string, then replaces all title attributes of the string, and finally converts it to a string.

but you need to change const target to let target 

JSON.stringify(target).replace(/"title":/g,'"name":'))

if you don't like this method, you can choose recursion to solve it.

there are so many answers, all of which are good answers, but it is better to teach people to fish than to teach people to fish. I can briefly share my own experience in writing recursive code to prevent ignorance. There are generally three points:

  • find the subproblems in recursion first
  • find the condition to start recursion again
  • find the condition to end recursion again

in your example, the corresponding should be:

  • replace title with name
  • the current traversal object has a children attribute and is not empty
  • the current traversal object has no children or the children property is empty

then write a pseudo code according to this: 

function recurse(node) {
    // 
    ...( title  name )
    
    // 
    if(node.children && node.children.length > 0) {
        // ...
        node.children.forEach(recurse)
    } else {
        // ...
        return
    }
}

then you will find that you only need to implement the part of the code that replaces title with name. 

            function transferKey(arr){
                arr.forEach(obj => {
                    obj.name = obj.title
                    delete obj["title"]
                    if(obj.children instanceof Array){
                        transferKey(obj.children)
                    }
                })
                return arr
            }

Previous: There is a "warehouse path" does not appear to be a git repository problem with the push code on Aliyun code?

Next: Laravel sends email with error 250

css mysql arrays josn react html typescript webpack npm sass R objective-c .net sql-server jquery python-3.x angularjs django angular excel regex iphone ajax linux xml pandas vba spring database wordpress string wpf xcode windows bash postgresql oracle multithreading eclipse list firebase algorithm macos forms image scala visual-studio azure bootstrap spring-boot react-native python-2.7 docker performance function winforms matlab powershell apache dataframe api sqlite numpy rest shell selenium flutter dart maven loops qt swing android-studio csv express file class tensorflow sorting codeigniter perl
© 2021 CodesHelper
Advertising Contact us About us
Menu