From aaa59b7edbdf5dee81422a59a8416c470a776f61 Mon Sep 17 00:00:00 2001
From: Davi Reis <davi@dhcp-192-168-28-192.mtv.corp.google.com>
Date: Sun, 22 Apr 2012 02:58:04 +0200
Subject: [PATCH] Real results. Minimal is slightly slower than STL, perfect is
 faster, perfect and pof2 even better.

---
 cxxmph/bm_map.cc | 2 --
 1 file changed, 2 deletions(-)

diff --git a/cxxmph/bm_map.cc b/cxxmph/bm_map.cc
index e24c9ee..153f354 100644
--- a/cxxmph/bm_map.cc
+++ b/cxxmph/bm_map.cc
@@ -100,14 +100,12 @@ using namespace cxxmph;
 
 int main(int argc, char** argv) {
   srandom(4);
-  /*
   Benchmark::Register(new BM_CreateUrls<mph_map<StringPiece, StringPiece>>("URLS100k"));
   Benchmark::Register(new BM_CreateUrls<unordered_map<StringPiece, StringPiece>>("URLS100k"));
   Benchmark::Register(new BM_SearchUrls<mph_map<StringPiece, StringPiece>>("URLS100k", 10*1000 * 1000, 0));
   Benchmark::Register(new BM_SearchUrls<unordered_map<StringPiece, StringPiece, Murmur3StringPiece>>("URLS100k", 10*1000 * 1000, 0));
   Benchmark::Register(new BM_SearchUrls<mph_map<StringPiece, StringPiece>>("URLS100k", 10*1000 * 1000, 0.9));
   Benchmark::Register(new BM_SearchUrls<unordered_map<StringPiece, StringPiece, Murmur3StringPiece>>("URLS100k", 10*1000 * 1000, 0.9));
-  */
   Benchmark::Register(new BM_SearchUint64<mph_map<uint64_t, uint64_t>>);
   Benchmark::Register(new BM_SearchUint64<unordered_map<uint64_t, uint64_t>>);
   Benchmark::RunAll();