guarantee worst-case linear time matching for any number of expressions Or you c... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

jefftk on Dec 9, 2016 | parent | context | favorite | on: Ask HN: What problem in your industry is a potenti...

    guarantee worst-case linear time matching for any
    number of expressions

Or you could just use RE2: https://github.com/google/re2/wiki/WhyRE2

It's open source, and match time is linear in the length of the input string.

(Disclosure: I work at Google on a different open source project)

alixaxel on Dec 11, 2016 [–]

RE2 is great! I first discovered it while building namegrep.com and after benchmarking it against PCRE I never looked back. :)

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact