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

[Stefan Monnier]

SM> Oh, yes, of course, that's something we want to do as well. We could start
SM> with an unsatisfying solution first, and then see how to improve it.
> Sounds reasonable. Any ideas how to start? Should we assume the presence of a
> Makefile, or something higher-level, like an Emacs Lisp file that declares how
> to build the modules, with options for various platforms?

You can put a

   (eval-when-compile <run-the-C-compiler>)

in the <pkg>.el file, so that the C code gets compiled when the Elisp
file is byte-compiled.


        Stefan