this might help: http://www.cs.kent.ac.uk/people/staff/smk/redblack/Untyped.hs
andrew Lex Stein said: > > Hi, No one responded to my question several weeks ago about a purely > functional implementation of a threaded, red-black tree. My message was > sent about the same time as that flurry of silly emails about "how to > respond to homework questions". Was my message not responded to because it > was classified as a homework question? I assure you this is officework, > not homework. I ended up porting Okasaki's red-black tree implementation; > hacking it apart with a bunch of mutation for the threading of the list > through the tree. However, I'm still missing a deletion function and I > haven't been able to find a prototype (Okasaki's red-black tree module > lacks delete). My study of the RB-tree deletion routine in CLR hasn't yet > yielded an adaptation for a functional environment. Any advice would be > much appreciated. > > Thanks, > Lex > > -- > Lex Stein http://www.eecs.harvard.edu/~stein/ > [EMAIL PROTECTED] cell: 617-233-0246 > > _______________________________________________ > Haskell-Cafe mailing list > [EMAIL PROTECTED] > http://www.haskell.org/mailman/listinfo/haskell-cafe > > -- http://www.acooke.org/andrew _______________________________________________ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
