Home
last modified time | relevance | path

Searched refs:candidate_indices (Results 1 – 1 of 1) sorted by relevance

/external/eigen/bench/
Danalyze-blocking-sizes.cpp488 vector<size_t> candidate_indices(inout_remainder.size()); in find_subset_with_efficiency_higher_than() local
489 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()