jerome.eteve at gmail.com
Tue Feb 25 14:42:55 GMT 2014
If you're looking to find the matches of a large number of strings in
a body of text, there's also https://metacpan.org/pod/Text::Scan .
AFAIK, it's very fast, as it's a C implementation of
It doesn't do regexes though, just plain text matching.
On 25 February 2014 14:21, Alex Balhatchet <kaoru at slackwise.net> wrote:
> Hey Dirk,
> The search time you're after is Trie.
> The POD of Dan Kogai's Regexp::Trie lists some alternatives and the
> description compares them a little.
> Hope that helps,
> - Alex
> On 25 February 2014 12:49, Dirk Koopman <djk at tobit.co.uk> wrote:
>> I am looking at an application where some incoming string needs to be
>> compared to many (certainly 10s, probably 100s but not 1000s) regexes. This
>> being a message passing application, speed is more important than it might
>> otherwise be. The list of regexes is single exit simple ladder logic (i.e.
>> the first match exits the list and is dealt with by the associated
>> I am wondering whether there is some regex consolidation possible that turns
>> the regex list into some single mega regex or a more formal state machine
>> driven thingy.
More information about the london.pm