How do I catch an exception caused from std::map?

Question

I have declared a map like this

map<long long, list<SoundInfo *> > m_soundListMap;

and I also have this function

void addSoundInfo(long long deviceId, SoundInfo * info)

I am trying to add sound info associate with the device id as the key into the map. In this function, I assumed that a key and value pair has been added to the map. So I can retrieve the list of the sound info and add incoming sound info to the back of the list.

I want to catch an exception for the case that the map doesn't have the key then I can create the key and value pair and insert into the map.

How do I catch this exception in C++?

Thanks in advance...

Ehm.. what exactly are you doing in `addSoundInfo`? `std::map` doesn't throw any exceptions on insertion. — Xeo, Jun 23 '11 at 05:49
What is going to happen if I try to get the list and the map doesn't have the key? is it just returning null or something? — user800799, Jun 23 '11 at 05:50

score 4 · Answer 1 · edited May 23 '17 at 12:23

4

std::map::operator[] returns a reference to the entry with the specified key; if no such entry exists a new entry is inserted (with the specified key and a default-constructed value) and a reference to that entry is returned. It can throw an exception when allocating memory fails (std::bad_alloc).

It sounds like you would probably find a good introductory C++ book useful.

edited May 23 '17 at 12:23

Community

1
1

answered Jun 23 '11 at 05:52

James McNellis

348,265
75
913
977

score 2 · Accepted Answer · answered Jun 23 '11 at 05:55

What is going to happen if I try to get the list and the map doesn't have the key?

Depends on how you try to get the item.

list<SoundInfo*>& info_list = m_soundListMap[55];

Will create an empty list, insert it into the map and return that when the key doesn't exist yet.

typedef map<long long, list<SoundInfo *> >::iterator iterator;
iterator iter = m_soundListMap.find(55);

Will return an iterator to the pair that holds both the key and the value, or will be map::end() if the key doesn't exist. iter->second will be your list<SoundInfo*>.

score 1 · Answer 3 · answered Jun 23 '11 at 05:53

1

Use map::find to check if map already has any value associated to a particular key.

answered Jun 23 '11 at 05:53

Alok Save

202,538
53
430
533

score 1 · Answer 4 · answered Jun 23 '11 at 05:55

1

You might look up the value using m_soundListMap.find(x). This returns an iterator. If the iterator is m_soundListMap.end() then the key wasn't found and you can insert if needed. No exceptions are thrown.

answered Jun 23 '11 at 05:55

seand

5,168
1
24
37

score 1 · Answer 5 · edited Oct 17 '15 at 12:07

1

I think you need this.

if(m_soundListMap.find(SomeLongVar) != m_soundListMap.end())
{  
  //Element found, take a decision if you want to update the value  
}  
else   
{  
  //Element not found, insert  
}

edited Oct 17 '15 at 12:07

Chris

3,245
4
29
53

answered Jun 23 '11 at 06:01

Manoj R

3,197
1
21
36

you are right. there is no exception, actually a new entry is created if the kety does not exist! the mystery of C++ :) – Mia Shani Nov 06 '20 at 02:09

How do I catch an exception caused from std::map?

5 Answers5