why won't this complile??? const troubles...

[JustSomeGuy]

this doesn't want to compile....

class image : public std::list<eleme nt>
{
element getElement(key k) const
{
image::iterator iter;
for (iter=begin(); iter != end(); ++iter)
{
element &elem(*iter) ;
if (Key == k)
{
return(elem);
}
}
throw("Not found");
}
};

I think the reason this isn't working is due to the const declaration of
the
method.
So what am I to do?

[Rolf Magnus]

JustSomeGuy wrote:

this doesn't want to compile....
Always post the full error message.
class image : public std::list<eleme nt>
{
element getElement(key k) const
{
image::iterator iter;
for (iter=begin(); iter != end(); ++iter)
{
element &elem(*iter) ;
if (Key == k)
{
return(elem);
}
}
throw("Not found");
}
};

I think the reason this isn't working is due to the const declaration
of the method.

It is due to you trying to use a non-const-iterator on a const
container. Use const_iterator instead of iterator.

[Phlip]

JustSomeGuy wrote:

this doesn't want to compile....

class image : public std::list<eleme nt>
{
element getElement(key k) const
{
image::iterator iter;
for (iter=begin(); iter != end(); ++iter)
{
element &elem(*iter) ;
if (Key == k)
{
return(elem);
}
}
throw("Not found");
}
};

I think the reason this isn't working is due to the const declaration of
the
method.
So what am I to do?

Don't inherit std::list<>.

Generally, only inherit to override a virtual method. STL does not use any
virtuals.

If many clients used the image class, they might start playing with all the
different functions which std::list<> provides. When the time came to
replace the list with something else, those clients would resist that
change. Library classes, such as std::list<>, should have very wide
interfaces, but application-specific classes must be very narrow.

BTW the actual fix is image::const_it erator.

--
Phlip
http://industrialxp.org/community/bi...UserInterfaces

[red floyd]

Phlip wrote:

Don't inherit std::list<>.

Generally, only inherit to override a virtual method. STL does not use any
virtuals.

Earlier I asked a question about inheriting std::priority_q ueue<>. It
seems that priority_queue is designed to be inherited (as it has
protected members), even though it has no virtuals.

There are many reasons to inherit, even if something has no virtuals,
such as adding new behavior, even though it doesn't modify existing
(Note that I was using private inheritance).

Blanket bans may not be a good thing.

[JustSomeGuy]

Rolf Magnus wrote:

JustSomeGuy wrote:

this doesn't want to compile....

Always post the full error message.

class image : public std::list<eleme nt>
{
element getElement(key k) const
{
image::iterator iter;
for (iter=begin(); iter != end(); ++iter)
{
element &elem(*iter) ;
if (Key == k)
{
return(elem);
}
}
throw("Not found");
}
};

I think the reason this isn't working is due to the const declaration
of the method.

It is due to you trying to use a non-const-iterator on a const
container. Use const_iterator instead of iterator.

I Can't use const_iterator because tof the overhead involved

element elem = *iter

make an entire copy of the object for every object in the list
(i.e. at every iteration of the for loop)
This is very inefficient...

[Jeff Flinn]

"JustSomeGu y" <No***@ucalgary .ca> wrote in message
news:40******** *******@ucalgar y.ca...

Rolf Magnus wrote:

JustSomeGuy wrote:

this doesn't want to compile....
Always post the full error message.

class image : public std::list<eleme nt>
{
element getElement(key k) const
{
image::iterator iter;
for (iter=begin(); iter != end(); ++iter)
{
element &elem(*iter) ;
if (Key == k)
{
return(elem);
}
}
throw("Not found");
}
};

I think the reason this isn't working is due to the const declaration
of the method.

It is due to you trying to use a non-const-iterator on a const
container. Use const_iterator instead of iterator.

I Can't use const_iterator because tof the overhead involved

element elem = *iter

cont_iterator does NOT force you to do a value copy. Just return (*iter).
Why add the element& anyway? If you continue to insist on an local scoped
reference, it needs to be a const reference.

const element& elem(*iter);

or
element const& elem(*iter);

Your getElement member function is specified 'const', so that's why you need
to use const_iterator.

make an entire copy of the object for every object in the list
(i.e. at every iteration of the for loop)
This is very inefficient...

In the above code, probably not if 'Key == k' considering 'k' never changes
in this scope, and I assume Key is a glo or a data member, and is not
modified in this code.

Jeff F

[JustSomeGuy]

Jeff Flinn wrote:

"JustSomeGu y" <No***@ucalgary .ca> wrote in message
news:40******** *******@ucalgar y.ca...

Rolf Magnus wrote:

JustSomeGuy wrote:

> this doesn't want to compile....

Always post the full error message.

> class image : public std::list<eleme nt>
> {
> element getElement(key k) const
> {
> image::iterator iter;
> for (iter=begin(); iter != end(); ++iter)
> {
> element &elem(*iter) ;
> if (Key == k)
> {
> return(elem);
> }
> }
> throw("Not found");
> }
> };
>
> I think the reason this isn't working is due to the const declaration
> of the method.

