mirror of
https://github.com/boostorg/container_hash.git
synced 2026-01-26 00:52:34 +01:00
https://svn.boost.org/svn/boost/branches/unordered/trunk ........ r43840 | danieljames | 2008-03-24 17:25:07 +0000 (Mon, 24 Mar 2008) | 1 line Fix a g++ warning. ........ r43844 | danieljames | 2008-03-24 17:56:28 +0000 (Mon, 24 Mar 2008) | 1 line It's a new-ish year. ........ r43885 | danieljames | 2008-03-27 20:36:10 +0000 (Thu, 27 Mar 2008) | 1 line The release script doesn't need to copy images and css - because that's now done in the jamfiles. Also tweak the shell script a tad bit. ........ r43890 | danieljames | 2008-03-27 23:01:40 +0000 (Thu, 27 Mar 2008) | 1 line Starting to add a docbook bibliography. ........ r43894 | danieljames | 2008-03-27 23:24:18 +0000 (Thu, 27 Mar 2008) | 1 line Redeclare 'data' in iterator_base to help compilers which have trouble with accessing the nested typedef. ........ [SVN r43895]
51 lines
1.4 KiB
C++
51 lines
1.4 KiB
C++
|
|
// Copyright 2005-2008 Daniel James.
|
|
// 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)
|
|
|
|
#include "./books.hpp"
|
|
#include <boost/functional/hash.hpp>
|
|
#include <cassert>
|
|
|
|
// If std::unordered_set was available:
|
|
//#include <unordered_set>
|
|
|
|
// 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);
|
|
|
|
// If std::unordered_set was available:
|
|
//
|
|
//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());
|
|
|
|
return 0;
|
|
}
|
|
|
|
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);
|
|
}
|
|
}
|