diff options
| author | Kris De Gussem <kris.degussem@gmail.com> | 2011-10-18 05:54:57 +0000 |
|---|---|---|
| committer | Kris <Kris.De.Gussem@hotmail.com> | 2011-10-18 05:54:57 +0000 |
| commit | 48acbc6ed82b18fb07aa5e7964f7702428bade73 (patch) | |
| tree | c54e5cb84bce1167d8f1baff59edb3b007dfd6f7 /src/snapped-line.cpp | |
| parent | pdf import. modify calculation of GradientTransform (Bug 530895) (diff) | |
| download | inkscape-48acbc6ed82b18fb07aa5e7964f7702428bade73.tar.gz inkscape-48acbc6ed82b18fb07aa5e7964f7702428bade73.zip | |
cppcheck
(bzr r10681)
Diffstat (limited to 'src/snapped-line.cpp')
| -rw-r--r-- | src/snapped-line.cpp | 20 |
1 files changed, 10 insertions, 10 deletions
diff --git a/src/snapped-line.cpp b/src/snapped-line.cpp index d9cd48d5b..6c0c411d8 100644 --- a/src/snapped-line.cpp +++ b/src/snapped-line.cpp @@ -176,7 +176,7 @@ bool getClosestSLS(std::list<Inkscape::SnappedLineSegment> const &list, Inkscape { bool success = false; - for (std::list<Inkscape::SnappedLineSegment>::const_iterator i = list.begin(); i != list.end(); i++) { + for (std::list<Inkscape::SnappedLineSegment>::const_iterator i = list.begin(); i != list.end(); ++i) { if ((i == list.begin()) || (*i).getSnapDistance() < result.getSnapDistance()) { result = *i; success = true; @@ -191,10 +191,10 @@ bool getClosestIntersectionSLS(std::list<Inkscape::SnappedLineSegment> const &li { bool success = false; - for (std::list<Inkscape::SnappedLineSegment>::const_iterator i = list.begin(); i != list.end(); i++) { + for (std::list<Inkscape::SnappedLineSegment>::const_iterator i = list.begin(); i != list.end(); ++i) { std::list<Inkscape::SnappedLineSegment>::const_iterator j = i; - j++; - for (; j != list.end(); j++) { + ++j; + for (; j != list.end(); ++j) { Inkscape::SnappedPoint sp = (*i).intersect(*j); if (sp.getAtIntersection()) { // if it's the first point @@ -221,7 +221,7 @@ bool getClosestSL(std::list<Inkscape::SnappedLine> const &list, Inkscape::Snappe { bool success = false; - for (std::list<Inkscape::SnappedLine>::const_iterator i = list.begin(); i != list.end(); i++) { + for (std::list<Inkscape::SnappedLine>::const_iterator i = list.begin(); i != list.end(); ++i) { if ((i == list.begin()) || (*i).getSnapDistance() < result.getSnapDistance()) { result = *i; success = true; @@ -236,10 +236,10 @@ bool getClosestIntersectionSL(std::list<Inkscape::SnappedLine> const &list, Inks { bool success = false; - for (std::list<Inkscape::SnappedLine>::const_iterator i = list.begin(); i != list.end(); i++) { + for (std::list<Inkscape::SnappedLine>::const_iterator i = list.begin(); i != list.end(); ++i) { std::list<Inkscape::SnappedLine>::const_iterator j = i; - j++; - for (; j != list.end(); j++) { + ++j; + for (; j != list.end(); ++j) { Inkscape::SnappedPoint sp = (*i).intersect(*j); if (sp.getAtIntersection()) { // if it's the first point @@ -266,8 +266,8 @@ bool getClosestIntersectionSL(std::list<Inkscape::SnappedLine> const &list1, std { bool success = false; - for (std::list<Inkscape::SnappedLine>::const_iterator i = list1.begin(); i != list1.end(); i++) { - for (std::list<Inkscape::SnappedLine>::const_iterator j = list2.begin(); j != list2.end(); j++) { + for (std::list<Inkscape::SnappedLine>::const_iterator i = list1.begin(); i != list1.end(); ++i) { + for (std::list<Inkscape::SnappedLine>::const_iterator j = list2.begin(); j != list2.end(); ++j) { Inkscape::SnappedPoint sp = (*i).intersect(*j); if (sp.getAtIntersection()) { // if it's the first point |