[Tim Peters]
>> ...
>> Taking my response out of context to begin with doesn't really change
>> that I answered the question he asked ;-)
[Fredrik Lundh]
> welcome to comp.lang.python.
>
>
Thanks for the welcome! It's tough to be a newbie here ;-)
--
http://mail.python.org/mailman/listinfo/p
Tim Peters wrote:
> Taking my response out of context to begin with doesn't really change that
> I answered the question he asked ;-)
welcome to comp.lang.python.
--
http://mail.python.org/mailman/listinfo/python-list
In message <[EMAIL PROTECTED]>, Tim Peters wrote:
> [Tim Peters]
> You should also note that copying a dict key or value (no matter of
> what type) consists in its entirety of copying one machine address (a
> 4- or 8-byte pointer, depending on platform).
>
> [Lawrence D'Oliveiro]
[Tim Peters]
You should also note that copying a dict key or value (no matter of
what type) consists in its entirety of copying one machine address (a
4- or 8-byte pointer, depending on platform).
[Lawrence D'Oliveiro]
>>> Actually, no. It also consists of updating reference counts
In message <[EMAIL PROTECTED]>, Tim Peters wrote:
> [Tim Peters]
>>> You should also note that copying a dict key or value (no matter of
>>> what type) consists in its entirety of copying one machine address (a
>>> 4- or 8-byte pointer, depending on platform).
>
> [Lawrence D'Oliveiro]
>> Actuall
[Tim Peters]
>> You should also note that copying a dict key or value (no matter of
>> what type) consists in its entirety of copying one machine address (a
>> 4- or 8-byte pointer, depending on platform).
[Lawrence D'Oliveiro]
> Actually, no. It also consists of updating reference counts as well.
In message <[EMAIL PROTECTED]>, Tim
Peters wrote:
> You should also note that copying a dict key or value (no matter of
> what type) consists in its entirety of copying one machine address (a
> 4- or 8-byte pointer, depending on platform).
Actually, no. It also consists of updating reference coun
[EMAIL PROTECTED] wrote:
> Thank you very much for your explanation!
>
> I made a mistake that I said the hash value should be recalculated
> each time the dict resize, what I wanted to say was that the position
> of each item should be recalculated.
>
> Maybe I should take a look at the source
Thank you very much for your explanation!
I made a mistake that I said the hash value should be recalculated each
time the dict resize, what I wanted to say was that the position of
each item should be recalculated.
Maybe I should take a look at the source code of python dict some day.
I'll some
[EMAIL PROTECTED]
> Python dict is a hash table, isn't it?
Yup.
> I know that hashtable has the concept of "bucket size" and "min bucket
> count" stuff,
Some implementations of hash tables do. Python's does not. Python's
uses what's called "open addressing" instead.
> and they should be confi
Python dict is a hash table, isn't it?
I know that hashtable has the concept of "bucket size" and "min bucket
count" stuff,
and they should be configurable so I can set them to the proper value
when I know how many items I'm going to handle.
If these two values can't be set, the hashtable will gi
11 matches
Mail list logo
