On 14 Dec 2003 17:25:23 -0600, Scott A Crosby <[EMAIL PROTECTED]> posted to spamassassin-talk: > On 14 Dec 2003 12:47:58 -0500, Rubin Bennett > <[EMAIL PROTECTED]> writes: >> And, has anyone given any thought to working the SA engine up in C or >> something faster than Perl? I've seen many issues with system resources >> and SA, and the answer keeps coming back as one of two responses: > Its possible to speed up much of the core matching engine using > automata techniques to match hundreds/thousands of re's in parallel in > effectively a single pass. If you write a perl module implementing > them, I am confident that SA will use it. See some of my posts over > the last 10 days for references. If after reading them you have any > questions, reply here.
FWIW, I recall M-J Dominus wrote up a good cookbook example of how to reimplement the regex engine in Perl (in Perl, sic) which could surely be a good starting point ... <googles> here: <http://perl.plover.com/Regex/> /* era */ -- The email address era the contact information Just for kicks, imagine at iki dot fi is heavily link on my home page at what it's like to get spam filtered. If you <http://www.iki.fi/era/> 500 pieces of spam for want to reach me, see instead. each wanted message. ------------------------------------------------------- This SF.net email is sponsored by: IBM Linux Tutorials. Become an expert in LINUX or just sharpen your skills. Sign up for IBM's Free Linux Tutorials. Learn everything from the bash shell to sys admin. Click now! http://ads.osdn.com/?ad_id=1278&alloc_id=3371&op=click _______________________________________________ Spamassassin-talk mailing list [EMAIL PROTECTED] https://lists.sourceforge.net/lists/listinfo/spamassassin-talk
