Chromium Code Reviews| Index: ppapi/tools/pepper_hash_for_uma.cc |
| diff --git a/ppapi/tools/pepper_hash_for_uma.cc b/ppapi/tools/pepper_hash_for_uma.cc |
| index 6e38cfdd4b6483c7fe879cc50e17f4dd401a3037..33e59d086bef50dcd278d230cf2e4ba328f2251c 100644 |
| --- a/ppapi/tools/pepper_hash_for_uma.cc |
| +++ b/ppapi/tools/pepper_hash_for_uma.cc |
| @@ -13,6 +13,9 @@ |
| #include <stdlib.h> |
| #include <string.h> |
| +#include <algorithm> |
| +#include <vector> |
| + |
| #include "base/hash.h" |
| #include "base/macros.h" |
| @@ -25,13 +28,19 @@ int main(int argc, char **argv) { |
| argv[0]); |
| return 1; |
| } |
| + std::vector<std::pair<uint32, char*>> hashes; |
| for (int i = 1; i < argc; i++) { |
| uint32 data = base::Hash(argv[i], strlen(argv[i])); |
| // Strip off the signed bit because UMA doesn't support negative values, |
| // but takes a signed int as input. |
| int hash = static_cast<int>(data & 0x7fffffff); |
| - printf("<int value=\"%d\" label=\"%s\"/>\n", hash, argv[i]); |
| + hashes.push_back(std::make_pair(hash, argv[i])); |
| + } |
| + std::sort(hashes.begin(), hashes.end()); |
| + for ( auto &hash : hashes ) { |
|
Alexei Svitkine (slow)
2015/02/25 22:14:21
Nit: Per chromium format:
for (const auto& hash :
bbudge
2015/02/26 00:13:57
Done.
|
| + printf("<int value=\"%d\" label=\"%s\"/>\n", hash.first, hash.second); |
| } |
| + |
| return 0; |
| } |