[Python-ideas] set.add() return value

[Greg Ewing]

Raymond Hettinger wrote:

> One result was that two successive accesses for the
> same key in a large table did *not* double the time.

What kind of keys, though? In my case the keys aren't
strings, they're tuples. Even after you've found the
right slot in the hash table, you still need to compare
the tuples.

> Remember, that every time there is
> dotted access, there is a hash table lookup.

For a string, which is probably interned. As far as
I'm aware, there is no notion of interning for tuples.

-- 
Greg