On Tue, 8 Oct 2002, David W. Tamkin wrote:
On Tue, 8 Oct 2002 dman(_at_)nomotek(_dot_)com wrote:
On Tue, 8 Oct 2002, Professional Software Engineering wrote:
Sorry for the delay, I'm not at my desk in this last days. And
I appreciate your fast responds.
Thanks for yours answers, you shed light on important point
that I did not aware:
* 1^1 A
* 1^1 B
* 1^1 C
Does not equal to
* (A|B|C)
In the first one procmail scan the message three time. In the
second only one. Is it because of the 1^1 ? Does 1^0 make
it scan like (A|B|C) ? I'm used to break _OR_ regx into score
style to make the recipes more readable, does it wrong? (from the
performance point of view).
Also, Sean explain how important to learn the characteristic
of the message that we are going to work on before decide the
algorithm:
[...]
OTOH, a drawback to this approach is that the initial body scans are
COMPLETE body scans, not bail on first match, so if you have a
match-match-nomatch condition, you scanned the
WHOLEBODY-WHOLEBODY-WHOLEBODY, instead of
JUSTTOTHEFIRSTMATCH-JUSTTOTHEFIRSTMATCH-WHOLEBODY. I'm not sure how
significant an impact this will have on your average search, but the
results when there IS a match on all three, will be faster, and when those
matches are towards the end of the document anyway, there should be
negligible difference in the failed cases.
[...]
Thenks,
Udi
_______________________________________________
procmail mailing list
procmail(_at_)lists(_dot_)RWTH-Aachen(_dot_)DE
http://MailMan.RWTH-Aachen.DE/mailman/listinfo/procmail