https://github.com/DanielStutzbach/blist/ is an implementation of lists that is asymptotically faster.
Quoting from them: "The blist uses a flexible, hybrid array/tree structure and only needs to move a small portion of items in memory, specifically using O(log n) operations. For small lists, the blist and the built-in list have virtually identical performance." I looked into PyPy's current list strategies and it seems we're not implementing the same algorithm as blist. I had a chance to use the package before and the implementation is sound. I'm wondering if PyPy could by a chance benefit from implementing the blist algorithm as a strategy. Possibly even switching it to be the default. What do you guys think? Omer Katz
_______________________________________________ pypy-dev mailing list pypy-dev@python.org https://mail.python.org/mailman/listinfo/pypy-dev
