🚀 go-pugleaf

>>>>> On 10 Apr 92 20:31:54 GMT, jbw@bigbird.bu.edu (Joe Wells) said:

Joe> In article <JGD.92Apr9191219@kodiak.acl.lanl.gov> jgd@acl.lanl.gov (Jerry G. DeLapp) writes:

Joe>    "Could the final release of vm-5.32 (or at least the next release)
Joe>    sorting by date sent please handle both RFC832 and RFC1123 style dates
Joe>    and not trigger reordering when the dates are equivalent."

Joe>    For example, 1992 and 92 are equivalent years and comparing them should not
Joe>    trigger reordering if the month and year are equivalent...

Joe> This is easy.  Convert the strings to numbers and then apply `mod' with
Joe> 1900 as second argument.  This will work for at least the next 1807 years.

If it's so easy, can you please provide the hacks? That's what I was asking
for, not the algorithm.

I've looked at the code and it's not obvious to me where/how to do this... I'm
not an elisp hacker (and I don't have the time to become one this week). I did
try some things myself, none of which worked.

I'm sure that since this is so easy, someone who knows the code will be happy
to post the hacks.

Joe> -- 
Joe> Enjoy,

Joe> Joe Wells <jbw@cs.bu.edu>
Joe> Member of the League for Programming Freedom --- send e-mail for details
--

Jerry G. DeLapp -- ACL System Scientist -- (505) 665-4531 <jgd@lanl.gov>
Computing beyond the Bleeding Edge -- The Advanced Computing Laboratory