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

[John Wiegley]

>>>>> "SM" == Stefan Monnier <address@hidden> writes:

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?

-- 
John Wiegley                  GPG fingerprint = 4710 CF98 AF9B 327B B80F
http://newartisans.com                          60E1 46C4 BD1A 7AC1 4BA2