In article <[email protected]>, Raymond Hettinger <[email protected]> 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 ([email protected]) <*> http://www.pythoncraft.com/ import antigravity -- http://mail.python.org/mailman/listinfo/python-list
