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/2006-April/064286.html below:

[Python-Dev] Reducing memory overhead for dictionaries by removing me_hash

[Python-Dev] Reducing memory overhead for dictionaries by removing me_hash [Python-Dev] Reducing memory overhead for dictionaries by removing me_hashGuido van Rossum guido at python.org
Mon Apr 24 21:03:11 CEST 2006
On 4/23/06, "Martin v. Löwis" <martin at v.loewis.de> wrote:
> Kirat Singh wrote:
> > The reason I looked into this to begin with was that my code used up a
> > bunch of memory which was traceable to lots of little objects with
> > instance dicts, so it seemed that if instancedicts took less memory I
> > wouldn't have to go and add __slots__ to a bunch of my classes, or
> > rewrite things as tuples/lists, etc.
>
> Ah. In that case, I would be curious if tuning PyDict_MINSIZE could
> help. If you have many objects of the same type, am I right assuming
> they all have the same number of dictionary keys? If so, what is the
> dictionary size? Do they use ma_smalltable, or do they have an extra
> ma_table?

But the space savings by using __slots__ is so much bigger! (And less
work than hacking the C code too. :-)

--
--Guido van Rossum (home page: http://www.python.org/~guido/)
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