I understand that std::multimap has the following hash table structure for the purpose of looking at it (it is listed...) (data structure is tree structure).
What should I do if I want to delete only DATA_A?
This is because it seems that only the key is used to delete elements that can be multi-imap, and the value cannot be deleted.
In the first place, is there a mechanism in multimap that removes values instead of keys and automatically packs empty parts?
Thank you for your cooperation.
Reference URL: http://vivi.dyndns.org/tech/cpp/multimap.htmlc++
You can delete elements that you have already commented on in
For example, if you have a function like this, you can erase it, but if you can't find a pair or if you find more than one data, the design will change depending on the situation.
(That's why STL only provided basic functions such as deleting with
© 2022 OneMinuteCode. All rights reserved.