From 3cbd34905a9f65c4cf516e86db325d7d9fa07e20 Mon Sep 17 00:00:00 2001
From: Don Gagne <don@thegagnes.com>
Date: Fri, 27 Sep 2024 16:55:58 -0700
Subject: [PATCH 1/2] Fix compiler complaint

---
 src/QtLocationPlugin/QGCTileCacheWorker.cpp | 4 +---
 1 file changed, 1 insertion(+), 3 deletions(-)

diff --git a/src/QtLocationPlugin/QGCTileCacheWorker.cpp b/src/QtLocationPlugin/QGCTileCacheWorker.cpp
index 8f5518d50..ee86e9b00 100644
--- a/src/QtLocationPlugin/QGCTileCacheWorker.cpp
+++ b/src/QtLocationPlugin/QGCTileCacheWorker.cpp
@@ -485,7 +485,6 @@ QGCCacheWorker::_createTileSet(QGCMapTask *mtask)
 {
     if(_valid) {
         //-- Create Tile Set
-        quint32 actual_count = 0;
         QGCCreateTileSetTask* task = static_cast<QGCCreateTileSetTask*>(mtask);
         QSqlQuery query(*_db);
         query.prepare("INSERT INTO TileSets("
@@ -534,8 +533,7 @@ QGCCacheWorker::_createTileSet(QGCMapTask *mtask)
                                 qWarning() << "Map Cache SQL error (add tile into TilesDownload):" << query.lastError().text();
                                 mtask->setError("Error creating tile set download list");
                                 return;
-                            } else
-                                actual_count++;
+                            }
                         } else {
                             //-- Tile already in the database. No need to dowload.
                             QString s = QString("INSERT OR IGNORE INTO SetTiles(tileID, setID) VALUES(%1, %2)").arg(tileID).arg(setID);

From a67e6b50994bc918ec6b55a1c3d8b2b578a8347b Mon Sep 17 00:00:00 2001
From: Don Gagne <don@thegagnes.com>
Date: Fri, 27 Sep 2024 17:07:22 -0700
Subject: [PATCH 2/2] Compiler warning

---
 src/Viewer3D/earcut.hpp | 3 ---
 1 file changed, 3 deletions(-)

diff --git a/src/Viewer3D/earcut.hpp b/src/Viewer3D/earcut.hpp
index 5204dc2ec..0c1ed5efa 100644
--- a/src/Viewer3D/earcut.hpp
+++ b/src/Viewer3D/earcut.hpp
@@ -266,11 +266,8 @@ void Earcut<N>::earcutLinked(Node* ear, int pass) {
     Node* prev;
     Node* next;
 
-    int iterations = 0;
-
     // iterate through ears, slicing them one by one
     while (ear->prev != ear->next) {
-        iterations++;
         prev = ear->prev;
         next = ear->next;