<bdo id='9oH7V'></bdo><ul id='9oH7V'></ul>

      1. <legend id='9oH7V'><style id='9oH7V'><dir id='9oH7V'><q id='9oH7V'></q></dir></style></legend>

        <small id='9oH7V'></small><noframes id='9oH7V'>

      2. <tfoot id='9oH7V'></tfoot>

        <i id='9oH7V'><tr id='9oH7V'><dt id='9oH7V'><q id='9oH7V'><span id='9oH7V'><b id='9oH7V'><form id='9oH7V'><ins id='9oH7V'></ins><ul id='9oH7V'></ul><sub id='9oH7V'></sub></form><legend id='9oH7V'></legend><bdo id='9oH7V'><pre id='9oH7V'><center id='9oH7V'></center></pre></bdo></b><th id='9oH7V'></th></span></q></dt></tr></i><div id='9oH7V'><tfoot id='9oH7V'></tfoot><dl id='9oH7V'><fieldset id='9oH7V'></fieldset></dl></div>

        尝试实现

        时间:2023-06-04
          <legend id='9sxx4'><style id='9sxx4'><dir id='9sxx4'><q id='9sxx4'></q></dir></style></legend>
            <bdo id='9sxx4'></bdo><ul id='9sxx4'></ul>
              <tfoot id='9sxx4'></tfoot>
                    <tbody id='9sxx4'></tbody>

                  <small id='9sxx4'></small><noframes id='9sxx4'>

                • <i id='9sxx4'><tr id='9sxx4'><dt id='9sxx4'><q id='9sxx4'><span id='9sxx4'><b id='9sxx4'><form id='9sxx4'><ins id='9sxx4'></ins><ul id='9sxx4'></ul><sub id='9sxx4'></sub></form><legend id='9sxx4'></legend><bdo id='9sxx4'><pre id='9sxx4'><center id='9sxx4'></center></pre></bdo></b><th id='9sxx4'></th></span></q></dt></tr></i><div id='9sxx4'><tfoot id='9sxx4'></tfoot><dl id='9sxx4'><fieldset id='9sxx4'></fieldset></dl></div>

                  本文介绍了尝试实现的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着跟版网的小编来一起学习吧!

                  问题描述

                  在 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.

                  这篇关于尝试实现的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持跟版网!

                  上一篇:C++ struct 语法“a : b"是什么意思?意思是 下一篇:std::vector 与 std::list 与 std::slist 的相对性能?

                  相关文章

                  <tfoot id='mbr8m'></tfoot>

                    1. <legend id='mbr8m'><style id='mbr8m'><dir id='mbr8m'><q id='mbr8m'></q></dir></style></legend>

                      <small id='mbr8m'></small><noframes id='mbr8m'>

                        <bdo id='mbr8m'></bdo><ul id='mbr8m'></ul>
                      <i id='mbr8m'><tr id='mbr8m'><dt id='mbr8m'><q id='mbr8m'><span id='mbr8m'><b id='mbr8m'><form id='mbr8m'><ins id='mbr8m'></ins><ul id='mbr8m'></ul><sub id='mbr8m'></sub></form><legend id='mbr8m'></legend><bdo id='mbr8m'><pre id='mbr8m'><center id='mbr8m'></center></pre></bdo></b><th id='mbr8m'></th></span></q></dt></tr></i><div id='mbr8m'><tfoot id='mbr8m'></tfoot><dl id='mbr8m'><fieldset id='mbr8m'></fieldset></dl></div>