From: Jesse Rosenthal <jrosenthal@jhu.edu>
To: Daniel Schoepe <daniel@schoepe.org>,
	Justus Winter <4winter@informatik.uni-hamburg.de>,
	Philippe LeCavalier <support@plecavalier.com>, notmuch@notmuchmail.org
Subject: Re: nomuch_addresses.py
In-Reply-To: <87zkccjnst.fsf@schoepe.localhost>
References: <87r4xur3rv.fsf@plc.plecavalier.com>
	<87fweamenf.fsf@schoepe.localhost>
	<20120221091509.8534.59492@thinkbox.jade-hamburg.de>
	<87zkccjnst.fsf@schoepe.localhost>
User-Agent: Notmuch/0.11.1+192~g36ce7e3 (http://notmuchmail.org)
	Emacs/24.0.93.1 (i686-pc-linux-gnu)
Date: Tue, 21 Feb 2012 11:33:38 -0500
Message-ID: <87boosjgd9.fsf@jhu.edu>
MIME-Version: 1.0
Content-Type: text/plain
Precedence: list

On Tue, 21 Feb 2012 14:53:06 +0100, Daniel Schoepe <daniel@schoepe.org> wrote:
> On Tue, 21 Feb 2012 09:15:09 -0000, Justus Winter <4winter@informatik.uni-hamburg.de> wrote:
> The reason I mentioned nottoomuch-addresses at all, is that completion
> itself is _a lot_ faster (at least for me), compared to
> addrlookup. According to the wiki, notmuch-addresses.py is even slower
> than addrlookup, so I thought (and still think) that it was worth
> mentioning. Of course, one could rewrite the database-generation part in
> python using the bindings, but I personally don't think it's that
> necessary.

I'm not sure what speed comparisons were being used -- I think it was
Sebastian comparing vala to python. In any case, using
notmuch_addresses.py to look up a common prefix ("Jes") on a slowish
computer takes 0.2 seconds. So I'm not sure if the speed is all that
much of an issue. It might be a question of cache temperature, though --
it'll probably take longer the first time you run it. Still, even trying
something out on a cold cache, it seems to be about a second.

I guess the question is whether having a second database is worth those
extra fractions of a second. I could totally see how it would be for
some.