Searched refs:max_entries_ (Results 1 – 8 of 8) sorted by relevance
117 explicit ExpiringCache(size_t max_entries) : max_entries_(max_entries) {} in ExpiringCache()147 if (entries_.size() == max_entries_ ) in Put()168 size_t max_entries() const { return max_entries_; } in max_entries()188 if (entries_.size() < max_entries_) in Compact()193 it != entries_.end() && entries_.size() >= max_entries_;) { in Compact()207 size_t max_entries_; variable
135 cache.max_entries_ = 6; in TEST()152 cache.max_entries_ = 4; in TEST()292 cache.max_entries_ = 2; in TEST()
98 : max_entries_(max_entries), in StrikeRegister()119 for (unsigned i = 0; i < max_entries_ - 1; i++) in Reset()121 internal_nodes_[max_entries_ - 1].SetNextPtr(kNil); in Reset()125 for (unsigned i = 0; i < max_entries_ - 1; i++) in Reset()127 external_node_next_ptr(max_entries_ - 1) = kNil; in Reset()289 CHECK_LT(i, max_entries_); in Validate()297 CHECK_LT(i, max_entries_); in Validate()452 CHECK_LT(internal_node, max_entries_); in ValidateTree()
198 : max_entries_(max_entries), in SlowStrikeRegister()208 if (nonces_.size() == max_entries_) { in Insert()281 const unsigned max_entries_; member in __anon527ee5d20111::SlowStrikeRegister
198 const uint32 max_entries_; variable
271 const size_t max_entries_; member in syncer::__anon2835c76e0211::Traversal282 max_entries_(max_entries), in Traversal()444 return out_->size() >= max_entries_; in IsFull()492 if (out_->size() > max_entries_) in AddCreatesAndMoves()493 out_->resize(max_entries_); in AddCreatesAndMoves()526 if (deletion_list.size() + out_->size() > max_entries_) in AddDeletes()537 if (out_->size() > max_entries_) in AddDeletes()538 out_->resize(max_entries_); in AddDeletes()
16 AnswersCache::AnswersCache(size_t max_entries) : max_entries_(max_entries) { in AnswersCache()47 if (cache_.size() >= max_entries_) in UpdateRecentAnswers()
39 size_t max_entries_;