test/testautomation_rect.c
changeset 7663 53fe1b64eb2d
parent 7191 75360622e65f
child 7678 286c42d7c5ed
--- a/test/testautomation_rect.c	Tue Aug 20 19:49:24 2013 -0300
+++ b/test/testautomation_rect.c	Tue Aug 20 20:34:40 2013 -0300
@@ -423,7 +423,7 @@
     SDL_Rect result;
     SDL_bool intersection;
 
-    // rectB fully contained in rectA
+    /* rectB fully contained in rectA */
     refRectB.x = 0;
     refRectB.y = 0;
     refRectB.w = SDLTest_RandomIntegerInRange(refRectA.x + 1, refRectA.x + refRectA.w - 1);
@@ -451,7 +451,7 @@
     SDL_Rect result;
     SDL_bool intersection;
 
-    // rectB fully outside of rectA
+    /* rectB fully outside of rectA */
     refRectB.x = refRectA.x + refRectA.w + SDLTest_RandomIntegerInRange(1, 10);
     refRectB.y = refRectA.y + refRectA.h + SDLTest_RandomIntegerInRange(1, 10);
     refRectB.w = refRectA.w;
@@ -480,7 +480,7 @@
     SDL_Rect expectedResult;
     SDL_bool intersection;
 
-    // rectB partially contained in rectA
+    /* rectB partially contained in rectA */
     refRectB.x = SDLTest_RandomIntegerInRange(refRectA.x + 1, refRectA.x + refRectA.w - 1);
     refRectB.y = SDLTest_RandomIntegerInRange(refRectA.y + 1, refRectA.y + refRectA.h - 1);
     refRectB.w = refRectA.w;
@@ -494,7 +494,7 @@
     intersection = SDL_IntersectRect(&rectA, &rectB, &result);
     _validateIntersectRectResults(intersection, SDL_TRUE, &rectA, &rectB, &refRectA, &refRectB, &result, &expectedResult);
 
-    // rectB right edge
+    /* rectB right edge */
     refRectB.x = rectA.w - 1;
     refRectB.y = rectA.y;
     refRectB.w = SDLTest_RandomIntegerInRange(1, refRectA.w - 1);
@@ -508,7 +508,7 @@
     intersection = SDL_IntersectRect(&rectA, &rectB, &result);
     _validateIntersectRectResults(intersection, SDL_TRUE, &rectA, &rectB, &refRectA, &refRectB, &result, &expectedResult);
 
-    // rectB left edge
+    /* rectB left edge */
     refRectB.x = 1 - rectA.w;
     refRectB.y = rectA.y;
     refRectB.w = refRectA.w;
@@ -522,7 +522,7 @@
     intersection = SDL_IntersectRect(&rectA, &rectB, &result);
     _validateIntersectRectResults(intersection, SDL_TRUE, &rectA, &rectB, &refRectA, &refRectB, &result, &expectedResult);
 
-    // rectB bottom edge
+    /* rectB bottom edge */
     refRectB.x = rectA.x;
     refRectB.y = rectA.h - 1;
     refRectB.w = SDLTest_RandomIntegerInRange(1, refRectA.w - 1);
@@ -536,7 +536,7 @@
     intersection = SDL_IntersectRect(&rectA, &rectB, &result);
     _validateIntersectRectResults(intersection, SDL_TRUE, &rectA, &rectB, &refRectA, &refRectB, &result, &expectedResult);
 
-    // rectB top edge
+    /* rectB top edge */
     refRectB.x = rectA.x;
     refRectB.y = 1 - rectA.h;
     refRectB.w = SDLTest_RandomIntegerInRange(1, refRectA.w - 1);
@@ -569,7 +569,7 @@
     SDL_bool intersection;
     int offsetX, offsetY;
 
-    // intersecting pixels
+    /* intersecting pixels */
     refRectA.x = SDLTest_RandomIntegerInRange(1, 100);
     refRectA.y = SDLTest_RandomIntegerInRange(1, 100);
     refRectB.x = refRectA.x;
