2010/3/3 Daniel Stutzbach <daniel at stutzbachenterprises.com>: > I think I see a way to dramatically speed up PyObject_RichCompareBool when > comparing immutable, built-in, non-container objects (int, float, str, > etc.). It would speed up list.sort when the key is one of those types, as > well as most operations on the ubiquitous dictionary with str keys. > > Is that a worthwhile avenue to pursue, or is it likely to be redundant with > Unladen Swallow's optimizations? Perhaps you could explain what exactly you want to do. :) That would help us make a judgment. > > If I can find time to pursue it, would it be best for me to implement it as > a patch to Unladen Swallow, CPython trunk, or CPython py3k? Your choice. -- Regards, Benjamin
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4