in reply to Re: various hash construction/ printing questions..
in thread how to construct tree from parent pointer list
That was very informative. What if I have three points of data.. say, child, parent, node name (ie descriptor)? Something like:
__DATA__ b:a:apples d:b:fuji apples <\c> <p> The structure would look something like: <p> <c> $VAR1 = { 'a' => { 'name' => 'fruit', 'child' => { 'b' => { 'name' => 'apples', 'child' => { 'd' => { 'name' +=> 'fuji apples' } } } } } };
Can your current algorithm be modified to work with this?
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^3: various hash construction/ printing questions..
by demerphq (Chancellor) on Jun 14, 2009 at 10:12 UTC | |
by bryank (Acolyte) on Jun 17, 2009 at 00:51 UTC |