Lines Matching refs:free_nodes_pool_
54 std::set<int>::iterator it = free_nodes_pool_.find(tab_node_id);
55 DCHECK(it != free_nodes_pool_.end());
56 free_nodes_pool_.erase(it);
65 if (free_nodes_pool_.empty()) {
86 free_nodes_pool_.insert(tab_node_id);
90 return *free_nodes_pool_.begin();
106 DCHECK(free_nodes_pool_.find(tab_node_id) == free_nodes_pool_.end());
108 free_nodes_pool_.insert(tab_node_id);
114 if (free_nodes_pool_.size() > kFreeNodesHighWatermark) {
115 for (std::set<int>::iterator free_it = free_nodes_pool_.begin();
116 free_it != free_nodes_pool_.end();) {
123 free_nodes_pool_.erase(free_it++);
124 if (free_nodes_pool_.size() <= kFreeNodesLowWatermark) {
170 free_nodes_pool_.clear();
177 free_nodes_pool_.size();
180 bool TabNodePool::Empty() const { return free_nodes_pool_.empty(); }