#include <iomanip> #include <iostream> #include <vector> int main() { int sz = 100; std::vector<int> v; auto cap = v.capacity(); std::cout << "Initial size: " << v.size() << ", capacity: " << cap << '\n'; std::cout << "\nDemonstrate the capacity's growth policy...
#include <iostream> #include <vector> int main() { int sz = 200; std::vector<int> v1; auto cap = v1.capacity(); std::cout << "initial capacity=" << cap << '\n'; for (int n = 0; n < sz; ++n) { v1.push_back(n); if (cap != v1.capacity()) { cap = v1.ca...
#include<iostream>#include<vector>voidprintCapLen(conststd::vector<int>&v){std::cout<<"Capacity: "<<v.capacity()<<" Length:"<<v.size()<<'\n';}intmain(){std::vector v{0,1,2};// length is initially 3printCapLen(v);for(autoi:v)std::cout<<i<<' ';std::cout<<'\n';v.r...
版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有...
capacity=DEFAULT_CAPACITY; ElemType*oldElem=elem; elem=newElemType[capacity<<=1]; for(inti=0;i<length;i++) elem[i]=oldElem[i]; delete[]oldElem; } public: Vector(intc=DEFAULT_CAPACITY):capacity(c){ elem=newElemType[capacity];
std::vector<T,Allocator>::capacityC++ 容器库 std::vector size_type capacity() const; (C++11 前) size_type capacity() const noexcept; (C++11 起) 返回容器当前已为之分配空间的元素数。 参数(无) 返回值当前分配存储的容量。 复杂度常数。
std::vector<T,Allocator>::empty std::vector<T,Allocator>::size std::vector<T,Allocator>::max_size std::vector<T,Allocator>::reserve std::vector<T,Allocator>::capacity std::vector<T,Allocator>::shrink_to_fit std::vector<T,Allocator>::clear std::vector<T,Allocator>::insert std::vecto...
#include <inplace_vector> int main() { constexpr std::inplace_vector<int, 4> v1; static_assert(v1.capacity() == 4 && v1.max_size() == 4); constexpr std::inplace_vector<int, 0> v2; static_assert(v2.capacity() == 0 && v2.max_size() == 0); }See...