std::map

[Duane Hebert]

2 questions:

Given a map defined as

std::map<int,st ring> stringmap;

//How do you access the data_type (string) via an iterator?

std::string spoo("doh");

stringmap.inser t(std::make_pai r(1,spoo));
// I tried this:
for(std::map<in t,string> ::iterator it = stringmap.begin (); it !=
stringmap.end() ; ++it)
std::cout << *it;
But this doesn't compile with error that the operator+ has not been defined
....
I think the problem is that the iterator returns a pair. Is it possible to
do this?

I know I can do:
if(stringmap.fi nd(1) != stringmap.end() ) std::cout << stringmap[1];
2nd question:

This doesn't work with BCB6 (causes a compile error about casting a pair to
an int???)

//stringmap is defined as a private class member
const std::string classname::gets tring(size_t index) const { return
stringmap[index];}

but this compiles fine and seems to work with no problems:

const std::string classname::gets tring(size_t index) { return
stringmap[index];}

Is this correct? Why can I not define this function as const? It's not
changing any
member data.

Thanks.

[Christoph Rabel]

Duane Hebert wrote:

// I tried this:
for(std::map<in t,string> ::iterator it = stringmap.begin (); it !=
stringmap.end() ; ++it)
std::cout << *it;
std::cout << it->second;

should do the trick.

Btw I recommend that you use a const_iterator instead of an
iterator.

I know I can do:
if(stringmap.fi nd(1) != stringmap.end() ) std::cout << stringmap[1];
Brr, this is terribly inefficient. Why dont you store the
returnvalue of find?

if((it = stringmap.find( 1)) != stringmap.end() )
std::cout << it->second;

2nd question:

This doesn't work with BCB6 (causes a compile error about casting a pair to
an int???)

//stringmap is defined as a private class member
const std::string classname::gets tring(size_t index) const { return
stringmap[index];}

but this compiles fine and seems to work with no problems:

const std::string classname::gets tring(size_t index) { return
stringmap[index];}

Is this correct? Why can I not define this function as const? It's not
changing any member data.

Because operator[] is not const. It might change the
contents of your stringmap. The map is const in this
function, so you are not allowed to call it.

Use find instead.

hope this helps,

Christoph

[Rob Williscroft]

Duane Hebert wrote in news:YY******** **********@wagn er.videotron.ne t:

2 questions:

Given a map defined as

std::map<int,st ring> stringmap;

//How do you access the data_type (string) via an iterator?

std::string spoo("doh");

stringmap.inser t(std::make_pai r(1,spoo));
// I tried this:
for(std::map<in t,string> ::iterator it = stringmap.begin (); it !=
stringmap.end() ; ++it)
std::cout << *it;
Change this to it->second; if you want the key do it->first.


But this doesn't compile with error that the operator+ has not been
defined ...
I think the problem is that the iterator returns a pair. Is it
possible to do this?

I know I can do:
if(stringmap.fi nd(1) != stringmap.end() ) std::cout <<
stringmap[1];


This should work fine stringmap[i] should return a std::string &
2nd question:

This doesn't work with BCB6 (causes a compile error about casting a
pair to an int???)
I don't really understand this, maybe you should post a complete
example that doesen't compile.

//stringmap is defined as a private class member
const std::string classname::gets tring(size_t index) const { return
stringmap[index];}

A return of std::string const & would be more effecient here.

but this compiles fine and seems to work with no problems:

const std::string classname::gets tring(size_t index) { return
stringmap[index];}

Is this correct? Why can I not define this function as const? It's
not changing any
member data.

Yes this is correct std::map<>::ope rator[] is not defined as a
const-member function, this is because the non-const version
will insert a new element into the map if it doesn't exist.

std::string classname::gets tring( int index ) const
{
std::map<int,st ring>::iterator ptr =
stringmap.find( index )
:

if ( ptr != stringmap.end() ) return ptr->second;

// return std::string( "< some default>" );
//throw std::runtime_er ror( "Item Not Found" );

// the choice is your's.
}
HTH

Rob.
--
http://www.victim-prime.dsl.pipex.com/

[Smeckler]

> > const std::string classname::gets tring(size_t index) { return

stringmap[index];}

