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
|
/**********************************************************************
** Copyright (C) 2000-2002 Trolltech AS. All rights reserved.
**
** This file is part of the Qtopia Environment.
**
** This file may be distributed and/or modified under the terms of the
** GNU General Public License version 2 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file.
**
** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
**
** See http://www.trolltech.com/gpl/ for GPL licensing information.
**
** Contact info@trolltech.com if any conditions of this licensing are
** not clear to you.
**
**********************************************************************/
#include "quuid.h"
/*!
\class QUuid quuid.h
\brief The QUuid class defines a Universally Unique Identifier (UUID).
This class is temporarily copied from Qt 3.0.
*/
/*!
\fn QUuid::QUuid()
Creates the null UUID {00000000-0000-0000-0000-000000000000}.
*/
/*!
\fn QUuid::QUuid( uint l, ushort w1, ushort w2, uchar b1, uchar b2, uchar b3, uchar b4, uchar b5, uchar b6, uchar b7, uchar b8 )
Creates an UUID with the value specified by the parameters, \a l, \a
w1, \a w2, \a b1, \a b2, \a b3, \a b4, \a b5, \a b6, \a b7, \a b8.
Example:
\code
// {67C8770B-44F1-410A-AB9A-F9B5446F13EE}
QUuid IID_MyInterface( 0x67c8770b, 0x44f1, 0x410a, 0xab, 0x9a, 0xf9, 0xb5, 0x44, 0x6f, 0x13, 0xee )
\endcode
*/
/*!
\fn QUuid::QUuid( const QUuid &orig )
Creates a copy of the QUuid \a orig.
*/
#ifndef QT_NO_QUUID_STRING
/*!
Creates a QUuid object from the string \a text. Right now, the function
can only convert the format {12345678-1234-1234-1234-123456789ABC} and
will create the null UUID when the conversion fails.
*/
QUuid::QUuid( const QString &text )
{
bool ok;
QString temp = text.upper();
data1 = temp.mid( 1, 8 ).toULong( &ok, 16 );
if ( !ok )
{
*this = QUuid();
return;
}
data2 = temp.mid( 10, 4 ).toUInt( &ok, 16 );
if ( !ok )
{
*this = QUuid();
return;
}
data3 = temp.mid( 15, 4 ).toUInt( &ok, 16 );
if ( !ok )
{
*this = QUuid();
return;
}
data4[0] = temp.mid( 20, 2 ).toUInt( &ok, 16 );
if ( !ok )
{
*this = QUuid();
return;
}
data4[1] = temp.mid( 22, 2 ).toUInt( &ok, 16 );
if ( !ok )
{
*this = QUuid();
return;
}
for ( int i = 2; i<8; i++ )
{
data4[i] = temp.mid( 25 + (i-2)*2, 2 ).toUShort( &ok, 16 );
if ( !ok )
{
*this = QUuid();
return;
}
}
}
/*!
\fn QUuid QUuid::operator=(const QUuid &uuid )
Assigns the value of \a uuid to this QUuid object.
*/
/*!
\fn bool QUuid::operator==(const QUuid &other) const
Returns TRUE if this QUuid and the \a other QUuid are identical, otherwise returns FALSE.
*/
/*!
\fn bool QUuid::operator!=(const QUuid &other) const
Returns TRUE if this QUuid and the \a other QUuid are different, otherwise returns FALSE.
*/
/*!
QString QUuid::toString() const
Returns a string in {12345678-1234-1234-1234-123456789ABC} format.
*/
QString QUuid::toString() const
{
QString result;
result = "{" + QString::number( data1, 16 ).rightJustify( 8, '0' ) + "-";
result += QString::number( (int)data2, 16 ).rightJustify( 4, '0' ) + "-";
result += QString::number( (int)data3, 16 ).rightJustify( 4, '0' ) + "-";
result += QString::number( (int)data4[0], 16 ).rightJustify( 2, '0' );
result += QString::number( (int)data4[1], 16 ).rightJustify( 2, '0' ) + "-";
for ( int i = 2; i < 8; i++ )
result += QString::number( (int)data4[i], 16 ).rightJustify( 2, '0' );
return result + "}";
}
#endif
/*!
Returns TRUE if this is the null UUID {00000000-0000-0000-0000-000000000000}, otherwise returns FALSE.
*/
bool QUuid::isNull() const
{
return data4[0] == 0 && data4[1] == 0 && data4[2] == 0 && data4[3] == 0 &&
data4[4] == 0 && data4[5] == 0 && data4[6] == 0 && data4[7] == 0 &&
data1 == 0 && data2 == 0 && data3 == 0;
}
/*!
\fn QUuid::Variant QUuid::variant() const
Returns the variant of the UUID.
The null UUID is considered to be of an unknown variant.
\sa version()
*/
QUuid::Variant QUuid::variant() const
{
if ( isNull() )
return VarUnknown;
// Check the 3 MSB of data4[0]
if ( (data4[0] & 0x80) == 0x00 ) return NCS;
else if ( (data4[0] & 0xC0) == 0x80 ) return DCE;
else if ( (data4[0] & 0xE0) == 0xC0 ) return Microsoft;
else if ( (data4[0] & 0xE0) == 0xE0 ) return Reserved;
return VarUnknown;
}
/*!
\fn bool QUuid::operator<(const QUuid &other) const
Returns TRUE if this QUuid is of the same variant,
and lexicographically before the \a other QUuid;
otherwise returns FALSE.
\sa variant()
*/
#define ISLESS(f1, f2) if (f1!=f2) return (f1<f2);
bool QUuid::operator<(const QUuid &other ) const
{
if ( variant() != other.variant() )
return FALSE;
ISLESS( data1, other.data1 );
ISLESS( data2, other.data2 );
ISLESS( data3, other.data3 );
for ( int n = 0; n < 8; n++ )
{
ISLESS( data4[n], other.data4[n] );
}
return FALSE;
}
/*!
\fn bool QUuid::operator>(const QUuid &other) const
Returns TRUE if this QUuid is of the same variant,
and lexicographically after the \a other QUuid;
otherwise returns FALSE.
\sa variant()
*/
#define ISMORE(f1, f2) if (f1!=f2) return (f1>f2);
bool QUuid::operator>(const QUuid &other ) const
{
if ( variant() != other.variant() )
return FALSE;
ISMORE( data1, other.data1 );
ISMORE( data2, other.data2 );
ISMORE( data3, other.data3 );
for ( int n = 0; n < 8; n++ )
{
ISMORE( data4[n], other.data4[n] );
}
return FALSE;
}
|
