2014-05-15 17:48:54 -04:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2014 Florian Geyer <blueice@fobos.de>
|
2017-06-09 17:40:36 -04:00
|
|
|
* Copyright (C) 2017 KeePassXC Team <team@keepassxc.org>
|
2014-05-15 17:48:54 -04:00
|
|
|
*
|
|
|
|
* 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)
|
|
|
|
* version 3 of the License.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "EntrySearcher.h"
|
|
|
|
|
|
|
|
#include "core/Group.h"
|
|
|
|
|
2018-03-31 16:01:30 -04:00
|
|
|
QList<Entry*> EntrySearcher::search(const QString& searchTerm, const Group* group, Qt::CaseSensitivity caseSensitivity)
|
2014-05-15 17:48:54 -04:00
|
|
|
{
|
2018-03-19 23:16:22 -04:00
|
|
|
QList<Entry*> results;
|
2014-05-15 17:48:54 -04:00
|
|
|
|
2018-03-19 23:16:22 -04:00
|
|
|
if (group->resolveSearchingEnabled()) {
|
|
|
|
results.append(searchEntries(searchTerm, group->entries(), caseSensitivity));
|
2014-05-15 17:48:54 -04:00
|
|
|
}
|
2016-09-02 13:51:51 -04:00
|
|
|
|
2018-03-19 23:16:22 -04:00
|
|
|
for (Group* childGroup : group->children()) {
|
|
|
|
if (childGroup->resolveSearchingEnabled()) {
|
|
|
|
results.append(searchEntries(searchTerm, childGroup->entries(), caseSensitivity));
|
2014-05-15 17:48:54 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-03-19 23:16:22 -04:00
|
|
|
return results;
|
2014-05-15 17:48:54 -04:00
|
|
|
}
|
2014-05-15 18:19:58 -04:00
|
|
|
|
2018-03-19 23:16:22 -04:00
|
|
|
QList<Entry*> EntrySearcher::searchEntries(const QString& searchTerm, const QList<Entry*>& entries,
|
|
|
|
Qt::CaseSensitivity caseSensitivity)
|
2014-05-15 18:19:58 -04:00
|
|
|
{
|
2018-03-19 23:16:22 -04:00
|
|
|
QList<Entry*> results;
|
|
|
|
for (Entry* entry : entries) {
|
|
|
|
if (matchEntry(searchTerm, entry, caseSensitivity)) {
|
|
|
|
results.append(entry);
|
|
|
|
}
|
2014-05-15 18:19:58 -04:00
|
|
|
}
|
2018-03-19 23:16:22 -04:00
|
|
|
return results;
|
2014-05-15 18:19:58 -04:00
|
|
|
}
|
2017-01-28 11:27:20 -05:00
|
|
|
|
2018-03-19 23:16:22 -04:00
|
|
|
bool EntrySearcher::matchEntry(const QString& searchTerm, Entry* entry,
|
|
|
|
Qt::CaseSensitivity caseSensitivity)
|
2017-01-28 11:27:20 -05:00
|
|
|
{
|
|
|
|
const QStringList wordList = searchTerm.split(QRegExp("\\s"), QString::SkipEmptyParts);
|
|
|
|
for (const QString& word : wordList) {
|
2018-03-19 23:16:22 -04:00
|
|
|
if (!wordMatch(word, entry, caseSensitivity)) {
|
2017-01-28 11:27:20 -05:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2018-03-19 23:16:22 -04:00
|
|
|
bool EntrySearcher::wordMatch(const QString& word, Entry* entry, Qt::CaseSensitivity caseSensitivity)
|
2017-01-28 11:27:20 -05:00
|
|
|
{
|
2018-03-19 23:16:22 -04:00
|
|
|
return entry->resolvePlaceholder(entry->title()).contains(word, caseSensitivity)
|
|
|
|
|| entry->resolvePlaceholder(entry->username()).contains(word, caseSensitivity)
|
|
|
|
|| entry->resolvePlaceholder(entry->url()).contains(word, caseSensitivity)
|
|
|
|
|| entry->resolvePlaceholder(entry->notes()).contains(word, caseSensitivity);
|
2017-01-28 11:27:20 -05:00
|
|
|
}
|