diff options
| author | Kris De Gussem <kris.degussem@gmail.com> | 2013-09-27 20:05:56 +0000 |
|---|---|---|
| committer | Kris <Kris.De.Gussem@hotmail.com> | 2013-09-27 20:05:56 +0000 |
| commit | 8bdeca099355f46c4f112144474ca470889dc668 (patch) | |
| tree | eae0a2134ba5d70f96dd576f169b4e46e8ead329 /src/libcola/cycle_detector.cpp | |
| parent | Adjusted code style of SPEllipse. (diff) | |
| download | inkscape-8bdeca099355f46c4f112144474ca470889dc668.tar.gz inkscape-8bdeca099355f46c4f112144474ca470889dc668.zip | |
cppcheck: performance + variable type
(bzr r12603)
Diffstat (limited to 'src/libcola/cycle_detector.cpp')
| -rw-r--r-- | src/libcola/cycle_detector.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/libcola/cycle_detector.cpp b/src/libcola/cycle_detector.cpp index 89a2ccaae..11e24a0ba 100644 --- a/src/libcola/cycle_detector.cpp +++ b/src/libcola/cycle_detector.cpp @@ -53,7 +53,7 @@ void CycleDetector::make_matrix() { assert(traverse.empty()); // from the edges passed, fill the adjacency matrix - for (ei = edges->begin(); ei != edges->end(); ei++) { + for (ei = edges->begin(); ei != edges->end(); ++ei) { anEdge = *ei; // the matrix is indexed by the first vertex of the edge // the second vertex of the edge is pushed onto another @@ -241,7 +241,7 @@ bool CycleDetector::find_node(std::vector<Node *> *& list, unsigned k) { } pair< bool, vector<unsigned>::iterator > CycleDetector::find_node(std::vector<unsigned>& list, unsigned k) { - for (vector<unsigned>::iterator ti = traverse.begin(); ti != traverse.end(); ti++) { + for (vector<unsigned>::iterator ti = traverse.begin(); ti != traverse.end(); ++ti) { if (*ti == k) { return pair< bool, vector<unsigned>::iterator >(true, ti); } } |