diff options
| author | Kris De Gussem <kris.degussem@gmail.com> | 2013-10-22 14:50:54 +0000 |
|---|---|---|
| committer | Kris <Kris.De.Gussem@hotmail.com> | 2013-10-22 14:50:54 +0000 |
| commit | 2a512b54b57ae53464601b38b05eab6f6c3cf3c4 (patch) | |
| tree | 77810d64bec56ecf825e4206c8dc82655eafdff8 /src/libvpsc/solve_VPSC.cpp | |
| parent | Fix for Bug #1022543 (Ctrl+C increments the documents count). (diff) | |
| download | inkscape-2a512b54b57ae53464601b38b05eab6f6c3cf3c4.tar.gz inkscape-2a512b54b57ae53464601b38b05eab6f6c3cf3c4.zip | |
cppcheck
(bzr r12713)
Diffstat (limited to 'src/libvpsc/solve_VPSC.cpp')
| -rw-r--r-- | src/libvpsc/solve_VPSC.cpp | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/src/libvpsc/solve_VPSC.cpp b/src/libvpsc/solve_VPSC.cpp index f9bed649c..83cb517b6 100644 --- a/src/libvpsc/solve_VPSC.cpp +++ b/src/libvpsc/solve_VPSC.cpp @@ -301,16 +301,16 @@ bool Solver::constraintGraphIsCyclic(const unsigned n, Variable* const vs[]) { varmap[vs[i]]->out.insert(varmap[r]); } } - while(graph.size()>0) { + while(!graph.empty()) { node *u=NULL; vector<node*>::iterator i=graph.begin(); for(;i!=graph.end();++i) { u=*i; - if(u->in.size()==0) { + if(u->in.empty()) { break; } } - if(i==graph.end() && graph.size()>0) { + if(i==graph.end() && !graph.empty()) { //cycle found! return true; } else { @@ -358,16 +358,16 @@ bool Solver::blockGraphIsCyclic() { c=b->findMinOutConstraint(); } } - while(graph.size()>0) { + while(!graph.empty()) { node *u=NULL; vector<node*>::iterator i=graph.begin(); for(;i!=graph.end();++i) { u=*i; - if(u->in.size()==0) { + if(u->in.empty()) { break; } } - if(i==graph.end() && graph.size()>0) { + if(i==graph.end() && !graph.empty()) { //cycle found! return true; } else { |