STL std::multiset (And how to compare non-trivial types) | Modern Cpp Series Ep. 123

Описание к видео STL std::multiset (And how to compare non-trivial types) | Modern Cpp Series Ep. 123

►Full C++ Series Playlist:    • The C++ Programming Language  
►Find full courses on: https://courses.mshah.io/
►Join as Member to Support the channel:    / @mikeshah  

►Lesson Description: In this lesson I give you an introduction to the std::multiset data structure which is an ordered data structure like the set, but it allows for duplicate elements. This data structure typically uses a red-black tree for logarithmic time operations for lookup, insertion, and removal. I'll spend some time also showing how to implement a custom comparison using less than operator overloading and a functor for a less trivial data type.

►YouTube Channel:    / mikeshah  
►Please like and subscribe to help the channel!
►Join our free community: https://courses.mshah.io/communities/...

Комментарии

Информация по комментариям в разработке