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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
|
// **********************************************************************
//
// Copyright (c) 2003-2006 ZeroC, Inc. All rights reserved.
//
// This copy of Ice is licensed to you under the terms described in the
// ICE_LICENSE file included in this distribution.
//
// **********************************************************************
#ifndef ICE_GRID_CACHE_H
#define ICE_GRID_CACHE_H
#include <IceUtil/Mutex.h>
#include <IceUtil/Shared.h>
#include <IceGrid/Util.h>
#include <IceGrid/TraceLevels.h>
namespace IceGrid
{
template<typename Key, typename Value>
class Cache : public IceUtil::Mutex
{
typedef IceUtil::Handle<Value> ValuePtr;
public:
Cache() : _entriesHint(_entries.end())
{
}
virtual
~Cache()
{
}
bool
has(const Key& key)
{
Lock sync(*this);
return getImpl(key);
}
ValuePtr
remove(const Key& key)
{
Lock sync(*this);
return removeImpl(key);
}
void
setTraceLevels(const TraceLevelsPtr& traceLevels)
{
_traceLevels = traceLevels;
}
const TraceLevelsPtr& getTraceLevels() const { return _traceLevels; }
protected:
virtual ValuePtr
getImpl(const Key& key, bool create = false)
{
typename std::map<Key, ValuePtr>::iterator p = _entries.end();
if(_entriesHint != _entries.end())
{
if(_entriesHint->first == key)
{
p = _entriesHint;
}
}
if(p == _entries.end())
{
p = _entries.find(key);
}
if(p != _entries.end())
{
_entriesHint = p;
return p->second;
}
else
{
if(create)
{
return createAndAddImpl(key);
}
else
{
return 0;
}
}
}
virtual ValuePtr
createAndAddImpl(const Key& key)
{
return addImpl(key, createEntry(key));
}
virtual ValuePtr
addImpl(const Key& key, const ValuePtr& entry)
{
typename std::map<Key, ValuePtr>::value_type v(key, entry);
_entriesHint = _entries.insert(_entriesHint, v);
return entry;
}
virtual ValuePtr
removeImpl(const Key& key)
{
typename std::map<Key, ValuePtr>::iterator p = _entries.end();
if(_entriesHint != _entries.end())
{
if(_entriesHint->first == key)
{
p = _entriesHint;
}
}
if(p == _entries.end())
{
p = _entries.find(key);
}
assert(p != _entries.end());
if(p->second->canRemove())
{
ValuePtr entry = p->second;
_entries.erase(p);
_entriesHint = _entries.end();
return entry;
}
else
{
_entriesHint = p;
return p->second;
}
}
virtual ValuePtr
createEntry(const Key& key)
{
return new Value(*this, key);
}
TraceLevelsPtr _traceLevels;
std::map<Key, ValuePtr> _entries;
typename std::map<Key, ValuePtr>::iterator _entriesHint;
};
template<typename T>
class CacheByString : public Cache<std::string, T>
{
typedef IceUtil::Handle<T> TPtr;
public:
virtual std::vector<std::string>
getAll(const std::string& expr)
{
IceUtil::Mutex::Lock sync(*this);
return getMatchingKeys<std::map<std::string,TPtr> >(Cache<std::string, T>::_entries, expr);
}
};
};
#endif
|
