31 size_t len = strlen(
kPath);
34 for (
int j = 0; j < 5; ++j) {
35 const int kNumRepetitions = 2000000;
38 for (
int i = 0; i < kNumRepetitions; ++i) {
42 times.push_back(delta);
48 for (
size_t i = 0; i < times.size(); ++i) {
52 else if (times[i] > max)
56 printf(
"min %dms max %dms avg %.1fms\n",
57 min, max, total / times.size());