aboutsummaryrefslogtreecommitdiffstats
path: root/SQLiteStudio3/coreSQLiteStudio/common/bistrhash.cpp
diff options
context:
space:
mode:
authorLibravatarUnit 193 <unit193@unit193.net>2021-12-17 07:07:47 -0500
committerLibravatarUnit 193 <unit193@unit193.net>2021-12-17 07:07:47 -0500
commit558b1e35fd0777ac97763c1b28056ac984e583e7 (patch)
tree1eb2557119a117ea76535c89cd14a49e510b96bf /SQLiteStudio3/coreSQLiteStudio/common/bistrhash.cpp
parentc22eb635c11fd45f9c30f911d70e1d79111a49ce (diff)
parent1fdc150116cad39aae5c5da407c3312b47a59e3a (diff)
Update upstream source from tag 'upstream/3.3.3+dfsg1'
Update to upstream version '3.3.3+dfsg1' with Debian dir 9a301fff4922aed2fec0c04c7d011947168c42f1
Diffstat (limited to 'SQLiteStudio3/coreSQLiteStudio/common/bistrhash.cpp')
-rw-r--r--SQLiteStudio3/coreSQLiteStudio/common/bistrhash.cpp9
1 files changed, 6 insertions, 3 deletions
diff --git a/SQLiteStudio3/coreSQLiteStudio/common/bistrhash.cpp b/SQLiteStudio3/coreSQLiteStudio/common/bistrhash.cpp
index 5f40521..5aac017 100644
--- a/SQLiteStudio3/coreSQLiteStudio/common/bistrhash.cpp
+++ b/SQLiteStudio3/coreSQLiteStudio/common/bistrhash.cpp
@@ -31,7 +31,7 @@ void BiStrHash::insert(const QString& left, const QString& right)
lowerInverted.insert(right.toLower(), right);
}
-bool BiStrHash::containsLeft(const QString& left, Qt::CaseSensitivity cs)
+bool BiStrHash::containsLeft(const QString& left, Qt::CaseSensitivity cs) const
{
if (cs == Qt::CaseSensitive)
return hash.contains(left);
@@ -39,7 +39,7 @@ bool BiStrHash::containsLeft(const QString& left, Qt::CaseSensitivity cs)
return lowerHash.contains(left.toLower());
}
-bool BiStrHash::containsRight(const QString& right, Qt::CaseSensitivity cs)
+bool BiStrHash::containsRight(const QString& right, Qt::CaseSensitivity cs) const
{
if (cs == Qt::CaseSensitive)
return inverted.contains(right);
@@ -147,7 +147,10 @@ BiStrHash& BiStrHash::unite(const QHash<QString, QString>& other)
{
QHashIterator<QString, QString> it(other);
while (it.hasNext())
- insert(it.next().key(), it.value());
+ {
+ it.next();
+ insert(it.key(), it.value());
+ }
return *this;
}