Powerful and fast hash function in python (Search algorithm)

Question

Python has a default searching function which is:

x in [x,y,z,]

Where x,y,z can be any integers or characters, but this is a default sequential search and I want to know how I can use a manual hashing search in python.

Answer 1

Use a set() instead:

x in {x,y,z}

This uses a hash table under the hood, so searches are O(1).