JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

formatting

Browse Source
This commit is contained in:
Jidong Xiao
2023-11-06 21:26:25 -05:00
parent 9d1d3f56d3
commit 413aa72495
1 changed files with 3 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
lectures/20_hash_tables_I/README.md
View File

@@ -219,7 +219,7 @@ More generally, the jth “probe” of the table is (i + c<sub>1</sub>j + c<sub>
- The Standard Template Library standard and implementation of hash table have been slowly evolving over - The Standard Template Library standard and implementation of hash table have been slowly evolving over
many years. Unfortunately, the names “hashset” and “hashmap” were spoiled by developers anticipating the many years. Unfortunately, the names “hashset” and “hashmap” were spoiled by developers anticipating the
STL standard, so to avoid breaking or having name clashes with code using these early implementations... STL standard, so to avoid breaking or having name clashes with code using these early implementations...
- STL’s agreed-upon standard for hash tables: unordered set and unordered map - STL’s agreed-upon standard for hash tables: unordered_set and unordered_map.
- Depending on your OS/compiler, you may need to add the -std=c++11 flag to the compile line (or other - Depending on your OS/compiler, you may need to add the -std=c++11 flag to the compile line (or other
configuration tweaks) to access these more recent pieces of STL. (And this will certainly continue to evolve configuration tweaks) to access these more recent pieces of STL. (And this will certainly continue to evolve
in future years!) Also, for many types STL has a good default hash function, so you may not always need to in future years!) Also, for many types STL has a good default hash function, so you may not always need to
@@ -281,10 +281,8 @@ ds_hashset<std::string, hash_string_obj> my_hashset;
## 20.15 Hash Set Iterators ## 20.15 Hash Set Iterators
- Iterators move through the hash table in the order of the storage locations rather than the ordering imposed - Iterators move through the hash table in the order of the storage locations rather than the ordering imposed by (say) an operator<. Thus, the visiting/printing order depends on the hash function and the table size.
by (say) an operator<. Thus, the visiting/printing order depends on the hash function and the table size. - Hence the increment operators must move to the next entry in the current linked list or, if the end of the current list is reached, to the first entry in the next non-empty list.
– Hence the increment operators must move to the next entry in the current linked list or, if the end of the
current list is reached, to the first entry in the next non-empty list.
- The declaration is nested inside the ds_hashset declaration in order to avoid explicitly templating the iterator - The declaration is nested inside the ds_hashset declaration in order to avoid explicitly templating the iterator
over the hash function type. over the hash function type.
- The iterator must store: - The iterator must store: