Sanitizing source files in Skia_Periodic_House_Keeping
git-svn-id: http://skia.googlecode.com/svn/trunk@7659 2bbb7eff-a529-9590-31e7-b0007b416f81
diff --git a/experimental/Intersection/CubicIntersection.cpp b/experimental/Intersection/CubicIntersection.cpp
index e5a2c18..6e88eff 100644
--- a/experimental/Intersection/CubicIntersection.cpp
+++ b/experimental/Intersection/CubicIntersection.cpp
@@ -357,7 +357,7 @@
Intersections xlocals;
intersectWithOrder(s1a, o1a, s2a, o2a, xlocals);
SkDebugf("xlocals.fUsed=%d\n", xlocals.used());
- }
+ }
#endif
intersectWithOrder(s1a, o1a, s2a, o2a, locals);
for (int tIdx = 0; tIdx < locals.used(); ++tIdx) {
@@ -370,7 +370,7 @@
#if 0 && SK_DEBUG
SkDebugf("to1=%1.9g p1=(%1.9g,%1.9g) to2=%1.9g p2=(%1.9g,%1.9g) d=%1.9g\n",
to1, p1.x, p1.y, to2, p2.x, p2.y, p1.distance(p2));
-
+
#endif
if (p1.approximatelyEqual(p2)) {
i.insert(i.swapped() ? to2 : to1, i.swapped() ? to1 : to2);
@@ -378,10 +378,10 @@
} else {
result = doIntersect(cubic1, p1s, to1, p1e, cubic2, p2s, to2, p2e, i);
// if both cubics curve in the same direction, the quadratic intersection
- // may mark a range that does not contain the cubic intersection. If no
- // intersection is found, look again including the t distance of the
+ // may mark a range that does not contain the cubic intersection. If no
+ // intersection is found, look again including the t distance of the
// of the quadratic intersection nearest a quadratic end (which in turn is
- // nearest the actual cubic)
+ // nearest the actual cubic)
if (!result) {
double b1s = p1s;
double b1e = p1e;
@@ -446,7 +446,7 @@
#endif
Intersections locals;
intersectWithOrder(s1, o1, s2, o2, locals);
-
+
for (int tIdx = 0; tIdx < locals.used(); ++tIdx) {
double to1 = t1Start + (t1 - t1Start) * locals.fT[0][tIdx];
double to2 = t2Start + (t2 - t2Start) * locals.fT[1][tIdx];