Nicolas Lehuen’s ternary search tree

I’m keeping a bookmark of Nicolas Lehuen’s pytst ternary search tree library. I don’t need one right this second, but TST’s are very useful (look at Nicolas’ description to see why). It’s LGPL open source, written in C++. If I do find myself needing a TST, I’m likely to also need to use it with Unicode, which this one does not currently support. I’d have to figure that out when I get there…