Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #40734 > unrolled thread
| Started by | Sven <svenito@gmail.com> |
|---|---|
| First post | 2013-03-07 09:34 +0000 |
| Last post | 2013-03-07 09:34 +0000 |
| Articles | 1 — 1 participant |
Back to article view | Back to comp.lang.python
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
Re: iterating over a list as if it were a circular list Sven <svenito@gmail.com> - 2013-03-07 09:34 +0000
| From | Sven <svenito@gmail.com> |
|---|---|
| Date | 2013-03-07 09:34 +0000 |
| Subject | Re: iterating over a list as if it were a circular list |
| Message-ID | <mailman.2999.1362648888.2939.python-list@python.org> |
[Multipart message — attachments visible in raw view] — view raw
On 7 March 2013 09:31, Chris Rebert <clp2@rebertia.com> wrote: > On Mar 7, 2013 1:24 AM, "Sven" <svenito@gmail.com> wrote: > > > > I was wondering what the best approach for the following might be. > > > > Say you have a list P of points and another list N of other items. You > can always assume that > > > > len(N) <= len(P) > > > > Now I would like to iterate over P and place one N at each point. > However if you run out of N I'd like to restart from N[0] and carry on > until all the points have been populated. > > Untested due to the late hour: > > import itertools > > for p, n in itertools.izip(P, itertools.cycle(N)): > # do whatever > I knew there was a more sensible way to do it. Thanks. -- ./Sven
Back to top | Article view | comp.lang.python
csiph-web