In std::multiset is there a function or algorithm to erase just one sample (unicate or duplicate) if an element is found

c++ stl multiset
Martin picture Martin · Feb 6, 2012 · Viewed 36.2k times · Source

Perhaps this is a duplicate but I did not find anything searching: When erase(value) is called on std::multiset all elements with the value found are deleted. The only solution I could think of is:

std::multiset<int>::iterator hit(mySet.find(5));
if (hit!= mySet.end()) mySet.erase(hit);

This is ok but I thought there might be better. Any Ideas ?

Answer

user2251346 picture user2251346 · Jul 12, 2016 
auto itr = my_multiset.find(value);
if(itr!=my_multiset.end()){
    my_multiset.erase(itr);
}

I would imagine there is a cleaner way of accomplishing the same. But this gets the job done.

Related questions

What are the meaning of template parameters A, B of std::multiset<A,B> respectively, and how does it work?

I have asked in another question about std::multiset, but now I see I need a decent understanding and cannot find any more complicated example in the internet. Can you explain to me, maybe exemplarize, how std::multiset<A,…

Read More
"multiset" & "multimap" - What's the point?

As the question states ... I don't get the point about multisets / multimaps. So, what's the purpose?

Read More
What is the easiest way to initialize a std::vector with hardcoded elements?

I can create an array and initialize it like this: int a[] = {10, 20, 30}; How do I create a std::vector and initialize it similarly elegant? The best way I know is: std::vector<int> ints; ints.push_back(10); ints.…

Read More