Skip to main content

STL - Map keys difference

Today, I would like to show how to quickly find difference between two maps of STL library basing on keys only. We need to compare two maps of STL library and find third map which will contain only those elements of first map which keys are not being placed within second map.

Take a look on code: Output of this code is:

In point I we are defining struct type having overloaded of operator(). This structure will be used as function object to compare two elements of maps (std::pair) basing on keys only.

In point II we are defining two maps which will be compared. We are going to receive all std::pairs from firstMap which keys are not being placed within secondMap.

In point II we are declaring diffMap map which will contain result of our differentiation.

Point IV is key point of our function. In that point we are using std::set_difference algorithm. This algorithm returns difference of two ranges of STL containers. First 4 arguments are begins and ends of two ranges of containers which should be compared. 5th argument is inserter of different element. This inserter will fulfill our diffMap map which will contain difference which we are looking for. For most of STL containers those 5 arguments are enough for comparison and finding difference. However if want to compare keys of map only, we need to redefine our comparison function. In order to do that we are using overloaded operator() of struct comparatorStruct defined in point I.

That's it. In point V we are displaying our difference map using C++11 auto type.

As usual, if you would like to download that code and compile it you can find it (as other codes used in this blog) on our github account here: mapKeysDifference
Labels:

Comments

  1. developer5 December 2013 at 21:26

    Thanks for this example. It helped me today in part of my project.

    ReplyDelete

Post a Comment

Popular posts from this blog

Blog's new layout

As you noticed this blog has new layout from today. I hope you like it. I think new layout looks better and more modern than previous one. Please, write you opinion about new layout in comments. If you have some ideas how to make this blog better, all ideas are welcomed. Enjoy new layout and blog articles.
3 comments
Read more

QT - foreach algoriithm with const references performance improvement

Today I would like to show you optimal way of using foreach QT algorithm . I will show you why we should pass elements of foreach algorithm by const reference instead of passing them by value. Let me explain it on the below example: Output of this example is: In point I we are creating 3 objects of MyClass class and push them to myClasses QList element. In point II we are using QT foreach algorithm to invoke getValue() method for each object from myClasses list. As you can see on output text for that part of code we are invoking copy constructor before and destructor after invoking getValue() function. It is because we are passing each myClasses list element to foreach algorithm by value. Therefore we are copying that element at the beginning of foreach loop step and removing them (destructing) at the end. This is inefficient solution, especially when class of object being copied is big. It decreases performance. of our application. Solution for that i...
1 comment
Read more

C++ in 2014 - Predictions

Today I would like to share with you interesting article about prediction of development C++ programming languages (and its well-known frameworks and libraries) in 2014. It is written by Jens Weller and I think it is very interesting for every C++ programmer and user. You can open this article by clicking on the image below: Enjoy!
1 comment
Read more