/*
- * Copyright 2015 Facebook, Inc.
+ * Copyright 2017 Facebook, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
*/
#include <random>
+
#include <folly/Benchmark.h>
+#include <folly/Fingerprint.h>
#include <folly/Format.h>
#include <folly/detail/SlowFingerprint.h>
-#include <folly/Fingerprint.h>
using namespace std;
using namespace folly;
// word length = uniformly distributed between 1 and 10
// charset = 0x20 - 0x7f
std::uniform_int_distribution<size_t> term_len(1, 10);
- std::uniform_int_distribution<uint8_t> term_char(0x20, 0x7f);
+ std::uniform_int_distribution<uint16_t> term_char(0x20, 0x7f);
for (int i = 0; i < kMaxTerms; i++) {
std::string& term = terms[i];
int len = term_len(rng);
fingerprintTerms<Fingerprint<128> >(num_iterations, num_ids);
}
-
-} // namespace
+} // namespace
// Only benchmark one size of slowFingerprint; it's significantly slower
// than fastFingeprint (as you can see for 64 bits) and it just slows down
// the benchmark without providing any useful data.
int main(int argc, char** argv) {
+ gflags::ParseCommandLineFlags(&argc, &argv, true);
# define BM(name, min, max) \
for (size_t i = min; i <= max; i *= 2) { \
addBenchmark( \