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
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
|
/*
* Copyright (C) 2014 Christian Mollekopf <chrigi_1@fastmail.fm>
* Copyright (C) 2018 Rémi Nicole <minijackson@riseup.net>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) version 3, or any
* later version accepted by the membership of KDE e.V. (or its
* successor approved by the membership of KDE e.V.), which shall
* act as a proxy defined in Section 6 of version 3 of the license.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library. If not, see <http://www.gnu.org/licenses/>.
*/
#include "key.h"
#include "utils.h"
using Sink::Storage::Identifier;
using Sink::Storage::Key;
using Sink::Storage::Revision;
uint Sink::Storage::qHash(const Sink::Storage::Identifier &identifier)
{
return qHash(identifier.toInternalByteArray());
}
QDebug &operator<<(QDebug &dbg, const Identifier &id)
{
dbg << id.toDisplayString();
return dbg;
}
QDebug &operator<<(QDebug &dbg, const Revision &rev)
{
dbg << rev.toDisplayString();
return dbg;
}
QDebug &operator<<(QDebug &dbg, const Key &key)
{
dbg << key.toDisplayString();
return dbg;
}
// Identifier
Identifier Identifier::createIdentifier()
{
return Identifier(QUuid::createUuid());
}
QByteArray Identifier::toInternalByteArray() const
{
Q_ASSERT(!uid.isNull());
return uid.toRfc4122();
}
Identifier Identifier::fromInternalByteArray(const QByteArray &bytes)
{
Q_ASSERT(bytes.size() == INTERNAL_REPR_SIZE);
return Identifier(QUuid::fromRfc4122(bytes));
}
QString Identifier::toDisplayString() const
{
return uid.toString();
}
QByteArray Identifier::toDisplayByteArray() const
{
return uid.toByteArray();
}
Identifier Identifier::fromDisplayByteArray(const QByteArray &bytes)
{
Q_ASSERT(bytes.size() == DISPLAY_REPR_SIZE);
return Identifier(QUuid(bytes));
}
bool Identifier::isNull() const
{
return uid.isNull();
}
bool Identifier::isValidInternal(const QByteArray &bytes)
{
return !QUuid::fromRfc4122(bytes).isNull();
}
bool Identifier::isValidDisplay(const QByteArray &bytes)
{
return !QUuid(bytes).isNull();
}
bool Identifier::isValid(const QByteArray &bytes)
{
switch (bytes.size()) {
case Identifier::INTERNAL_REPR_SIZE:
return isValidInternal(bytes);
case Identifier::DISPLAY_REPR_SIZE:
return isValidDisplay(bytes);
}
return false;
}
bool Identifier::operator==(const Identifier &other) const
{
return uid == other.uid;
}
bool Identifier::operator!=(const Identifier &other) const
{
return !(*this == other);
}
// Revision
QByteArray Revision::toInternalByteArray() const
{
return padNumber(rev);
}
Revision Revision::fromInternalByteArray(const QByteArray &bytes)
{
Q_ASSERT(bytes.size() == INTERNAL_REPR_SIZE);
return Revision(bytes.toLongLong());
}
QString Revision::toDisplayString() const
{
return QString::fromUtf8(toInternalByteArray());
}
QByteArray Revision::toDisplayByteArray() const
{
return toInternalByteArray();
}
Revision Revision::fromDisplayByteArray(const QByteArray &bytes)
{
Q_ASSERT(bytes.size() == DISPLAY_REPR_SIZE);
return fromInternalByteArray(bytes);
}
qint64 Revision::toQint64() const
{
return rev;
}
bool Revision::isValidInternal(const QByteArray &bytes)
{
if (bytes.size() != Revision::INTERNAL_REPR_SIZE) {
return false;
}
bool ok;
bytes.toLongLong(&ok);
return ok;
}
bool Revision::isValidDisplay(const QByteArray &bytes)
{
return isValidInternal(bytes);
}
bool Revision::isValid(const QByteArray &bytes)
{
return isValidInternal(bytes);
}
bool Revision::operator==(const Revision &other) const
{
return rev == other.rev;
}
bool Revision::operator!=(const Revision &other) const
{
return !(*this == other);
}
// Key
QByteArray Key::toInternalByteArray() const
{
return id.toInternalByteArray() + rev.toInternalByteArray();
}
Key Key::fromInternalByteArray(const QByteArray &bytes)
{
Q_ASSERT(bytes.size() == INTERNAL_REPR_SIZE);
auto idBytes = bytes.mid(0, Identifier::INTERNAL_REPR_SIZE);
auto revBytes = bytes.mid(Identifier::INTERNAL_REPR_SIZE);
return Key(Identifier::fromInternalByteArray(idBytes), Revision::fromInternalByteArray(revBytes));
}
QString Key::toDisplayString() const
{
return id.toDisplayString() + rev.toDisplayString();
}
QByteArray Key::toDisplayByteArray() const
{
return id.toDisplayByteArray() + rev.toDisplayByteArray();
}
Key Key::fromDisplayByteArray(const QByteArray &bytes)
{
Q_ASSERT(bytes.size() == DISPLAY_REPR_SIZE);
auto idBytes = bytes.mid(0, Identifier::DISPLAY_REPR_SIZE);
auto revBytes = bytes.mid(Identifier::DISPLAY_REPR_SIZE);
return Key(Identifier::fromDisplayByteArray(idBytes), Revision::fromDisplayByteArray(revBytes));
}
const Identifier &Key::identifier() const
{
return id;
}
const Revision &Key::revision() const
{
return rev;
}
void Key::setRevision(const Revision &newRev)
{
rev = newRev;
}
bool Key::isNull() const
{
return id.isNull();
}
bool Key::isValidInternal(const QByteArray &bytes)
{
if (bytes.size() != Key::INTERNAL_REPR_SIZE) {
return false;
}
auto idBytes = bytes.mid(0, Identifier::INTERNAL_REPR_SIZE);
auto revBytes = bytes.mid(Identifier::INTERNAL_REPR_SIZE);
return Identifier::isValidInternal(idBytes) && Revision::isValidInternal(revBytes);
}
bool Key::isValidDisplay(const QByteArray &bytes)
{
if (bytes.size() != Key::DISPLAY_REPR_SIZE) {
return false;
}
auto idBytes = bytes.mid(0, Identifier::DISPLAY_REPR_SIZE);
auto revBytes = bytes.mid(Identifier::DISPLAY_REPR_SIZE);
return Key::isValidDisplay(idBytes) && Revision::isValidDisplay(revBytes);
}
bool Key::isValid(const QByteArray &bytes)
{
switch (bytes.size()) {
case Key::INTERNAL_REPR_SIZE:
return isValidInternal(bytes);
case Key::DISPLAY_REPR_SIZE:
return isValidDisplay(bytes);
}
return false;
}
bool Key::operator==(const Key &other) const
{
return (id == other.id) && (rev == other.rev);
}
bool Key::operator!=(const Key &other) const
{
return !(*this == other);
}
|
