Home | History | Annotate | Download | only in test

Lines Matching defs:times

113 void print_summary(std::vector<double>* times, bool full) {
114 std::sort(times->begin(), times->end());
120 const size_t count_trimmed = times->size() * trim_ratio;
124 const size_t count_best = times->size() * best_ratio;
126 for (size_t i = 0; i < times->size(); i++) {
127 sum_times += (*times)[i];
128 if (i >= count_trimmed && i < times->size() - count_trimmed) {
129 sum_times_trimmed += (*times)[i];
133 sum_times_best += (*times)[i];
138 const double min_latency = times->front();
139 const double max_latency = times->back();
140 const double mean_latency = sum_times / times->size();
145 std::cout << "Graph latency (over " << times->size()
161 std::vector<double> times;
172 times.push_back(delta_time / repetitions);
176 print_summary(&times, true);
180 std::vector<double> times;
196 times.push_back(delta_time / shape->repetitions);
200 print_summary(&times, false);