2005-04-11 22:26:01 +00:00
|
|
|
|
Merge hash and unordered changes.
Remove deprecated headers, move hash_fwd.hpp into hash subdirectory. And
several minor internal changes.
Mostly minor internal details.
Merged revisions 51262-51263,51407-51409,51504-51505,51644-51646,51667 via svnmerge from
https://svn.boost.org/svn/boost/trunk
........
r51262 | danieljames | 2009-02-15 19:32:04 +0000 (Sun, 15 Feb 2009) | 1 line
Use the new 'boost:' links for the hash, unordered and quickbook documentation.
........
r51263 | danieljames | 2009-02-15 19:32:19 +0000 (Sun, 15 Feb 2009) | 2 lines
Don't copy images for the standalone hash and unordered documentation, was only
really required before the libraries were integrated into boost.
........
r51407 | danieljames | 2009-02-22 23:49:51 +0000 (Sun, 22 Feb 2009) | 1 line
Fix the hash dirname.
........
r51408 | danieljames | 2009-02-22 23:50:04 +0000 (Sun, 22 Feb 2009) | 1 line
Make copy_buckets and move_buckets member functions - so that calling them is a bit simpler.
........
r51409 | danieljames | 2009-02-22 23:50:20 +0000 (Sun, 22 Feb 2009) | 1 line
Move some of the data structure classes out of hash table data.
........
r51504 | danieljames | 2009-03-01 14:15:09 +0000 (Sun, 01 Mar 2009) | 1 line
Add missing return for operator=.
........
r51505 | danieljames | 2009-03-01 14:15:39 +0000 (Sun, 01 Mar 2009) | 3 lines
Make the sort stable.
Doesn't really matter, but it might as well be.
........
r51644 | danieljames | 2009-03-08 09:44:51 +0000 (Sun, 08 Mar 2009) | 1 line
Detab.
........
r51645 | danieljames | 2009-03-08 09:45:11 +0000 (Sun, 08 Mar 2009) | 4 lines
Move hash_fwd into the hash subdirectory.
I should have done this in the last release. But now all of the hash
implementation is in the hash subdirectory.
........
r51646 | danieljames | 2009-03-08 09:45:30 +0000 (Sun, 08 Mar 2009) | 3 lines
Remove deprecated headers.
Fixes #2412.
........
r51667 | danieljames | 2009-03-09 20:56:23 +0000 (Mon, 09 Mar 2009) | 1 line
Update copyright dates in hash and unordered.
........
[SVN r51729]
2009-03-11 22:51:09 +00:00
|
|
|
// Copyright 2005-2009 Daniel James.
|
2007-11-25 18:38:02 +00:00
|
|
|
// Distributed under the Boost Software License, Version 1.0. (See accompanying
|
|
|
|
|
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
2005-04-11 22:26:01 +00:00
|
|
|
|
2005-04-20 15:02:00 +00:00
|
|
|
#include "./books.hpp"
|
2005-04-11 22:26:01 +00:00
|
|
|
#include <boost/functional/hash.hpp>
|
|
|
|
|
#include <cassert>
|
|
|
|
|
|
2005-04-20 15:02:00 +00:00
|
|
|
// If std::unordered_set was available:
|
|
|
|
|
//#include <unordered_set>
|
|
|
|
|
|
2005-04-11 22:26:01 +00:00
|
|
|
// This example illustrates how to use boost::hash with a custom hash function.
|
|
|
|
|
// For full details, see the tutorial.
|
|
|
|
|
|
|
|
|
|
int main()
|
|
|
|
|
{
|
|
|
|
|
library::book knife(3458, "Zane Grey", "The Hash Knife Outfit");
|
|
|
|
|
library::book dandelion(1354, "Paul J. Shanley", "Hash & Dandelion Greens");
|
|
|
|
|
|
|
|
|
|
boost::hash<library::book> book_hasher;
|
|
|
|
|
std::size_t knife_hash_value = book_hasher(knife);
|
2009-11-29 16:14:10 +00:00
|
|
|
(void)knife_hash_value; // suppress unused variable warning
|
2005-04-11 22:26:01 +00:00
|
|
|
|
2005-04-20 15:02:00 +00:00
|
|
|
// If std::unordered_set was available:
|
2005-04-11 22:26:01 +00:00
|
|
|
//
|
|
|
|
|
//std::unordered_set<library::book, boost::hash<library::book> > books;
|
|
|
|
|
//books.insert(knife);
|
|
|
|
|
//books.insert(library::book(2443, "Lindgren, Torgny", "Hash"));
|
|
|
|
|
//books.insert(library::book(1953, "Snyder, Bernadette M.",
|
|
|
|
|
// "Heavenly Hash: A Tasty Mix of a Mother's Meditations"));
|
|
|
|
|
|
|
|
|
|
//assert(books.find(knife) != books.end());
|
|
|
|
|
//assert(books.find(dandelion) == books.end());
|
2005-08-22 19:16:47 +00:00
|
|
|
|
|
|
|
|
return 0;
|
2005-04-11 22:26:01 +00:00
|
|
|
}
|
2005-04-20 15:02:00 +00:00
|
|
|
|
|
|
|
|
namespace library
|
|
|
|
|
{
|
|
|
|
|
bool operator==(book const& a, book const& b)
|
|
|
|
|
{
|
|
|
|
|
return a.id == b.id;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
std::size_t hash_value(book const& b)
|
|
|
|
|
{
|
|
|
|
|
boost::hash<int> hasher;
|
|
|
|
|
return hasher(b.id);
|
|
|
|
|
}
|
|
|
|
|
}
|