Re: ANNOUNCE: nottoomuch-addresses.pl

[Tomi Ollila <tomi.ollila@iki.fi>]

On Tue, 06 Dec 2011 08:45:49 +1100, Bart Bunting <bart@ursys.com.au> wrote:
> Hi,
> 
> I agree with Jamie on this one.
> 
> The case sensitivity appears to get in the way of searching.  I also
> think that enabling the regular expression    searching is a good idea.
> 
> All in all though this is great.

I did version 1.2 of nottoomuch-addresses.sh which does case insensitive
searches. Note the renaming to .sh -- it is now shell script wrapper
which runs 'exec grep -aiF "$*" <addresses-file> -- grep is locale-aware
which makes case insensitivity work outside of ASCII range. The perl code
to create/update addresses file is exactly the same as in version 1.1

So, the current version (1.2) is available at

http://www.iki.fi/too/nottoomuch/nottoomuch-addresses.sh

sha1sum is 03aa8bcf4e32d47e453fc081376843ef03a427ad and doc page is at

http://www.iki.fi/too/nottoomuch/nottoomuch-addresses/

> The only other idea I have, which is only half formed, is that it would
> be nice to prioritize emails that are more important than others.
> 
> I'm not sure exactly how this would work but something like:
> - Addresses I have actualy sent email to rather than jjust received from
> get a high priority in the result.
> - Addresses that have sent me email directly rather than just to a list
> get next priority.
> - All other emails after that.
> 
> Also some sort of weighting within the groups to do with frequency of
> emails sent or something.
> 
> Does that make sense?  Would it be hard to implement?

Neat idea. To implement the feature into program is not too hard. 
Somehow determine weight for each email address, store that into 
hash (key address, value weight). 
Then, when writing addresses file, sort first by weight and then 
ascii order. The hash is also stored to disk (using tie()) and used 
when address file updated.

Now, how to determine good (generic) rules for weights (and maybe
some user-defined rules as well) is the question.

> 
> Cheers
> 
> Bart

Thanks,

Tomi