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.

"[x if x.getHashKeyMethod()==y.getHashKeyMethod() for x in myIterable]" will return all the objects with same hash as y from myIterable, is that it? — Ricola3D
– Ricola3D, Commented Apr 19, 2013 at 16:00

Martijn Pieters · Accepted Answer · 2013-04-19 15:57:01Z

4

Use a set() instead:

x in {x,y,z}

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

answered Apr 19, 2013 at 15:57

Martijn Pieters

1.1m326 gold badges4.2k silver badges3.4k bronze badges

Sign up to request clarification or add additional context in comments.

4 Comments

user1715095 Over a year ago

hmmm, is this another built-in python function?

Martijn Pieters Over a year ago

Yes, I linked you to the documentation for sets. Sets are a standard type.

David Zwicker Over a year ago

Whoa, I just learned about the {1,2,3} notation for sets. Has it always been there? I must have missed it...

Martijn Pieters Over a year ago

It is new in Python 2.7 and 3.x.

Collectives™ on Stack Overflow

Powerful and fast hash function in python (Search algorithm)

1 Answer 1

4 Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

4 Comments

Your Answer

Sign up or log in

Post as a guest

Related