A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://mail.python.org/pipermail/python-dev/2008-December/084539.html below:

[Python-Dev] extremely slow exit for program having huge (45G) dict (python 2.5.2)

[Python-Dev] extremely slow exit for program having huge (45G) dict (python 2.5.2)Ivan Krstić krstic at solarsail.hcs.harvard.edu
Mon Dec 22 22:23:12 CET 2008
On Dec 22, 2008, at 4:07 PM, M.-A. Lemburg wrote:
> What kinds of objects are you storing in your dictionary ? Python
> instances, strings, integers ?

Answered in a previous message:

On Dec 20, 2008, at 8:09 PM, Mike Coleman wrote:
> The dict keys were all uppercase alpha strings of length 7.  I don't
> have access at the moment, but maybe something like 10-100M of them
> (not sure how redundant the set is).  The values are all lists of
> pairs, where each pair is a (string, int).  The pair strings are of
> length around 30, and drawn from a "small" fixed set of around 60K
> strings ().  As mentioned previously, I think the ints are drawn
> pretty uniformly from something like range(10000).  The length of the
> lists depends on the redundancy of the key set, but I think there are
> around 100-200M pairs total, for the entire dict.
>
> (If you're curious about the application domain, see 'http://greylag.org 
> '.)


--
Ivan Krstić <krstic at solarsail.hcs.harvard.edu> | http://radian.org

More information about the Python-Dev mailing list

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