Summary
Full Transcript
►Full C++ Series Playlist: https://www.youtube.com/playlist?list=PLvv0ScY6vfd8j-tlhYVPYgiIyXduu6m-L ►Find full courses on: https://courses.mshah.io/ ►Join as Member to Support the channel: https://www.youtube.com/channel/UCA64pZbN5Mz5NxC3SO4qpDg/join ►Lesson Description: In this lesson I will show you how to use the unordered_map which is very similar to map but offers average-cast constant time insertion lookup, and deletion.. The difference with this data structure (versus a std::map) is that the underlying data structure is a hash_table (similar to unordered_set versus set) versus a red-black tree. I'll show you how to use a few other functions like find, erase, and insert, as well as how to write your own hash function and quality operator if you use keys that are not part of the STL or otherwise trivial. ►YouTube Channel: https://www.youtube.com/c/MikeShah ►Please like and subscribe to help the channel! ►Join our free community: https://courses.mshah.io/communities/Q29tbXVuaXR5LTI3MzAz
Continue this lesson in the app
Install CourseHive on Android or iOS to keep learning while you move.
