boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2025-07-31 11:57:15 +02:00
Code Issues Packages Projects Releases Wiki Activity

Back to using quickbook 1.4 for the documentation.

Browse Source 
[SVN r39021]
This commit is contained in:
Daniel James
2007-08-27 21:08:54 +00:00
parent 58c7bb031c
commit 2cd1659c33
3 changed files with 7 additions and 33 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
doc/comparison.qbk
View File

@@ -14,7 +14,9 @@
] ]
[ [
[`Compare` exposed by member typedef `key_compare`, accessed by member function `key_comp()`] [`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()`.] [Member typedef `value_compare` supplies an ordering comparison for member elements, accessed by member function `value_comp()`.]

34
doc/hash_equality.qbk
View File

@@ -32,37 +32,9 @@ Alternatively, you might wish to use a different equality function. If so, make
sure you use a hash function that matches it. So to implement a sure you use a hash function that matches it. So to implement a
case-insensitive dictionary: case-insensitive dictionary:
struct iequal_to [import src_code/insensitive.cpp]
: std::binary_function<std::string, std::string, bool> [case_insensitive_functions]
{ [case_insensitive_dictionary]
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;
A more generic version is available at: A more generic version is available at:
[@../../libs/unordered/examples/case_insensitive.hpp /libs/unordered/examples/case_insensitive.hpp] [@../../libs/unordered/examples/case_insensitive.hpp /libs/unordered/examples/case_insensitive.hpp]

2
doc/unordered.qbk
View File

@@ -3,7 +3,7 @@
/ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) ] / file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) ]
[library Unordered Associative Containers [library Unordered Associative Containers
[quickbook 1.3] [quickbook 1.4]
[authors [Maitin-Shepard, Jeremy B.], [James, Daniel]] [authors [Maitin-Shepard, Jeremy B.], [James, Daniel]]
[copyright 2005 2007 Daniel James] [copyright 2005 2007 Daniel James]
[purpose std::tr1 compliant hash containers] [purpose std::tr1 compliant hash containers]