Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re: recursive creation of attached objects?

by remiah (Hermit)
on Sep 14, 2012 at 04:06 UTC ( #993631=note: print w/ replies, xml ) Need Help??


in reply to recursive creation of attached objects?

Hello.

You return nothing at recursive call. But, at first, you will see lots of warnings if you put use strict and use warnings for your code...

It maybe like this.

{ package bin_tree; use strict; use warnings; sub new{ my $class=shift; my $self={value=>undef, a=>undef, b=>undef}; #make our object as a +n anonymous hash with keywords but no values yet, that way the a an $self->{value}=0; bless $self, $class; #make object return $self; #return object } sub populate{ my($self, $depth)=@_; return if(! $depth); $self->{a} = populate( bin_tree->new() , $depth -1 ); $self->{b} = populate( bin_tree->new() , $depth -1 ); return $self; } 1; } #end bin_tree package main; use strict; use warnings; #try to create a three node deep binary tree my $bintree = bin_tree->new(); $bintree->populate(3); use Data::Dumper; print Dumper $bintree;
Moose has "Recipe 3" for Binary Tree. It is far more advanced.


Comment on Re: recursive creation of attached objects?
Download Code
Re^2: recursive creation of attached objects?
by NetWallah (Abbot) on Sep 14, 2012 at 04:54 UTC
    Added "depth_test" to your code, and added more lines to main code to make a more interesting structure.

    The "value" can track the origination of each node.

    use strict; use warnings; { package bin_tree; use strict; use warnings; sub new{ my $class=shift; my $self={value=>shift, a=>undef, b=>undef}; $self->{value}||=0; bless $self, $class; return $self; } sub a{ my ($self, $setval) = @_; $setval or return $self->{a}; return $self->{a} = $setval; } sub b{ my ($self, $setval) = @_; $setval or return $self->{b}; return $self->{b} = $setval; } sub populate{ my($self, $depth, $value)=@_; return if(! $depth); $value ||= $self->{value}; $self->a ( populate( bin_tree->new($value) , $depth -1 ) ); $self->b ( populate( bin_tree->new($value) , $depth -1 ) ); return $self; } sub depth{ my ($self, $level)=@_; $level ||= 1; if (defined $self->a()){ return $self->a()->depth($level + 1); } return $level; } 1; } #end bin_tree package main; my $bintree = bin_tree->new('Initial') -> populate(3); use Data::Dumper; print "BEFORE: " ,Dumper ($bintree),"Depth:",$bintree->depth() ,"\n"; $bintree->a()->a()->populate(2,'Firstlevel') -> b( bin_tree->new('sec +ondlevel')); print "After: ", Dumper ($bintree),"Depth:",$bintree->depth(), "\n";
    Update : Minor tweaks - added a() and b() methods. Renamed depth_test(). Changed test structure. populate() allows optional new 'value' param.

                 I hope life isn't a big joke, because I don't get it.
                       -SNL

      Thanks for reply

      I learned I can put header to Dumper ouput with

      print "After:", Dumper $bintree,"\n";
      
      This is not trivial thing for me. This will help me a lot.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://993631]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (18)
As of 2014-09-30 14:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    How do you remember the number of days in each month?











    Results (373 votes), past polls