31   auto candidate = nodes_.end();  in PopBestCandidate()  local
35       candidate = iterator;  in PopBestCandidate()
40   if (candidate != nodes_.end()) {  in PopBestCandidate()
41     ScheduleGraphNode *result = *candidate;  in PopBestCandidate()
42     nodes_.erase(candidate);  in PopBestCandidate()
54   auto candidate = nodes_.begin();  in PopBestCandidate()  local
55   std::advance(candidate, isolate()->random_number_generator()->NextInt(  in PopBestCandidate()
57   ScheduleGraphNode *result = *candidate;  in PopBestCandidate()
58   nodes_.erase(candidate);  in PopBestCandidate()
224     ScheduleGraphNode* candidate = ready_list.PopBestCandidate(cycle);  in ScheduleBlock()  local
226     if (candidate != nullptr) {  in ScheduleBlock()
227       sequence()->AddInstruction(candidate->instruction());  in ScheduleBlock()
229       for (ScheduleGraphNode* successor : candidate->successors()) {  in ScheduleBlock()
233                      cycle + candidate->latency()));  in ScheduleBlock()