From 0d299eca57ddab9dfb17c1f6c99139c481dccb49 Mon Sep 17 00:00:00 2001
From: Matthias Vallentin <vallentin@icir.org>
Date: Thu, 6 Jun 2013 14:54:25 -0700
Subject: [PATCH] Correct computation of k hash functions.

---
 src/BloomFilter.cc | 9 +--------
 1 file changed, 1 insertion(+), 8 deletions(-)

diff --git a/src/BloomFilter.cc b/src/BloomFilter.cc
index c684c82c0e..f1db71ae1d 100644
--- a/src/BloomFilter.cc
+++ b/src/BloomFilter.cc
@@ -3,13 +3,6 @@
 #include <cmath>
 #include "Serializer.h"
 
-// Backport C++11's std::round().
-namespace {
-template <typename T>
-T round(double x) { return (x > 0.0) ? (x + 0.5) : (x - 0.5); }
-} // namespace <anonymous>
-
-
 CounterVector::CounterVector(size_t width, size_t cells)
   : bits_(new BitVector(width * cells)), width_(width)
   {
@@ -155,7 +148,7 @@ size_t BasicBloomFilter::M(double fp, size_t capacity)
 size_t BasicBloomFilter::K(size_t cells, size_t capacity)
   {
   double frac = static_cast<double>(cells) / static_cast<double>(capacity);
-  return round<size_t>(frac * std::log(2));
+  return std::ceil(frac * std::log(2));
   }
 
 BasicBloomFilter::BasicBloomFilter(double fp, size_t capacity)