258        const vector<preprocessed_inputfile_t>& preprocessed_inputfiles)  in check_all_files_in_same_exact_order()  argument
260   if (preprocessed_inputfiles.empty()) {  in check_all_files_in_same_exact_order()
264   const preprocessed_inputfile_t& first_file = preprocessed_inputfiles[0];  in check_all_files_in_same_exact_order()
267   for (size_t i = 0; i < preprocessed_inputfiles.size(); i++) {  in check_all_files_in_same_exact_order()
268     if (preprocessed_inputfiles[i].entries.size() != num_entries) {  in check_all_files_in_same_exact_order()
270            << preprocessed_inputfiles[i].filename  in check_all_files_in_same_exact_order()
281     for (size_t file_index = 0; file_index < preprocessed_inputfiles.size(); file_index++) {  in check_all_files_in_same_exact_order()
282       const preprocessed_inputfile_t& cur_file = preprocessed_inputfiles[file_index];  in check_all_files_in_same_exact_order()
298         const vector<preprocessed_inputfile_t>& preprocessed_inputfiles,  in efficiency_of_subset()  argument
304   const preprocessed_inputfile_t& first_file = preprocessed_inputfiles[subset[0]];  in efficiency_of_subset()
319 …efficiency_this_entry = min(efficiency_this_entry, preprocessed_inputfiles[*i].entries[e].efficien…  in efficiency_of_subset()
335         const vector<preprocessed_inputfile_t>& preprocessed_inputfiles,  in dump_table_for_subset()  argument
338   const preprocessed_inputfile_t& first_file = preprocessed_inputfiles[subset[0]];  in dump_table_for_subset()
370 …efficiency_this_entry = min(efficiency_this_entry, preprocessed_inputfiles[*i].entries[e].efficien…  in dump_table_for_subset()
401         const vector<preprocessed_inputfile_t>& preprocessed_inputfiles,  in efficiency_of_partition()  argument
406     efficiency = min(efficiency, efficiency_of_subset(preprocessed_inputfiles, *s));  in efficiency_of_partition()
474        const vector<preprocessed_inputfile_t>& preprocessed_inputfiles,  in find_subset_with_efficiency_higher_than()  argument
510         float trial_efficiency = efficiency_of_subset(preprocessed_inputfiles, trial_subset);  in find_subset_with_efficiency_higher_than()
535     float trial_efficiency = efficiency_of_subset(preprocessed_inputfiles, trial_subset);  in find_subset_with_efficiency_higher_than()
546        const vector<preprocessed_inputfile_t>& preprocessed_inputfiles,  in find_partition_with_efficiency_higher_than()  argument
553   for (size_t i = 0; i < preprocessed_inputfiles.size(); i++) {  in find_partition_with_efficiency_higher_than()
560       preprocessed_inputfiles,  in find_partition_with_efficiency_higher_than()
569        const vector<preprocessed_inputfile_t>& preprocessed_inputfiles,  in print_partition()  argument
572   float efficiency = efficiency_of_partition(preprocessed_inputfiles, partition);  in print_partition()
576 …      << ", efficiency " << efficiency_of_subset(preprocessed_inputfiles, *subset) * 100.0f << "%:"  in print_partition()
579       cout << "    " << preprocessed_inputfiles[*file].filename << endl;  in print_partition()
583       dump_table_for_subset(preprocessed_inputfiles, *subset);  in print_partition()
601     vector<preprocessed_inputfile_t> preprocessed_inputfiles;  in run()  local
612           preprocessed_inputfiles.emplace_back(inputfile);  in run()
625     check_all_files_in_same_exact_order(preprocessed_inputfiles);  in run()
634         preprocessed_inputfiles,  in run()
637       float actual_efficiency = efficiency_of_partition(preprocessed_inputfiles, partition);  in run()
638       cerr << "partition " << preprocessed_inputfiles.size() << " files into " << partition.size()  in run()
643       if (partition.size() == preprocessed_inputfiles.size() || actual_efficiency == 1.0f) {  in run()
663       print_partition(preprocessed_inputfiles, *it);  in run()