arrays - Storing hierarchy of tree levels in recursion using javascript - 


function formselectedtree(totaldata, selectedids) {     if (!array.isarray(totaldata)) return;     (var item of totaldata) {         if ((!item.children || item.children.length === 0)) {             selectedids.map(function(id, index) {                 if (parseint(item.id) === parseint(id)) {                     item.isselected = true                     item.open = true                 }             })         } else {             this.formselectedtree(item.children, selectedids);         }     }     return totaldata }

parameters:

  • totaldata-array of objects(find below json)
  • selectedids:array of string(id's of leaf nodes)["1749","1747"]

the above recursive function iterate tree json object. getting id's of leafnodes backend, based on these id's , should select leaf node , expand tree structure parent level.

the selection handled using 'isselected' boolean property expanding of tree nodes handled using 'open' boolean property.

i able set these properties leaf node. facing difficulty set open=true parent/sub-parent levels.

please find below sample json object

{     "data": [{         "id": 1745,         "parentid": null,         "isselected": false,         "open": false,         "children": [{             "id": 1746,             "parentid": 1745,             "isselected": false,             "open": false,             "children": [{                     "id": 1747,                     "parentid": 1746,                     "isselected": false,                     "open": false                 },                 {                     "id": 1748,                     "parentid": 1746,                     "isselected": false,                     "open": false,                     "children": [{                         "id": 1749,                         "parentid": 1748,                         "isselected": false,                         "open": false                     }]                 }             ]         }]     }] }

can me in achieving difficulty.

thanks

this example adds parentnode property each node encountered, , uses set "open" property of ancestors given selected leaf node, once has been located.

function formselectedtree(totaldata, selectedids, parentnode) {    if (!parentnode) parentnode = false;    if (!array.isarray(totaldata)) return;    (var item of totaldata) {      // set parentnode property each item traverse      item.parentnode = parentnode;      if ((!item.children || item.children.length === 0)) {          selectedids.map(function(id, index) {              if (parseint(item.id) === parseint(id)) {                  item.isselected = true                  item.open = true                                    // since leaf item selected/open, ancestors should open                  var p = item.parentnode;                  while (p) {                    p.open = true;                    // travel through hierarchy until parentnode doesn't exist (top level)                    p = p.parentnode;                  }              }          })      } else {          this.formselectedtree(item.children, selectedids, item);      }    }    return totaldata;  }


Comments

Post a Comment

Popular posts from this blog

neo4j - finding mutual friends in a cypher statement starting with three or more persons -

Image
i trying build cypher statement neo4j know 2-n starting nodes name , need find node (if any) can reached of starting nodes. at first tought similar "mutual friend" situation handled (start1)-[*..2]->(main)<-[*..2]-(start2) in case have more 2 starting points around 6 know name. so puzzled how can include third, fourth , on node cypher able find commmon root amongst them. in above example neo4j website need path starting 'dilshad', 'becky' , 'cesar' check if have common friend (anders) excluding 'filipa' , 'emil' not friends of three. so far create statement programmatically looks like match (start1 {name:'person1'}), (start2 {name:'person2'}), (start3 {name: 'person3'}), (main) (start1)-[*..2]->(main) , (start2)-[*..2]->(main) , (start3)-[*..2]->(main) return distinct main but wondering if there more elegant / efficient way in cypher possibly use list of names parameter ...
Read more

php - How to remove letter in front of the word laravel -

Image
based on picture above result of var_dump() , dd() of same variable ,when var_dump() , apostrophe (') symbol in black diamond of question mark , when dd() same variable , apostrophe can seen letter 'b' appear in front of words what want can me result : loreal's sdn bhd and @ same time want remove special character ( excluding these 4 symbols (-) ,(_) ,('),(,) ) simply escape special character resolve issue. mysqli_real_escape_string resolve issue. $name = mysqli_real_escape_string($request()->user); or use addslashes function() $name = addslashes($request()->user);
Read more

minify - Minimizing css files -

i want know how css files can minimized. currently, using external sites css minifier compress css files. however, after removing whitespaces, comments, etc, file sizes reduced 10-15%. how frameworks bootstrap manage make minimized versions kilobytes. as example, css is: body { background-color: #ff0; } the reduction goes 28 bytes 22 bytes other css files have lot more characters still smaller this. actually minifying code means it's remove thing code white space characters new line characters comments block delimiters it reduces amount of code has transferred on web , speed site load fastly.but unreadable format.
Read more