Is this correct? Why can I not define this function as const? It's not
changing any member data.

Because operator[] is not const. It might change the
contents of your stringmap. The map is const in this
function, so you are not allowed to call it.

But why doesn't map define a const operator[] in addition to the non const
one?

[Smeckler]

> > But why doesn't map define a const operator[] in addition to the non
const

one?

What would it do if the key was not present in the map?

Errrr...do nothing and return a reference to NULL :)

[jeffc]

"Duane Hebert" <sp**@flarn.com > wrote in message
news:YY******** **********@wagn er.videotron.ne t...

2 questions:

Given a map defined as

std::map<int,st ring> stringmap;

//How do you access the data_type (string) via an iterator?

std::string spoo("doh");

stringmap.inser t(std::make_pai r(1,spoo));
// I tried this:
for(std::map<in t,string> ::iterator it = stringmap.begin (); it !=
stringmap.end() ; ++it)
std::cout << *it;

So you've figured out that you need to insert pairs, so the thing in the map
that the iterator is pointing to is a pair. You also said you want only the
string, not the whole pair. *it would be the whole pair. In a pair, there
is a "first" and "second". You want to point to the "second".

[Chris Theis]

"Smeckler" <sm*********@ho tSPAMmail.com> wrote in message
news:bj******** ***********@new s.demon.co.uk.. .

But why doesn't map define a const operator[] in addition to the non const one?

What would it do if the key was not present in the map?

Errrr...do nothing and return a reference to NULL :)

And how do you return a _reference_ to NULL?

Chris

[Ron Natalie]

"Chris Theis" <Ch************ *@nospam.cern.c h> wrote in message news:bj******** **@sunnews.cern .ch...

"Smeckler" <sm*********@ho tSPAMmail.com> wrote in message
news:bj******** ***********@new s.demon.co.uk.. .

> But why doesn't map define a const operator[] in addition to the non

const

> one?
>
What would it do if the key was not present in the map?

Errrr...do nothing and return a reference to NULL :)

And how do you return a _reference_ to NULL?

That was a joke, son. (Didn't you see the smilely?)

[Duane Hebert]

> > // I tried this:

for(std::map<in t,string> ::iterator it = stringmap.begin (); it !=
stringmap.end() ; ++it)
std::cout << *it;
Change this to it->second; if you want the key do it->first.

Thanks. I stumbled on that myself. I also found that
std::cout (*it).second; works as well. This was what I tried
originally but I missed the () .

I know I can do:
if(stringmap.fi nd(1) != stringmap.end() ) std::cout <<
stringmap[1];

This should work fine stringmap[i] should return a std::string &

That's correct but if I want to access each element of the map with a for
loop
it requires that I know the min and max keys and try all of them. That's
why
I wanted to get the iterator to work. (also to figure it out :-)

//stringmap is defined as a private class member
const std::string classname::gets tring(size_t index) const { return
stringmap[index];}

A return of std::string const & would be more effecient here.

but this compiles fine and seems to work with no problems:

const std::string classname::gets tring(size_t index) { return
stringmap[index];}

Is this correct? Why can I not define this function as const? It's
not changing any
member data.

Yes this is correct std::map<>::ope rator[] is not defined as a
const-member function, this is because the non-const version
will insert a new element into the map if it doesn't exist.

std::string classname::gets tring( int index ) const
{
std::map<int,st ring>::iterator ptr =
stringmap.find( index )
:

if ( ptr != stringmap.end() ) return ptr->second;

This didn't exactly work on my compiler. Threw the same error as before.
I had to make ptr a const_iterator,
then it worked fine. Not sure why since find() returns an iterator,
but thanks for the help.
HTH

It does. Thanks.

[Christoph Rabel]

Duane Hebert wrote:

std::string classname::gets tring( int index ) const
{
std::map<int,st ring>::iterator ptr =
stringmap.find( index )
:

if ( ptr != stringmap.end() ) return ptr->second;

This didn't exactly work on my compiler. Threw the same error as before.
I had to make ptr a const_iterator,
then it worked fine. Not sure why since find() returns an iterator,
but thanks for the help.

No, because the stringmap is const in this function find
returns a const_iterator in this case.

Christoph