On Sun, Nov 05, 2017 at 09:09:37PM +0200, Serhiy Storchaka wrote: > 05.11.17 20:39, Stefan Krah пише: > >On Sun, Nov 05, 2017 at 01:14:54PM -0500, Paul G wrote: > >>2. Someone invents a new arbitrary-ordered container that would improve on the memory and/or CPU performance of the current dict implementation > > > >I would think this is very unlikely, given that the previous dict implementation > >has always been very fast. The new one is very fast, too. > > The modification of the current implementation that don't preserve > the initial order after deletion would be more compact and faster. How much faster? Stefan Krah
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