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

Re^2: How to code this?

by herveus (Parson)
on Nov 15, 2011 at 14:31 UTC ( #938185=note: print w/replies, xml ) Need Help??


in reply to Re: How to code this?
in thread How to code this?

Howdy!

Given subsequent clarifications, I think this may be a very effective approach. If you look at the first n items in the array, you will get the entire group each time. Once you have handled a set, shift the first element off and any subsequent empty elements. Lather, rinse, repeat.

yours,
Michael

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://938185]
help
Chatterbox?
[choroba]: that's from the last year, right?
[choroba]: Pretty similar to his talk at YAPC::EU 2016

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (6)
As of 2017-09-19 18:04 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    During the recent solar eclipse, I:









    Results (226 votes). Check out past polls.

    Notices?