[Python-checkins] r69993 - peps/trunk/pep-0372.txt

[raymond.hettinger]

Author: raymond.hettinger
Date: Thu Feb 26 16:10:24 2009
New Revision: 69993

Log:
Update performance data based on latest recipe.

Modified:
   peps/trunk/pep-0372.txt

Modified: peps/trunk/pep-0372.txt
==============================================================================
--- peps/trunk/pep-0372.txt	(original)
+++ peps/trunk/pep-0372.txt	Thu Feb 26 16:10:24 2009
@@ -198,15 +198,7 @@
   that remembers insertion order.
 
 * Generally good performance.  The big-oh times are the same as regular
-  dictionaries except for the cost of a single sort prior to the
-  first ordered retrieval (via *__iter__* or somesuch).
-
-* Key insertion and deletion is O(1).  The work of organizing keys into
-  correct order is deferred to the end (instead of trying to maintain
-  sorted list, linked list, or btree as the dict is built-up).  This
-  corresponds to typical use patterns (read-in ordered key/value pairs,
-  make modifications, and then write them back out in insertion order)
-  and it takes advantage of Python's highly efficient built-in sort.
+  dictionaries except that key deletion is O(n).
 
 * The code runs without modification on Py2.6, Py2.7, Py3.0, and Py3.1.