現(xiàn)在總結(jié)如下表：yes表示支持，no表示不支持?

? ? ? ? ? ??

代碼實(shí)例如下：

#include <iostream> #include <string> #include <vector> #include <deque> #include <list> #include <forward_list> #include <string> #include <array> using namespace std; #define LENGTH 10 typedef int TYPE; typedef vector<TYPE> VECTORTYPE; typedef deque<TYPE> DEQUETYPE; typedef list<TYPE> LISTTYPE; typedef forward_list<TYPE> FORWARD_LISTTYPE; typedef array<TYPE,LENGTH> ARRAYTYPE; void print(VECTORTYPE & ); void print(DEQUETYPE & ); void print(LISTTYPE & ); void print(FORWARD_LISTTYPE & ); void print(ARRAYTYPE & ); void print(string &); int main() {//forward_list:only can use push_front(emplace_front) to insert elements,e.g:forward_list<int> f_int{11,22,33,44,55};print(f_int);f_int.push_front(0);f_int.push_front(142857);print(f_int);//vector:can use push_back(emplace_back),insert(p,t),emplace(p,t),c.insert(p,b,e),c.insert(p,n,t),c.insert(p,i1),no push_front or emplace_frontvector<int> v_int1{1,2,3,4,5},v_int2{43,44,45},v_int3{},v_int4{};/*v_int1.push_front(0); wrong,vector has no member of push_front*//*v_int1.emplace_front(0); wrong,vector has no member of emplace_front*/cout << "vector: ";v_int1.emplace_back(6);print(v_int1); cout << "vector is end." << endl;v_int1.insert(v_int1.begin(),9);print(v_int1);v_int1.emplace(v_int1.begin(),10);print(v_int1);v_int1.insert(v_int1.begin(),f_int.begin(),f_int.end());print(v_int1); //iterator like assignv_int1.insert(v_int1.begin(),{11,22,33,44,55});print(v_int1); //list like assignv_int1.insert(v_int1.begin(),5,1024);print(v_int1); //constructor like assign//deque:can use all the function:push_front,emplace_front,push_back,emplace_back,c.insert(p,t),c.emplace(p,t),c.insert(p,b,e),c.insert(p,n,t),c.insert(p,l1)deque<int> d_int1{1,2,3};d_int1.push_front(0);d_int1.emplace_front(-1);d_int1.emplace_back(4);d_int1.emplace_back(5);d_int1.insert(d_int1.begin() + 1,1024);d_int1.emplace(d_int1.begin() + 1,1024);d_int1.insert(d_int1.begin(),v_int2.begin(),v_int2.end());d_int1.insert(d_int1.end(),v_int2.begin(),v_int2.end());d_int1.insert(d_int1.begin(),3,55);d_int1.insert(d_int1.begin() + 1,{43,43,43});d_int1.insert(d_int1.begin(),5,1025);print(d_int1);//list:can use all the function:push_front,emplace_front,push_back,emplace_back,insert(p,t),emplace(p,t),c.insert(p,b,e),c.insert(p,n,t),c.insert(p,{}),note:list ' s iterator can't add int numberlist<int> l_int{1,2,3,4,5};forward_list<int> f_int3{11,22,33};l_int.push_front(0);l_int.emplace_front(-1);l_int.push_back(6);l_int.emplace_back(7);l_int.insert(l_int.begin(),-2);l_int.emplace(++l_int.begin(),-3);l_int.insert(l_int.begin(),f_int3.begin(),f_int3.end());l_int.insert(l_int.begin(),3,44);l_int.insert(l_int.begin(),{54,54,54});print(l_int);//forward_list:only can insert elements in front of it.forward_list<int> f_int1{1,2,3,4};f_int1.push_front(0);print(f_int1);//array:has none member function of them.array<int,10> arr{1,2,3,4};//string:string str1{"abcde"},str2{"xyx"};str1.push_back('f');str1.insert(str1.begin(),'B');str1.insert(str1.begin(),6,'s');str1.insert(str1.begin(),{'k','l'});str1.insert(str1.begin(),str2.begin(),str2.end());print(str1);return 0; } void print(VECTORTYPE &vec) {for(VECTORTYPE::iterator i = vec.begin() ; i != vec.end() ; ++i){ cout << *i << " ";}cout << endl;return ; }void print(DEQUETYPE &vec) {for(DEQUETYPE::iterator i = vec.begin() ; i != vec.end() ; ++i){ cout << *i << " ";}cout << endl;return ; }void print(LISTTYPE &vec) {for(LISTTYPE::iterator i = vec.begin() ; i != vec.end() ; ++i){ cout << *i << " ";}cout << endl;return ; }void print(FORWARD_LISTTYPE &vec) {for(FORWARD_LISTTYPE::iterator i = vec.begin() ; i != vec.end() ; ++i){ cout << *i << " ";}cout << endl;return ; }void print(ARRAYTYPE &vec) {for(ARRAYTYPE::iterator i = vec.begin() ; i != vec.end() ; ++i){ cout << *i << " ";}cout << endl;return ; }void print(string & s_vec) {for(string::iterator i = s_vec.begin(); i != s_vec.end() ; ++i) {cout << *i << " ";}cout << endl; }

?

總結(jié)

以上是生活随笔為你收集整理的（背）顺序容器的操作－向容器中插入元素详细总结的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。