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/2008-June/080431.html below:

[Python-Dev] Proposal: add odict to collections

[Python-Dev] Proposal: add odict to collections [Python-Dev] Proposal: add odict to collectionsArmin Ronacher armin.ronacher at active-4.com
Sun Jun 15 12:06:34 CEST 2008
Hi,

Alexander Schremmer <2008a <at> usenet.alexanderweb.de> writes:

> Even worse, most of them are slow, i.e. show a wrong algorithmic
> complexity ...
I already said that in the initial post.

> > I have an example implementation here that incorporates the ideas
> > from ordereddict, Django's OrderedDict and Babel's odict:
> > 
> >     http://dev.pocoo.org/hg/sandbox/raw-file/tip/odict.py
> 
> ... like your implementation. It is not too hard to get the delitem
> O(log n) compared to your O(n), see here:
That implementation is intended as example implementation for a possible
API not one you should actually use.

Regards,
Armin

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