diff --git a/core/tests/geolocation/editor/test_simpletreemodel.cpp b/core/tests/geolocation/editor/test_simpletreemodel.cpp
index e7098179f2..d74361b3e9 100644
--- a/core/tests/geolocation/editor/test_simpletreemodel.cpp
+++ b/core/tests/geolocation/editor/test_simpletreemodel.cpp
@@ -1,121 +1,124 @@
 /* ============================================================
  *
  * This file is a part of digiKam project
  * https://www.digikam.org
  *
  * Date        : 2010-06-21
  * Description : Test for SimpleTreeModel.
  *
  * Copyright (C) 2010 by Michael G. Hansen <mike at mghansen dot de>
  *
  * This program is free software; you can redistribute it
  * and/or modify it under the terms of the GNU General
  * Public License as published by the Free Software Foundation;
  * either version 2, or (at your option)
  * any later version.
  *
  * This program is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  * GNU General Public License for more details.
  *
  * ============================================================ */
 
 #include "test_simpletreemodel.h"
 
 // Qt includes
 
 #include <QUrl>
 #include <QDebug>
 
 // local includes
 
 #include "simpletreemodel.h"
 #include "modeltest.h"
 
 using namespace Digikam;
 
 /**
  * Description : Dummy test that does nothing
  */
 void TestSimpleTreeModel::testNoOp()
 {
 }
 
 void TestSimpleTreeModel::testModel1()
 {
     SimpleTreeModel* const treeModel = new SimpleTreeModel(1, this);
     new ModelTest(treeModel, this);
     Q_ASSERT(!treeModel->index(0, 0).isValid());
-    Q_ASSERT(treeModel->indexToItem(QModelIndex())==treeModel->rootItem());
+    Q_ASSERT(treeModel->indexToItem(QModelIndex()) == treeModel->rootItem());
     Q_ASSERT(!treeModel->itemToIndex(treeModel->rootItem()).isValid());
     Q_ASSERT(!treeModel->itemToIndex(nullptr).isValid());
     Q_ASSERT(!treeModel->parent(QModelIndex()).isValid());
 
     SimpleTreeModel::Item* const item1 = treeModel->addItem();
-    Q_ASSERT(item1!=nullptr);
+    Q_ASSERT(item1 != nullptr);
     const QPersistentModelIndex item1Index = treeModel->itemToIndex(item1);
     Q_ASSERT(item1Index.isValid());
-    Q_ASSERT(treeModel->indexToItem(item1Index)==item1);
+    Q_ASSERT(treeModel->indexToItem(item1Index) == item1);
     Q_ASSERT(!treeModel->parent(item1Index).isValid());
 
     SimpleTreeModel::Item* const item2 = treeModel->addItem();
-    Q_ASSERT(item2!=nullptr);
+    Q_ASSERT(item2 != nullptr);
     const QModelIndex item2Index = treeModel->itemToIndex(item2);
     Q_ASSERT(item2Index.isValid());
-    Q_ASSERT(treeModel->indexToItem(item2Index)==item2);
+    Q_ASSERT(treeModel->indexToItem(item2Index) == item2);
     Q_ASSERT(!treeModel->parent(item2Index).isValid());
 
     SimpleTreeModel::Item* const item21 = treeModel->addItem(item2);
-    Q_ASSERT(item21!=nullptr);
+    Q_ASSERT(item21 != nullptr);
     const QModelIndex item21Index = treeModel->itemToIndex(item21);
     Q_ASSERT(item21Index.isValid());
-    Q_ASSERT(treeModel->indexToItem(item21Index)==item21);
-    Q_ASSERT(treeModel->parent(item21Index)==item2Index);
-    Q_ASSERT(treeModel->index(0, 0, item2Index)==item21Index);
+    Q_ASSERT(treeModel->indexToItem(item21Index) == item21);
+    Q_ASSERT(treeModel->parent(item21Index) == item2Index);
+    Q_ASSERT(treeModel->index(0, 0, item2Index) == item21Index);
 
     // just make sure another modeltest will test things for consistency in case a signal went missing
+
     new ModelTest(treeModel, this);
 
     Q_ASSERT(treeModel->rootItem() == treeModel->indexToItem(QModelIndex()));
     Q_ASSERT(treeModel->indexToItem(treeModel->itemToIndex(item1))==item1);
     Q_ASSERT(treeModel->hasIndex(0, 0) == true);
 
     QModelIndex topIndex = treeModel->index(0, 0, QModelIndex());
 
     if (treeModel->rowCount(topIndex) > 0)
     {
         QModelIndex childIndex = treeModel->index(0, 0, topIndex);
         qDebug() << childIndex;
         qDebug() << treeModel->parent(childIndex);
         Q_ASSERT(treeModel->parent(childIndex) == topIndex);
     }
 
-    // add another few items:
+    // add another few items
+
     {
-        SimpleTreeModel::Item* const item21 = treeModel->addItem(item2, 0);
-        Q_ASSERT(item21!=nullptr);
-        const QModelIndex item21Index = treeModel->itemToIndex(item21);
-        Q_ASSERT(item21Index.isValid());
-        Q_ASSERT(treeModel->indexToItem(item21Index)==item21);
-        Q_ASSERT(treeModel->parent(item21Index)==item2Index);
-        Q_ASSERT(treeModel->index(0, 0, item2Index)==item21Index);
-        Q_ASSERT(item21Index.row()==0);
+        SimpleTreeModel::Item* const item22 = treeModel->addItem(item2, 0);
+        Q_ASSERT(item22 != nullptr);
+        const QModelIndex item22Index = treeModel->itemToIndex(item21);
+        Q_ASSERT(item22Index.isValid());
+        Q_ASSERT(treeModel->indexToItem(item22Index) == item22);
+        Q_ASSERT(treeModel->parent(item22Index) == item22Index);
+        Q_ASSERT(treeModel->index(0, 0, item2Index) == item21Index);
+        Q_ASSERT(item22Index.row() == 0);
     }
 
-    // add another few items:
+    // add another few items
+
     {
-        SimpleTreeModel::Item* const item21 = treeModel->addItem(item2, 1);
-        Q_ASSERT(item21!=nullptr);
-        const QModelIndex item21Index = treeModel->itemToIndex(item21);
-        Q_ASSERT(item21Index.isValid());
-        Q_ASSERT(treeModel->indexToItem(item21Index)==item21);
-        Q_ASSERT(treeModel->parent(item21Index)==item2Index);
-        Q_ASSERT(treeModel->index(1, 0, item2Index)==item21Index);
-        Q_ASSERT(item21Index.row()==1);
+        SimpleTreeModel::Item* const item23 = treeModel->addItem(item2, 1);
+        Q_ASSERT(item23 != nullptr);
+        const QModelIndex item23Index = treeModel->itemToIndex(item23);
+        Q_ASSERT(item23Index.isValid());
+        Q_ASSERT(treeModel->indexToItem(item23Index) == item23);
+        Q_ASSERT(treeModel->parent(item23Index) == item2Index);
+        Q_ASSERT(treeModel->index(1, 0, item2Index) == item23Index);
+        Q_ASSERT(item23Index.row() == 1);
     }
 
     new ModelTest(treeModel, this);
 }
 
 QTEST_GUILESS_MAIN(TestSimpleTreeModel)