Lines Matching refs:candidate
14 // Compare the two nodes and return true if node1 is a better candidate than
25 auto candidate = nodes_.end();
30 if ((candidate == nodes_.end()) || CompareNodes(*iterator, *candidate)) {
31 candidate = iterator;
36 if (candidate != nodes_.end()) {
37 ScheduleGraphNode *result = *candidate;
38 nodes_.erase(candidate);
50 auto candidate = nodes_.begin();
51 std::advance(candidate, isolate()->random_number_generator()->NextInt(
53 ScheduleGraphNode *result = *candidate;
54 nodes_.erase(candidate);
196 ScheduleGraphNode* candidate = ready_list.PopBestCandidate(cycle);
198 if (candidate != nullptr) {
199 sequence()->AddInstruction(candidate->instruction());
201 for (ScheduleGraphNode* successor : candidate->successors()) {
205 cycle + candidate->latency()));
