C++常用容器总结<array> <vector> <map> <list> <deque> <stack>

#include<iostream>
#include<array>
#include<vector>
#include<map>

1.array
-----------------------------------------------------------------------
array<type,size> name 

name.begin()   end()   rbegin()  rend()

name.size()    name.max_size()

name.empty()

operator[ ]   //value = array[i]
at()          //value = array.at(i)
front()       // value = array.front()
back()        //value = array.back()
*p = name.data() //point to the object

fill()          // array.fill(5);
swap(arr1,arr2)
get<i>(arr)     //Returns a reference to the Ith element of array arr

== || != || >= 比较
--------------------------------------------------------------------------

2.vector
--------------------------------------------------------------------------
vector<type>myvector

 

begin()  、 end() 、  rbegin() 、 rend()

size()  、max_size()

empty()

resize()

for (int i=1;i<10;i++) myvector.push_back(i);
  myvector.resize(5);
  myvector.resize(8,100);
  myvector.resize(12);
  myvector contains: 1 2 3 4 5 100 100 100 0 0 0 0

 

name.capacity()     //返回分配的容量大小，>size,按二进制指数增长1-2-4-8-16,vector满了才进行下一次增长

name.reserve(size); //重置capacity为size

operator[ ]         //array[i]
at                  //value = array.at(i)
front()  、back()
data()              //A pointer to the first element  , *p = name.data()

assign              //name.assign (7,100);  7 ints with a value of 100
push_back()  、pop_back()

erase()

iterator erase (const_iterator position);
iterator erase (const_iterator first, const_iterator last);

insert(const_iterator position, size_type n, const value_type& val)   // inserting new elements before the element at the