I wonder if the multiple-string rule would run faster with a sorted list. A regexp where all the substrings start with "ca" should fail quickly.
If there is no mixing of the first letter of the alphabet in a regexp, only 1/26th of lines would have to test beyond the first character (if these names were a random distribution, which they normally are not, but we're talking about abnormal mailers anyway). Many of those with the same initial 2-3 characters would also stop quickly, so only a few of those 1/26th would have regexp which are examined in some detail. Of course, if your rules can be grouped within a non-regexp "IF /^c/" then it would go even faster... ------------------------------------------------------- This SF.net email is sponsored by: SF.net Giveback Program. Does SourceForge.net help you be more productive? Does it help you create better code? SHARE THE LOVE, and help us help YOU! Click Here: http://sourceforge.net/donate/ _______________________________________________ Spamassassin-talk mailing list [EMAIL PROTECTED] https://lists.sourceforge.net/lists/listinfo/spamassassin-talk
