Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #60962
| Date | 2013-12-04 08:17 +1100 |
|---|---|
| From | Cameron Simpson <cs@zip.com.au> |
| Subject | Re: how to implement a queue-like container with sort function |
| References | <l7hu8f$9ea$1@ger.gmane.org> |
| Newsgroups | comp.lang.python |
| Message-ID | <mailman.3529.1386105443.18130.python-list@python.org> (permalink) |
On 02Dec2013 07:26, Ned Batchelder <ned@nedbatchelder.com> wrote: > Actually, I had a long conversation in the #python IRC channel with > the OP at the same time he was posting the question here, and it > turns out he knows exactly how many entries are going into the > "queue", so a plain-old list is the best solution. I don't know > quite where the idea of limiting the number of entries came from. For me, it was because he said "fill the queue" in the OP. I took that to imply that the queue had a capacity limit. Cheers, -- It's bubble, bubble, toil and trouble in conductive polymer. - overhead by WIRED at the Intelligent Printing conference Oct2006
Back to comp.lang.python | Previous | Next | Find similar | Unroll thread
Re: how to implement a queue-like container with sort function Cameron Simpson <cs@zip.com.au> - 2013-12-04 08:17 +1100
csiph-web