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

  • <legend id='rURg8'><style id='rURg8'><dir id='rURg8'><q id='rURg8'></q></dir></style></legend>
      <bdo id='rURg8'></bdo><ul id='rURg8'></ul>

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

        将 std::map 与 std::string 键与 int 键一起使用的成本?

        时间:2024-08-14
          <bdo id='F2Miu'></bdo><ul id='F2Miu'></ul>

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

            <tbody id='F2Miu'></tbody>

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

                • 本文介绍了将 std::map 与 std::string 键与 int 键一起使用的成本?的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着跟版网的小编来一起学习吧!

                  问题描述

                  我知道单个地图查询最多需要 log(N) 时间.但是我想知道,我已经看到很多使用字符串作为映射键的示例.例如,将 std::string 作为键而不是 int 关联到映射的性能成本是多少?

                  I know that the individual map queries take a maximum of log(N) time. However I was wondering, I have seen a lot of examples that use strings as map keys. What is the performance cost of associating a std::string as a key to a map instead of an int for example ?

                  std::mapsomeMap; vs std::mapsomeMap;

                  谢谢!

                  推荐答案

                  除了已经提到的比较字符串的时间复杂性之外,每次向容器中添加项目时,字符串键还会导致额外的内存分配.在某些情况下,例如高度并行的系统,全局分配器互斥锁可能是性能问题的根源.

                  In addition to the time complexity from comparing strings already mentioned, a string key will also cause an additional memory allocation each time an item is added to the container. In certain cases, e.g. highly parallel systems, a global allocator mutex can be a source of performance problems.

                  一般来说,您应该选择最适合您情况的替代方案,并且仅根据实际性能测试进行优化.众所周知,很难判断什么将成为瓶颈.

                  In general, you should choose the alternative that makes the most sense in your situation, and only optimize based on actual performance testing. It's notoriously hard to judge what will be a bottleneck.

                  这篇关于将 std::map 与 std::string 键与 int 键一起使用的成本?的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持跟版网!

                  上一篇:如何在地图中找到最小值? 下一篇:使用 std::deque 或 std::priority_queue 线程安全吗?

                  相关文章

                  <legend id='2Wenp'><style id='2Wenp'><dir id='2Wenp'><q id='2Wenp'></q></dir></style></legend>

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

                    2. <small id='2Wenp'></small><noframes id='2Wenp'>