Commit 34f74e42 authored by Stefan Brüns's avatar Stefan Brüns
Browse files

[BalooRolesProvider] Move static tagsFromValues to anonymous namespace

parent 4c31ec37
...@@ -15,6 +15,17 @@ ...@@ -15,6 +15,17 @@
#include <QDebug> #include <QDebug>
#include <QTime> #include <QTime>
namespace {
QString tagsFromValues(const QStringList& values)
{
QStringList alphabeticalOrderTags = values;
QCollator coll;
coll.setNumericMode(true);
std::sort(alphabeticalOrderTags.begin(), alphabeticalOrderTags.end(), [&](const QString& s1, const QString& s2){ return coll.compare(s1, s2) < 0; });
return alphabeticalOrderTags.join(QLatin1String(", "));
}
}
struct KBalooRolesProviderSingleton struct KBalooRolesProviderSingleton
{ {
KBalooRolesProvider instance; KBalooRolesProvider instance;
...@@ -137,13 +148,6 @@ KBalooRolesProvider::KBalooRolesProvider() : ...@@ -137,13 +148,6 @@ KBalooRolesProvider::KBalooRolesProvider() :
m_roleForProperty.insert(propertyInfoList[i].property, propertyInfoList[i].role); m_roleForProperty.insert(propertyInfoList[i].property, propertyInfoList[i].role);
m_roles.insert(propertyInfoList[i].role); m_roles.insert(propertyInfoList[i].role);
} }
}
QString KBalooRolesProvider::tagsFromValues(const QStringList& values) const
{
QStringList alphabeticalOrderTags = values;
QCollator coll;
coll.setNumericMode(true);
std::sort(alphabeticalOrderTags.begin(), alphabeticalOrderTags.end(), [&](const QString& s1, const QString& s2){ return coll.compare(s1, s2) < 0; });
return alphabeticalOrderTags.join(QLatin1String(", "));
} }
...@@ -47,13 +47,6 @@ public: ...@@ -47,13 +47,6 @@ public:
protected: protected:
KBalooRolesProvider(); KBalooRolesProvider();
private:
/**
* @return User visible string for the given tag-values.
* The tag-values are sorted in alphabetical order.
*/
QString tagsFromValues(const QStringList& values) const;
private: private:
QSet<QByteArray> m_roles; QSet<QByteArray> m_roles;
QHash<QString, QByteArray> m_roleForProperty; QHash<QString, QByteArray> m_roleForProperty;
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment