[Guido] > ... > Slots can get you back most of this, but not all. Dict lookup is > already extremely tight code, and when I profiled this, most of the > time was spent there -- twice as many lookup calls using new-style > classes than for classic classes. As I've said, and as Oren later demonstrated with code, the cost of a namespace dict lookup now is more in the layers of function call overhead than in the actual lookup. We could whittle that down in Oren-like ways, although I'd rather we spent whatever time we can devote to stuff like this on advancing one of the more-general optimization schemes that were a hot topic before the Python conference.
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