Typo: 'bouding' -> 'bounding'.

git-svn-id: http://svn.voria.com/code@1042 1f10aa63-cdf2-0310-b900-c93c546f37ac

diff --git a/synfig-core/trunk/src/modules/lyr_std/sphere_distort.cpp b/synfig-core/trunk/src/modules/lyr_std/sphere_distort.cpp
index d44b753..8998cc9 100644 (file)
--- a/synfig-core/trunk/src/modules/lyr_std/sphere_distort.cpp
+++ b/synfig-core/trunk/src/modules/lyr_std/sphere_distort.cpp
@@ -408,7 +408,7 @@ bool Layer_SphereDistort::accelerated_render(Context context,Surface *surface,in
                /*synfig::warning("Spherize: Bounding box (%f,%f)-(%f,%f)",
                                                        expandr.minx,expandr.miny,expandr.maxx,expandr.maxy);*/
 
-               //now that we have the bouding rectangle of ALL the pixels (should be...)
+               //now that we have the bounding rectangle of ALL the pixels (should be...)
                //order it so that it's in the same orientation as the tl,br pair
 
                //synfig::warning("Spherize: Organize like tl,br");

diff --git a/synfig-core/trunk/src/synfig/curve_helper.cpp b/synfig-core/trunk/src/synfig/curve_helper.cpp
index b9b22e8..00f95cf 100644 (file)
--- a/synfig-core/trunk/src/synfig/curve_helper.cpp
+++ b/synfig-core/trunk/src/synfig/curve_helper.cpp
@@ -569,7 +569,7 @@ int intersect(const bezier<Point> &b, const Point &p)
 //Curve curve intersection
 void CIntersect::recurse_intersect(const SCurve &left, const SCurve &right, int depth)
 {
-       //reject curves that do not overlap with bouding boxes
+       //reject curves that do not overlap with bounding boxes
        if(!intersect(left.aabb,right.aabb)) return;
 
        //accept curves (and perform super detailed check for intersections)

diff --git a/synfig-core/trunk/src/synfig/curveset.cpp b/synfig-core/trunk/src/synfig/curveset.cpp
index 4d02410..4b7302f 100644 (file)
--- a/synfig-core/trunk/src/synfig/curveset.cpp
+++ b/synfig-core/trunk/src/synfig/curveset.cpp
@@ -436,7 +436,7 @@ void CurveSet::CleanUp(int /*curve*/)
 
        Performance annoyances:
        1) Recursing down to find an intersection at the end points that doesn't actually exist
-               (can be helped a bit by not including the edges of bouding rectaingles)
+               (can be helped a bit by not including the edges of bounding rectaingles)
        2) Intersecting curves is slow... oh well
 
        Algorithm: