Improve implementation with better underlying data structure
commitc871cdc8117f084e6646c5aafa4f000d8deea30c
authorraymond.hettinger <raymond.hettinger@6015fed2-1504-0410-9fe1-9d1591cc4771>
Thu, 19 Mar 2009 15:21:10 +0000 (19 15:21 +0000)
committerraymond.hettinger <raymond.hettinger@6015fed2-1504-0410-9fe1-9d1591cc4771>
Thu, 19 Mar 2009 15:21:10 +0000 (19 15:21 +0000)
tree41ceb5a8d0a5bbc60957e25ecc73bb7543683d54
parenta97e5a87bffe08745cb85f122a17ddb12a2d5ad9
Improve implementation with better underlying data structure
for O(1) deletions.  Big-Oh performance now the same as regular
dictionaries.  Uses a doubly-linked list instead of a list/seq
to track insertion order.

git-svn-id: http://svn.python.org/projects/python/trunk@70470 6015fed2-1504-0410-9fe1-9d1591cc4771
Lib/collections.py