void m(char16_t c0, char32_t c1)
{
f_c (c0); /* { dg-warning "conversion from .char16_t. to .char. may change value" } */
fsc (c0); /* { dg-warning "change value" } */
fuc (c0); /* { dg-warning "change value" } */
f_s (c0); /* { dg-warning "change the sign" } */
fss (c0); /* { dg-warning "change the sign" } */
fus (c0);
f_i (c0);
fsi (c0);
fui (c0);
f_l (c0);
fsl (c0);
ful (c0);
f_ll (c0);
fsll (c0);
full (c0);
f_c (c1); /* { dg-warning "change value" } */
fsc (c1); /* { dg-warning "change value" } */
fuc (c1); /* { dg-warning "change value" } */
f_s (c1); /* { dg-warning "change value" } */
fss (c1); /* { dg-warning "change value" } */
fus (c1); /* { dg-warning "change value" } */
f_i (c1); /* { dg-warning "change the sign" } */
fsi (c1); /* { dg-warning "change the sign" } */
fui (c1);
f_l (c1); /* { dg-warning "change the sign" "" { target { llp64 || ilp32 } } } */
fsl (c1); /* { dg-warning "change the sign" "" { target { llp64 || ilp32 } } } */
ful (c1);
f_ll (c1);
fsll (c1);
full (c1);
}
int vertex_connectivity()
{
Graph_List<Edge_Flow<int> > G_(2*G.V(), false); // on double les sommets
Graph_List<Edge>::iterator_all it(G);
for(Edge *e = it.beg(); !it.end(); e = it.nxt())
G_.insert(new Edge_Flow<>(G.V() + e->v(), e->w(), G_.V()*G_.V()));
for(int i = 0; i < G.V(); i++)
G_.insert(new Edge_Flow<>(i, G.V() + i, 1));
int min_flow = -1;
for(int s = G.V(); s < G_.V(); s++)
for(int t = 0; t < G.V(); t++)
{
if(s == t) continue;
Graph_List<Edge_Flow<int> >::iterator_all it(G_);
for(Edge_Flow<int> *e = it.beg(); !it.end(); e = it.nxt())
e->set_flow(0);
//IO<Edge_Flow<int>, Graph_List<Edge_Flow<int> >>::show_capR(G_);
NoNullCap<> noNull(G_.V(), t);
Fulkerson<int, Edge_Flow<> > ful(G_, noNull, s, t);
ful(0);
int flow = ful.get_outflow();
//IO<Edge_Flow<int>, Graph_List<Edge_Flow<int> >>::show_flow(G_);
if(min_flow == -1 || min_flow > flow)
min_flow = flow;
/*if(flow < 3)
cout<<s<<"-"<<t<<endl;*/
}
return min_flow;
}
void m (char16_t c0, char32_t c1)
{
f_c (c0); /* { dg-warning "alter its value" } */
fsc (c0); /* { dg-warning "alter its value" } */
fuc (c0); /* { dg-warning "alter its value" } */
f_s (c0); /* { dg-warning "change the sign" } */
fss (c0); /* { dg-warning "change the sign" } */
fus (c0);
f_i (c0);
fsi (c0);
fui (c0);
f_l (c0);
fsl (c0);
ful (c0);
f_ll (c0);
fsll (c0);
full (c0);
f_c (c1); /* { dg-warning "alter its value" } */
fsc (c1); /* { dg-warning "alter its value" } */
fuc (c1); /* { dg-warning "alter its value" } */
f_s (c1); /* { dg-warning "alter its value" } */
fss (c1); /* { dg-warning "alter its value" } */
fus (c1); /* { dg-warning "alter its value" } */
f_i (c1); /* { dg-warning "change the sign" "" { target { ! int16 } } } */
fsi (c1); /* { dg-warning "change the sign" "" { target { ! int16 } } } */
fui (c1);
f_l (c1); /* { dg-warning "change the sign" "" { target { llp64 || ilp32 } } } */
fsl (c1); /* { dg-warning "change the sign" "" { target { llp64 || ilp32 } } } */
ful (c1);
f_ll (c1);
fsll (c1);
full (c1);
}
/* static */ void PolyCreFileName::MakeDirectoryForFile(const wchar_t wfn[])
{
YsWString ful(wfn),pth,fil;
ful.SeparatePathFile(pth,fil);
ful=pth;
YsArray <YsWString> backTrack;
for(;;)
{
if(ful.LastChar()=='\\' || ful.LastChar()=='/')
{
ful.BackSpace();
}
printf("%ls\n",ful.Txt());
backTrack.Append(ful);
YsWString pth,fil;
ful.SeparatePathFile(pth,fil);
if(0<pth.Strlen() && 0<fil.Strlen())
{
ful=pth;
}
else
{
break;
}
}
for(YSSIZE_T idx=backTrack.GetN()-1; 0<=idx; --idx)
{
printf("MkDir %ls\n",backTrack[idx].Txt());
YsFileIO::MkDir(backTrack[idx]);
}
}
int edge_connectivity()
{
Graph_List<Edge_Flow<int> > G_(G.V(), false); // non orienté
Graph_List<Edge>::iterator_all it(G);
for(Edge *e = it.beg(); !it.end(); e = it.nxt())
G_.insert(new Edge_Flow<>(e->v(), e->w(), 1));
int min_flow = -1;
for(int s = 0; s < G_.V(); s++)
for(int t = 0; t < G_.V(); t++)
{
if(s == t) continue;
Graph_List<Edge_Flow<int> >::iterator_all it(G_);
for(Edge_Flow<int> *e = it.beg(); !it.end(); e = it.nxt())
e->set_flow(0);
NoNullCap<> noNull(G_.V(), t);
Fulkerson<int, Edge_Flow<> > ful(G_, noNull, s, t);
ful(0);
int flow = ful.get_outflow();
//IO<Edge_Flow<int>, Graph_List<Edge_Flow<int> >>::show_flow(G_);
if(min_flow == -1 || min_flow > flow)
min_flow = flow;
//cout<<s<<"-"<<t<<" flow: "<<flow<<endl;
/* if(flow < 3)
{
Cut_Vertices<> cut(G_);
cut(1);
cout<<"Edges in the computed min cut:"<<endl;
for(std::list<Edge_Flow<>*>::iterator it = cut.cut.begin(); it != cut.cut.end(); ++it)
cout<<(*it)->v()<<" "<<(*it)->w()<<endl;
system("pause");
}*/
}
return min_flow;
}
