Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #63100
| References | <CACwCsY5P47-dB1NLQTUTQ=0aF6B+-M3y4hCxcUGmcVmHM8=-xQ@mail.gmail.com> <CAPTjJmp+NtGYWE3S3SGjo-xoYC74Exdpci_+x4AUNgqM5=CJNQ@mail.gmail.com> |
|---|---|
| Date | 2014-01-03 18:58 -0800 |
| Subject | Re: Creating a list with holes |
| From | Dan Stromberg <drsalists@gmail.com> |
| Newsgroups | comp.lang.python |
| Message-ID | <mailman.4878.1388804309.18130.python-list@python.org> (permalink) |
On Fri, Jan 3, 2014 at 7:37 AM, Chris Angelico <rosuav@gmail.com> wrote: > Depending on what exactly you need, it's probably worth just using a > dict. In what ways do you need it to function as a list? You can > always iterate over sorted(some_dict.keys()) if you need to run > through them in order. FWIW, sorting inside a loop is rarely a good idea, unless your lists are pretty small. For that, there are many tree datastructures available.
Back to comp.lang.python | Previous | Next | Find similar | Unroll thread
Re: Creating a list with holes Dan Stromberg <drsalists@gmail.com> - 2014-01-03 18:58 -0800
csiph-web