Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #60963
| Date | 2013-12-04 08:19 +1100 |
|---|---|
| From | Cameron Simpson <cs@zip.com.au> |
| Subject | Re: how to implement a queue-like container with sort function |
| References | <20131203211718.GA94804@cskk.homeip.net> |
| Newsgroups | comp.lang.python |
| Message-ID | <mailman.3530.1386105592.18130.python-list@python.org> (permalink) |
On 04Dec2013 08:17, I wrote: > 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. And then I check the source:-( He actually said "I want to a fixed length list-like container". That still sounds like a limit to the number of entries. Cheers, -- Cameron Simpson <cs@zip.com.au> Success in software development depends on making a carefully planned series of small mistakes in order to avoid making unplanned large mistakes. - Steve McConnell, _Software Project Survival Guide_
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:19 +1100
csiph-web