[Scummvm-git-logs] scummvm master -> c5cd928087c84f50de678c20c0abe0b51e4a1a98

[eriktorbjorn]

This automated email contains information about 1 new commit which have been
pushed to the 'scummvm' repo located at https://api.github.com/repos/scummvm/scummvm .

Summary:
c5cd928087 QDENGINE: Fix warnings


Commit: c5cd928087c84f50de678c20c0abe0b51e4a1a98
    https://github.com/scummvm/scummvm/commit/c5cd928087c84f50de678c20c0abe0b51e4a1a98
Author: Torbjörn Andersson (eriktorbjorn at users.sourceforge.net)
Date: 2025-04-15T18:55:33+02:00

Commit Message:
QDENGINE: Fix warnings

Changed paths:
    engines/qdengine/qdcore/qd_contour.cpp


diff --git a/engines/qdengine/qdcore/qd_contour.cpp b/engines/qdengine/qdcore/qd_contour.cpp
index 427747b7f4a..a79273b2b7d 100644
--- a/engines/qdengine/qdcore/qd_contour.cpp
+++ b/engines/qdengine/qdcore/qd_contour.cpp
@@ -96,7 +96,7 @@ void qdContour::createMaskOld(int x0, int y0, int x1, int y1) {
 	for (int y = y0; y <= y1; y++) {
 		byte *ptr = &*it;
 
-		for (int i = 0; i < _contour.size(); i++) {
+		for (uint i = 0; i < _contour.size(); i++) {
 			Vect2s p0 = _contour[i];
 			Vect2s p1 = (i < _contour.size() - 1) ? _contour[i + 1] : _contour[0];
 
@@ -108,7 +108,7 @@ void qdContour::createMaskOld(int x0, int y0, int x1, int y1) {
 
 		if (intersections.size() > 1) {
 			Common::sort(intersections.begin(), intersections.end());
-			for (int i = 0; i < intersections.size() - 1; i += 2) {
+			for (uint i = 0; i < intersections.size() - 1; i += 2) {
 				int xl = intersections[i];
 				int xr = intersections[i + 1];
 
@@ -122,7 +122,7 @@ void qdContour::createMaskOld(int x0, int y0, int x1, int y1) {
 
 		intersections.clear();
 
-		for (int i = 0; i < _contour.size(); i++) {
+		for (uint i = 0; i < _contour.size(); i++) {
 			Vect2s p0 = _contour[i];
 			Vect2s p1 = (i < _contour.size() - 1) ? _contour[i + 1] : _contour[0];
 
@@ -134,7 +134,7 @@ void qdContour::createMaskOld(int x0, int y0, int x1, int y1) {
 
 		if (intersections.size() > 1) {
 			Common::sort(intersections.begin(), intersections.end());
-			for (int i = 0; i < intersections.size() - 1; i += 2) {
+			for (uint i = 0; i < intersections.size() - 1; i += 2) {
 				int xl = intersections[i];
 				int xr = intersections[i + 1];