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
|
/*
* Copyright (c) 2002-2006 Samit Basu
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#ifndef __SYMBOLTABLE_HPP__
#define __SYMBOLTABLE_HPP__
#include <QHash>
#include "Types.hpp"
namespace FM { //have to use namespace to avoid conflict with llvm::SymbolTable
template <class T>
class SymbolTable {
QHash<QString,T> map;
public:
SymbolTable() { }
~SymbolTable() { }
T* findSymbol(const QString& key) {
if (map.contains(key)) {
return &(map[key]);
}
return 0;
}
bool hasSymbol(const QString& key) {
return map.contains(key);
}
void deleteSymbol(const QString& key) {
map.remove(key);
}
void insertSymbol(const QString& key, const T& val) {
map.insert(key,val);
}
StringVector getCompletions(const QString& prefix) {
StringVector retvec;
for (typename QHash<QString,T>::const_iterator i=map.constBegin();i != map.constEnd();++i) {
if ((i.key().size() > prefix.size()) &&
(i.key().left(prefix.size()) == prefix))
retvec << i.key();
}
return retvec;
}
};
}
#endif
|
