Is there an equivalent way to search a set that only contains unique string elements for a word that starts with an arbitrary substring? similar to a list search like this:

for word in list:
if word[:len(substring)] == substring:

Question

Is there an equivalent way to search a set that only contains unique string elements for a word that starts with an arbitrary substring? similar to a list search like this:

for word in list:
    if word[:len(substring)] == substring:

anonymous · Answer

this is python btw

anonymous · Answer

Try using filter.
filter(sequence, lambda str: str.startswith(substring))
That will return a list of words that start with substring.

anonymous · Answer

Sorry my answer gave the wrong argument order. Try this:
filter(lambda word: word.startswith(substring), set)
Also I don't see why your original post won't work for sets as well as lists.