Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid

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

by Anonymous Monk
on Jul 17, 2014 at 23:02 UTC ( #1094139=note: print w/replies, xml ) Need Help??

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

Thanks im reading up on it now. Meanwhile, i'd like to understand recursion better as this is the first ive come across it and it looks immensely useful for the future.

Conceptually it seems simple enough, a function calling itself but i cant get my head around the details of what the code is doing!

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

Replies are listed 'Best First'.
Re^3: Massive expansion of a hash of arrays?
by Jim (Curate) on Jul 17, 2014 at 23:14 UTC

    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.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (5)
As of 2020-10-22 12:46 GMT
Find Nodes?
    Voting Booth?
    My favourite web site is:

    Results (225 votes). Check out past polls.