Download cpp-compiled/sources/ninja/canon_perftest.cc from sjkim1127/decbench-cpp-raw-corpus: direct link, hf CLI and curl.
- Browser
- Download file 1.57 kB
-
https://huggingface.co/datasets/sjkim1127/decbench-cpp-raw-corpus/resolve/main/cpp-compiled/sources/ninja/canon_perftest.cc
- Command line
-
hf download hf://datasets/sjkim1127/decbench-cpp-raw-corpus/cpp-compiled/sources/ninja/canon_perftest.cc
-
curl -L -o canon_perftest.cc https://huggingface.co/datasets/sjkim1127/decbench-cpp-raw-corpus/resolve/main/cpp-compiled/sources/ninja/canon_perftest.cc
1.57 kB
| // Copyright 2012 Google Inc. All Rights Reserved. | |
| // | |
| // Licensed under the Apache License, Version 2.0 (the "License"); | |
| // you may not use this file except in compliance with the License. | |
| // You may obtain a copy of the License at | |
| // | |
| // http://www.apache.org/licenses/LICENSE-2.0 | |
| // | |
| // Unless required by applicable law or agreed to in writing, software | |
| // distributed under the License is distributed on an "AS IS" BASIS, | |
| // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | |
| // See the License for the specific language governing permissions and | |
| // limitations under the License. | |
| using namespace std; | |
| const char kPath[] = | |
| "../../third_party/WebKit/Source/WebCore/" | |
| "platform/leveldb/LevelDBWriteBatch.cpp"; | |
| int main() { | |
| vector<int> times; | |
| char buf[200]; | |
| size_t len = strlen(kPath); | |
| strcpy(buf, kPath); | |
| for (int j = 0; j < 5; ++j) { | |
| const int kNumRepetitions = 2000000; | |
| int64_t start = GetTimeMillis(); | |
| uint64_t slash_bits; | |
| for (int i = 0; i < kNumRepetitions; ++i) { | |
| CanonicalizePath(buf, &len, &slash_bits); | |
| } | |
| int delta = (int)(GetTimeMillis() - start); | |
| times.push_back(delta); | |
| } | |
| int min = times[0]; | |
| int max = times[0]; | |
| float total = 0; | |
| for (size_t i = 0; i < times.size(); ++i) { | |
| total += times[i]; | |
| if (times[i] < min) | |
| min = times[i]; | |
| else if (times[i] > max) | |
| max = times[i]; | |
| } | |
| printf("min %dms max %dms avg %.1fms\n", | |
| min, max, total / times.size()); | |
| } | |