Need assistance with recursion in JS -

-

i'm having great deal of trouble wrapping head around recursion. simple recursion can 1 not easy me. goal here speed search algorithm. i'm guessing recursion help. takes 15 seconds on simple 43 node tree children is. below unrolled recursion fomr of code works. 

var nodelist = new array();          var removelist = new array();          var count = 0;          var foundinthisnodetree;           var find = function ( condition )          {          }           while ( this.treeidmap.igtree( "nodebypath", count ).data() )          {              var foundinthisnodetree = false;              var n;              n = this.treeidmap.igtree( "nodefromelement", this.treeidmap.igtree( "nodebypath", count ) )              if ( n.data.item.indexof( filter ) > -1 ) { foundinthisnodetree = true; }              else {//look deeper                  var = 0;                  while ( this.treeidmap.igtree( "nodebypath", count + "_" + ).data() )                  {                      n = this.treeidmap.igtree( "nodefromelement", this.treeidmap.igtree( "nodebypath", count + "_" + ) );                      if ( n.data.item.indexof( filter ) > -1 ) { foundinthisnodetree = true; break; }                      else {//look deeper                          var j = 0;                          while ( this.treeidmap.igtree( "nodebypath", count + "_" + + "_" + j ).data() )                          {                              n = this.treeidmap.igtree( "nodefromelement", this.treeidmap.igtree( "nodebypath", count + "_" + + "_" + j ) );                              if ( n.data.item.indexof( filter ) > -1 ) { foundinthisnodetree = true; break; }                              else {//look deeper                                  var k = 0;                                  while ( this.treeidmap.igtree( "nodebypath", count + "_" + + "_" + j + "_" + k ).data() )                                  {                                      n = this.treeidmap.igtree( "nodefromelement", this.treeidmap.igtree( "nodebypath", count + "_" + + "_" + j + "_" + k ) );                                      if ( n.data.item.indexof( filter ) > -1 ) { foundinthisnodetree = true; break; }                                      k++;                                  }                              }                               j++;                          }                      }                      i++;                  }              }              if ( !foundinthisnodetree ) this.treeidmap.igtree("removeat", ""+count )              else count++;          }

*** second revision suggested mirco ellmann *****

var nodelist = new array();          var removelist = new array();          var count = 0;          var foundinthisnodetree;          filter = filter.tolowercase();          while ( this.treeidmap.igtree( "nodebypath", count ).data() )          {              var foundinthisnodetree = false;              var n;              n = this.treeidmap.igtree( "nodefromelement", this.treeidmap.igtree( "nodebypath", count ) )              if ( n.data.item.tolowercase().indexof( filter ) > -1 ) { foundinthisnodetree = true; }              else {//look deeper                  var = 0;                  n = this.treeidmap.igtree( "childrenbypath", count );                  while ( n[i] )                  {                      if ( n[i].data.item.indexof( filter ) > -1 ) { foundinthisnodetree = true; break; }                          var j = 0;                          n = this.treeidmap.igtree( "childrenbypath", count + "_" + );                          while ( n[j]  )                          {                              if ( n[j].data.item.indexof( filter ) > -1 ) { foundinthisnodetree = true; break; }                                  var k = 0;                                  n = this.treeidmap.igtree( "childrenbypath", count + "_" + + "_" + j);                                  while ( n[k] )                                  {                                      if ( n[k].data.item.indexof( filter ) > -1 ) { foundinthisnodetree = true; break; }                                      k++;                                  }                              j++;                          }                       i++;                  }              }              if ( !foundinthisnodetree ) this.treeidmap.igtree("removeat", ""+count )              else count++;          }

****using branchable trees data no need calls tree****

 var count = 0;  var foundinthisnodetree;  filter = filter.tolowercase();  while ( this.treeidmap.igtree( "nodebypath", count ).data() )  {      var foundinthisnodetree = false;      var n;      n = this.treeidmap.igtree( "nodefromelement", this.treeidmap.igtree( "nodebypath", count ) )      if ( n.data.item.tolowercase().indexof( filter ) > -1 ) { foundinthisnodetree = true; }      if ( n.data.branch )//look @ childer under root node      {                var = 0;          n = n.data.branch;          while ( n[i] )//look @ childer under root node          {                   if ( n[i].item.tolowercase().indexof( filter ) > -1 ) { foundinthisnodetree = true; break; }             while ( n[i].branch )//look deeper             {                 var j = 0;                 n = n[i].branch;                 if ( n[j].item.tolowercase().indexof( filter ) > -1 ) { foundinthisnodetree = true; break; }                 while ( n[j].branch )//look deeper                 {                     var k = 0;                     n = n[j].branch;                     if ( n[k].item.tolowercase().indexof( filter ) > -1 ) { foundinthisnodetree = true; break; }                     k++;                 }                  j++;             }               i++;          }      }      if ( !foundinthisnodetree ) this.treeidmap.igtree("removeat", ""+count )      else count++;  }

instead of use "nodebypath" should use "childrenbypath".

that minimize search calls on igtree.

ps: use not replace ;)


Comments

Post a Comment

Popular posts from this blog

java - Jmockit String final length method mocking Issue -

-
using jmockit 1.2 jar, trying mock string's length method getting unexpected invocation exception: failed: test java.lang.illegalstateexception: missing invocation mocked type @ point; please make sure such invocations appear after declaration of suitable mock field or parameter @ stringdemo.testa$1.<init>(testa.java:17) @ stringdemo.testa.test(testa.java:13) i using testng: @test public void test() throws exception { new expectations() { @mocked("length") string astring; { astring.length(); result = 2; } }; system.out.println(a.showa("test")); } } actual class a: public class { public static int showa(string str){ int a= str.length(); return a; } } this wrong way of recording expected results. shouldn't mock , record string's length() method, record showa() instead. here solution @suppresswarnings("unused&qu
Read more

asp.net - Razor Page Hosted on IIS 6 Fails Every Morning -

-
i have simple page in intranet uses razor/asp fetch single record table , display it, plus few graphic, dashboard display. meaning, no user intervention other first time open ie internal url. the problem having every morning ie displays "page not found or network error" message. refresh page, , it's stuck , doesn't display anything. try different pc, open ie internal url , it's stuck... ...until following: login server hosting page run inetmgr go web sites, etc right click on page that's giving me problem , select browse at moment, error message: server error in '/' application. -------------------------------------------------------------------------------- type of page not served. description: type of page have requested not served because has been explicitly forbidden. extension '.cshtml' may incorrect. please review url below , make sure spelled correctly. requested url: /application/dashboard.cshtml ---------------
Read more

c++ - wxwidget compiling on windows command prompt -

-
can please guide me on method,as how compile wxwidget using windows command prompt or msys. [i can't seem find on wxwiki/wxwidget official book/anywhere else] i have compiled wxwidget instructions have provided (using msys). from searching on internet seems 1 can (maybe?) through use of makefile (is correct?) if yes: directory & how should link wx libraries in makefile if no: way besides makefile? i know can use ide's code::block , make life simpler prefer compile using command prompt/msys. thanks in advance.
Read more