Subject: [Boost-commit] svn:boost r72660 - sandbox/bloom_filter/trunk/libs/bloom_filter/doc/html
Date: 2011-06-17 21:47:51
Date: 2011-06-17 21:47:51 EDT (Fri, 17 Jun 2011)
New Revision: 72660
Made use of term Hasher more apparent in tutorial.
Text files modified:
sandbox/bloom_filter/trunk/libs/bloom_filter/doc/html/tutorial.html | 2 +-
1 files changed, 1 insertions(+), 1 deletions(-)
--- sandbox/bloom_filter/trunk/libs/bloom_filter/doc/html/tutorial.html (original)
+++ sandbox/bloom_filter/trunk/libs/bloom_filter/doc/html/tutorial.html 2011-06-17 21:47:51 EDT (Fri, 17 Jun 2011)
@@ -103,7 +103,7 @@
In practice, where false positive rates matter a great deal, care must be taken to choose not
- only the right bitset Size, but also the right number (and implementation) of hash functions.
+ only the right bitset Size, but also the right number (and implementation) of hash functions (Hahsers).
This is where the last template parameter comes in, as well as the remaining member functions.
To use the Bloom filter to its maximum potential, you must understand how to customize
these remaining parameters.
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk