Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re^3: Massive expansion of a hash of arrays?

by Jim (Curate)
on Jul 17, 2014 at 23:14 UTC ( #1094140=note: print w/replies, xml ) Need Help??

in reply to Re^2: Massive expansion of a hash of arrays?
in thread Massive expansion of a hash of arrays?

I recommend you start with the Wikipedia article titled Recursion (computer science). And because "recursion is one of the central ideas of computer science," you're going to find explanations and examples of it in any good computer science textbook.

If you have an arbitrarily nested data structure with both arrays and hashes in it, then you're going to need to use the ref function. You'll use an if-then-else construct within your recursive function to decide what to do at each level in the nested data structure.

  • Comment on Re^3: Massive expansion of a hash of arrays?

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (5)
As of 2021-01-25 07:56 GMT
Find Nodes?
    Voting Booth?