Re: A read-based grep-like for symbols (el-search?) (was Do shorthands break basic tooling (tags, grep, etc)? (was Re: Shorthands have landed on master))

[Michael Heerdegen]

João Távora <joaotavora@gmail.com> writes:

> * designing a caching strategy seems fairly easy here.

el-search uses caching of the data used by the first algorithm I
described - the one that kicks out most non-matches.  Thus, the second
run of finding references of a symbol that doesn't appear too often
takes around 3 seconds for the Emacs elisp code base, which is around
four times faster than the first run.

Michael.