Re: [PATCH] emacs: Use a single buffer invisibility spec to fix quadratic search cost.

Subject: Re: [PATCH] emacs: Use a single buffer invisibility spec to fix quadratic search cost.

Date: Fri, 11 Nov 2011 04:04:30 +0100

To: servilio, Sebastian Spaeth

Cc: notmuch@notmuchmail.org

From: Pieter Praet


On Thu, 10 Nov 2011 14:22:30 -0500, servilio <servilio@gmail.com> wrote:
> On 10 November 2011 08:33, Sebastian Spaeth <Sebastian@sspaeth.de> wrote:
> > On Tue,  8 Nov 2011 21:55:28 -0500, Austin Clements <amdragon@MIT.EDU> wrote:
> >>  emacs/notmuch.el |   11 +++--------
> >>  1 files changed, 3 insertions(+), 8 deletions(-)
> >
> >
> > Tested and works great here! +1 for quick inclusion.
> 
> I join the petition, I have been using for a couple of days and the
> difference is noticeable.
> 

Subjectively, I'm not seeing any difference, but that may be due to a
relatively recent machine, and Austin's recent rebase [1] of Istvan's
database patch [2] no doubt makes a huge difference as well.


I've tried getting some hard numbers using

  #+begin_src sh
    time emacs --eval '(progn
        (notmuch)
        (notmuch-search "*")
        (while (get-buffer-process (current-buffer))
            (sleep-for 0.1))
        (kill-emacs))'
  #+end_src

... but the results vary wildly on subsequent runs.


How would one go about getting stable results?


> Servilio
> _______________________________________________
> notmuch mailing list
> notmuch@notmuchmail.org
> http://notmuchmail.org/mailman/listinfo/notmuch


Peace

-- 
Pieter

[1] id:"1320599856-24078-1-git-send-email-amdragon@mit.edu"
[2] id:"m3pqnj2j7a.fsf@zsu.kismala.com"

Thread: