Technically it's been a solid implementation and the post probably contains a few helpful bits. But I overengineered the implementation by splitting in too many source files, and relying on source code generation.
A much cleaner "no bullshit" version of it now lives as part of my current project: https://github.com/jstimpfle/astedit . I've also added augmentation facilities (not heavily tested). I think it's pretty good, I just might open up the internals even more than they already are.
(I think the std::map approach from STL definitely has merits, especially when one needs just an associative container, quickly. But it's not a very efficient nor flexible approach.)
That project also has a text rope implementation that uses the red-black tree. I think a rope is much like a B-tree, but I might be wrong.
Also have a look at the linux kernel rbtree implementation. But I think it's not easily usable outside the linux tree.
Traditional books fail me in most of the cases as I want modern techniques combined with (maybe) "old" algorithms.
I would love it if people could show me modern examples and implementations (and reasoning) about let's say things from clrs for example:
- trees (red/black, splay, B, quadtrees, k-trees
- dynamic programming
- hasing (extendible, linear)
- pairing heaps, binomial queues
- shortest distances with dijkstra, johnson, bellman-ford
- finite state machines etc
- string algorithms like boyer-moore, knuth-morris-pratt
- (...)
FYI: I had no account prior to this comment, created one just for you ;) Keep up the good work OP!