本文整理汇总了C++中cache_t::end方法的典型用法代码示例。如果您正苦于以下问题:C++ cache_t::end方法的具体用法?C++ cache_t::end怎么用?C++ cache_t::end使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类cache_t
的用法示例。
在下文中一共展示了cache_t::end方法的9个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: new_keys
typename std::enable_if<(sizeof...(Args), std::is_same<cache_t, cache_vector_t>::value) && tp == timeout_policy_t::NEVER, std::remove_const_t<std::decay_t<R>>>::type
const& call(Args const&... args)
{
decayed_key_t new_keys(getKey(args)...);
auto&& it(cache.find(new_keys));
if (it == cache.end()) // not cached
{
if (cache.size() == LRU_MAX) // cache is full, time to overwrite old objects
{
if (internal_it == internal_cache.end())
{
assert(cache_it == cache.end());
internal_it = internal_cache.begin();
cache_it = cache.begin();
}
*internal_it = fptr(args...);
cache.erase(cache_it);
cache.insert(cache_it, std::pair<key_t, internal_cache_it_t>(new_keys, internal_it));
++cache_it;
return *internal_it++;
}
else
{
// Maybe emplace_back
internal_cache.push_back(fptr(args...));
cache[new_keys] = internal_cache.end();
return internal_cache.back();
}
}
else // was cached
return *it->second;
};
示例2: get
void get( const LLUUID& key, callback_slot_t slot )
{
if(key.isNull()) return;
cache_t::const_iterator it = sCache.find(key);
if (it != sCache.end())
{
// ...name already exists in cache, fire callback now
callback_signal_t signal;
signal.connect(slot);
signal(it->second);
return;
}
fetch(key);
// always store additional callback, even if request is pending
signal_map_t::iterator sig_it = sSignalMap.find(key);
if (sig_it == sSignalMap.end())
{
// ...new callback for this id
callback_signal_t* signal = new callback_signal_t();
signal->connect(slot);
sSignalMap[key] = signal;
}
else
{
// ...existing callback, bind additional slot
callback_signal_t* signal = sig_it->second;
signal->connect(slot);
}
}
示例3: eraseExpired
void eraseExpired()
{
F64 now = LLFrameTimer::getTotalSeconds();
cache_t::iterator it = sCache.begin();
while (it != sCache.end())
{
cache_t::iterator cur = it;
LLSD& exp = cur->second;
++it;
if(exp.has(EXPIRES) && exp[EXPIRES].asReal() < now)
{
if(!exp.has(EXPERIENCE_ID))
{
LL_WARNS("ExperienceCache") << "Removing experience with no id " << LL_ENDL ;
sCache.erase(cur);
}
else
{
LLUUID id = exp[EXPERIENCE_ID].asUUID();
LLUUID private_key = exp.has(LLExperienceCache::PRIVATE_KEY) ? exp[LLExperienceCache::PRIVATE_KEY].asUUID():LLUUID::null;
if(private_key.notNull() || !exp.has("DoesNotExist"))
{
fetch(id, true);
}
else
{
LL_WARNS("ExperienceCache") << "Removing invalid experience " << id << LL_ENDL ;
sCache.erase(cur);
}
}
}
}
}
示例4: erase
void erase( const LLUUID& key )
{
cache_t::iterator it = sCache.find(key);
if(it != sCache.end())
{
sCache.erase(it);
}
}
示例5: fetch
bool fetch( const LLUUID& key, bool refresh/* = true*/ )
{
if(!key.isNull() && !isRequestPending(key) && (refresh || sCache.find(key)==sCache.end()))
{
LL_DEBUGS("ExperienceCache") << " queue request for " << EXPERIENCE_ID << " " << key << LL_ENDL ;
sAskQueue[key]=EXPERIENCE_ID;
return true;
}
return false;
}
示例6: cycleLengthRecursive
int cycleLengthRecursive(unsigned int n) {
// base case is handled by cache
cache_t::iterator it = cache.find(n);
if (it != cache.end()) {
return it->second;
}
int out;
if (n % 2 == 1)
out = 1 + cycleLengthRecursive((n*3) + 1); // if n is odd then n <- 3n + 1
else
out = 1 + cycleLengthRecursive(n/2); // else n <- n/2
cache[n] = out;
return out;
}
示例7: exportFile
void exportFile(std::ostream& ostr)
{
LLSD experiences;
cache_t::const_iterator it =sCache.begin();
for( ; it != sCache.end() ; ++it)
{
if(!it->second.has(EXPERIENCE_ID) || it->second[EXPERIENCE_ID].asUUID().isNull() ||
it->second.has("DoesNotExist") || (it->second.has(PROPERTIES) && it->second[PROPERTIES].asInteger() & PROPERTY_INVALID))
continue;
experiences[it->first.asString()] = it->second;
}
LLSD data;
data["experiences"] = experiences;
LLSDSerialize::toPrettyXML(data, ostr);
}
示例8: CacheGet
// static
bool Dbase::CacheGet(Cddb::Matches& res, const Cddb::discid_t discID)
{
bool ret = false;
for (cache_t::const_iterator it = s_cache.find(discID); it != s_cache.end(); ++it)
{
if (it->discID == discID)
{
ret = true;
res.discID = discID;
LOG(VB_MEDIA, LOG_DEBUG, QString("Cddb CacheGet %1 found %2 ")
.arg(discID,0,16).arg(it->discID,0,16)
+ it->discGenre + " " + it->artist + " / " + it->title);
// If it's marker for 'no match' then genre is empty
if (!it->discGenre.isEmpty())
res.matches.push_back(Cddb::Match(*it));
}
}
return ret;
}
示例9: mx
//start = startIndex
int mx(int start, int maxw)
{
if(start >= tt->size() || maxw <= 0) return 0;
cache_t::iterator it = cache.find(PI(start, maxw));
if(it != cache.end()){
return it->second;
}
int without = mx(start+1, maxw);
int res = without;
int st_w = (*tt)[start].w;
int st_st = (*tt)[start].st;
int with = -1;
if(st_w <= maxw){
int new_maxw = min(maxw - st_w, st_st - st_w);
with = mx(start+1, new_maxw);
if(1+with > res){
res = 1+with;
}
}
cache[PI(start,maxw)] = res;
return res;
}