On 2013-03-26 07:43, Zoltán Herczeg wrote:
Thanks... I'm so sorry but my bad English don't allow me understand
this.
Is there other word's? I don't feel how to speed up my application by
using another thread.
You probably have a list of patterns (array, linked list, etc.). Each
item
Thanks... I'm so sorry but my bad English don't allow me understand this.
Is there other word's? I don't feel how to speed up my application by
using another thread.
You probably have a list of patterns (array, linked list, etc.). Each item
should have a pcre and a study. When your
On 2013-03-25 19:02, Zoltán Herczeg wrote:
It is also possible that the JIT does not help you. No solution is
perfect, everything has advantages and disadvantages.
I tests JIT against individual patterns. Results are awesome! For some of
them JIT is about 6 times faster than interpreter.
This is an exponential case for the code generator. It is similar to the one
which is sent by Ralf recently.
In PCRE, if P is not a character literal or a backreference, (P){n,m} is
expanded to
(P)(P)(P)...(P)(?:(P)(?:(P))?)?
The code generator optimize these patterns one-by-one, and
On 2013-03-25 08:57, Zoltán Herczeg wrote:
This is an exponential case for the code generator.The code generator
optimize these patterns one-by-one, and this process requires a lot of
time and an enormous stack space. Where do you use such pattern? Can't
you use a better pattern?
It's
