Differential D25698 Diff 74335 src/services/kapplicationtrader.cpp

Changeset View

Standalone View

View Options

src/services/kapplicationtrader.cpp

  • This file was added.
1​/* This file is part of the KDE libraries
2​ Copyright (C) 2000 Torben Weis <weis@kde.org>
3​ Copyright (C) 2006-2020 David Faure <faure@kde.org>
4​
5​ This library is free software; you can redistribute it and/or
6​ modify it under the terms of the GNU Library General Public
7​ License as published by the Free Software Foundation; either
8​ version 2 of the License, or (at your option) any later version.
9​
10​ This library is distributed in the hope that it will be useful,
11​ but WITHOUT ANY WARRANTY; without even the implied warranty of
12​ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13​ Library General Public License for more details.
14​
15​ You should have received a copy of the GNU Library General Public License
16​ along with this library; see the file COPYING.LIB. If not, write to
17​ the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
18​ Boston, MA 02110-1301, USA.
19​*/
20​
21​#include "kapplicationtrader.h"
22​
23​#include "ksycoca.h"
24​#include "ksycoca_p.h"
25​#include "kservicetypefactory_p.h"
26​#include "kservicefactory_p.h"
27​#include "kmimetypefactory_p.h"
28​#include "servicesdebug.h"
29​
30​#include <qmimedatabase.h>
31​
32​static KService::List mimeTypeSycocaServiceOffers(const QString &mimeType)
33​{
34​ KService::List lst;
35​ QMimeDatabase db;
36​ QString mime = db.mimeTypeForName(mimeType).name();
37​ if (mime.isEmpty()) {
38​ if (!mimeType.startsWith(QLatin1String("x-scheme-handler/"))) { // don't warn for unknown scheme handler mimetypes
39​ qCWarning(SERVICES) << "KApplicationTrader: mimeType" << mimeType << "not found";
40​ return lst; // empty
41​ }
42​ mime = mimeType;
43​ }
44​ KSycoca::self()->ensureCacheValid();
45​ KMimeTypeFactory *factory = KSycocaPrivate::self()->mimeTypeFactory();
46​ const int offset = factory->entryOffset(mime);
47​ if (!offset) {
48​ qCWarning(SERVICES) << "KApplicationTrader: mimeType" << mimeType << "not found";
49​ return lst; // empty
50​ }
51​ const int serviceOffersOffset = factory->serviceOffersOffset(mime);
52​ if (serviceOffersOffset > -1) {
53​ lst = KSycocaPrivate::self()->serviceFactory()->serviceOffers(offset, serviceOffersOffset);
54​ }
55​ return lst;
56​}
57​
58​// Filter the offers for the requested mime type in order to keep only applications.
59​static void filterMimeTypeOffers(KService::List &list) // static, internal
60​{
61​ KServiceType::Ptr genericServiceTypePtr = KServiceType::serviceType(QStringLiteral("Application"));
62​ Q_ASSERT(genericServiceTypePtr);
63​
64​ KSycoca::self()->ensureCacheValid();
65​ KServiceFactory *serviceFactory = KSycocaPrivate::self()->serviceFactory();
66​
67​ // Remove non-Applications (TODO KF6: kill plugin desktop files, then kill this code)
68​ auto removeFunc = [&](const KService::Ptr &serv) {
69​ return !serviceFactory->hasOffer(genericServiceTypePtr, serv);
70​ };
71​ list.erase(std::remove_if(list.begin(), list.end(), removeFunc), list.end());
72​}
73​
74​static void applyFilter(KService::List &list, KApplicationTrader::FilterFunc filterFunc)
75​{
76​ if (list.isEmpty()) {
77​ return;
78​ }
79​
80​ // Find all services matching the constraint
81​ // and remove the other ones
82​ auto removeFunc = [&](const KService::Ptr &serv) {
83​ return !serv->showInCurrentDesktop() || (filterFunc && !filterFunc(serv));
84​ };
85​ list.erase(std::remove_if(list.begin(), list.end(), removeFunc), list.end());
86​}
87​
88​KService::List KApplicationTrader::query(FilterFunc filterFunc)
dhaumannUnsubmitted
Not Done

I would prefer the std::erase(std::remove_if(...), ...end()); idiom here.

Assuming the list is a vector this will be much faster, or do you have to preserve the order? I fear I know the answer :-)

dhaumann: I would prefer the std::erase(std::remove_if(...), ...end()); idiom here. Assuming the list is…
dfaureAuthorUnsubmitted
Not Done

Order is very important here, it's the order of preference.

But doesn't erase(remove_if()) preserve order? I thought it did.

dfaure: Order is very important here, it's the order of preference. But doesn't erase(remove_if())…
broulikUnsubmitted
Not Done

cppreference says it does:

Relative order of the elements that remain is preserved and the physical size of the container is unchanged

broulik: cppreference says it does: > Relative order of the elements that remain is preserved and the…
89​{
90​ // Get all applications
91​ KSycoca::self()->ensureCacheValid();
92​ KServiceType::Ptr servTypePtr = KSycocaPrivate::self()->serviceTypeFactory()->findServiceTypeByName(QStringLiteral("Application"));
93​ Q_ASSERT(servTypePtr);
94​ if (servTypePtr->serviceOffersOffset() == -1) {
95​ return KService::List();
96​ }
97​
98​ KService::List lst = KSycocaPrivate::self()->serviceFactory()->serviceOffers(servTypePtr);
99​
100​ applyFilter(lst, filterFunc);
101​
102​ qCDebug(SERVICES) << "query returning" << lst.count() << "offers";
103​ return lst;
104​}
105​
106​KService::List KApplicationTrader::queryByMimeType(const QString &mimeType,
107​ FilterFunc filterFunc)
108​{
109​ // Get all services of this mime type.
110​ KService::List lst = mimeTypeSycocaServiceOffers(mimeType);
111​ filterMimeTypeOffers(lst);
112​
113​ applyFilter(lst, filterFunc);
114​
115​ qCDebug(SERVICES) << "query for mimeType" << mimeType << "returning" << lst.count() << "offers";
116​ return lst;
117​}
118​
119​KService::Ptr KApplicationTrader::preferredService(const QString &mimeType)
120​{
121​ const KService::List offers = queryByMimeType(mimeType);
122​ if (!offers.isEmpty()) {
123​ return offers.at(0);
124​ }
125​ return KService::Ptr();
126​}
127​
128​bool KApplicationTrader::isSubsequence(const QString &pattern, const QString &text, Qt::CaseSensitivity cs)
129​{
130​ if (pattern.isEmpty()) {
131​ return false;
132​ }
133​ const bool chk_case = cs == Qt::CaseSensitive;
134​
135​ QString::const_iterator i = text.constBegin(), j = pattern.constBegin();
136​ for (; i != text.constEnd() && j != pattern.constEnd(); ++i) {
137​ if ((chk_case && *i == *j) || (!chk_case && i->toLower() == j->toLower())) {
138​ ++j;
139​ }
140​ }
141​ return j == pattern.constEnd();
142​}
143​
144​