I have a fairly comprehensible left leaning rb tree implementation that I've been porting along my travels. I keep it around for situations where a binary sear

I have a fairly comprehensible left leaning rb tree implementation that I've been porting along my travels. I keep it around for situations where a binary searched array isn't doable or good enough, but I still want ordered set functionality that isn't in the stdlib. https://github.com/codr7/whirlog/blob/main/rb.lisp https://github.com/codr7/whirlog/blob/main/rb.lisp https://github.com/codr7/libcodr7/blob/master/source/codr7/tree_node.c https://github.com/codr7/libcodr7/blob/master/source/codr7/t...