Contains of HashSet in Python

Contains of HashSet in Python

Just use a set:

>>> l = set()
>>> l.add(1)
>>> l.add(2)
>>> 1 in l
True
>>> 34 in l
False

The same works for lists:

>>> ll = [1,2,3]
>>> 2 in ll
True
>>> 23 in ll
False

Edit:
Note @bholagabbars comment below that the time complexity for in checks in lists and tuples is O(n) on average (see the python docs here), whereas for sets it is on average O(1) (worst case also O(n), but is very uncommon and might only happen if __hash__ is implemented poorly).

In Python, there is a built-in type, set.
The major difference from the hashmap in Java is that the Python set is not typed,
i.e., it is legal to have a set {2, 2} in Python.

Out of the box, the class set does not have a contains() method implemented.
We typically use the Python keyword in to do what you want, i.e.,

A = [1, 2, 3]
S = set()
S.add(2)
for x in A:
  if x in S:
    print(Example)

If that does not work for you, you can invoke the special method __contains__(), which is NOT encouraged.

A = [1, 2, 3]
S = set()
S.add(2)
for x in A:
  if S.__contains__(x):
    print(Example)

Contains of HashSet in Python

Related posts

•  Does Python have a string contains substring method?
• python – Using any() and all() to check if a list contains one set of values or another
• pythons re: return True if string contains regex pattern
• Contains of HashSet in Python
• python – What does __contains__ do, what can call __contains__ function
• Python CSV error: line contains NULL byte