[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Binary Search Tree and Treap Functions bst-assq and treap-put
From: |
Stefan Monnier |
Subject: |
Re: Binary Search Tree and Treap Functions bst-assq and treap-put |
Date: |
Sun, 22 Oct 2017 20:37:06 -0400 |
User-agent: |
Gnus/5.13 (Gnus v5.13) Emacs/27.0.50 (gnu/linux) |
>> 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,
If we do, it's not a "bootstrap". Indeed, I almost never bootstrap
(most of my machines date back to the 2006 era, so bootstrapping takes
very long time and I'm willing to go through a fair bit of trouble to
avoid it), but some people do it more often, and there are circumstances
(such as automated regression testing) where it's almost indispensable.
Stefan