数组序列的capacity及size函数

#include<iostream>
#include<vector>
using namespace std;
int main()
{
    vector<int> ivec;
    cout<<"ivec's capacity:"<<ivec.capacity()<<"ivec's size"<<ivec.size()<<endl;
    for(int i=0;i<10;i++)
    {
        ivec.push_back(i);
        cout<<"ivec's capacity:"<<ivec.capacity()<<"ivec's size"<<ivec.size()<<endl;
    }
    while(ivec.size()!=ivec.capacity())
    {
        ivec.push_back(0);
    }
    
    cout<<"size = capacity. insert one element\n";  
    ivec.push_back(0);  
    cout<<"capacity:"<<ivec.capacity()<<"  size:"<<ivec.size()<<endl;  
    
    ivec.reserve(100);  
    cout<<"reserve capacity 100\n";  
    cout<<"capacity:"<<ivec.capacity()<<"  size:"<<ivec.size()<<endl;  
    
    while(ivec.size() != ivec.capacity())  
        ivec.push_back(42);  
        
     cout<<"size = capacity. insert one element\n";  
    ivec.push_back(0);  
    cout<<"capacity:"<<ivec.capacity()<<"  size:"<<ivec.size()<<endl;  
    
    system("pause");
    return 0;
}

转载于:https://www.cnblogs.com/liguigen/p/3336202.html