Re: Binary Search Tree and Treap Functions bst-assq and treap-put

[Noam Postavsky]

On Sun, Oct 22, 2017 at 12:44 PM, Stefan Monnier
<address@hidden> wrote:

> Also, I'm far from convinced that an O(log N) lookup of lexical
> variables will help very much there (profiling would clearly be needed
> to determine the main performance culprit, but I wouldn't be surprised
> if it's completely elsewhere as in macro-expansion, for instance).

I will admit it was idle speculation on my part.

> If we want to speed up bootstrapping, maybe we should aim to bootstrap
> without interpreting Elisp code: keep a set of precompiled .elc files,
> with which we build bootstrap-emacs.

Most of the time we do have the .elc files from the previous run
anyway, but I had hit a situation where they were all of out of date
(due to jumping around in git, I think?) so I was watching a slow
source bootstrap.