RetroSearch Browse

Thu Mar 10 04:21:18 CET 2005 · http://mail.python.org/pipermail/python-dev/2005-March/051971.html

[Aahz]
> Gee, I just found out I could have used an OrderedDict today.  (We're
> using a dict that we're now having to add an auxilliary list to to
track
> when keys are added.)  (This isn't particularly an argument in favor
of
> adding OrderedDict to stdlib, but it's another use case.  Each dict
key
> contains a dict value; the subkeys from later-added keys are supposed
to
> override earlier subkeys.  The original implementation relied on
subkeys
> being unique, but that doesn't work for our new business
requirements.)

If I read the proposal correctly, order would be determined by when the
key was first encountered.  Presumably, that would mean that the related
value would also be the first encountered (not overridden by later-added
keys as dictated by your business requirements).  

Raymond

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

Showing content from http://mail.python.org/pipermail/python-dev/2005-March/051971.html below:

[Python-Dev] LinkedHashSet/LinkedHashMap equivalents