[CrackMonkey] Re: 5cr1p7 k1dd135
carton at Ivy.NET
Wed Apr 12 12:44:23 PDT 2000
On Wed, 12 Apr 2000, Don Marti wrote:
> So, it seems to me that a useful heuristic would be either "keep the LAST
> copy of a message with a given Message-Id" or "when mail B comes in with
> the same Message-Id as existing message A, trash B but move A to the
> folder where you would have put B."
I thought of this after about two seconds, but unlike SOME people I
didn't just hit R immediately. Cough, um, okay There are two problems:
o Delivery order must be regarded as random by any well-considered plan.
It tends toward the ordering Nick described, but it's possible for the
list message to arrive first.
o Your scheme can't be implemented on O(1) w.r.t. the size of mail
folders, which may contain tens of thousands of messages. Everything
else procmail does is O(1) on Berkeley mail folders, and, not sure what
exactly, but still much faster than a linear parse-and-search, on mh
So, wait until mail is stored in a DBMS. Then, your idea will still be
Miles Nordin / v:+1 720 841-8308 fax:+1 530 579-8680
555 Bryant Street PMB 182 / Palo Alto, CA 94301-1700 / US
<IMG SRC="C:\CON\CON" HEIGHT="0" WIDTH="0">
More information about the Crackmonkey