On Mon, 07 Aug 2006 00:33:33 -0400, Tim Peters wrote:
> ...
>
> [Jon Smirl]
>> I know in advance how many items will be added to the dictionary. Most
>> dictionary implementations I have previously worked with are more
>> efficient if they know ahead of time h
On Sun, 06 Aug 2006 15:33:30 -0700, John Machin wrote:
> Jon Smirl wrote:
>> Is there some way to tell a dictionary object that I am going to load 1M
>> objects into it and have it pre-allocate enought slots to hold all of
>> the entries?
>
> Not according to the ma
Is there some way to tell a dictionary object that I am going to load 1M
objects into it and have it pre-allocate enought slots to hold all of the
entries? Thus avoiding many thousand memory allocations.
Jon Smirl
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
arrays instead of lists.
I'll code this up and give it try. Hopefully it can run though the 10GB of
data in a few hours and not take days.
Jon Smirl
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
ss it with zlib and
finally write it to disk.
The 10GB of data is Mozilla CVS when fully expanded.
Thanks for any tips on how to do this.
Jon Smirl
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
