0
|
1 |
/****************************************************************************
|
|
2 |
**
|
|
3 |
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
|
|
4 |
** All rights reserved.
|
|
5 |
** Contact: Nokia Corporation (qt-info@nokia.com)
|
|
6 |
**
|
|
7 |
** This file is part of the tools applications of the Qt Toolkit.
|
|
8 |
**
|
|
9 |
** $QT_BEGIN_LICENSE:LGPL$
|
|
10 |
** No Commercial Usage
|
|
11 |
** This file contains pre-release code and may not be distributed.
|
|
12 |
** You may use this file in accordance with the terms and conditions
|
|
13 |
** contained in the Technology Preview License Agreement accompanying
|
|
14 |
** this package.
|
|
15 |
**
|
|
16 |
** GNU Lesser General Public License Usage
|
|
17 |
** Alternatively, this file may be used under the terms of the GNU Lesser
|
|
18 |
** General Public License version 2.1 as published by the Free Software
|
|
19 |
** Foundation and appearing in the file LICENSE.LGPL included in the
|
|
20 |
** packaging of this file. Please review the following information to
|
|
21 |
** ensure the GNU Lesser General Public License version 2.1 requirements
|
|
22 |
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
|
|
23 |
**
|
|
24 |
** In addition, as a special exception, Nokia gives you certain additional
|
|
25 |
** rights. These rights are described in the Nokia Qt LGPL Exception
|
|
26 |
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
|
|
27 |
**
|
|
28 |
** If you have questions regarding the use of this file, please contact
|
|
29 |
** Nokia at qt-info@nokia.com.
|
|
30 |
**
|
|
31 |
**
|
|
32 |
**
|
|
33 |
**
|
|
34 |
**
|
|
35 |
**
|
|
36 |
**
|
|
37 |
**
|
|
38 |
** $QT_END_LICENSE$
|
|
39 |
**
|
|
40 |
****************************************************************************/
|
|
41 |
|
|
42 |
#ifndef UTILS_H
|
|
43 |
#define UTILS_H
|
|
44 |
|
|
45 |
#include "ui4.h"
|
|
46 |
#include <QtCore/QString>
|
|
47 |
#include <QtCore/QList>
|
|
48 |
#include <QtCore/QHash>
|
|
49 |
|
|
50 |
QT_BEGIN_NAMESPACE
|
|
51 |
|
|
52 |
inline bool toBool(const QString &str)
|
|
53 |
{ return str.toLower() == QLatin1String("true"); }
|
|
54 |
|
|
55 |
inline QString toString(const DomString *str)
|
|
56 |
{ return str ? str->text() : QString(); }
|
|
57 |
|
|
58 |
inline QString fixString(const QString &str, const QString &indent)
|
|
59 |
{
|
|
60 |
QString cursegment;
|
|
61 |
QStringList result;
|
|
62 |
const QByteArray utf8 = str.toUtf8();
|
|
63 |
const int utf8Length = utf8.length();
|
|
64 |
|
|
65 |
for (int i = 0; i < utf8Length; ++i) {
|
|
66 |
const uchar cbyte = utf8.at(i);
|
|
67 |
if (cbyte >= 0x80) {
|
|
68 |
cursegment += QLatin1Char('\\');
|
|
69 |
cursegment += QString::number(cbyte, 8);
|
|
70 |
} else {
|
|
71 |
switch(cbyte) {
|
|
72 |
case '\\':
|
|
73 |
cursegment += QLatin1String("\\\\"); break;
|
|
74 |
case '\"':
|
|
75 |
cursegment += QLatin1String("\\\""); break;
|
|
76 |
case '\r':
|
|
77 |
break;
|
|
78 |
case '\n':
|
|
79 |
cursegment += QLatin1String("\\n\"\n\""); break;
|
|
80 |
default:
|
|
81 |
cursegment += QLatin1Char(cbyte);
|
|
82 |
}
|
|
83 |
}
|
|
84 |
|
|
85 |
if (cursegment.length() > 1024) {
|
|
86 |
result << cursegment;
|
|
87 |
cursegment.clear();
|
|
88 |
}
|
|
89 |
}
|
|
90 |
|
|
91 |
if (!cursegment.isEmpty())
|
|
92 |
result << cursegment;
|
|
93 |
|
|
94 |
|
|
95 |
QString joinstr = QLatin1String("\"\n");
|
|
96 |
joinstr += indent;
|
|
97 |
joinstr += indent;
|
|
98 |
joinstr += QLatin1Char('"');
|
|
99 |
|
|
100 |
QString rc(QLatin1Char('"'));
|
|
101 |
rc += result.join(joinstr);
|
|
102 |
rc += QLatin1Char('"');
|
|
103 |
return rc;
|
|
104 |
}
|
|
105 |
|
|
106 |
inline QHash<QString, DomProperty *> propertyMap(const QList<DomProperty *> &properties)
|
|
107 |
{
|
|
108 |
QHash<QString, DomProperty *> map;
|
|
109 |
|
|
110 |
for (int i=0; i<properties.size(); ++i) {
|
|
111 |
DomProperty *p = properties.at(i);
|
|
112 |
map.insert(p->attributeName(), p);
|
|
113 |
}
|
|
114 |
|
|
115 |
return map;
|
|
116 |
}
|
|
117 |
|
|
118 |
inline QStringList unique(const QStringList &lst)
|
|
119 |
{
|
|
120 |
QHash<QString, bool> h;
|
|
121 |
for (int i=0; i<lst.size(); ++i)
|
|
122 |
h.insert(lst.at(i), true);
|
|
123 |
return h.keys();
|
|
124 |
}
|
|
125 |
|
|
126 |
QT_END_NAMESPACE
|
|
127 |
|
|
128 |
#endif // UTILS_H
|