C++ feature, like std::set, which allows duplicates

c++ list c++11 std-pair stdset
gsamaras picture gsamaras · Jan 20, 2014 · Viewed 7.6k times · Source

I have an std::set, which stores std::pairs of two integers. The std::set is also sorted, by allowing me to pass a helping class. However, I have written many lines of code so far and now, at the last tests, "they" told me something, that actually means that I need to allow possible duplicates in the std::set. Of course this isn't done with std::set. Any alternative that will not make me change the whole-big project?

In short, I use the std::set as an ordered list with data an std::pair of two ints.

Answer

R Sahu picture R Sahu · Jan 20, 2014

You can use std::multiset. That should work for what you are describing.

Related questions

vector vs. list in STL

I noticed in Effective STL that vector is the type of sequence that should be used by default. What's does it mean? It seems that ignore the efficiency vector can do anything. Could anybody offer me a scenario where vector …

Read More
How to get a certain element in a list, given the position?

So I've got a list: list<Object> myList; myList.push_back(Object myObject); I'm not sure but I'm confident that this would be the "0th" element in the array. Is there any function I can use that will …

Read More
Can you remove elements from a std::list while iterating through it?

I've got code that looks like this: for (std::list<item*>::iterator i=items.begin();i!=items.end();i++) { bool isActive = (*i)->update(); //if (!isActive) // items.remove(*i); //else other_code_involving(*i); } items.remove_if(…

Read More