[Python-Dev] About dictionary lookup caching (original) (raw)

"Martin v. Löwis" martin at v.loewis.de
Tue Dec 19 23:19:22 CET 2006


Raymond Hettinger schrieb:

If you can find some other design that doesn't depend on the ordering of conames, that would be nice; otherwise, we're adding a permanent complication to the compiler and establishing a new invariant that would have to be maintained by everyone hoping to generate or hack bytecodes.

It wouldn't be a strict invariant, but instead, breaking it would mean that the memory consumption goes up somewhat.

Regards, Martin



More information about the Python-Dev mailing list