[Boost-commit] svn:boost r72848 - sandbox/bloom_filter/trunk/libs/bloom_filter/test

Subject: [Boost-commit] svn:boost r72848 - sandbox/bloom_filter/trunk/libs/bloom_filter/test
From: cpp.cabrera_at_[hidden]
Date: 2011-07-02 09:09:19

Author: alejandro
Date: 2011-07-02 09:09:18 EDT (Sat, 02 Jul 2011)
New Revision: 72848
URL: http://svn.boost.org/trac/boost/changeset/72848

Log:
Added preliminary and near-final regression suite for counting_bloom_filter. Updated Jamfile.
Added:
   sandbox/bloom_filter/trunk/libs/bloom_filter/test/counting_bloom-pass.cpp   (contents, props changed)
Text files modified: 
   sandbox/bloom_filter/trunk/libs/bloom_filter/test/Jamfile.v2 |     1 +                                       
   1 files changed, 1 insertions(+), 0 deletions(-)

Modified: sandbox/bloom_filter/trunk/libs/bloom_filter/test/Jamfile.v2
==============================================================================
--- sandbox/bloom_filter/trunk/libs/bloom_filter/test/Jamfile.v2	(original)
+++ sandbox/bloom_filter/trunk/libs/bloom_filter/test/Jamfile.v2	2011-07-02 09:09:18 EDT (Sat, 02 Jul 2011)
@@ -24,6 +24,7 @@
         :
         [ run bloom-pass.cpp ]
         [ run dynamic_bloom-pass.cpp ]
+	[ run counting_bloom-pass.cpp ]
         ;
 
     test-suite "fail"

