forked from boostorg/unordered
Remove use of quickbook 1.4 features from unordered container documentation,
so it'll build with quickbook 1.3 (will put them back soon-ish). [SVN r3995]
This commit is contained in:
1 parent
507cc3c059
commit
452ab8cf30
2 files changed
+32
-7
No files matched your search
+31
-3
@@ -34,9 +34,37 @@ Alternatively, you might wish to use a different equality function. If so, make
|
||||
sure you use a hash function that matches it. For example, a
|
||||
case-insensitive dictionary:
|
||||
|
||||
[import src_code/insensitive.cpp]
|
||||
[case_insensitive_functions]
|
||||
[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;
|
||||
|
||||
A more generic version of this example is available at:
|
||||
[@../../libs/unordered/examples/case_insensitive.hpp /libs/unordered/examples/case_insensitive.hpp]
|
||||
|
||||
Reference in new issue
Block a user