Re: [boost] Re: [regex] any interest in finite automata-based regex engine?

From: Vladimir Pozdyayev (ardatur_at_[hidden])
Date: 2004-11-03 01:46:28

Eric Niebler wrote:

EN> ... It appears do to lots of
EN> vector::push_back and make lots of virtual calls while matching a 
EN> pattern. You commented on the algorithmic complexity, but have you 
EN> benchmarked against Boost.regex? I'd be very curious to see how your 
EN> back-end stacks up performance-wise.

The code does _no_ virtual calls while matching (<operator()>). It's
the regex compilation (<build(node*)>) that uses them. And
<push_back>s are rather cheap when the memory is already allocated by
earlier <resize>'s and likes of them, aren't they?

Oh, and benchmarking is still on my TODO list. I intend to do it as
soon as the syntax parser is able to accept the benchmarking tests.

-- 
Best regards,
Vladimir Pozdyayev.