hash chaining only approaches order n if the table is very full (because of collisions). <div class="gmail_quote">On Sun, Jun 7, 2009 at 8:07 AM, Benjamin M. Schwartz <<a href="mailto:bmschwar@fas.harvard.edu">bmschwar@fas.harvard.edu</a>> wrote: <blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;"><div class="im">Lucian Branescu wrote: > This <a href="http://www.python.org/dev/peps/pep-0372/" target="_blank">http://www.python.org/dev/peps/pep-0372/</a> might be interesting. > Perhaps it could get backported to 2.5. > > But it still has O(n) deletion. </div>It also doesn't have insertion at all (only append), and indexing (and reverse indexing) is O(n). --Ben _______________________________________________ Sugar-devel mailing list <a href="mailto:Sugar-devel@lists.sugarlabs.org">Sugar-devel@lists.sugarlabs.org</a> <a href="http://lists.sugarlabs.org/listinfo/sugar-devel" target="_blank">http://lists.sugarlabs.org/listinfo/sugar-devel</a> </blockquote></div>