Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number
 
PerlMonks  

Re^3: Building an arbitrary-depth, multi-level hash

by samtregar (Abbot)
on Feb 28, 2009 at 22:19 UTC ( [id://747219]=note: print w/replies, xml ) Need Help??


in reply to Re^2: Building an arbitrary-depth, multi-level hash
in thread Building an arbitrary-depth, multi-level hash

Wow, no. This is basic Perl and shouldn't require a module! I love modules, probably much more than the next guy, but there's a point at which it becomes silly. What's next Scalar::Increment? Loop::For?

UPDATE: Just looked at the code for Data::Diver. Double wow!

-sam

Replies are listed 'Best First'.
Re^4: Building an arbitrary-depth, multi-level hash
by ikegami (Patriarch) on Feb 28, 2009 at 22:33 UTC

    Basic?

    It's a FAQ.
    People continually get it wrong.
    People have no idea how it works when given that solution.
    It's missing half the code.
    It's 6 lines instead of one. (7 for the fetcher if you don't validate.)

    I have no problem writing such code, but I'm not most people. Put it into an appropriately named function and I'll be able to read it too. Or you know, use the function that's already written.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (6)
As of 2024-03-28 12:14 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found