struct search_within_hash_table { // Function takes no parameters, searches a hash table for a book with an ISBN // matching the target ISBN, and returns a pointer to that found book if such // a book is found, nullptr otherwise. Book* operator()(const Book& unused) { // TO-DO (21) | // Write the lines of code to search for the Book within "my_hash_table" // with an ISBN matching "target_isbn". Return a pointer to that book // immediately upon finding it, or a null pointer when you know the book is // not in the container. // // NOTE: Do not implement a linear search, i.e., do not loop from beginning // to end. ///// END-TO–DO (21) |||/ } std::unordered_map& my_hash_table; const std::string target_isbn;

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
struct search_within_hash_table {
// Function takes no parameters, searches a hash table for a book with an ISBN
// matching the target ISBN, and returns a pointer to that found book if such
// a book is found, nullptr otherwise.
Book* operator()(const Book& unused) {
//// TO-DO (21) |||
(/ ////
// Write the lines of code to search for the Book within "my_hash_table"
// with an ISBN matching "target_isbn". Return a pointer to that book
// immediately upon finding it, or a null pointer when you know the book is
// not in the container.
//
// NOTE: Do not implement a linear search, i.e., do not loop from beginning
// to end.
///// END-TO-DO (21) |||//
////
}
std::unordered_map<std::string, Book>& my_hash_table;
const std::string target_isbn;
};
Transcribed Image Text:struct search_within_hash_table { // Function takes no parameters, searches a hash table for a book with an ISBN // matching the target ISBN, and returns a pointer to that found book if such // a book is found, nullptr otherwise. Book* operator()(const Book& unused) { //// TO-DO (21) ||| (/ //// // Write the lines of code to search for the Book within "my_hash_table" // with an ISBN matching "target_isbn". Return a pointer to that book // immediately upon finding it, or a null pointer when you know the book is // not in the container. // // NOTE: Do not implement a linear search, i.e., do not loop from beginning // to end. ///// END-TO-DO (21) |||// //// } std::unordered_map<std::string, Book>& my_hash_table; const std::string target_isbn; };
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY