Rename CClaimTrieCache to CClaimTrieUpdateBuffer #156
1 changed files with 9 additions and 0 deletions
|
@ -769,17 +769,26 @@ bool CClaimTrie::update(nodeCacheType& cache, hashMapType& hashes, std::map<std:
|
||||||
for (nodeCacheType::iterator itcache = cache.begin(); itcache != cache.end(); ++itcache)
|
for (nodeCacheType::iterator itcache = cache.begin(); itcache != cache.end(); ++itcache)
|
||||||
{
|
{
|
||||||
if (!updateName(itcache->first, itcache->second))
|
if (!updateName(itcache->first, itcache->second))
|
||||||
|
{
|
||||||
|
LogPrintf("%s: Failed to update name for:%s\n", __func__, itcache->first);
|
||||||
return false;
|
return false;
|
||||||
|
}
|
||||||
}
|
}
|
||||||
for (hashMapType::iterator ithash = hashes.begin(); ithash != hashes.end(); ++ithash)
|
for (hashMapType::iterator ithash = hashes.begin(); ithash != hashes.end(); ++ithash)
|
||||||
{
|
{
|
||||||
if (!updateHash(ithash->first, ithash->second))
|
if (!updateHash(ithash->first, ithash->second))
|
||||||
|
{
|
||||||
|
LogPrintf("%s: Failed to update hash for:%s\n", __func__, ithash->first);
|
||||||
return false;
|
return false;
|
||||||
|
}
|
||||||
}
|
}
|
||||||
for (std::map<std::string, int>::iterator itheight = takeoverHeights.begin(); itheight != takeoverHeights.end(); ++itheight)
|
for (std::map<std::string, int>::iterator itheight = takeoverHeights.begin(); itheight != takeoverHeights.end(); ++itheight)
|
||||||
{
|
{
|
||||||
if (!updateTakeoverHeight(itheight->first, itheight->second))
|
if (!updateTakeoverHeight(itheight->first, itheight->second))
|
||||||
|
{
|
||||||
|
LogPrintf("%s: Failed to update takeover height for:%s\n", __func__, itheight->first);
|
||||||
return false;
|
return false;
|
||||||
|
}
|
||||||
}
|
}
|
||||||
for (claimQueueType::iterator itQueueCacheRow = queueCache.begin(); itQueueCacheRow != queueCache.end(); ++itQueueCacheRow)
|
for (claimQueueType::iterator itQueueCacheRow = queueCache.begin(); itQueueCacheRow != queueCache.end(); ++itQueueCacheRow)
|
||||||
{
|
{
|
||||||
|
|
Loading…
Reference in a new issue