Home
last modified time | relevance | path

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

/external/eigen/bench/
Danalyze-blocking-sizes.cpp411 void make_first_subset(size_t subset_size, vector<size_t>& out_subset, size_t set_size) in make_first_subset() argument
414 out_subset.resize(subset_size); in make_first_subset()
416 out_subset[i] = i; in make_first_subset()
477 vector<size_t>& out_subset) in find_subset_with_efficiency_higher_than() argument
479 out_subset.resize(0); in find_subset_with_efficiency_higher_than()
502 vector<size_t> trial_subset = out_subset; in find_subset_with_efficiency_higher_than()
503 trial_subset.resize(out_subset.size() + candidate_indices_subset_size); in find_subset_with_efficiency_higher_than()
507 trial_subset[out_subset.size() + i] = inout_remainder[candidate_indices_subset[i]]; in find_subset_with_efficiency_higher_than()
532 vector<size_t> trial_subset = out_subset; in find_subset_with_efficiency_higher_than()
537 out_subset.push_back(*candidate_iterator); in find_subset_with_efficiency_higher_than()