blob: 715acf4ae6f116746c8363673213515ff13d94d8 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
|
// Copyright (C) 2018 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR LGPL-3.0-only OR GPL-2.0-only OR GPL-3.0-only
#ifndef QQMLPREVIEWBLACKLIST_H
#define QQMLPREVIEWBLACKLIST_H
//
// W A R N I N G
// -------------
//
// This file is not part of the Qt API. It exists purely as an
// implementation detail. This header file may change from version to
// version without notice, or even be removed.
//
// We mean it.
//
#include <QtCore/qhash.h>
#include <QtCore/qchar.h>
#include <QtCore/qstring.h>
#include <algorithm>
QT_BEGIN_NAMESPACE
class QQmlPreviewBlacklist
{
public:
void blacklist(const QString &path);
void whitelist(const QString &path);
bool isBlacklisted(const QString &path) const;
void clear();
private:
class Node {
public:
Node();
Node(const Node &other);
Node(Node &&other) noexcept;
~Node();
Node &operator=(const Node &other);
Node &operator=(Node &&other) noexcept;
void split(QString::iterator it, QString::iterator end);
void insert(const QString &path, int offset);
void remove(const QString &path, int offset);
int containedPrefixLeaf(const QString &path, int offset) const;
private:
Node(const QString &mine, const QHash<QChar, Node *> &next = QHash<QChar, Node *>(),
bool isLeaf = true);
QString m_mine;
QHash<QChar, Node *> m_next;
bool m_isLeaf = false;
};
Node m_root;
};
QT_END_NAMESPACE
#endif // QQMLPREVIEWBLACKLIST_H
|
