GNU bug report logs - #31853
27.0.50; binding case-fold-search is slow when there are many buffers

Previous Next

Package: emacs;

Reported by: Aaron Jensen <aaronjensen <at> gmail.com>

Date: Sat, 16 Jun 2018 01:43:01 UTC

Severity: normal

Found in version 27.0.50

Done: Aaron Jensen <aaronjensen <at> gmail.com>

Bug is archived. No further changes may be made.

Full log


Message #50 received at 31853 <at> debbugs.gnu.org (full text, mbox):

From: Stefan Monnier <monnier <at> IRO.UMontreal.CA>
To: Aaron Jensen <aaronjensen <at> gmail.com>
Cc: 31853 <at> debbugs.gnu.org
Subject: Re: bug#31853: (27.0.50;
 binding case-fold-search is slow when there are many buffers)
Date: Sat, 30 Jun 2018 09:18:23 -0400
> Is it possible to improve this somehow? In this instance it's actually
> org-mode that's binding case-fold-search in a tight loop in
> org-scan-tags.

BTW, I think that the idea that let-binding a dynamically-scoped var is
cheap is wrong.
It's basically only cheap when lexical-binding works as well ;-)

So regardless of whether we can speed it up like Eli did just now (by
only looping over the live buffers), the org-scan-tags code that
let-binds it within a tight loop should be fixed.


        Stefan




This bug report was last modified 6 years and 330 days ago.

Previous Next


GNU bug tracking system
Copyright (C) 1999 Darren O. Benham, 1997,2003 nCipher Corporation Ltd, 1994-97 Ian Jackson.