InfoMatrix-cpp

if(Line[testp]==0)//无异常行
{
b=true;
for(int j=0;j<M;++j)
a[j].push_back(Line[j]);
}
else
{
bb=true;
for(int k=0;k<M;++k)
}
/****************************************/
vector<InfoMatrix> isolate( vector<InfoMatrix>& D,int testp,int M)
{
static int g=0;
vector<InfoMatrix> DD;
testfile.open("F:\\My projrct.C++\\TestpointSection\\ClassMatrix.txt");
string line;
if(!testfile) //判断是否存在ifstream infile
{
for(int i=0;i!=matrix.begin()->size();++i)
{
vector<int> temp;
p=matrix.begin();
for(p;p!=matrix.end();++p)
temp.push_back(p->operator [](i) );
{
int temp=0;
temp=accumulate(p->begin(),p->end(),0); //计算和
testw.push_back(temp);
}
return testw;
}
vector<int> InfoMatrix::Isolateweight()
for(pd=D.begin();pd!=D.end();++pd)//对每个分组的权重累积
t+=pd->Isolateweight()[i];
temp.push_back(t);
}
return (max_element(temp.begin(),temp.end()) - temp.begin() );
{
if(*pp==0)
++num;
else
++anum;
}
temp=num*anum;
//temp=accumulate(p->begin(),p->end(),0,vectorsum); //计算和
//cout<<"each weight:"<<temp<<endl;
for(p;p!=vec.end();++p)
Line.push_back(p->operator [](line));
return Line;
}
int max_weightf( vector<InfoMatrix>& D)
{
vector<InfoMatrix>::iterator pd=D.begin();//只有一组
cout<<endl;
}
cout<<*pp<<" ";
cout<<endl;
}
ቤተ መጻሕፍቲ ባይዱ
}
vector<vector<int> > Tanspose(const vector<vector<int> >& matrix)
{
vector<vector<int> > matr;
vector<vector<int> >::const_iterator p;
{
size_t size=D.size();//分组数
vector<InfoMatrix>::iterator pd=D.begin();
vector<int> temp;
for(int i=0;i!=M;++i)//每个测点
{
int t=0;
aa[k].push_back(Line[k]);
}
}
if(b && (!a.empty() && a.begin()->size()>1) )
{
d.setPT()=a;
DD.push_back(d);
}
if(bb && (!aa.empty() && aa.begin()->size()>1) )
{
dd.setPT()=aa;
DD.push_back(dd);
}
}
return DD;
}
void display(const vector<int>& test)
cerr<<"读入文件不存在"<<endl;
return;
}
while (getline(testfile, line) )
{
int temp;
vector<int> Line;
stringstream ss(line );
}
vector<vector<int> >& InfoMatrix::setPT()
{
return PT;
}
/***************************************************/
void OutMatrix(const vector<vector<int> >& matrix)
{
vector<int>::const_iterator p=test.begin();
cout<<"Test points based on the quantity of information : "<<endl;
for(p;p!=test.end();++p)
cout<<*p<<" ";
vector<int> temp=pd->Testweight();
return ( max_element(temp.begin(),temp.end()) - temp.begin());
}
//隔离分组
int max_weight( vector<InfoMatrix>& D,int M)
sum=num*anum;
return sum;
}
void InfoMatrix::Initialize()
{
// istringstream类用于执行C++风格的串流的输入操作,可以字符串的空格把字符串输入到 整型 字符 等等
ifstream testfile; //testfile是一个文件流，因此其实还是对流进行的操作
matr.push_back(temp);
}
return matr;
}
vector<int> getLine(vector<vector<int> >& vec,int line)
{
int i=vec[0].size();
vector<int> Line;
vector<vector<int> >::iterator p=vec.begin();
vector<InfoMatrix>::iterator p=D.begin();
size_t sd=D.size();
for(p;p!=D.end();++p)//对每一个分组
{
//隔离所得新组
vector<vector<int> > a(M),aa(M);
{
vector<int >::iterator pp;
for(p=PT.begin();p!=PT.end();++p)
{
int temp=0;
int num=0;
int anum=0;
for(pp=p->begin();pp!=p->end();++pp)
{
cout<<"The information matrix:"<<endl;
vector<vector<int> >::const_iterator p=matrix.begin();
for(p;p!=matrix.end();++p)
{
for(vector<int>::const_iterator pp=p->begin();pp!=p->end();++pp)