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

[Stefan Monnier]

SM> Is it written in C or Elisp? If it's Elisp, then we definitely would
SM> welcome it into GNU ELPA (there is already an avl-tree implementation in
SM> Emacs itself at lisp/emacs-lisp/avl-tree.el, but the more the merrier). If
SM> it's written C, I'll let others decide whether we want to include it.
> Or, we could find a satisfying way to install Modules through ELPA, in which
> case C code could live there too.

Oh, yes, of course, that's something we want to do as well.  We could
start with an unsatisfying solution first, and then see how to improve it.


        Stefan