Suppose I have a list:
items = ['matt', 'zen', 'a', 'b', 'c', 'cat', 'dog']
if elem in items
`if 'a' 'b' 'c' found then return 1
Whenever elem finds 'a', 'b', 'c' in the list and return a value. Is there a way to define the list in such a way? I don't want to have multiple if conditions (if it can be avoided).
To check if every item is in items
>>> items = ['matt', 'zen', 'a', 'b', 'c', 'cat', 'dog']
>>> {'a', 'b', 'c'}.issubset(items)
True
Inside a for loop, still taking advantage of the fast (O(1) amortized) lookup speeds of sets:
find = {'a', 'b', 'c'}
for elem in items:
if elem in find:
# do stuff
for elem in items return a proper value for elem
items, anyway I added a for loop checkin function for example, maybe combine 'a'+'b'+'c' to 'abc' and define subset = ['a'] and if subset in 'abc' -the do whateverif any(x in string for x in ('at', 'bat', 'cat'))You can use the subset operator for simple objects such as strings:
>>> items = ['matt', 'zen', 'a', 'b', 'c', 'cat', 'dog']
>>>> {'a', 'b', 'c'} < set(items)
True
Here is a general case :
>>> items = ['matt', 'zen', 'a', 'b', 'c', 'cat', 'dog']
>>> all(x in items for x in (['a'], 'b', 'c'))
True
It still works even though we have an unhashable type in the container.
Or
for elem in 'abc':
if elem in str
strname toitems,stris a builtin