[Boost-commit] svn:boost r72530 - sandbox/bloom_filter/trunk/libs/bloom_filter/doc/html

Subject: [Boost-commit] svn:boost r72530 - sandbox/bloom_filter/trunk/libs/bloom_filter/doc/html
From: cpp.cabrera_at_[hidden]
Date: 2011-06-09 19:06:33

Author: alejandro
Date: 2011-06-09 19:06:33 EDT (Thu, 09 Jun 2011)
New Revision: 72530
URL: http://svn.boost.org/trac/boost/changeset/72530

Log:
Added various sections to the table of contents. Added a few sections to the reference - still need to decide on reference format.
Text files modified: 
   sandbox/bloom_filter/trunk/libs/bloom_filter/doc/html/index.html     |     7 +++++--                                 
   sandbox/bloom_filter/trunk/libs/bloom_filter/doc/html/reference.html |     9 +++++++--                               
   2 files changed, 12 insertions(+), 4 deletions(-)

Modified: sandbox/bloom_filter/trunk/libs/bloom_filter/doc/html/index.html
==============================================================================
--- sandbox/bloom_filter/trunk/libs/bloom_filter/doc/html/index.html	(original)
+++ sandbox/bloom_filter/trunk/libs/bloom_filter/doc/html/index.html	2011-06-09 19:06:33 EDT (Thu, 09 Jun 2011)
@@ -37,17 +37,20 @@
       <ul>
         <li>Introduction</li>
         <li>Tutorial</li>
-	<li>Design</li>
         <li>Miscellaneous</li>
         <li>Reference</li>
+	<li>Testing</li>
         <li>Bibliography</li>
+	<li>Version History</li>
+	<li>Design</li>
+	<li>Acknowledgements</li>
       </ul>
     </div>
 
     <a name="introduction"></a>
     <h2>Introduction</h2>
     <p>
-      A Bloom filter is a probabilistic data structures that allows the compact representation of a set of elements. Bloom filters are used where an application can gain a performance advantage by avoiding an expensive lookup. For example, one might use a Bloom filter to ask whether a file may be stored on the network. If the Bloom filter returns false, the network lookup can be skipped. A few known applications of Bloom filters:
+      A Bloom filter is a probabilistic data structure that allows the compact representation of a set of elements. Bloom filters are used where an application can gain a performance advantage by avoiding an expensive lookup. For example, one might use a Bloom filter to ask whether a file may be stored on the network. If the Bloom filter returns false, the network lookup can be skipped. A few known applications of Bloom filters:
     </p>
     <ul>
       <li>Google BigTable: check whether particular rows/columns exist - improves query performance</li>

Modified: sandbox/bloom_filter/trunk/libs/bloom_filter/doc/html/reference.html
==============================================================================
--- sandbox/bloom_filter/trunk/libs/bloom_filter/doc/html/reference.html	(original)
+++ sandbox/bloom_filter/trunk/libs/bloom_filter/doc/html/reference.html	2011-06-09 19:06:33 EDT (Thu, 09 Jun 2011)
@@ -39,10 +39,15 @@
     
     <div class="toc">
       <ul>
-	<li>bloom.hpp</li>
+	<li><a href="reference/bloom_hpp.html">
+	boost/bloom_filter/bloom.hpp</a></li>
+	<li><a href="reference/hash/defaul_hpp.html">
+	boost/bloom_filter/hash/default.hpp</a></li>
+	<li><a href="reference/detail/apply_hash_hpp.html">
+	boost/bloom_filter/detail/apply_hash.hpp</a></li>
       </ul>
     </div>
-
+    
     <hr/>
     <div class="spirit-nav">
       <a accesskey="p" href="misc.html">