序列式容器Sequence containers

1：何为序列式容器，C++标准程序库上面是这样说的：此乃可序(ordered)群集，其中每个元素均有固定的位置—取决于插入时机和地点，和元素的值无关。如果以追加方式对一个群集置入六个元素，它们的排列次序将和置入次序一致。STL提供三个定义好的序列式容器：vector,deque,list;

vector的相关操作:

vector将其元素置于一个dynamic array

// vector assign #include <iostream> #include<algorithm> #include <vector> using namespace std; int main () { vector<int> first; vector<int> second; vector<int> third; first.assign (7,100); //和vector<int> first(7,100);效果一样 // a repetition 7 times of value 100为first分配7个整型空间初始值都为100 vector<int>::iterator it; it=first.begin()+1; second.assign (it,first.end()-1); // the 5 central values of first//second大小为5 int myints[] = {1776,7,4}; third.assign (myints,myints+3); // assigning from array.//将third初始为1776,7,4 cout << "Size of first: " << int (first.size()) << endl;//7 cout << "Size of second: " << int (second.size()) << endl;//5 cout << "Size of third: " << int (third.size()) << endl;//3 return 0; } #include <iostream> #include <vector> using namespace std; int main () { vector<int> myvector (10); // 10 zero-initialized ints unsigned int i; // assign some values: for (i=0; i<myvector.size(); i++) myvector.at(i)=i; cout << "myvector contains:"; for (i=0; i<myvector.size(); i++) cout << " " << myvector.at(i); cout << endl; return 0; }