javascript-objects

I have a tree object as below, I am trying to remove the items array property if it's empty. I am not sure on the best approach to do this? I am thinking of looping through the key, check the property and then remove using delete myJSONObject[prop] ... Any thoughts / ideas are welcome? [{ text: "TreeRoot", items: [{ text: "Subgroup1", items: [] }, { text: "Subgroup2", items: [] }, { text: "Subgroup3", items: [], items: [{ text: "subgroup5", items: [{ text: "subgroup6", items: [{ text: "subgroup7", items: [{ text: "subgroup8", items: [] }] }] }] }] }] }] This should do the job ( ES5 ): function

I'm learning about new uses of spreading . I realize that object spread is an ES2018 proposal. It works in Node 10.5 in the following manner: const oldObj = {name:"doug", age:34}; const newObj = {...oldObj}; console.log(newObj); // { name: 'doug', age: 34 } One interesting use of spreading is to convert iterables into arrays. It works fine with Maps, for example, giving you an array of arrays of value pairs const mappie = new Map().set("name", "doug").set("age", 234).set("profession", "seeker of Cthulhu"); const arr1 = [...mappie]; console.log(arr1); // [ [ 'name', 'doug' ], [ 'age', 234 ], [

I have a javascript dictionary object which has a pre-set keys that are defaulted to 0 . Then I need to loop through the elements of this dictionary by index and use the value of the key to set its value. Below is my code to make things easier to understand: var _map = { 'severity-normal': 0, 'severity-minimal': 0, 'severity-moderate': 0, 'severity-severe': 0, 'severity-highly-severe': 0 }; mapSeverities: function () { for (var i = 0; i < _map.length; i++) { //get the key value, ex: severity-normal, by index (which would by i) var key = //retrieved key value _map[key] = this.data(key); } } In

I have a nested javascript object like this: { "apple": { "orange": { "chilli": {}, "pineapple": { "mango": {} } }, "carrot": { "cabbage": {}, "onion": {} } } } i want to get the path (keys) of the deepest nested object. something like apple.orange.pineapple.mango any help is appriciated :) You could return an array of arrays with the longest pathes. This works for more than one path with the same length. function getDeepest(object) { return object && typeof object === 'object' ? Object.entries(object).reduce((r, [k, o]) => { var temp = getDeepest(o).reduce((r, a, i) => { if (!i || r[0].length