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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
|
/****************************************************************************
**
** Copyright (C) 2016 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of Qt Creator.
**
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and The Qt Company. For licensing terms
** and conditions see https://www.qt.io/terms-conditions. For further
** information use the contact form at https://www.qt.io/contact-us.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3 as published by the Free Software
** Foundation with exceptions as appearing in the file LICENSE.GPL3-EXCEPT
** included in the packaging of this file. Please review the following
** information to ensure the GNU General Public License requirements will
** be met: https://www.gnu.org/licenses/gpl-3.0.html.
**
****************************************************************************/
#pragma once
#include <qmljs/qmljs_global.h>
#include <QHash>
#include <QList>
#include <QSharedPointer>
#include <utility>
QT_FORWARD_DECLARE_CLASS(QString)
QT_FORWARD_DECLARE_CLASS(QDebug)
namespace QmlJS {
namespace PersistentTrie {
enum LookupFlags {
CaseInsensitive = 0x1,
Partial = 0x2,
SkipChars = 0x4,
SkipSpaces = 0x8
};
class QMLJS_EXPORT TrieNode
{
public:
typedef const TrieNode CTrie;
typedef QSharedPointer<CTrie> Ptr;
QString prefix;
QList<Ptr> postfixes;
TrieNode(const QString &pre = QString(), QList<Ptr> post = QList<Ptr>());
TrieNode(const TrieNode &o);
static Ptr create(const QString &pre = QString(), QList<Ptr> post = QList<Ptr>());
static void complete(QStringList &results, const Ptr &trie, const QString &root,
const QString &base = QString(), LookupFlags flags = LookupFlags(CaseInsensitive|Partial));
static bool contains(const Ptr &trie, const QString &value, LookupFlags flags = LookupFlags(0));
static QStringList stringList(const Ptr &trie);
static bool isSame(const Ptr &trie1, const Ptr &trie2);
static Ptr replaceF(const Ptr &trie, const QHash<QString, QString> &replacements);
static Ptr insertF(const Ptr &trie, const QString &value);
static std::pair<Ptr,int> intersectF(const Ptr &v1, const Ptr &v2, int index1=0);
static std::pair<Ptr,int> mergeF(const Ptr &v1, const Ptr &v2);
static QDebug &printStrings(QDebug &dbg, const Ptr &trie);
static QDebug &describe(QDebug &dbg, const Ptr &trie, int indent);
};
class QMLJS_EXPORT Trie
{
public:
Trie();
Trie(const TrieNode::Ptr &t);
QStringList complete(const QString &root, const QString &base = QString(),
LookupFlags flags = LookupFlags(CaseInsensitive|Partial)) const;
bool contains(const QString &value, LookupFlags flags = LookupFlags(0)) const;
QStringList stringList() const;
Trie insertF(const QString &value) const;
Trie intersectF(const Trie &v) const;
Trie mergeF(const Trie &v) const;
Trie replaceF(const QHash<QString, QString> &replacements) const;
void insert(const QString &value);
void intersect(const Trie &v);
void merge(const Trie &v);
void replace(const QHash<QString, QString> &replacements);
bool isEmpty() const;
bool operator==(const Trie &o);
bool operator!=(const Trie &o);
friend QMLJS_EXPORT QDebug operator<<(QDebug dbg, const TrieNode::Ptr &trie);
friend QMLJS_EXPORT QDebug operator<<(QDebug dbg, const Trie &trie);
TrieNode::Ptr trie;
};
template <typename T> void enumerateTrieNode(const TrieNode::Ptr &trie, T &t,
QString base = QString())
{
if (trie.isNull())
return;
base.append(trie->prefix);
foreach (const TrieNode::Ptr subT, trie->postfixes) {
enumerateTrieNode(subT,t,base);
}
if (trie->postfixes.isEmpty())
t(base);
}
QMLJS_EXPORT int matchStrength(const QString &searchStr, const QString &str);
QMLJS_EXPORT QStringList matchStrengthSort(const QString &searchString, QStringList &res);
QMLJS_EXPORT QDebug operator<<(QDebug dbg, const TrieNode::Ptr &trie);
QMLJS_EXPORT QDebug operator<<(QDebug dbg, const Trie &trie);
} // end namespace PersistentTrie
} // end namespace QmlJS
|
