Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re^3: Build tree data structure from DB (flat) data; function golf

by imp (Priest)
on Sep 02, 2006 at 04:41 UTC ( #570857=note: print w/ replies, xml ) Need Help??


in reply to Re^2: Build tree data structure from DB (flat) data; function golf
in thread Build tree data structure from DB (flat) data; function golf

The structure's ideal format depends on how it will be used

gryphon's output seems like something intended for HTML::Template, which only accepts scalars or arrays of hashrefs unfortunately. It wouldn't be able to iterate over your proposed structure.


Comment on Re^3: Build tree data structure from DB (flat) data; function golf

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (9)
As of 2014-07-24 08:57 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (158 votes), past polls