X-Git-Url: https://git.pterodactylus.net/?a=blobdiff_plain;f=synfig-core%2Ftrunk%2Fsrc%2Fsynfig%2Fcurveset.cpp;h=e8bd7fab3d3fb74985432d442fa12d998b121534;hb=d15c4522466bedfbe61620c401becae0931854f5;hp=2e607bdda788b96c4b3eeaedf20c7b05bb1c7107;hpb=cc54c38609ee9745ad678e5e9b9d7d2912be9c95;p=synfig.git

diff --git a/synfig-core/trunk/src/synfig/curveset.cpp b/synfig-core/trunk/src/synfig/curveset.cpp
index 2e607bd..e8bd7fa 100644
--- a/synfig-core/trunk/src/synfig/curveset.cpp
+++ b/synfig-core/trunk/src/synfig/curveset.cpp
@@ -104,7 +104,7 @@ struct ipoint
 		}else return curveindex < rhs.curveindex;
 	}
 
-	bool operator >(const ipoint &rhs) const
+	bool operator>(const ipoint &rhs) const
 	{
 		return rhs < *this;
 	}
@@ -304,7 +304,7 @@ public:
 		}
 	}
 
-	bool ConstructSet(CurveSet &c, const CurveSet &lhs, const CurveSet &rhs, int type)
+	bool ConstructSet(CurveSet &/*c*/, const CurveSet &lhs, const CurveSet &rhs, int type)
 	{
 		bool in1,in2;
 
@@ -428,7 +428,7 @@ void CurveSet::SetClamp(int &i, int &si)
 	}
 }
 
-void CurveSet::CleanUp(int curve)
+void CurveSet::CleanUp(int /*curve*/)
 {
 }
 
@@ -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 rectangles)
 	2) Intersecting curves is slow... oh well
 
 	Algorithm:
@@ -446,17 +446,17 @@ void CurveSet::CleanUp(int curve)
 	- only works with odd-even rule
 */
 
-CurveSet CurveSet::operator &(const CurveSet &rhs) const
+CurveSet CurveSet::operator&(const CurveSet &/*rhs*/) const
 {
 	return *this;
 }
 
-CurveSet CurveSet::operator |(const CurveSet &rhs) const
+CurveSet CurveSet::operator|(const CurveSet &/*rhs*/) const
 {
 	return *this;
 }
 
-CurveSet CurveSet::operator -(const CurveSet &rhs) const
+CurveSet CurveSet::operator-(const CurveSet &/*rhs*/) const
 {
 	return *this;
 }