RetroSearch Browse

Tue Mar 11 00:51:05 CET 2008 · https://mail.python.org/pipermail/python-dev/2008-March/077537.html

Martin v. Löwis wrote:
> Yes - the assumption is that more del calls will follow, so that the
> dictionary eventually ends up empty. Only when new inserts are made,
> that assumption is proven wrong, and the shrinking can be done in
> one sweep.

Hmmm. So the most efficient way to copy a dict that you've
just deleted a lot of things from is to insert something, then
delete it again, and then copy. :-)

-- 
Greg

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

Showing content from https://mail.python.org/pipermail/python-dev/2008-March/077537.html below:

[Python-Dev] Complexity documentation request