ARCHIVE/xahaud
3
0
Fork 0
mirror of https://github.com/Xahau/xahaud.git synced 2025-12-06 17:27:52 +00:00
Code Issues Packages Projects Releases Wiki Activity

Make TaggedCache::del more flexible.

Browse Source
This commit is contained in:
JoelKatz
2013-01-02 14:25:06 -08:00
parent 1127ae560e
commit f75e175fc2
1 changed files with 11 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
src/cpp/ripple/TaggedCache.h
View File

@@ -61,7 +61,7 @@ public:
void sweep();
bool touch(const key_type& key);
bool del(const key_type& key);
bool del(const key_type& key, bool valid);
bool canonicalize(const key_type& key, boost::shared_ptr<c_Data>& data, bool replace = false);
bool store(const key_type& key, const c_Data& data);
boost::shared_ptr<c_Data> fetch(const key_type& key);
@@ -161,10 +161,18 @@ template<typename c_Key, typename c_Data> bool TaggedCache<c_Key, c_Data>::touch
return true;
}
template<typename c_Key, typename c_Data> bool TaggedCache<c_Key, c_Data>::del(const key_type& key)
{ // Remove from cache, map unaffected
template<typename c_Key, typename c_Data> bool TaggedCache<c_Key, c_Data>::del(const key_type& key, bool valid)
{ // Remove from cache, if !valid, remove from map too. Returns true if removed from cache
boost::recursive_mutex::scoped_lock sl(mLock);
if (!valid)
{ // remove from map too
typename boost::unordered_map<key_type, weak_data_ptr>::iterator mit = mMap.find(key);
if (mit == mMap.end()) // not in map, cannot be in cache
return false;
mMap.erase(mit);
}
typename boost::unordered_map<key_type, cache_entry>::iterator cit = mCache.find(key);
if (cit == mCache.end())
return false;