X-Git-Url: https://git.pterodactylus.net/?a=blobdiff_plain;f=synfig-core%2Ftrunk%2Fsrc%2Fsynfig%2Fcurve_helper.cpp;h=d5996202d4922156e1f79a460653d22164608689;hb=843ac7146b30c389db9123564d0727b71c64def2;hp=b9b22e8bf675b0e71671ded4b4dc53d72b0cbdd0;hpb=7a8e75cef2a63f9e7e0b57807afb239279053280;p=synfig.git

diff --git a/synfig-core/trunk/src/synfig/curve_helper.cpp b/synfig-core/trunk/src/synfig/curve_helper.cpp
index b9b22e8..d599620 100644
--- 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)
@@ -621,7 +621,7 @@ void CIntersect::recurse_intersect(const SCurve &left, const SCurve &right, int
 
 
 
-bool CIntersect::operator()(const bezier<Point> &c1, const bezier<Point> &c2)
+bool CIntersect::operator()(const etl::bezier<Point> &c1, const etl::bezier<Point> &c2)
 {
 	times.clear();