algorithm - Javascript Recursion Tree Building -


i having issue building tree flat array. building category -> subcategory tree in parent has subcategories array.

here flat array like:

[   {     "id": 1   },   {     "id": 5,   },   {     "id": 2,     "parent_id": 1   },   {     "id": 3,     "parent_id": 1   },   {     "id": 42,     "parent_id": 5   },   {     "id": 67,     "parent_id": 5   } ]

and need result look:

[   {     "id":1,     "subcategories":[       {         "id":2,         "parent_id":1       },       {         "id":3,         "parent_id":1       }     ]   },   {     "id":5,     "subcategories":[       {         "id":42,         "parent_id":5       },       {         "id":67,         "parent_id":5       }     ]   } ]

i have tried recursively recursively searching children , attaching array , continuing until hit bottom of barrel getting cyclic structure. appears parent_id in traverse id of parent... ideas:

tree(passinginflatobjecthere);  function toplevel (data) {   let blob = [];   data.foreach((each) => {     if (!each.parent_id) {       blob.push(each);     }   });   return blob; }  function tree (data) {   let blob = toplevel(data).map(function (each) {     each.subcategories = traverse(data, each.id);     return each;   });   return blob; }  function traverse (data, parent_id) {   let blob = [];   if (!parent_id) {     return blob;   }   data.foreach((each) => {     if (each.id === parent_id) {       each.subcategories = traverse(data, each.id);       blob.push(each);     }   });   return blob; }

i don’t want fix problem take full advantage of es6

first of toplevel function can rewritten this:

function toplevel(data) {   return data.filter(node => !node.parent_id); }

neat isn’t it? recommend changing tree consistency that’s of course stylistic.

function tree(data) {   return toplevel(data).map(each => {     each.subcategories = traverse(data, each.id);     return each;   }); }

no logic issues far. traverse, however, contains one, when check each.id === parent_id. this, functions searches node id parent_id. mistake. wanted each.parent_id === parent_id.

your issue solved now. stop reading if bother you. take advantage of filter here , remove superfluous exit , rewrite function to: 

function traverse(data, parentid) {   const children = data.filter(each => each.parent_id === parentid);   children.foreach(child => {     child.subcategories = traverse(data, child.id);   });   return children; }

Comments

Post a Comment

Popular posts from this blog

'hasOwnProperty' in javascript -

i use obj.hasownproperty judge whether object has property, when replaced obj[prop] !== undefined , not normal implementation, ask, why behind method can not use it? object.hasownproperty(prop); object[prop] !== undefined; obj[prop] !== undefined wrong 2 reasons: you can explicitly set property undefined , obj[prop] = undefined; . obj.hasownproperty(prop) return true in case. obj[prop] follow prototype chain, return property that's inherited. obj.hasownproperty(prop) returns true if property exists directly in object, returns false inherited properties.
Read more

How to understand 2 main() functions after using uftrace to profile the C++ program? -

i trying uftrace profile following simple c++ program: #include <iostream> class { public: a() {std::cout << "a created" << std::endl;} ~a() {std::cout << "a destroyed" << std::endl;} }; int main() { a; return 0; } the profile result this: # uftrace a.out created destroyed # duration tid function 2.026 [ 4828] | __cxa_atexit(); [ 4828] | main() { [ 4828] | __static_initialization_and_destruction_0() { 89.397 [ 4828] | std::ios_base::init::init(); 0.768 [ 4828] | __cxa_atexit(); 93.029 [ 4828] | } /* __static_initialization_and_destruction_0 */ 94.425 [ 4828] | } /* main */ [ 4828] | main() { [ 4828] | a::a() { 11.104 [ 4828] | std::operator <<(); 10.825 [ 4828] | std::basic_ostream::operator <<(); 24.514 [ 4828] | } /* a::a */ [ 4828] | a::~a() { 0.978 [ 4828] | ...
Read more

android - Unable to generate FCM token from dynamically instantiated Firebase -

our business logic requires instantiate firebase during runtime. fetch firebase credentials (app id, api key etc.) default firebase location after knowing user's public key , create firebase instance using credentials. this means there 2 firebase instances used within app: the default "index" firebase gives credentials second the actual firebase intend use point forward the second firebase initialised this: firebaseapp app = firebaseapp.initializeapp(<context>, <options>, <app_label>); our problem traditional method of retrieving fcm token using firebaseinstanceidservice , ontokenrefresh() fails since ontokenrefresh() method called first firebase instance. directly calling string token = firebaseinstanceid.getinstance(app).gettoken(); returns null never ready when called. have tried polling test if token generated @ point. no luck. how can generate fcm token reliably firebase instance instantiated during runtime? i...
Read more