blob: 61a43ab978f403445f48d0d48becda488bd20ba3 (
plain) (
blame)
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
|
#pragma once
#include <map>
#include <unordered_set>
#include "types.hh"
namespace nix {
/* Symbol table used by the parser and evaluator to represent and look
up identifiers and attributes efficiently. SymbolTable::create()
converts a string into a symbol. Symbols have the property that
they can be compared efficiently (using a pointer equality test),
because the symbol table stores only one copy of each string. */
class Symbol {
private:
const string* s; // pointer into SymbolTable
Symbol(const string* s) : s(s){};
friend class SymbolTable;
public:
Symbol() : s(0){};
bool operator==(const Symbol& s2) const { return s == s2.s; }
bool operator!=(const Symbol& s2) const { return s != s2.s; }
bool operator<(const Symbol& s2) const { return s < s2.s; }
operator const string&() const { return *s; }
bool set() const { return s; }
bool empty() const { return s->empty(); }
friend std::ostream& operator<<(std::ostream& str, const Symbol& sym);
};
class SymbolTable {
private:
typedef std::unordered_set<string> Symbols;
Symbols symbols;
public:
Symbol create(const string& s) {
std::pair<Symbols::iterator, bool> res = symbols.insert(s);
return Symbol(&*res.first);
}
size_t size() const { return symbols.size(); }
size_t totalSize() const;
template <typename T>
void dump(T callback) {
for (auto& s : symbols) callback(s);
}
};
} // namespace nix
|
