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

[Noam Postavsky]

On Sat, Dec 3, 2016 at 11:33 PM, Stefan Monnier
<address@hidden> wrote:
>> now.  I intend to use these functions to make lexically-scoped variable
>> lookup average case O(log(n)) instead of the current O(n).
>
> AFAIK it's O(1) currently (for byte-compiled code only, but performance
> of non-byte-compiled code should be of no importance).

There is one case where interpreted code performance matters: during boostrap.

I wonder if bootstrap-emacs could load these functions as a module to
make bootstrapping with .el files go faster...