2014-05-15 17:48:54 -04:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2014 Florian Geyer <debfx@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/>.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef KEEPASSX_ENTRYSEARCHER_H
|
|
|
|
#define KEEPASSX_ENTRYSEARCHER_H
|
|
|
|
|
2018-03-25 16:24:30 -04:00
|
|
|
#include <QRegularExpression>
|
2014-05-15 17:48:54 -04:00
|
|
|
|
|
|
|
class Group;
|
|
|
|
class Entry;
|
|
|
|
|
|
|
|
class EntrySearcher
|
|
|
|
{
|
|
|
|
public:
|
2019-01-20 09:50:20 -05:00
|
|
|
enum class Field
|
|
|
|
{
|
2018-03-25 16:24:30 -04:00
|
|
|
Undefined,
|
|
|
|
Title,
|
|
|
|
Username,
|
|
|
|
Password,
|
|
|
|
Url,
|
|
|
|
Notes,
|
2019-11-01 16:23:26 -04:00
|
|
|
AttributeKV,
|
2019-02-21 00:51:23 -05:00
|
|
|
Attachment,
|
2020-05-08 11:13:15 -04:00
|
|
|
AttributeValue,
|
2022-01-23 10:00:48 -05:00
|
|
|
Group,
|
|
|
|
Tag,
|
|
|
|
Is
|
2018-03-25 16:24:30 -04:00
|
|
|
};
|
|
|
|
|
|
|
|
struct SearchTerm
|
|
|
|
{
|
|
|
|
Field field;
|
2019-11-01 16:23:26 -04:00
|
|
|
// only used when field == Field::AttributeValue
|
2018-03-25 16:24:30 -04:00
|
|
|
QString word;
|
|
|
|
QRegularExpression regex;
|
|
|
|
bool exclude;
|
|
|
|
};
|
|
|
|
|
2020-01-24 12:42:00 -05:00
|
|
|
explicit EntrySearcher(bool caseSensitive = false, bool skipProtected = false);
|
2019-11-01 16:23:26 -04:00
|
|
|
|
|
|
|
QList<Entry*> search(const QList<SearchTerm>& searchTerms, const Group* baseGroup, bool forceSearch = false);
|
|
|
|
QList<Entry*> search(const QString& searchString, const Group* baseGroup, bool forceSearch = false);
|
|
|
|
QList<Entry*> repeat(const Group* baseGroup, bool forceSearch = false);
|
|
|
|
|
|
|
|
QList<Entry*> searchEntries(const QList<SearchTerm>& searchTerms, const QList<Entry*>& entries);
|
|
|
|
QList<Entry*> searchEntries(const QString& searchString, const QList<Entry*>& entries);
|
|
|
|
QList<Entry*> repeatEntries(const QList<Entry*>& entries);
|
|
|
|
|
|
|
|
void setCaseSensitive(bool state);
|
2020-01-24 12:42:00 -05:00
|
|
|
bool isCaseSensitive() const;
|
2019-11-01 16:23:26 -04:00
|
|
|
|
|
|
|
private:
|
2020-05-08 11:13:15 -04:00
|
|
|
bool searchEntryImpl(const Entry* entry);
|
2019-02-22 17:17:51 -05:00
|
|
|
void parseSearchTerms(const QString& searchString);
|
2018-03-25 16:24:30 -04:00
|
|
|
|
|
|
|
bool m_caseSensitive;
|
2020-01-24 12:42:00 -05:00
|
|
|
bool m_skipProtected;
|
2019-11-01 16:23:26 -04:00
|
|
|
QList<SearchTerm> m_searchTerms;
|
2018-03-25 16:24:30 -04:00
|
|
|
|
|
|
|
friend class TestEntrySearcher;
|
2014-05-15 17:48:54 -04:00
|
|
|
};
|
|
|
|
|
|
|
|
#endif // KEEPASSX_ENTRYSEARCHER_H
|