Added: sandbox/bloom_filter/trunk/libs/bloom_filter/test/counting_bloom-pass.cpp
==============================================================================
--- (empty file)
+++ sandbox/bloom_filter/trunk/libs/bloom_filter/test/counting_bloom-pass.cpp	2011-07-02 09:09:18 EDT (Sat, 02 Jul 2011)
@@ -0,0 +1,375 @@
+//////////////////////////////////////////////////////////////////////////////
+//
+// (C) Copyright Alejandro Cabrera 2011.
+// Distributed under the Boost
+// Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or
+// copy at http://www.boost.org/LICENSE_1_0.txt)
+//
+// See http://www.boost.org/libs/bloom_filter for documentation.
+//
+//////////////////////////////////////////////////////////////////////////////
+
+#define BOOST_TEST_DYN_LINK 1
+#define BOOST_TEST_MODULE "Boost Bloom Filter" 1
+#include <iostream>
+
+#include <boost/bloom_filter/counting_bloom.hpp>
+#include <boost/test/unit_test.hpp>
+#include <boost/test/floating_point_comparison.hpp>
+
+using boost::bloom_filter::counting_bloom_filter;
+using boost::bloom_filter::boost_hash;
+
+typedef unsigned char small_block_type;
+typedef unsigned short med_block_type;
+typedef unsigned long large_block_type;
+
+static const size_t NUM_BINS = 8;
+
+enum {
+  BITS_PER_BIN_ONE = 1,
+  BITS_PER_BIN_TINY = 2,
+  BITS_PER_BIN_DEFAULT = 4,
+  BITS_PER_BIN_ODD = 5,
+  BITS_PER_BIN_MED = 8,
+  BITS_PER_BIN_LARGE = 16,
+  BITS_PER_BIN_MAX = 32
+};
+
+BOOST_AUTO_TEST_CASE(defaultConstructor) {
+  typedef boost::mpl::vector<
+    boost_hash<int, 13>,
+    boost_hash<int, 17>,
+    boost_hash<int, 19> > BoostHashFunctions;
+  
+  counting_bloom_filter<int, NUM_BINS> bloom1;
+  counting_bloom_filter<int, NUM_BINS, BITS_PER_BIN_ONE> bloom2;
+  counting_bloom_filter<int, NUM_BINS, BITS_PER_BIN_TINY, BoostHashFunctions> bloom3;
+  counting_bloom_filter<int, NUM_BINS, BITS_PER_BIN_MED,
+			BoostHashFunctions, small_block_type> bloom4;
+}
+
+BOOST_AUTO_TEST_CASE(countSingle)
+{
+  counting_bloom_filter<int, NUM_BINS> bloom;
+  
+  bloom.insert(1);
+  BOOST_CHECK_EQUAL(bloom.count(), 1ul);
+  bloom.remove(1);
+  BOOST_CHECK_EQUAL(bloom.count(), 0ul);
+}
+
+BOOST_AUTO_TEST_CASE(countMulti)
+{
+  counting_bloom_filter<int, 100> bloom;
+
+  for (size_t i = 0; i < 100; ++i) {
+    bloom.insert(i);
+  }
+
+  BOOST_CHECK_EQUAL(bloom.count(), 100);
+
+  for (size_t i = 0; i < 100; ++i) {
+    bloom.insert(i);
+  }
+
+  BOOST_CHECK_EQUAL(bloom.count(), 100);
+}
+
+BOOST_AUTO_TEST_CASE(rangeConstructor) {
+  int elems[5] = {1,2,3,4,5};
+  counting_bloom_filter<int, NUM_BINS> bloom(elems, elems+5);
+
+  BOOST_CHECK_EQUAL(bloom.count(), 5ul);
+}
+
+#ifndef BOOST_NO_0X_HDR_INITIALIZER_LIST
+BOOST_AUTO_TEST_CASE(initListConstructor) {
+  counting_bloom_filter<int, NUM_BINS> bloom = {1,2,3,4,5};
+
+  BOOST_CHECK_EQUAL(bloom.count(), 5ul);
+}
+#endif
+
+BOOST_AUTO_TEST_CASE(copyConstructor) {
+  int elems[5] = {1,2,3,4,5};
+  counting_bloom_filter<int, NUM_BINS> bloom1(elems, elems+5);
+  counting_bloom_filter<int, NUM_BINS> bloom2(bloom1);
+
+  BOOST_CHECK_EQUAL(bloom1.count(), bloom2.count());
+}
+
+BOOST_AUTO_TEST_CASE(assignment)
+{
+  counting_bloom_filter<int, NUM_BINS> bloom1;
+  counting_bloom_filter<int, NUM_BINS> bloom2;
+
+  for (size_t i = 0; i < 200; ++i) {
+    bloom1.insert(i);
+    BOOST_CHECK_EQUAL(bloom1.probably_contains(i), true);
+  }
+
+  bloom2 = bloom1;
+
+  for (size_t i = 0; i < 200; ++i) {
+    BOOST_CHECK_EQUAL(bloom2.probably_contains(i), true);
+  }
+}
+
+BOOST_AUTO_TEST_CASE(bit_capacity) {
+  counting_bloom_filter<size_t, 8> bloom_8;
+  counting_bloom_filter<size_t, 256> bloom_256;
+  counting_bloom_filter<size_t, 2048> bloom_2048;
+  
+  BOOST_CHECK_EQUAL(bloom_8.bit_capacity(), 8ul * BITS_PER_BIN_DEFAULT);
+  BOOST_CHECK_EQUAL(bloom_256.bit_capacity(), 256ul * BITS_PER_BIN_DEFAULT);
+  BOOST_CHECK_EQUAL(bloom_2048.bit_capacity(), 2048ul * BITS_PER_BIN_DEFAULT);
+}
+
+BOOST_AUTO_TEST_CASE(empty) {
+  counting_bloom_filter<size_t, NUM_BINS> bloom;
+  
+  BOOST_CHECK_EQUAL(bloom.empty(), true);
+  bloom.insert(1);
+  BOOST_CHECK_EQUAL(bloom.empty(), false);
+  bloom.clear();
+  BOOST_CHECK_EQUAL(bloom.empty(), true);
+}
+
+BOOST_AUTO_TEST_CASE(numHashFunctions) {
+  counting_bloom_filter<size_t, NUM_BINS> bloom_1;
+  counting_bloom_filter<size_t, NUM_BINS, BITS_PER_BIN_TINY, boost::mpl::vector<
+    boost_hash<size_t, 1>,
+    boost_hash<size_t, 2> > > bloom_2;
+  counting_bloom_filter<size_t, NUM_BINS, BITS_PER_BIN_TINY, boost::mpl::vector<
+    boost_hash<size_t, 1>,
+    boost_hash<size_t, 2>,
+    boost_hash<size_t, 3>,
+    boost_hash<size_t, 4>,
+    boost_hash<size_t, 5>,
+    boost_hash<size_t, 6>,
+    boost_hash<size_t, 7> > > bloom_7;
+
+  BOOST_CHECK_EQUAL(bloom_1.num_hash_functions(), 1ul);
+  BOOST_CHECK_EQUAL(bloom_2.num_hash_functions(), 2ul);
+  BOOST_CHECK_EQUAL(bloom_7.num_hash_functions(), 7ul);
+}
+
+BOOST_AUTO_TEST_CASE(falsePositiveRate) {
+  counting_bloom_filter<size_t, 64> bloom;
+
+  BOOST_CHECK_EQUAL(bloom.false_positive_rate(), 0.0);
+
+  bloom.insert(1);
+  BOOST_CHECK_CLOSE(bloom.false_positive_rate(), 0.015504, .01);
+
+  bloom.insert(2);
+  BOOST_CHECK_CLOSE(bloom.false_positive_rate(), 0.030768, .01);
+
+  bloom.insert(3);
+  BOOST_CHECK_CLOSE(bloom.false_positive_rate(), 0.045794, .01);
+
+  bloom.insert(4);
+  BOOST_CHECK_CLOSE(bloom.false_positive_rate(), 0.060588, .01);
+
+  bloom.insert(5);
+  BOOST_CHECK_CLOSE(bloom.false_positive_rate(), 0.075151, .01);
+
+  bloom.insert(6);
+  BOOST_CHECK_CLOSE(bloom.false_positive_rate(), 0.089491, .01);
+
+  for (size_t i = 7; i < 5000; ++i)
+    bloom.insert(i);
+  
+  BOOST_CHECK_GE(bloom.false_positive_rate(), 0.6);
+  BOOST_CHECK_LE(bloom.false_positive_rate(), 1.0);
+}
+
+BOOST_AUTO_TEST_CASE(probably_contains) {
+  counting_bloom_filter<size_t, NUM_BINS> bloom;
+
+  bloom.insert(1);
+  BOOST_CHECK_EQUAL(bloom.probably_contains(1), true);
+  BOOST_CHECK_LE(bloom.count(), 3ul);
+  BOOST_CHECK_GE(bloom.count(), 1ul);
+}
+
+BOOST_AUTO_TEST_CASE(doesNotContain) {
+  counting_bloom_filter<size_t, NUM_BINS> bloom;
+
+  BOOST_CHECK_EQUAL(bloom.probably_contains(1), false);
+}
+
+BOOST_AUTO_TEST_CASE(insertNoFalseNegatives) {
+  counting_bloom_filter<size_t, 2048> bloom;
+
+  for (size_t i = 0; i < 100; ++i) {
+    bloom.insert(i);
+    BOOST_CHECK_EQUAL(bloom.probably_contains(i), true);
+  }
+}
+
+BOOST_AUTO_TEST_CASE(insertOverflowAsExpected) {
+  counting_bloom_filter<size_t, 8, BITS_PER_BIN_ONE> bloom;
+
+  bloom.insert(1);
+  BOOST_CHECK_EQUAL(bloom.probably_contains(1), true);
+  bloom.insert(1);
+  BOOST_CHECK_EQUAL(bloom.probably_contains(1), false);
+}
+
+BOOST_AUTO_TEST_CASE(rangeInsert) {
+  int elems[5] = {1,2,3,4,5};
+  counting_bloom_filter<size_t, NUM_BINS> bloom;
+
+  bloom.insert(elems, elems+5);
+  BOOST_CHECK_EQUAL(bloom.count(), 5ul);
+}
+
+BOOST_AUTO_TEST_CASE(remove) {
+  counting_bloom_filter<size_t, NUM_BINS> bloom;
+  
+  bloom.insert(1);
+  bloom.remove(1);
+  BOOST_CHECK_EQUAL(bloom.count(), 0ul);
+}
+
+BOOST_AUTO_TEST_CASE(removeMulti) {
+  counting_bloom_filter<size_t, 100> bloom;
+
+  for (size_t i = 0; i < 100; ++i) {
+    bloom.insert(i);
+    bloom.remove(i);
+    BOOST_CHECK_EQUAL(bloom.count(), 0ul);
+  }
+}
+
+BOOST_AUTO_TEST_CASE(rangeRemove) {
+  size_t arr[] = {1,2,3,4,5};
+  counting_bloom_filter<size_t, 100> bloom;
+
+  bloom.insert(arr, arr+5);
+  bloom.remove(arr, arr+5);
+  BOOST_CHECK_EQUAL(bloom.count(), 0ul);
+}
+
+BOOST_AUTO_TEST_CASE(clear) {
+  counting_bloom_filter<size_t, NUM_BINS> bloom;
+
+  for (size_t i = 0; i < 1000; ++i)
+    bloom.insert(i);
+
+  bloom.clear();
+  BOOST_CHECK_EQUAL(bloom.probably_contains(1), false);
+  BOOST_CHECK_EQUAL(bloom.count(), 0ul);
+}
+
+BOOST_AUTO_TEST_CASE(memberSwap) {
+  size_t elems[5] = {1,2,3,4,5};
+  counting_bloom_filter<size_t, NUM_BINS> bloom1(elems, elems+2);
+  counting_bloom_filter<size_t, NUM_BINS> bloom2(elems+2, elems+5);
+
+  bloom1.swap(bloom2);
+
+  BOOST_CHECK_EQUAL(bloom1.count(), 3ul);
+  BOOST_CHECK_EQUAL(bloom2.count(), 2ul);
+}
+
+BOOST_AUTO_TEST_CASE(testUnion) {
+  counting_bloom_filter<size_t, 300> bloom_1;
+  counting_bloom_filter<size_t, 300> bloom_2;
+  counting_bloom_filter<size_t, 300> bloom_union;
+
+  for (size_t i = 0; i < 100; ++i)
+    bloom_1.insert(i);
+
+  for (size_t i = 100; i < 200; ++i)
+    bloom_2.insert(i);
+
+  bloom_union = bloom_1 | bloom_2;
+
+  for (size_t i = 0; i < 200; ++i)
+    BOOST_CHECK_EQUAL(bloom_union.probably_contains(i), true);
+  BOOST_CHECK_GE(bloom_union.count(), bloom_1.count());
+  BOOST_CHECK_GE(bloom_union.count(), bloom_2.count());
+}
+
+BOOST_AUTO_TEST_CASE(testUnionAssign) {
+  counting_bloom_filter<size_t, 300> bloom_1;
+  counting_bloom_filter<size_t, 300> bloom_union;
+
+  for (size_t i = 0; i < 100; ++i) 
+    bloom_1.insert(i);
+
+  bloom_union |= bloom_1;
+
+  for (size_t i = 0; i < 100; ++i)
+    BOOST_CHECK_EQUAL(bloom_union.probably_contains(i), true);
+  BOOST_CHECK_EQUAL(bloom_union.count(), bloom_1.count());
+}
+
+BOOST_AUTO_TEST_CASE(testIntersect) {
+  counting_bloom_filter<size_t, 300> bloom_1;
+  counting_bloom_filter<size_t, 300> bloom_2;
+  counting_bloom_filter<size_t, 300> bloom_intersect;
+
+  // overlap at 100
+  for (size_t i = 0; i < 101; ++i) 
+    bloom_1.insert(i);
+  
+  for (size_t i = 100; i < 200; ++i) 
+    bloom_2.insert(i);
+
+  bloom_intersect = bloom_1 & bloom_2;
+
+  BOOST_CHECK_LE(bloom_intersect.count(), bloom_1.count());
+  BOOST_CHECK_LE(bloom_intersect.count(), bloom_2.count());
+  BOOST_CHECK_EQUAL(bloom_intersect.probably_contains(100), true);
+}
+
+BOOST_AUTO_TEST_CASE(testIntersectAssign) {
+  counting_bloom_filter<size_t, 300> bloom_1;
+  counting_bloom_filter<size_t, 300> bloom_intersect;
+
+  for (size_t i = 0; i < 100; ++i) 
+    bloom_1.insert(i);
+  
+  bloom_intersect &= bloom_1;
+
+  for (size_t i = 0; i < 100; ++i)
+    BOOST_CHECK_EQUAL(bloom_intersect.probably_contains(i), false);
+}
+
+BOOST_AUTO_TEST_CASE(globalSwap) {
+  size_t elems[5] = {1,2,3,4,5};
+  counting_bloom_filter<size_t, NUM_BINS> bloom1(elems, elems+2);
+  counting_bloom_filter<size_t, NUM_BINS> bloom2(elems+2, elems+5);
+
+  swap(bloom1, bloom2);
+
+  BOOST_CHECK_EQUAL(bloom1.count(), 3ul);
+  BOOST_CHECK_EQUAL(bloom2.count(), 2ul);
+}
+
+BOOST_AUTO_TEST_CASE(equalityOperator) {
+  counting_bloom_filter<int, NUM_BINS> bloom1;
+  counting_bloom_filter<int, NUM_BINS> bloom2;
+
+  BOOST_CHECK_EQUAL(bloom1 == bloom2, true);
+  bloom1.insert(1);
+  BOOST_CHECK_EQUAL(bloom1 == bloom2, false);
+  bloom2.insert(1);
+  BOOST_CHECK_EQUAL(bloom1 == bloom2, true);
+}
+
+BOOST_AUTO_TEST_CASE(inequalityOperator) {
+  counting_bloom_filter<int, NUM_BINS> bloom1;
+  counting_bloom_filter<int, NUM_BINS> bloom2;
+
+  BOOST_CHECK_EQUAL(bloom1 != bloom2, false);
+  bloom1.insert(1);
+  BOOST_CHECK_EQUAL(bloom1 != bloom2, true);
+  bloom2.insert(1);
+  BOOST_CHECK_EQUAL(bloom1 != bloom2, false);
+}