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...
Read more

What is the difference between data design and data model(ERD) -

-
i have google question , find answer in day. know, data design many many table have list column,and mark pk , fk. why er-diagram have find this? data design process of designing database. main output of data design detailed logical data model of database. some people data design includes of needed logical , physical design choices , physical storage parameters needed generate design in data definition language. technically, database analysis, database analysts (dbas) trained do. while person can both data design , database analysis, these 2 different tasks. data design models data. database analysis takes model , applies 1 or more database engines (relational, hierarchical, nosql). a logical data model 1 of main outputs of data design. data model represented entity relationship diagram, or er diagram.
Read more

ios - Can NSManagedObject conform to NSCoding -

-
i need transfer single object across device. right converting nsmanagedobject dictionary , archiving , sending nsdata. upon receiving unarchiving it. transfer nsmanagedobject archiving , unarchiving instead of creating intermediate data object. @interface test : nsmanagedobject<nscoding> @property (nonatomic, retain) nsstring * title; @end @implementation test @dynamic title; - (id)initwithcoder:(nscoder *)coder { self = [super init]; if (self) { self.title = [coder decodeobjectforkey:@"title"]; //<crash } return self; } - (void)encodewithcoder:(nscoder *)coder { [coder encodeobject:self.title forkey:@"title"]; } @end nsdata *archivedobjects = [nskeyedarchiver archiveddatawithrootobject:testobj]; nsdata *objectsdata = archivedobjects; if ([objectsdata length] > 0) { nsarray *objects = [nskeyedunarchiver unarchiveobjectwithdata:objectsdata]; } the problem above code is. crashes @ self.title in initwithcoder sa...
Read more