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

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

      <tfoot id='xJoC0'></tfoot>

      1. <legend id='xJoC0'><style id='xJoC0'><dir id='xJoC0'><q id='xJoC0'></q></dir></style></legend>
          <bdo id='xJoC0'></bdo><ul id='xJoC0'></ul>

      2. 容量是否复制到向量中?

        Is capacity copied in a vector?(容量是否复制到向量中?)

        • <small id='9sH5K'></small><noframes id='9sH5K'>

          <legend id='9sH5K'><style id='9sH5K'><dir id='9sH5K'><q id='9sH5K'></q></dir></style></legend>

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

                <tbody id='9sH5K'></tbody>
                <bdo id='9sH5K'></bdo><ul id='9sH5K'></ul>

                • <tfoot id='9sH5K'></tfoot>
                • 本文介绍了容量是否复制到向量中?的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着跟版网的小编来一起学习吧!

                  问题描述

                  输入以下代码:

                  std::vector<int> a;
                  a.reserve(65536);
                  std::vector<int> b(a);  //NOTE: b is constructed from a
                  
                  a.reserve(65536); // no reallocation
                  b.reserve(65536);
                  

                  是否复制了容量?最后一行会重新分配吗?标准对此是否有任何说明或沉默?

                  Is capacity copied? Will there be a reallocation on the last line? Does the standard say anything about this or is it silent?

                  推荐答案

                  是否复制了容量?

                  Is capacity copied?

                  在实践中,没有.我在 Clang 和 GCC 以及 MSVC 并且它们都没有复制容量.

                  In practice, no. I tested it online in Clang and GCC as well as MSVC and none of them copy the capacity.

                  最后一行会重新分配吗?

                  Will there be a reallocation on the last line?

                  如果容量小于要保留的参数(即它不会被复制),则是.

                  If the capacity is less than the argument to reserve (i.e. it doesn't get copied) then yes.

                  标准对此有说明还是沉默?

                  Does the standard say anything about this or is it silent?

                  vector.cons 中没有提供复制构造函数的定义.相反,我们必须查看 container.requirements

                  No definitions for the copy constructor are provided in vector.cons. Instead we have to look at the container.requirements

                  X 表示包含 Taa 类型对象的容器类b 表示 X 类型的值,u 表示一个标识符,r 表示X 类型的非常量值,并且 rv 表示的非常量值输入 X.

                  X denotes a container class containing objects of type T, a and b denote values of type X, u denotes an identifier, r denotes a non-const value of type X, and rv denotes a non-const rvalue of type X.

                  X u(a)

                  X u = a;

                  要求: TCopyInsertableX(见下文).

                  Requires: T is CopyInsertable into X (see below).

                  发布:u == a

                  现在两个容器相等是什么意思?

                  Now what does it mean for two containers to be equal?

                  a == b

                  == 是一个等价关系.equal(a.begin(), a.end(), b.begin(), b.end())

                  换句话说,既然不需要capacity在比较中相等,那么就没有理由复制capacity.

                  In other words, since it doesn't require capacity to be equal in the comparison, then there's no reason to copy the capacity.

                  这篇关于容量是否复制到向量中?的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持跟版网!

                  本站部分内容来源互联网,如果有图片或者内容侵犯了您的权益,请联系我们,我们会在确认后第一时间进行删除!

                  相关文档推荐

                  Consistent pseudo-random numbers across platforms(跨平台一致的伪随机数)
                  Vary range of uniform_int_distribution(改变uniform_int_distribution的范围)
                  What is a seed in terms of generating a random number?(就生成随机数而言,种子是什么?)
                  Is 1.0 a valid output from std::generate_canonical?(1.0 是 std::generate_canonical 的有效输出吗?)
                  Getting big random numbers in C/C++(在 C/C++ 中获取大随机数)
                  What is the best way to generate random numbers in C++?(在 C++ 中生成随机数的最佳方法是什么?)
                    <legend id='XUnhm'><style id='XUnhm'><dir id='XUnhm'><q id='XUnhm'></q></dir></style></legend>

                      <tbody id='XUnhm'></tbody>

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

                      • <bdo id='XUnhm'></bdo><ul id='XUnhm'></ul>

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