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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
|
#include "bistrhash.h"
#include <QStringList>
BiStrHash::BiStrHash(std::initializer_list<std::pair<QString, QString> > list)
{
hash = QHash<QString,QString>(list);
initInvertedAndLower();
}
BiStrHash::BiStrHash(const QHash<QString, QString>& other)
{
unite(other);
}
BiStrHash::BiStrHash(const BiStrHash& other) : hash(other.hash), inverted(other.inverted),
lowerHash(other.lowerHash), lowerInverted(other.lowerInverted)
{
}
BiStrHash& BiStrHash::operator=(const BiStrHash& other)
{
this->hash = other.hash;
this->inverted = other.inverted;
this->lowerHash = other.lowerHash;
this->lowerInverted = other.lowerInverted;
return *this;
}
void BiStrHash::insert(const QString& left, const QString& right)
{
if (lowerHash.contains(left.toLower()))
removeLeft(left, Qt::CaseInsensitive);
if (lowerInverted.contains(right.toLower()))
removeRight(right, Qt::CaseInsensitive);
inverted.insert(right, left);
hash.insert(left, right);
lowerHash.insert(left.toLower(), left);
lowerInverted.insert(right.toLower(), right);
}
bool BiStrHash::containsLeft(const QString& left, Qt::CaseSensitivity cs) const
{
if (cs == Qt::CaseSensitive)
return hash.contains(left);
else
return lowerHash.contains(left.toLower());
}
bool BiStrHash::containsRight(const QString& right, Qt::CaseSensitivity cs) const
{
if (cs == Qt::CaseSensitive)
return inverted.contains(right);
else
return lowerInverted.contains(right.toLower());
}
int BiStrHash::removeLeft(const QString& left, Qt::CaseSensitivity cs)
{
if (cs == Qt::CaseSensitive)
{
if (!hash.contains(left))
return 0;
inverted.remove(hash.value(left));
hash.remove(left);
return 1;
}
else
{
QString lowerLeft = left.toLower();
if (!lowerHash.contains(lowerLeft))
return 0;
QString right = hash.value(lowerHash.value(lowerLeft));
hash.remove(inverted.value(right));
inverted.remove(right);
lowerHash.remove(lowerLeft);
lowerInverted.remove(right.toLower());
return 1;
}
}
int BiStrHash::removeRight(const QString& right, Qt::CaseSensitivity cs)
{
if (cs == Qt::CaseSensitive)
{
if (!inverted.contains(right))
return 0;
hash.remove(inverted.value(right));
inverted.remove(right);
return 1;
}
else
{
QString lowerRight = right.toLower();
if (!lowerInverted.contains(lowerRight))
return 0;
QString left = inverted.value(lowerInverted.value(lowerRight));
inverted.remove(hash.value(left));
hash.remove(left);
lowerHash.remove(left.toLower());
lowerInverted.remove(lowerRight);
return 1;
}
}
QString BiStrHash::takeLeft(const QString& left, Qt::CaseSensitivity cs)
{
if (cs == Qt::CaseSensitive)
{
QString right = hash.take(left);
inverted.remove(right);
return right;
}
else
{
QString right = hash.take(lowerHash.take(left.toLower()));
inverted.remove(lowerInverted.take(right.toLower()));
return right;
}
}
QString BiStrHash::takeRight(const QString& right, Qt::CaseSensitivity cs)
{
if (cs == Qt::CaseSensitive)
{
QString left = inverted.take(right);
hash.remove(left);
return left;
}
else
{
QString left = inverted.take(lowerInverted.take(right.toLower()));
hash.remove(lowerHash.take(left.toLower()));
return left;
}
}
BiStrHash& BiStrHash::unite(const BiStrHash& other)
{
unite(other.hash);
return *this;
}
BiStrHash& BiStrHash::unite(const QHash<QString, QString>& other)
{
QHashIterator<QString, QString> it(other);
while (it.hasNext())
{
it.next();
insert(it.key(), it.value());
}
return *this;
}
QString BiStrHash::valueByLeft(const QString& left, Qt::CaseSensitivity cs) const
{
if (cs == Qt::CaseSensitive)
return hash.value(left);
else
return hash.value(lowerHash.value(left.toLower()));
}
QString BiStrHash::valueByLeft(const QString& left, const QString& defaultValue, Qt::CaseSensitivity cs) const
{
if (containsLeft(left, cs))
return valueByLeft(left, cs);
return defaultValue;
}
QString BiStrHash::valueByRight(const QString& right, Qt::CaseSensitivity cs) const
{
if (cs == Qt::CaseSensitive)
return inverted.value(right);
else
return inverted.value(lowerInverted.value(right.toLower()));
}
QString BiStrHash::valueByRight(const QString& right, const QString& defaultValue, Qt::CaseSensitivity cs) const
{
if (containsRight(right, cs))
return valueByRight(right, cs);
return defaultValue;
}
QStringList BiStrHash::leftValues() const
{
return hash.keys();
}
QStringList BiStrHash::rightValues() const
{
return inverted.keys();
}
QHashIterator<QString, QString> BiStrHash::iterator() const
{
return QHashIterator<QString,QString>(hash);
}
void BiStrHash::clear()
{
hash.clear();
inverted.clear();
lowerHash.clear();
lowerInverted.clear();
}
int BiStrHash::count() const
{
return hash.count();
}
bool BiStrHash::isEmpty() const
{
return hash.isEmpty();
}
void BiStrHash::initInvertedAndLower()
{
QHashIterator<QString,QString> it(hash);
while (it.hasNext())
{
it.next();
inverted[it.value()] = it.key();
lowerHash[it.key().toLower()] = it.key();
lowerInverted[it.value().toLower()] = it.value();
}
}
|
