Searched refs:candidate_indices (Results 1 – 2 of 2) sorted by relevance
488 vector<size_t> candidate_indices(inout_remainder.size()); in find_subset_with_efficiency_higher_than() local489 for (size_t i = 0; i < candidate_indices.size(); i++) { in find_subset_with_efficiency_higher_than()490 candidate_indices[i] = i; in find_subset_with_efficiency_higher_than()493 size_t candidate_indices_subset_size = max_feasible_subset_size(candidate_indices.size()); in find_subset_with_efficiency_higher_than()498 candidate_indices.size()); in find_subset_with_efficiency_higher_than()515 if (is_last_subset(candidate_indices_subset, candidate_indices.size())) { in find_subset_with_efficiency_higher_than()518 next_subset(candidate_indices_subset, candidate_indices.size()); in find_subset_with_efficiency_higher_than()523 candidate_indices[i] = candidate_indices[best_candidate_indices_subset[i]]; in find_subset_with_efficiency_higher_than()525 candidate_indices.resize(best_candidate_indices_subset.size()); in find_subset_with_efficiency_higher_than()530 size_t candidate_index = candidate_indices[0]; in find_subset_with_efficiency_higher_than()
976 std::vector<int> candidate_indices; in SuggestSelection() local979 &interpreter_manager, &candidate_indices)) { in SuggestSelection()984 std::sort(candidate_indices.begin(), candidate_indices.end(), in SuggestSelection()992 for (const int i : candidate_indices) { in SuggestSelection()1066 std::vector<int> candidate_indices; in ResolveConflicts() local1070 &candidate_indices)) { in ResolveConflicts()1073 result->insert(result->end(), candidate_indices.begin(), in ResolveConflicts()1074 candidate_indices.end()); in ResolveConflicts()1915 std::vector<int> candidate_indices; in ClassifyText() local1918 &interpreter_manager, &candidate_indices)) { in ClassifyText()[all …]