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
|
/****************************************************************************
**
** Copyright (C) 2012 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the Qt Mobility Components.
**
** $QT_BEGIN_LICENSE:LGPL$
** GNU Lesser General Public License Usage
** This file may be used under the terms of the GNU Lesser General Public
** License version 2.1 as published by the Free Software Foundation and
** appearing in the file LICENSE.LGPL included in the packaging of this
** file. Please review the following information to ensure the GNU Lesser
** General Public License version 2.1 requirements will be met:
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU General
** Public License version 3.0 as published by the Free Software Foundation
** and appearing in the file LICENSE.GPL included in the packaging of this
** file. Please review the following information to ensure the GNU General
** Public License version 3.0 requirements will be met:
** http://www.gnu.org/copyleft/gpl.html.
**
** Other Usage
** Alternatively, this file may be used in accordance with the terms and
** conditions contained in a signed written agreement between you and Nokia.
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef QLATIN1CONSTANT_H
#define QLATIN1CONSTANT_H
#include <QString>
#include <QVariant>
QTM_BEGIN_NAMESPACE
/*
* QLatin1Constant
*
* The idea of the QLatin1Constant is to provide a POD-esque container
* for constant strings which are defined in various places
* (e.g., detail leaf class definition names, field keys, constant field values, etc).
* We would ideally like these to be stored in the .rodata section to allow
* sharing / minimise footprint.
*
* Given that the declare/define macros are const anyway, we changed the
* member to a char array from a const char array, in order to squash
* the compiler warning regarding uninitialised const value without
* initialiser list in default ctor (POD requires default ctor).
*/
//QTM_SYNC_HEADER_EXPORT QLatin1Constant
template <int N> struct QLatin1Constant
{
char chars[N];
bool operator ==(const QLatin1Constant& other) const {return (chars == other.chars) || (qstrcmp(chars, other.chars) == 0);}
bool operator !=(const QLatin1Constant& other) const {return !operator==(other);}
inline const char * latin1() const {return chars;}
operator QLatin1String() const {return QLatin1String(chars);}
operator QString() const {return QString::fromLatin1(chars, N-1);}
operator QVariant() const {return QVariant(operator QString());}
};
/* Hash - this comes from qhash.cpp >.> */
template<int N> uint qHash(const QLatin1Constant<N>& a)
{
uint h = 0;
uint g;
int n = N - 1;
const register uchar*p = (const uchar*)a.chars;
while (n--) {
h = (h << 4) + *p++;
if ((g = (h & 0xf0000000)) != 0)
h ^= g >> 23;
h &= ~g;
}
return h;
}
/* Operators for QLatin1Constant */
template<int N, int M> bool operator==(const QLatin1Constant<N>&, const QLatin1Constant<M>&)
{
// For N != M, this is always false
// For N == M, the member function gets called
return false;
}
template<int N, int M> bool operator!=(const QLatin1Constant<N>&, const QLatin1Constant<M>&)
{
// If N != M, this is always true
// For N == M, the member function again gets called
return true;
}
template<int N, int M> bool operator <(const QLatin1Constant<N>& a, const QLatin1Constant<M>& b)
{
return qstrcmp(a.chars, b.chars) < 0;
}
/* Operators for QLatin1String */
template<int N> bool operator==(const QLatin1Constant<N>& a, const QLatin1String& b)
{
return (a.chars == b.latin1()) || (qstrcmp(a.chars, b.latin1()) == 0);
}
template<int N> bool operator==(const QLatin1String& b, const QLatin1Constant<N>& a)
{
return (a.chars == b.latin1()) || (qstrcmp(a.chars, b.latin1()) == 0);
}
template<int N> bool operator!=(const QLatin1Constant<N>& a, const QLatin1String& b)
{
return (a.chars != b.latin1()) && (qstrcmp(a.chars, b.latin1()) != 0);
}
template<int N> bool operator!=(const QLatin1String& b, const QLatin1Constant<N>& a)
{
return (a.chars != b.latin1()) && (qstrcmp(a.chars, b.latin1()) != 0);
}
/* Operators for QString */
template<int N> bool operator==(const QLatin1Constant<N>& a, const QString& b)
{
return b == QLatin1String(a.chars);
}
template<int N> bool operator==(const QString& b, const QLatin1Constant<N>& a)
{
return b == QLatin1String(a.chars);
}
template<int N> bool operator!=(const QLatin1Constant<N>& a, const QString& b)
{
return b != QLatin1String(a.chars);
}
template<int N> bool operator!=(const QString& b, const QLatin1Constant<N>& a)
{
return b != QLatin1String(a.chars);
}
#define Q_DECLARE_LATIN1_CONSTANT(varname, str) static const QLatin1Constant<sizeof(str)> varname
#define Q_DEFINE_LATIN1_CONSTANT(varname, str) const QLatin1Constant<sizeof(str)> varname = {str}
QTM_END_NAMESPACE
#endif
|
