VectorTest

#include <iostream>#include <fstream>#include <string>#include <set>#include <map>#include <vector>#include <list>#include <stack>#include <queue>#include <limits>#include <iterator>#include <iomanip>#include <algorithm>#include <functional>using namespace std;void main(){////////////////////////////////////////////////////////////////////////////part 2vector <int> FDLdiff; //一级FDL阵列所提供的不同缓存能力int baseFDL = 5; //变量o_FDLtimeBasic//FDL基数，可提供的最小FDL长度。int plusPara = 3; //变量//以加的方式扩展FDLint FDLlevel = 6;//变量o_FDLcapacity//FDL阵列的级数。//1、加的方式//建立不同FDL缓存能力的集合int cntplus = 0;while ( cntplus < FDLlevel){cout << "cntplus " << cntplus <<endl;FDLdiff.push_back(baseFDL);baseFDL += plusPara;cntplus++;}vector<int>::iterator iter;for (iter=FDLdiff.begin();iter!=FDLdiff.end();++iter){cout << (*iter) <<endl;}//与节点相结合，每节点不同FDL阵列的集合。vector < vector<int> > FDLVec2D;int nodenum = 3;FDLVec2D.assign(nodenum,FDLdiff);int i1,i2;for (i1=0;i1<FDLVec2D.size();i1++){for (i2=0;i2<FDLVec2D[i1].size();i2++){cout << "[" << i1<< "," << i2<< "] " << FDLVec2D[i1][i2]<< endl;}}int nodenumSize = FDLVec2D.size();cout << nodenumSize <<endl;int FDLnumSize = FDLVec2D[nodenumSize-1].size();cout << FDLnumSize <<endl;}