30   auto candidate = nodes_.end();  in PopBestCandidate()  local
34       candidate = iterator;  in PopBestCandidate()
39   if (candidate != nodes_.end()) {  in PopBestCandidate()
40     ScheduleGraphNode* result = *candidate;  in PopBestCandidate()
41     nodes_.erase(candidate);  in PopBestCandidate()
52   auto candidate = nodes_.begin();  in PopBestCandidate()  local
53   std::advance(candidate, random_number_generator()->NextInt(  in PopBestCandidate()
55   ScheduleGraphNode* result = *candidate;  in PopBestCandidate()
56   nodes_.erase(candidate);  in PopBestCandidate()
225     ScheduleGraphNode* candidate = ready_list.PopBestCandidate(cycle);  in Schedule()  local
227     if (candidate != nullptr) {  in Schedule()
228       sequence()->AddInstruction(candidate->instruction());  in Schedule()
230       for (ScheduleGraphNode* successor : candidate->successors()) {  in Schedule()
233             std::max(successor->start_cycle(), cycle + candidate->latency()));  in Schedule()