2016. december 13., kedd 16:53:45 UTC+1 időpontban David Sofo a következőt írta: > > Hi, > > For a set of rules expressed in regular expression (around 1000 rules > expected) to find some keywords in a text file (~50Ko each file), how to > speed up the execution time. Currently I compile the regex rule at > initialization time with init function at put them in a map at package > level then run the regex rules with a loop. The regex have this form: > > \b(?:( (A1|A2|A3) | (B1|B2|B3) ) )\b > > spaces are put for readability. A and B are classes of keywords. > > How to speed up the execution: at regular expression level or others > levels (such execution priority). I am using Ubuntu 14.04. Any suggestion > is welcome. Thank you. > > Here a code > > Regards > David > > Are these really just words? Then split the string first, then match these tokens. Or try to create one huge regexp - maybe that's faster. Or create one huge regexp, roll it through Ragel, and use the generated Go code.
-- You received this message because you are subscribed to the Google Groups "golang-nuts" group. To unsubscribe from this group and stop receiving emails from it, send an email to golang-nuts+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