It is due to you trying to use a non-const-iterator on a const
container. Use const_iterator instead of iterator.
I Can't use const_iterator because tof the overhead involved

element elem = *iter

cont_iterator does NOT force you to do a value copy. Just return (*iter).
Why add the element& anyway? If you continue to insist on an local scoped
reference, it needs to be a const reference.

const element& elem(*iter);

or
element const& elem(*iter);

Your getElement member function is specified 'const', so that's why you need
to use const_iterator.

make an entire copy of the object for every object in the list
(i.e. at every iteration of the for loop)
This is very inefficient...

In the above code, probably not if 'Key == k' considering 'k' never changes
in this scope, and I assume Key is a glo or a data member, and is not
modified in this code.

Sorry that was supposed to be:
if (elem.Key == k)


Jeff F

[John Harrison]

"JustSomeGu y" <No***@ucalgary .ca> wrote in message
news:40******** *******@ucalgar y.ca...

Rolf Magnus wrote:

JustSomeGuy wrote:

this doesn't want to compile....

Always post the full error message.

class image : public std::list<eleme nt>
{
element getElement(key k) const
{
image::iterator iter;
for (iter=begin(); iter != end(); ++iter)
{
element &elem(*iter) ;
if (Key == k)
{
return(elem);
}
}
throw("Not found");
}
};

I think the reason this isn't working is due to the const declaration
of the method.

It is due to you trying to use a non-const-iterator on a const
container. Use const_iterator instead of iterator.

I Can't use const_iterator because tof the overhead involved

element elem = *iter

make an entire copy of the object for every object in the list
(i.e. at every iteration of the for loop)
This is very inefficient...

So just change

element &elem(*iter) ;

to

const element &elem(*iter) ;

and use a const iterator.

If const made any difference at all to the efficiency of a C++ program it
wouldn't be part of the language.

john

[Bob Hairgrove]

On Fri, 18 Jun 2004 20:11:33 GMT, red floyd <no*****@here.d ude> wrote:

Phlip wrote:

Don't inherit std::list<>.

Generally, only inherit to override a virtual method. STL does not use any
virtuals.

Earlier I asked a question about inheriting std::priority_q ueue<>. It
seems that priority_queue is designed to be inherited (as it has
protected members), even though it has no virtuals.

There are many reasons to inherit, even if something has no virtuals,
such as adding new behavior, even though it doesn't modify existing
(Note that I was using private inheritance).

Blanket bans may not be a good thing.

Why inherit from a class which you cannot use polymorphically in the
first place?

Since the base class destructor is not virtual, it is not called when
your derived class is destroyed. I suppose one could call it
explicitly from the derived class' destructor, but this is hardly good
design. Likewise, since the member functions in std::list are not
virtual, you must not override them in the derived class because that
would hide the base class functions.

It is quite possible to implement what you want to do using
delegation, or containment -- your class has a data member of type
std::list, and you can write forwarding functions for any of the
std::list methods which you would like to use in your own class. I did
this once in order to extend std::string, which also has no virtual
destructor. It is a bit tedious to write all the one-liner functions
to forward to std::list, but at least you end up with something that
works properly.

Really, you shouldn't inherit from this one. Some STL classes are
designed for inheritance, such as std::exception (which DOES have a
virtual destructor).
--
Bob Hairgrove
No**********@Ho me.com

[Rolf Magnus]

Bob Hairgrove wrote:

Earlier I asked a question about inheriting std::priority_q ueue<>. It
seems that priority_queue is designed to be inherited (as it has
protected members), even though it has no virtuals.

There are many reasons to inherit, even if something has no virtuals,
such as adding new behavior, even though it doesn't modify existing
(Note that I was using private inheritance).

Blanket bans may not be a good thing.
Why inherit from a class which you cannot use polymorphically in the
first place?

Because you might want to inherit functionality from some class but
don't want to use it polymorphically .
Since the base class destructor is not virtual, it is not called when
your derived class is destroyed.
That's wrong. Things only go wrong if a derived object is dynamically
allocated _and_ destroyed through a pointer to the base class. In this
case, the derived part isn't properly destroyed. Any other way of
creating/destroying the object will just work fine.
I suppose one could call it
explicitly from the derived class' destructor, but this is hardly good
design. Likewise, since the member functions in std::list are not
virtual, you must not override them in the derived class because that
would hide the base class functions.
Hiding and overriding are two different concepts. Anyway, if you do
that, then hiding the base class's function is exactly what you want.
It is quite possible to implement what you want to do using
delegation, or containment -- your class has a data member of type
std::list, and you can write forwarding functions for any of the
std::list methods which you would like to use in your own class.

And if you want to use most functions of std::list, you will have the
boring task to write a whole lot of forwarding functions. What is the
advantage over just inheriting them and not needing to write any code
for them?
Note that when using containment and forwarding functions, you still
cannot use it as a polymorphic replacement for std::list, so by
deriving from std::list, you didn't lose _any_ functionality. The only
thing that's different is that you have less work when deriving.