尝试最喜欢的尝试：基数、后缀和哈希！甚至是三元，天哪！
因此，我试图将一组优秀的数据结构实现集合在一起，部分是为了我的个人收藏，部分是为了尝试为某些特殊目的构建更大的高度优化的结构集。部分原因是 deque 和 set 分别带来了意想不到的开销和令人惊讶的痛苦删除成本。部分原因源于黑客的好奇心。
然而，我还没有能够在一个足够宽松的许可证下找到我喜欢的特里树，以用于潜在的商业用途。理想情况下，我希望有人帮助您在 C++ 中找到一个出色且异常安全的后缀 trie 实现，以及一个类似的强大前缀 trie。奖金回合包括一个可靠的散列特里树。
但我正在寻找更多选项。
如果我们得到一些好的代码，我也会编写一些基准测试代码。
So, I'm trying to pull together a collection of excellent datastructure implementations, partly for my personal collection, partly to try and build a larger set of highly optimized structures for somewhat specialized purposes. Part of this stems from the agony that deque and set inflicted with unexpected overheads and surprisingly painful deletion costs, respectively. Part of it stems from hackish curiosity.
However, I haven't been able to settle on a trie that I like, under a license that is permissive enough for potential commercial use. Ideally, I'd like some help finding a superb and exception safe suffix trie implementation in C++, and a similarly robust prefix trie. Bonus round includes a solid hashed trie.
In the interest of sharing, here's what I got so far:
Ned!
RLC Suffix Array
But I'm looking for more options.
If we get a few good ones, I'll hack up some benchmarking code too.
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（2）
您也可以尝试我的 TommyDS 库 http://tommyds.sourceforge.net/
它包含哈希表和尝试。
我还进行了广泛的基准测试，将其与主要竞争对手进行比较，得到了非常有趣的结果。请参阅网站上的基准测试页面。
You can try also my TommyDS library at http://tommyds.sourceforge.net/
It contains both hashtables and tries.
I also did an extensive benchmarks comparing it with the major competitors, with very interesting results. See the benchmarks page on the site.
有多种 PATRICIA trie 实现。
There are several PATRICIA trie implementations.