
15 Sep
2003
15 Sep
'03
1:44 a.m.
On Sun, 2003-09-14 at 21:48, Lex Stein wrote:
Hi, No one responded to my question several weeks ago about a purely functional implementation of a threaded, red-black tree.
I'm not sure what you mean by "threaded". By simply ignoring that word, I come up with the following solution :-) There is a purely functional implementation of a red-black tree in the MetaPRL system (www.metaprl.org), written in OCaml. For the latest CVS version of this red-black tree code, go to http://cvs.metaprl.org:12000/cvsweb/metaprl/libmojave/stdlib/ (look at lm_map.ml and lm_set.ml). Carl Witty