@@ -579,7 +579,7 @@
     intersection = SDL_IntersectRect(&rectA, &rectB, &result);
     _validateIntersectRectResults(intersection, SDL_TRUE, &rectA, &rectB, &refRectA, &refRectB, &result, &refRectA);
 
-    // non-intersecting pixels cases
+    /* non-intersecting pixels cases */
     for (offsetX = -1; offsetX <= 1; offsetX++) {
         for (offsetY = -1; offsetY <= 1; offsetY++) {
             if (offsetX != 0 || offsetY != 0) {
@@ -616,7 +616,7 @@
     SDL_bool intersection;
     SDL_bool empty;
 
-    // Rect A empty
+    /* Rect A empty */
     result.w = SDLTest_RandomIntegerInRange(1, 100);
     result.h = SDLTest_RandomIntegerInRange(1, 100);
     refRectA.x = SDLTest_RandomIntegerInRange(1, 100);
@@ -633,7 +633,7 @@
     empty = (SDL_bool)SDL_RectEmpty(&result);
     SDLTest_AssertCheck(empty == SDL_TRUE, "Validate result is empty Rect; got: %s", (empty == SDL_TRUE) ? "SDL_TRUE" : "SDL_FALSE");
 
-    // Rect B empty
+    /* Rect B empty */
     result.w = SDLTest_RandomIntegerInRange(1, 100);
     result.h = SDLTest_RandomIntegerInRange(1, 100);
     refRectA.x = SDLTest_RandomIntegerInRange(1, 100);
@@ -650,7 +650,7 @@
     empty = (SDL_bool)SDL_RectEmpty(&result);
     SDLTest_AssertCheck(empty == SDL_TRUE, "Validate result is empty Rect; got: %s", (empty == SDL_TRUE) ? "SDL_TRUE" : "SDL_FALSE");
 
-    // Rect A and B empty
+    /* Rect A and B empty */
     result.w = SDLTest_RandomIntegerInRange(1, 100);
     result.h = SDLTest_RandomIntegerInRange(1, 100);
     refRectA.x = SDLTest_RandomIntegerInRange(1, 100);
@@ -685,7 +685,7 @@
     SDL_Rect result;
     SDL_bool intersection;
 
-    // invalid parameter combinations
+    /* invalid parameter combinations */
     intersection = SDL_IntersectRect((SDL_Rect *)NULL, &rectB, &result);
     SDLTest_AssertCheck(intersection == SDL_FALSE, "Check that function returns SDL_FALSE when 1st parameter is NULL");
     intersection = SDL_IntersectRect(&rectA, (SDL_Rect *)NULL, &result);
@@ -716,7 +716,7 @@
     SDL_Rect rectB;
     SDL_bool intersection;
 
-    // rectB fully contained in rectA
+    /* rectB fully contained in rectA */
     refRectB.x = 0;
     refRectB.y = 0;
     refRectB.w = SDLTest_RandomIntegerInRange(refRectA.x + 1, refRectA.x + refRectA.w - 1);
@@ -743,7 +743,7 @@
     SDL_Rect rectB;
     SDL_bool intersection;
 
-    // rectB fully outside of rectA
+    /* rectB fully outside of rectA */
     refRectB.x = refRectA.x + refRectA.w + SDLTest_RandomIntegerInRange(1, 10);
     refRectB.y = refRectA.y + refRectA.h + SDLTest_RandomIntegerInRange(1, 10);
     refRectB.w = refRectA.w;
@@ -770,7 +770,7 @@
     SDL_Rect rectB;
     SDL_bool intersection;
 
-    // rectB partially contained in rectA
+    /* rectB partially contained in rectA */
     refRectB.x = SDLTest_RandomIntegerInRange(refRectA.x + 1, refRectA.x + refRectA.w - 1);
     refRectB.y = SDLTest_RandomIntegerInRange(refRectA.y + 1, refRectA.y + refRectA.h - 1);
     refRectB.w = refRectA.w;
@@ -780,7 +780,7 @@
     intersection = SDL_HasIntersection(&rectA, &rectB);
     _validateHasIntersectionResults(intersection, SDL_TRUE, &rectA, &rectB, &refRectA, &refRectB);
 
-    // rectB right edge
+    /* rectB right edge */
     refRectB.x = rectA.w - 1;
     refRectB.y = rectA.y;
     refRectB.w = SDLTest_RandomIntegerInRange(1, refRectA.w - 1);
@@ -790,7 +790,7 @@
     intersection = SDL_HasIntersection(&rectA, &rectB);
     _validateHasIntersectionResults(intersection, SDL_TRUE, &rectA, &rectB, &refRectA, &refRectB);
 
-    // rectB left edge
+    /* rectB left edge */
     refRectB.x = 1 - rectA.w;
     refRectB.y = rectA.y;
     refRectB.w = refRectA.w;
@@ -800,7 +800,7 @@
     intersection = SDL_HasIntersection(&rectA, &rectB);
     _validateHasIntersectionResults(intersection, SDL_TRUE, &rectA, &rectB, &refRectA, &refRectB);
 
-    // rectB bottom edge
+    /* rectB bottom edge */
     refRectB.x = rectA.x;
     refRectB.y = rectA.h - 1;
     refRectB.w = SDLTest_RandomIntegerInRange(1, refRectA.w - 1);
@@ -810,7 +810,7 @@
     intersection = SDL_HasIntersection(&rectA, &rectB);
     _validateHasIntersectionResults(intersection, SDL_TRUE, &rectA, &rectB, &refRectA, &refRectB);
 
-    // rectB top edge
+    /* rectB top edge */
     refRectB.x = rectA.x;
     refRectB.y = 1 - rectA.h;
     refRectB.w = SDLTest_RandomIntegerInRange(1, refRectA.w - 1);
@@ -838,7 +838,7 @@
     SDL_bool intersection;
     int offsetX, offsetY;
 
-    // intersecting pixels
+    /* intersecting pixels */
     refRectA.x = SDLTest_RandomIntegerInRange(1, 100);
     refRectA.y = SDLTest_RandomIntegerInRange(1, 100);
     refRectB.x = refRectA.x;
@@ -848,7 +848,7 @@
     intersection = SDL_HasIntersection(&rectA, &rectB);
     _validateHasIntersectionResults(intersection, SDL_TRUE, &rectA, &rectB, &refRectA, &refRectB);
 
-    // non-intersecting pixels cases
+    /* non-intersecting pixels cases */
     for (offsetX = -1; offsetX <= 1; offsetX++) {
         for (offsetY = -1; offsetY <= 1; offsetY++) {
             if (offsetX != 0 || offsetY != 0) {
@@ -883,7 +883,7 @@
     SDL_Rect rectB;
     SDL_bool intersection;
 
-    // Rect A empty
+    /* Rect A empty */
     refRectA.x = SDLTest_RandomIntegerInRange(1, 100);
     refRectA.y = SDLTest_RandomIntegerInRange(1, 100);
     refRectA.w = SDLTest_RandomIntegerInRange(1, 100);
@@ -896,7 +896,7 @@
     intersection = SDL_HasIntersection(&rectA, &rectB);
     _validateHasIntersectionResults(intersection, SDL_FALSE, &rectA, &rectB, &refRectA, &refRectB);
 
-    // Rect B empty
+    /* Rect B empty */
     refRectA.x = SDLTest_RandomIntegerInRange(1, 100);
     refRectA.y = SDLTest_RandomIntegerInRange(1, 100);
     refRectA.w = SDLTest_RandomIntegerInRange(1, 100);
@@ -909,7 +909,7 @@
     intersection = SDL_HasIntersection(&rectA, &rectB);
     _validateHasIntersectionResults(intersection, SDL_FALSE, &rectA, &rectB, &refRectA, &refRectB);
 
-    // Rect A and B empty
+    /* Rect A and B empty */
     refRectA.x = SDLTest_RandomIntegerInRange(1, 100);
     refRectA.y = SDLTest_RandomIntegerInRange(1, 100);
     refRectA.w = SDLTest_RandomIntegerInRange(1, 100);
@@ -939,7 +939,7 @@
     SDL_Rect rectB;
     SDL_bool intersection;
 
-    // invalid parameter combinations
+    /* invalid parameter combinations */
     intersection = SDL_HasIntersection((SDL_Rect *)NULL, &rectB);
     SDLTest_AssertCheck(intersection == SDL_FALSE, "Check that function returns SDL_FALSE when 1st parameter is NULL");
     intersection = SDL_HasIntersection(&rectA, (SDL_Rect *)NULL);
@@ -969,7 +969,7 @@
     int minx = 0, maxx = 0, miny = 0, maxy = 0;
     int i;
 
-    // Create input data, tracking result
+    /* Create input data, tracking result */
     for (i=0; i<numPoints; i++) {
         newx = SDLTest_RandomIntegerInRange(-1024, 1024);
         newy = SDLTest_RandomIntegerInRange(-1024, 1024);
@@ -990,7 +990,7 @@
         }
     }
 
-    // Call function and validate - special case: no result requested
+    /* Call function and validate - special case: no result requested */
     anyEnclosedNoResult = SDL_EnclosePoints((const SDL_Point *)points, numPoints, (const SDL_Rect *)NULL, (SDL_Rect *)NULL);
     SDLTest_AssertCheck(expectedEnclosed==anyEnclosedNoResult,
         "Check expected return value %s, got %s",
@@ -1002,7 +1002,7 @@
             i, refPoints[i].x, refPoints[i].y, points[i].x, points[i].y);
     }
 
-    // Call function and validate
+    /* Call function and validate */
     anyEnclosed = SDL_EnclosePoints((const SDL_Point *)points, numPoints, (const SDL_Rect *)NULL, &result);
     SDLTest_AssertCheck(expectedEnclosed==anyEnclosed,
         "Check return value %s, got %s",
@@ -1040,7 +1040,7 @@
     int minx = 0, maxx = 0, miny = 0, maxy = 0;
     int i;
 
-    // Create input data, tracking result
+    /* Create input data, tracking result */
     for (i=0; i<numPoints; i++) {
         if (i < halfPoints) {
             newx = SDLTest_RandomIntegerInRange(-1024, 1024);
@@ -1066,7 +1066,7 @@
         }
     }
 
-    // Call function and validate - special case: no result requested
+    /* Call function and validate - special case: no result requested */
     anyEnclosedNoResult = SDL_EnclosePoints((const SDL_Point *)points, numPoints, (const SDL_Rect *)NULL, (SDL_Rect *)NULL);
     SDLTest_AssertCheck(expectedEnclosed==anyEnclosedNoResult,
         "Check return value %s, got %s",
@@ -1078,7 +1078,7 @@
             i, refPoints[i].x, refPoints[i].y, points[i].x, points[i].y);
     }
 
-    // Call function and validate
+    /* Call function and validate */
     anyEnclosed = SDL_EnclosePoints((const SDL_Point *)points, numPoints, (const SDL_Rect *)NULL, &result);
     SDLTest_AssertCheck(expectedEnclosed==anyEnclosed,
         "Check return value %s, got %s",
@@ -1117,13 +1117,13 @@
     int minx = 0, maxx = 0, miny = 0, maxy = 0;
     int i;
 
-    // Setup clipping rectangle
+    /* Setup clipping rectangle */
     refClip.x = SDLTest_RandomIntegerInRange(-1024, 1024);
     refClip.y = SDLTest_RandomIntegerInRange(-1024, 1024);
     refClip.w = SDLTest_RandomIntegerInRange(1, 1024);
     refClip.h = SDLTest_RandomIntegerInRange(1, 1024);
 
-    // Create input data, tracking result
+    /* Create input data, tracking result */
     for (i=0; i<numPoints; i++) {
         newx = SDLTest_RandomIntegerInRange(-1024, 1024);
         newy = SDLTest_RandomIntegerInRange(-1024, 1024);
@@ -1148,7 +1148,7 @@
         }
     }
 
-    // Call function and validate - special case: no result requested
+    /* Call function and validate - special case: no result requested */
     clip = refClip;
     anyEnclosedNoResult = SDL_EnclosePoints((const SDL_Point *)points, numPoints, (const SDL_Rect *)&clip, (SDL_Rect *)NULL);
     SDLTest_AssertCheck(expectedEnclosed==anyEnclosedNoResult,
@@ -1163,7 +1163,7 @@
     SDLTest_AssertCheck(refClip.x==clip.x && refClip.y==clip.y && refClip.w==clip.w && refClip.h==clip.h,
         "Check that source clipping rectangle was not modified");
 
-    // Call function and validate
+    /* Call function and validate */
     anyEnclosed = SDL_EnclosePoints((const SDL_Point *)points, numPoints, (const SDL_Rect *)&clip, &result);
     SDLTest_AssertCheck(expectedEnclosed==anyEnclosed,
         "Check return value %s, got %s",
@@ -1209,7 +1209,7 @@
     SDL_Rect result;
     SDL_bool anyEnclosed;
 
-    // invalid parameter combinations
+    /* invalid parameter combinations */
     anyEnclosed = SDL_EnclosePoints((SDL_Point *)NULL, 1, (const SDL_Rect *)&clip, &result);
     SDLTest_AssertCheck(anyEnclosed == SDL_FALSE, "Check that functions returns SDL_FALSE when 1st parameter is NULL");
     anyEnclosed = SDL_EnclosePoints((const SDL_Point *)points, 0, (const SDL_Rect *)&clip, &result);
@@ -1434,7 +1434,7 @@
     SDL_Rect rectA, rectB;
     SDL_Rect result;
 
-    // invalid parameter combinations
+    /* invalid parameter combinations */
     SDL_UnionRect((SDL_Rect *)NULL, &rectB, &result);
     SDLTest_AssertPass("Check that function returns when 1st parameter is NULL");
     SDL_UnionRect(&rectA, (SDL_Rect *)NULL, &result);
@@ -1465,7 +1465,7 @@
     SDL_bool result;
     int w, h;
 
-    // Non-empty case
+    /* Non-empty case */
     refRect.x=SDLTest_RandomIntegerInRange(-1024, 1024);
     refRect.y=SDLTest_RandomIntegerInRange(-1024, 1024);
     refRect.w=SDLTest_RandomIntegerInRange(256, 1024);
@@ -1475,7 +1475,7 @@
     result = (SDL_bool)SDL_RectEmpty((const SDL_Rect *)&rect);
     _validateRectEmptyResults(result, expectedResult, &rect, &refRect);
 
-    // Empty case
+    /* Empty case */
     for (w=-1; w<2; w++) {
         for (h=-1; h<2; h++) {
             if ((w != 1) || (h != 1)) {
@@ -1504,7 +1504,7 @@
 {
     SDL_bool result;
 
-    // invalid parameter combinations
+    /* invalid parameter combinations */
     result = (SDL_bool)SDL_RectEmpty((const SDL_Rect *)NULL);
     SDLTest_AssertCheck(result == SDL_TRUE, "Check that function returns TRUE when 1st parameter is NULL");
 
@@ -1526,7 +1526,7 @@
     SDL_bool expectedResult;
     SDL_bool result;
 
-    // Equals
+    /* Equals */
     refRectA.x=SDLTest_RandomIntegerInRange(-1024, 1024);
     refRectA.y=SDLTest_RandomIntegerInRange(-1024, 1024);
     refRectA.w=SDLTest_RandomIntegerInRange(1, 1024);
@@ -1563,7 +1563,7 @@
     rectB.w=SDLTest_RandomIntegerInRange(1, 1024);
     rectB.h=SDLTest_RandomIntegerInRange(1, 1024);
 
-    // invalid parameter combinations
+    /* invalid parameter combinations */
     result = (SDL_bool)SDL_RectEquals((const SDL_Rect *)NULL, (const SDL_Rect *)&rectB);
     SDLTest_AssertCheck(result == SDL_FALSE, "Check that function returns SDL_FALSE when 1st parameter is NULL");
     result = (SDL_bool)SDL_RectEquals((const SDL_Rect *)&rectA, (const SDL_Rect *)NULL);