|
| From: | Stefan Monnier |
| Subject: | Re: Binary Search Tree and Treap Functions bst-assq and treap-put |
| Date: | Sat, 03 Dec 2016 23:33:48 -0500 |
| User-agent: | Gnus/5.13 (Gnus v5.13) Emacs/25.1.50 (gnu/linux) |
> 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).
Stefan
| [Prev in Thread] | Current Thread | [Next in Thread] |