[C++]Nested map problem.

[HDS]

Aaah I see what you mean. I think that's exactly what the exercise meant. Will give it a shot tomorrow.

PS : Would I need to use 2 for loops to iterate through the map then?

 

[semaphore]

Aaah I see what you mean. I think that's exactly what the exercise meant. Will give it a shot tomorrow.

PS : Would I need to use 2 for loops to iterate through the map then?

Yeah you would iter through the keys to get the values, then iter again over those pairs.

 

[semaphore]

Instead of using iters you can use .find on the map which will return you the other map.

 

[HDS]

Instead of using iters you can use .find on the map which will return you the other map.

You still have to iterate through the inner map.

So the iteration would be something like

my_map<string, int>::iterator inner;
my_map::iterator find_value = my_map.find(a);

for ( inner = find_value -> second.begin(); inner != find_value -> second.end(); inner++ )
{
cout << find_value -> first << inner -> first << inner -> second;
}
That's more or less how I did it this morning. But thanks, your idea solved it for me .

 

[semaphore]

You still have to iterate through the inner map.

So the iteration would be something like

my_map<string, int>::iterator inner;
my_map::iterator find_value = my_map.find(a);

for ( inner = find_value -> second.begin(); inner != find_value -> second.end(); inner++ )
{
cout << find_value -> first << inner -> first << inner -> second;
}
That's more or less how I did it this morning. But thanks, your idea solved it for me .

Cool yeah you would iter in the other map like you said.