In article <497af344-31b5-4d1a-9b1a-c3d82feb3...@j5g2000yqm.googlegroups.com>, Raymond Hettinger <pyt...@rcn.com> wrote: > >The performance of an IndexableSkiplist is similar to a B+tree but the >implementation in pure python is much simpler.
Nice! Can you summarize why IndexableSkipList is simpler? -- Aahz (a...@pythoncraft.com) <*> http://www.pythoncraft.com/ import antigravity -- http://mail.python.org/mailman/listinfo/python-list
