QUrlIdna: replace manual pointer handling with std::begin()/end()

This is more readable, because it follows usual iterator patterns.

Change-Id: I56900286ddbca57a86aa499020f175e8add17fd9
Reviewed-by: Lars Knoll <lars.knoll@qt.io>

1 files changed, 4 insertions, 6 deletions

diff --git a/src/corelib/io/qurlidna.cpp b/src/corelib/io/qurlidna.cpp
index 08c5d1759c..549b280f91 100644
--- a/src/corelib/io/qurlidna.cpp
+++ b/src/corelib/io/qurlidna.cpp
@@ -1442,8 +1442,6 @@ static const NameprepCaseFoldingEntry NameprepCaseFolding[] = {
 
 static void mapToLowerCase(QString *str, int from)
 {
-    int N = sizeof(NameprepCaseFolding) / sizeof(NameprepCaseFolding[0]);
-
     ushort *d = nullptr;
     for (int i = from; i < str->size(); ++i) {
         uint uc = str->at(i).unicode();
@@ -1461,10 +1459,10 @@ static void mapToLowerCase(QString *str, int from)
                     ++i;
                 }
             }
-            const NameprepCaseFoldingEntry *entry = std::lower_bound(NameprepCaseFolding,
-                                                                     NameprepCaseFolding + N,
-                                                                     uc);
-            if ((entry != NameprepCaseFolding + N) && !(uc < *entry)) {
+            const auto entry = std::lower_bound(std::begin(NameprepCaseFolding),
+                                                std::end(NameprepCaseFolding),
+                                                uc);
+            if ((entry != std::end(NameprepCaseFolding)) && !(uc < *entry)) {
                 int l = 1;
                 while (l < 4 && entry->mapping[l])
                     ++l;