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
|
/*
* This file is part of the API Extractor project.
*
* Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
* Copyright (C) 2002-2005 Roberto Raggi <roberto@kdevelop.org>
*
* Contact: PySide team <contact@pyside.org>
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* version 2 as published by the Free Software Foundation.
*
* This program 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
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
* 02110-1301 USA
*
*/
#ifndef SYMBOL_H
#define SYMBOL_H
#include <QtCore/QString>
#include <cstring>
#include <QtCore/QHash>
#include <QtCore/QPair>
struct NameSymbol
{
const char *data;
std::size_t count;
inline QString as_string() const
{
return QString::fromUtf8(data, (int) count);
}
inline bool operator == (const NameSymbol &other) const
{
return count == other.count
&& !std::strncmp(data, other.data, count);
}
protected:
inline NameSymbol() {}
inline NameSymbol(const char *d, std::size_t c)
: data(d), count(c) {}
private:
void operator = (const NameSymbol &);
friend class NameTable;
};
inline uint qHash(const NameSymbol &r)
{
uint hash_value = 0;
for (std::size_t i = 0; i < r.count; ++i)
hash_value = (hash_value << 5) - hash_value + r.data[i];
return hash_value;
}
inline uint qHash(const QPair<const char*, std::size_t> &r)
{
uint hash_value = 0;
for (std::size_t i = 0; i < r.second; ++i)
hash_value = (hash_value << 5) - hash_value + r.first[i];
return hash_value;
}
class NameTable
{
public:
typedef QPair<const char *, std::size_t> KeyType;
typedef QHash<KeyType, NameSymbol*> ContainerType;
public:
NameTable() {}
~NameTable()
{
qDeleteAll(_M_storage);
}
inline const NameSymbol *findOrInsert(const char *str, std::size_t len)
{
KeyType key(str, len);
NameSymbol *name = _M_storage.value(key);
if (!name) {
name = new NameSymbol(str, len);
_M_storage.insert(key, name);
}
return name;
}
inline std::size_t count() const { return _M_storage.size(); }
private:
ContainerType _M_storage;
private:
NameTable(const NameTable &other);
void operator=(const NameTable &other);
};
#endif // SYMBOL_H
// kate: space-indent on; indent-width 2; replace-tabs on;
|
