It creates the left and right values automatically (I'm the author of DBIx::Tree::NestedSet) when you invoke any method that deletes/moves/adds nodes. What use would the module be if it didn't? Did you even try the code I posted in the other thread you created?

With a nested set you don't need a parent ID: the hierarchy is created via left and right. Managing a parent id is redundant.

Traversing the tree is right in the docs.

I am afraid I am not versed enough in Perl's complex data structures and Object-Oriented programming to fathom how the module would generate right and left ids without using a parent id as a point of comparison! I just had a chance to look at the code and it calls for explicit usage of all the nodes. To be honest with you, I was looking for a quick and dirty way of building the ids without having to specify explicitly what my nodes are. I'll be happy to use your wonderful module if it would allow me to traverse the tree. In fact, now that you confirmed that it was designed for that purpose, I am planning to re-read the docs again and study your code to see how I can traverse the tree programmatically. I really appreciate your time in developing the module and just wish I was bright enough to understand all its capabilities. Please bear with this poor, un-enlightened monk!

my $root =1;
my $counter = 1;
rebuild_tree($root);

sub rebuild_tree{
my $idy = shift;

my $result= $dbh->prepare("SELECT id FROM terms WHERE parent_id = ?");
my $left = $dbh->prepare("UPDATE terms SET left_id=? WHERE id = ?");
my $right= $dbh->prepare("UPDATE terms SET right_id=? WHERE id = ?");


$left->execute($ctr++,$idy);
$result->execute($idy);
  while (my $i = $result->fetchrow_hashref()) {
  rebuild_tree($i->{id});
  }
$right->execute($ctr++,$idy);

}#end of sub
[download]

Since you are calling it recursivly you WANT to prepare them in there. Otherwise you handles would be re-executed before they finished fetchrowing. :)


___________
Eric Hodges