Question

{ // 3d: Search for an element in a binary search tree std::map<std::string, Book> dataStructureUnderTest; const auto target_isbn = std::string("non-existent"); measure( "BST", "Search", [&](const Book & book) {dataStructureUnderTest.emplace(book.isbn(), book);}, [&] (auto&) -> Book * /////// TO-DO (18) ////////////////////////////// /// Write the lines of code (approximately 3 or 4) to search for the Book within the data structure under test with a ISBN /// matching "target_isbn". Return a pointer to the 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 (18) ///// ///// Collect Hash Table Measurements void collect_HashTable_measurements() { { // 1e: Insert into a hash table } std::unordered_map<std::string, Book> dataStructureUnderTest; measure( "Hash Table", "Insert", [&] (const Book & book ) { ///////////////////////// TO-DO (19) ////////////////////////////// /// Write the line of code to insert the key (ISBN) and value (book) into the data structure under test. You may use /// either the subscript operator, emplace, or insert function. /////////////////////// END-TO-DO (19) //////////////////////////// });

          { // 3d: Search for an element in a binary search tree
std::map<std::string, Book> dataStructureUnderTest;
const auto
target_isbn = std::string("non-existent");
measure( "BST", "Search", [&](const Book & book) {dataStructureUnderTest.emplace(book.isbn(), book);}, [&] (auto&) -> Book *
/////// TO-DO (18) //////////////////////////////
/// Write the lines of code (approximately 3 or 4) to search for the Book within the data structure under test with a ISBN
/// matching "target_isbn". Return a pointer to the 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 (18) /////
/////
Collect Hash Table Measurements
void collect_HashTable_measurements()
{
{ // 1e: Insert into a hash table
}
std::unordered_map<std::string, Book> dataStructureUnderTest;
measure( "Hash Table", "Insert", [&] (const Book & book ) {
///////////////////////// TO-DO (19) //////////////////////////////
/// Write the line of code to insert the key (ISBN) and value (book) into the data structure under test. You may use
/// either the subscript operator, emplace, or insert function.
/////////////////////// END-TO-DO (19) ////////////////////////////
});

// 3d: Search for an element in a binary search tree
std::map<std::string, Book> dataStructureUnderTest;
const auto
targetisbn = std::string("non-existent");
measure( "BST", "Search", [ ](const Book book) dataStructureUnderTest.emplace(book.isbn(), book);, [ ] (auto ) -> Book *
/////// TO-DO (18) //////////////////////////////
/// Write the lines of code (approximately 3 or 4) to search for the Book within the data structure under test with a ISBN
/// matching "targetisbn". Return a pointer to the 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 (18) /////
/////
Collect Hash Table Measurements
void collectHashTablemeasurements()

// 1e: Insert into a hash table

std::unorderedmap<std::string, Book> dataStructureUnderTest;
measure( "Hash Table", "Insert", [ ] (const Book book )
///////////////////////// TO-DO (19) //////////////////////////////
/// Write the line of code to insert the key (ISBN) and value (book) into the data structure under test. You may use
/// either the subscript operator, emplace, or insert function.
/////////////////////// END-TO-DO (19) ////////////////////////////
);

Added by Michael G.

Question

Please give Ace some feedback