⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 books.cpp

📁 Boost provides free peer-reviewed portable C++ source libraries. We emphasize libraries that work
💻 CPP
字号:
// 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);    }}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -