[Python-Dev] LinkedHashSet/LinkedHashMap equivalents

Raymond Hettinger python at rcn.com
Thu Mar 10 07:29:51 CET 2005

> > If I read the proposal correctly, order would be determined by when
> > key was first encountered.  Presumably, that would mean that the
> > value would also be the first encountered (not overridden by
> > keys as dictated by your business requirements).
> Hmmmmm....  Guess this means we need a PEP!

Or the implementation can have a switch to choose between keep-first
logic or replace logic.

The latter seems a bit odd to me.  The key position would be determined
by the first encountered while the value would be determined by the last
encountered.  Starting with [(10, v1), (20, v2), (10.0, v3)], the
ordered dictionary's items would look like [(10, v3), (20, v2)].  


More information about the Python-Dev mailing list