blob: 4acee2e1e6df40e3e0f924d770a7d59a684cfd93 (
plain)
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
|
#ifndef NODECACHE_H_
#define NODECACHE_H_
#include <vector>
#include <string>
#include "node.h"
/*!
Caches string values per node based on the node.index().
The node index guaranteed to be unique per node tree since the index is reset
every time a new tree is generated.
*/
class NodeCache
{
public:
NodeCache() { }
virtual ~NodeCache() { }
bool contains(const AbstractNode &node) const {
return !(*this)[node].empty();
}
/*! Returns a reference to the cached string copy. NB! don't rely on
* this reference to be valid for long - if the cache is resized
* internally, existing values are lost. */
const std::string & operator[](const AbstractNode &node) const {
if (this->cache.size() > node.index()) return this->cache[node.index()];
else return this->nullvalue;
}
/*! Returns a reference to the cached string copy. NB! don't rely on
* this reference to be valid for long - if the cache is resized
* internally, existing values are lost. */
const std::string &insert(const class AbstractNode &node, const std::string & value) {
if (this->cache.size() <= node.index()) this->cache.resize(node.index() + 1);
return this->cache[node.index()] = value;
}
void remove(const class AbstractNode &node) {
if (this->cache.size() > node.index()) this->cache[node.index()] = std::string();
}
void clear() {
this->cache.clear();
}
private:
std::vector<std::string> cache;
std::string nullvalue;
};
#endif
|
