Set builtin lookups

[Marc 'BlackJack' Rintsch]

In <mailman.109.1182926621.22759.python-list at python.org>, Evan Klitzke
wrote:

> I have a question about the internal representation of sets in Python.
> If I write some code like
> 
> if x in some_list:
>     do_something()
> 
> the lookup for the in statement is O(n), where n is the number of
> elements in the list. Is this also true if I am using a set or are
> sets represented by a hash table?

Sets are implemented as hash tables.

Ciao,
	Marc 'BlackJack' Rintsch