The Standard Template Library (STL) supplies the programmer with container classes that help with applications requiring frequent and quick searches. The
std::multiset are used to contain a sorted set of elements and offer you the ability to find elements given a logarithmic complexity. Their unordered counterparts offer constant-time insertion and search capabilities.
This lesson includes
• How STL
unordered_multiset containers can be of use to you
• Insertion, removal, and search of elements
• Advantages and disadvantages in using these containers
multiset are containers that facilitate a quick lookup of keys in a container ...