A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://mail.python.org/pipermail/python-dev/2016-June/145157.html below:

[Python-Dev] PEP 468

[Python-Dev] PEP 468 [Python-Dev] PEP 468MRAB python at mrabarnett.plus.com
Mon Jun 13 21:14:26 EDT 2016
On 2016-06-14 01:47, Larry Hastings wrote:
> On 06/13/2016 05:05 PM, MRAB wrote:
>> This could be avoided by expanding the items to include the index of
>> the 'previous' and 'next' item, so that they could be handled like a
>> doubly-linked list.
>>
>> The disadvantage would be that it would use more memory.
>
> Another, easier technique: don't fill holes.  Same disadvantage
> (increased memory use), but easier to write and maintain.
>
When iterating over the dict, you'd need to skip over the holes, so it 
would be a good idea to compact it a some point, when there are too many 
holes.
More information about the Python-Dev mailing list

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4