Efficient way of testing for substring being one of a set?

Dennis Benzinger:
> You could use the Aho-Corasick algorithm <http://en.wikipedia.org/wiki/
> Aho-Corasick_algorithm>.
> I don't know if there's a Python implementation yet.

http://hkn.eecs.berkeley.edu/~dyoo/python/ahocorasick/

Bye,
bearophile

On Apr 3, 9:00 am, Jeff <jeffo...@gmail.com> wrote:
> On Apr 3, 8:44 am, Ant <ant...@gmail.com> wrote:
>
>
> 
> 
> 
> 
> 
> 
> 
> 
>
> That's pretty :)

It's even prettier in 2.5:

any(word in name for word in words)

George