Craig R Hughes wrote:
> purpose, here's a list of the current (CVS) top 20 most expensive rules
> computationally:
I was just looking at some of my rule changes and noticed I never
thought about using the non-greedy quantifiers like {n,m}?.
In the rule set for SA 2.20 I found only 3 rules (ASCII_FORM_ENTRY,
VERY_SUSP_RECIPS, VERY_SUSP_CC_RECIPS) where the {n,m}? syntax is used.
Could this be another area where performance might be improved?
ciao
Klaus
_______________________________________________________________
Have big pipes? SourceForge.net is looking for download mirrors. We supply
the hardware. You get the recognition. Email Us: [EMAIL PROTECTED]
_______________________________________________
Spamassassin-talk mailing list
[EMAIL PROTECTED]
https://lists.sourceforge.net/lists/listinfo/spamassassin-talk
