So, I'm trying to build a collection of excellent data structure implementations, partly for my personal collection, partly try to build a larger set of highly optimized structures for some specialized purposes. Part of this stems from the agony that the detective and the many inflict are caused by unexpected overheads and, as a result, surprisingly painful removal costs, respectively. Part of it stems from hacker curiosity.
However, I was not able to agree on what I like with a license that is sufficiently solvable for potential commercial use. Ideally, I would like some help finding an excellent and exceptional implementation of the trie suffix in C ++ and a similarly robust trie prefix. The bonus round includes a solid hashed trick.
In the interest of sharing, here is what I got so far:
Ned!
RLC Suffix Array
But I'm looking for more options.
If we get some good ones, I will also hack some benchmarking.
source
share