[Boost-commit] svn:boost r39021 - sandbox/unordered/libs/unordered/doc

From: daniel_james_at_[hidden]
Date: 2007-08-27 17:08:55

Author: danieljames
Date: 2007-08-27 17:08:54 EDT (Mon, 27 Aug 2007)
New Revision: 39021
URL: http://svn.boost.org/trac/boost/changeset/39021

Log:
Back to using quickbook 1.4 for the documentation.
Text files modified: 
   sandbox/unordered/libs/unordered/doc/comparison.qbk    |     4 +++-                                    
   sandbox/unordered/libs/unordered/doc/hash_equality.qbk |    34 +++-------------------------------      
   sandbox/unordered/libs/unordered/doc/unordered.qbk     |     2 +-                                      
   3 files changed, 7 insertions(+), 33 deletions(-)

Modified: sandbox/unordered/libs/unordered/doc/comparison.qbk
==============================================================================
--- sandbox/unordered/libs/unordered/doc/comparison.qbk	(original)
+++ sandbox/unordered/libs/unordered/doc/comparison.qbk	2007-08-27 17:08:54 EDT (Mon, 27 Aug 2007)
@@ -14,7 +14,9 @@
     ]
     [
         [`Compare` exposed by member typedef `key_compare`, accessed by member function `key_comp()`]
-        [`Hash` exposed by member typedef `hasher`, accessed by member function `hash_function()`.\n`Pred` by member typedef `key_equal` and member function `key_eq()`.]
+        [`Hash` exposed by member typedef `hasher`, accessed by member function `hash_function()`.
+
+         `Pred` by member typedef `key_equal` and member function `key_eq()`.]
     ]
     [
         [Member typedef `value_compare` supplies an ordering comparison for member elements, accessed by member function `value_comp()`.]

Modified: sandbox/unordered/libs/unordered/doc/hash_equality.qbk
==============================================================================
--- sandbox/unordered/libs/unordered/doc/hash_equality.qbk	(original)
+++ sandbox/unordered/libs/unordered/doc/hash_equality.qbk	2007-08-27 17:08:54 EDT (Mon, 27 Aug 2007)
@@ -32,37 +32,9 @@
 sure you use a hash function that matches it. So to implement a
 case-insensitive dictionary:
 
-    struct iequal_to
-        : std::binary_function<std::string, std::string, bool>
-    {
-        bool operator()(std::string const& x,
-            std::string const& y) const
-        {
-            return boost::algorithm::iequals(x, y);
-        }
-    };
-
-    struct ihash
-        : std::unary_function<std::string, bool>
-    {
-        bool operator()(std::string const& x) const
-        {
-            std::size_t seed = 0;
-
-            for(std::string::const_iterator it = x.begin();
-                it != x.end(); ++it)
-            {
-                boost::hash_combine(seed, std::toupper(*it));
-            }
-
-            return seed;
-        }
-    };
-
-    struct word_info;
-
-    boost::unordered_map<std::string, word_info, ihash, iequal_to>
-        idictionary;
+[import src_code/insensitive.cpp] 
+[case_insensitive_functions] 
+[case_insensitive_dictionary] 
 
 A more generic version is available at:
 [@../../libs/unordered/examples/case_insensitive.hpp /libs/unordered/examples/case_insensitive.hpp]

Modified: sandbox/unordered/libs/unordered/doc/unordered.qbk
==============================================================================
--- sandbox/unordered/libs/unordered/doc/unordered.qbk	(original)
+++ sandbox/unordered/libs/unordered/doc/unordered.qbk	2007-08-27 17:08:54 EDT (Mon, 27 Aug 2007)
@@ -3,7 +3,7 @@
  / file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) ]
 
 [library Unordered Associative Containers
-    [quickbook 1.3]
+    [quickbook 1.4]
     [authors [Maitin-Shepard, Jeremy B.], [James, Daniel]]
     [copyright 2005 2007 Daniel James]
     [purpose std::tr1 compliant hash containers]