Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re^3: Unhappy returns

by Aristotle (Chancellor)
on Oct 10, 2005 at 10:53 UTC ( [id://498766]=note: print w/replies, xml ) Need Help??


in reply to Re^2: Unhappy returns
in thread Unhappy returns

Yes – though that still only returns a fixed number of elements per evaluation. What about flattening data structures?

my @list = map @$_, @$lol;

I think that feature of map is one of the most useful things to have around for those occasions it’s called for.

Makeshifts last the longest.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others having an uproarious good time at the Monastery: (2)
As of 2025-06-20 14:34 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.