On Jan 20, 2008 1:59 PM, Mark H. <mark.hoem...@gmail.com> wrote:
> On Jan 17, 7:40am, Rich Hickey <richhic...@gmail.com> wrote:[snip]
> > I've read Okasaki.
> That's actually an interesting question -- how much optimization doSpeaking of Okasaki and red-black trees, I just read his little paper
> typical SML/Haskell/Erlang compilers do on pattern matching? But
> somehow I suspect that they won't get very far with the kind of
> matching code that does things like red-black trees.
on them, and it's just amazing how he manages to reduce the normal
four rotations to a single transformation to be done if a newly
inserted node (colored red by default) has a red parent:
"Take the red child, the red parent, and the (black) grandparent and
If there is still a node with a red parent, then repeat the
See http://www.eecs.usma.edu/webs/people/okasaki/sigcse05.pdf , a
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.