source: trunk/src/xmlpatterns/utils/qnamepool_p.h@ 594

Last change on this file since 594 was 561, checked in by Dmitry A. Kuminov, 15 years ago

trunk: Merged in qt 4.6.1 sources.

File size: 16.5 KB
Line 
1/****************************************************************************
2**
3** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
4** All rights reserved.
5** Contact: Nokia Corporation ([email protected])
6**
7** This file is part of the QtXmlPatterns module of the Qt Toolkit.
8**
9** $QT_BEGIN_LICENSE:LGPL$
10** Commercial Usage
11** Licensees holding valid Qt Commercial licenses may use this file in
12** accordance with the Qt Commercial License Agreement provided with the
13** Software or, alternatively, in accordance with the terms contained in
14** a written agreement between you and Nokia.
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** GNU General Public License Usage
29** Alternatively, this file may be used under the terms of the GNU
30** General Public License version 3.0 as published by the Free Software
31** Foundation and appearing in the file LICENSE.GPL included in the
32** packaging of this file. Please review the following information to
33** ensure the GNU General Public License version 3.0 requirements will be
34** met: http://www.gnu.org/copyleft/gpl.html.
35**
36** If you have questions regarding the use of this file, please contact
37** Nokia at [email protected].
38** $QT_END_LICENSE$
39**
40****************************************************************************/
41
42//
43// W A R N I N G
44// -------------
45//
46// This file is not part of the Qt API. It exists purely as an
47// implementation detail. This header file may change from version to
48// version without notice, or even be removed.
49//
50// We mean it.
51
52#ifndef Patternist_NamePool_H
53#define Patternist_NamePool_H
54
55#include <QHash>
56#include <QReadLocker>
57#include <QReadWriteLock>
58#include <QSharedData>
59#include <QString>
60#include <QVector>
61#include <QXmlName>
62
63#include <QtXmlPatterns/private/qprimitives_p.h>
64
65QT_BEGIN_HEADER
66
67QT_BEGIN_NAMESPACE
68
69namespace QPatternist
70{
71 /**
72 * @short Store names such as namespace bindings and QNames and allows them to
73 * be referenced in efficient ways.
74 *
75 * Once a string have been inserted it stays there and cannot be removed. The
76 * only way to deallocate any string in the NamePool is to deallocate the
77 * NamePool itself, as a whole.
78 *
79 * This class is not only reentrant, it is thread-safe in all sense of the
80 * word. All functions of this class can be called concurrently. This is
81 * achieved by internal locking.
82 *
83 * @author Frans Englich <[email protected]>
84 * @todo Use QSubStrings, we can save very many heap allocations by that.
85 * @todo Check limits
86 */
87 class Q_AUTOTEST_EXPORT NamePool : public QSharedData
88 {
89 public:
90 typedef QExplicitlySharedDataPointer<NamePool> Ptr;
91
92 private:
93 friend class StandardNamespaces;
94
95 enum
96 {
97 NoSuchValue = -1,
98 /**
99 * This must be identical to the amount of members in
100 * StandardNamespaces.
101 */
102 StandardNamespaceCount = 11,
103 StandardPrefixCount = 9,
104 StandardLocalNameCount = 141
105 };
106
107 QVector<QString> m_prefixes;
108 QVector<QString> m_namespaces;
109 QVector<QString> m_localNames;
110
111 /**
112 * This hash contains no essential data, but speeds up
113 * finding a prefix in m_prefixes by mapping a prefix(the key) to
114 * the index into m_prefixes(which the value is).
115 *
116 * In other words, one can skip this variable at the cost of having
117 * to linearly loop over prefixes, in order to find the entry.
118 */
119 QHash<QString, QXmlName::PrefixCode> m_prefixMapping;
120
121 /**
122 * Same as m_prefixMapping but applies for URIs, and hence m_namespaces instead
123 * of m_prefixes.
124 */
125 QHash<QString, QXmlName::NamespaceCode> m_namespaceMapping;
126
127 QHash<QString, QXmlName::LocalNameCode> m_localNameMapping;
128
129 enum DefaultCapacities
130 {