[Dcplusplus-commit] SF.net SVN: adchpp: [112] adchpp/trunk/plugins/Bloom/src

[<arn...@us...>]

Revision: 112
          http://adchpp.svn.sourceforge.net/adchpp/?rev=112&view=rev
Author:   arnetheduck
Date:     2007-12-26 06:55:44 -0800 (Wed, 26 Dec 2007)

Log Message:
-----------
Comment fixes

Modified Paths:
--------------
    adchpp/trunk/plugins/Bloom/src/HashBloom.cpp
    adchpp/trunk/plugins/Bloom/src/HashBloom.h

Modified: adchpp/trunk/plugins/Bloom/src/HashBloom.cpp
===================================================================
--- adchpp/trunk/plugins/Bloom/src/HashBloom.cpp	2007-12-23 20:30:27 UTC (rev 111)
+++ adchpp/trunk/plugins/Bloom/src/HashBloom.cpp	2007-12-26 14:55:44 UTC (rev 112)
@@ -29,11 +29,9 @@
 	}
 	for(size_t i = 0; i < k; ++i) {
 		if(!bloom[pos(tth, i)]) {
-			printf("no match\n");
 			return false;
 		}
 	}
-	printf("match\n");
 	return true;
 }
 

Modified: adchpp/trunk/plugins/Bloom/src/HashBloom.h
===================================================================
--- adchpp/trunk/plugins/Bloom/src/HashBloom.h	2007-12-23 20:30:27 UTC (rev 111)
+++ adchpp/trunk/plugins/Bloom/src/HashBloom.h	2007-12-26 14:55:44 UTC (rev 112)
@@ -15,7 +15,7 @@
  */
 class HashBloom {
 public:
-	/** Return the largest k such that get_m returns a value smaller than 2^(TTHValue::SIZE/k) */
+	/** Return a suitable value for k based on n */
 	static size_t get_k(size_t n);
 	/** Optimal number of bits to allocate for n elements when using k hashes */
 	static uint64_t get_m(size_t n, size_t k);


This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.