 |  |  |  |  |  |  |  |
Comparing two STL maps..
Please support our C++ advertiser: Intel Parallel Studio Home
 |
•
•
Join Date: Feb 2005
Posts: 466
Reputation: 
Solved Threads: 18
Posting Pro in Training
Is there a (builtin) way to compare the contents of two stl maps? (Assuming of course that the maps have the same data types).
I thought of writing this myself, but iterating through each map and seeing if the contents are found in the other map (and then doing the reverse), but was wondering if this exists already...
I thought of writing this myself, but iterating through each map and seeing if the contents are found in the other map (and then doing the reverse), but was wondering if this exists already...
>Is there a (builtin) way to compare the contents of two stl maps?
Have you tried the relational operators? Or did you just come running here before attempting anything so that you could waste time waiting for an answer?
Have you tried the relational operators? Or did you just come running here before attempting anything so that you could waste time waiting for an answer?
I'm here to prove you wrong.
•
•
Join Date: Jun 2005
Posts: 2,039
Reputation:
Solved Threads: 139
Go to google, type in "compare C++ maps", and press the I'm Feeling Lucky button.
•
•
Join Date: Feb 2005
Posts: 466
Reputation:
Solved Threads: 18
Posting Pro in Training
All of the operators return bool, I was looking for something that details the differences (ie 'X' appears in map 1 and not in map 2, 'Y' appears in map 2 and not map1, etc.). I wasn't looking for whether or not the whole thing is equal or not...
•
•
Join Date: Jun 2005
Posts: 2,039
Reputation:
Solved Threads: 139
Then be more specific. Which of the following do you want to do:
1. Find all the x in S that are not in T.
2. Find all the x in S or T that are not in both.
3. Find all the x that are in both S and T.
1. Find all the x in S that are not in T.
2. Find all the x in S or T that are not in both.
3. Find all the x that are in both S and T.
•
•
Join Date: Feb 2005
Posts: 466
Reputation:
Solved Threads: 18
Posting Pro in Training
basically #2.
I know how to write this myself by iterating through each map and checking in the other map to see if it exists, but I figure anything built in would be faster than what I would write.
I know how to write this myself by iterating through each map and checking in the other map to see if it exists, but I figure anything built in would be faster than what I would write.
You want the symmetric difference of the two maps. Conveniently enough, the standard library provides you with the set_symmetric_difference template function in <algorithm>.
I'm here to prove you wrong.
|
Similar Threads
- Fast data storage (C++)
- Array limit (C)
Other Threads in the C++ Forum
- Previous Thread: Microsoft visual studio.net 2003 edition
- Next Thread: seg fault with head pointer
| Thread Tools | Search this Thread |
You need to join our community in order to build your list of favorite forums. You can visit the forum index for a listing of all forums.
Related Forum Features
Latest C++ Posts
- Today's Posts
- Unanswered Threads
api array based beginner binary bitmap c++ c/c++ calculator char char* class code coding compile compiler console conversion count data database delete deploy developer dll download dynamic dynamiccharacterarray email encryption error file forms fstream function functions game getline givemetehcodez graph gui homeworkhelp homeworkhelper iamthwee ifstream input int integer java lib linker list loop looping loops map math matrix memory multiple news node number numbertoword output parameter pointer problem program programming project proxy python random read recursion recursive reference rpg sorting string strings struct temperature template text text-file tree url variable vector video visual visualstudio win32 windows winsock word wordfrequency wxwidgets
