在 C/C++ 中是否有任何速度和缓存高效的 trie 实现?我知道什么是特里,但我不想重新发明轮子,自己实现它.
Is there any speed- and cache-efficient implementations of trie in C/C++? I know what a trie is, but I don't want reinvent the wheel, implementing it myself.
如果您正在寻找 ANSI C 实现,您可以从 FreeBSD 窃取"它.您要查找的文件名为 radix.c.用于管理内核中的路由数据.
if you are looking for an ANSI C implementation you can "steal" it from FreeBSD. The file you are looking for is called radix.c. It's used for managing routing data in kernel.
这篇关于尝试实现的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持html5模板网!