From 6df56ced384daa0b91c05f5f41a8e96fd54fc3d7 Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Thu, 9 Nov 2023 16:33:18 -0500 Subject: [PATCH] line break --- lectures/21_hash_tables_II/README.md | 5 ----- 1 file changed, 5 deletions(-) diff --git a/lectures/21_hash_tables_II/README.md b/lectures/21_hash_tables_II/README.md index 1bc38a3..73294dc 100644 --- a/lectures/21_hash_tables_II/README.md +++ b/lectures/21_hash_tables_II/README.md @@ -113,12 +113,10 @@ if (itr != my_data.end()) { ## 21.5 Using STL’s Associative Hash Table (Map) - Using the default std::string hash function. - - With no specified initial table size. (map a std::string type key to a class Foo type value) ```cpp std::unordered_map m; ``` - - Optionally specifying initial (minimum) table size. ```cpp std::unordered_map m(1000); @@ -128,18 +126,15 @@ std::unordered_map m(1000); ```cpp std::unordered_map > m(1000, MyHashFunction); ``` - - Using the decltype specifier to get the “declared type of an entity”. ```cpp std::unordered_map m(1000, MyHashFunction); ``` - Using a home-made std::string hash functor or function object. - - With no specified initial table size. ```cpp std::unordered_map m; ``` - - Optionally specifying initial (minimum) table size. ```cpp std::unordered_map m(1000);