Message121158
| Author |
pitrou |
| Recipients |
mark.dickinson, pitrou, rhettinger, tim.peters |
| Date |
2010年11月13日.23:24:06 |
| SpamBayes Score |
0.0019942897 |
| Marked as misclassified |
No |
| Message-id |
<1289690644.3561.16.camel@localhost.localdomain> |
| In-reply-to |
<1289690059.37.0.930145765696.issue10408@psf.upfronthosting.co.za> |
| Content |
> FWIW, one way to make a dict denser without increasing the number of
> probes is to use Brent's Variation of Algorithm D in Knuth. That
> optimizes the insertion order to minimize the number of collisions and
> lets you pack well over two-thirds full without degradation.
He, you suggested that several years ago on python-dev and I supplied
the code. Also, IIRC, it didn't bring any improvement - although I don't
remember which benchmarks, if any, were run.
But the experiment here is mostly to decrease the (direct and indirect)
cost of collisions by improving temporal locality of lookups. |
|