STL question

[Rusty]

Is there any way to use the STL algorithm for_each if my container
contains pointers? For example,

class A
{
int a;
virtual void print (void) {cout << a << endl;}
};
class B: public A
{
int b;
virtual void print (void) {cout << a << "," << b << endl;}
}

I want to have a list that I can call print() on for each member, so I
figured vector <A*>. Is there anyway to get the following with
for_each?

vector <A*>::iterator i;
for (i=list.begin(); i<list.end(); ++i) (*i)->print();

Russ

[Jonathan Turkanis]

"Rusty" <ru*****************@shaw.ca> wrote in message
news:b7********************************@4ax.com...

Is there any way to use the STL algorithm for_each if my container
contains pointers? For example,

class A
{
int a;
virtual void print (void) {cout << a << endl;}
};
class B: public A
{
int b;
virtual void print (void) {cout << a << "," << b << endl;}
}

I want to have a list that I can call print() on for each member, so I figured vector <A*>. Is there anyway to get the following with
for_each?

struct Printer : std::unary_function<A*, void> {
void operator() (A* a) const { /* write to cout */ }
}

std::for_each(list.begin(), list.end(), Printer());

HTH.

Jonathan

[Jacques Labuschagne]

Rusty wrote:

Is there any way to use the STL algorithm for_each if my container
contains pointers? For example,

class A
{
int a;
virtual void print (void) {cout << a << endl;}
};
class B: public A
{
int b;
virtual void print (void) {cout << a << "," << b << endl;}
}

I want to have a list that I can call print() on for each member, so I
figured vector <A*>. Is there anyway to get the following with
for_each?
Sure..

struct call_print{
void operator()(A* a){ a->print(); }
};

and then

for_each(v.begin(), v.end(), call_print());

vector <A*>::iterator i;
for (i=list.begin(); i<list.end(); ++i) (*i)->print();
Don't call your vector 'list', there's already a std::list class.

Russ

[Daniel T.]

Rusty <ru*****************@shaw.ca> wrote:

Is there any way to use the STL algorithm for_each if my container
contains pointers? For example,

class A
{
int a;
virtual void print (void) {cout << a << endl;}
};
class B: public A
{
int b;
virtual void print (void) {cout << a << "," << b << endl;}
}

I want to have a list that I can call print() on for each member, so I
figured vector <A*>. Is there anyway to get the following with
for_each?

vector <A*>::iterator i;
for (i=list.begin(); i<list.end(); ++i) (*i)->print();

for_each( vec.begin(), vec.end(), mem_fun( &A::print ) );

[Jacques Labuschagne]

Daniel T. wrote:

vector <A*>::iterator i;
for (i=list.begin(); i<list.end(); ++i) (*i)->print();

for_each( vec.begin(), vec.end(), mem_fun( &A::print ) );

Hang on, it's a vector of pointers... Surely there's no way of getting
around the extra functor to dereference the pointer.

Jacques

[Jerry Coffin]

In article <5V********************@news02.tsnz.net>,
ja*****@clawshrimp.com says...

Rusty wrote:

Is there any way to use the STL algorithm for_each if my container
contains pointers? For example,

class A
{
int a;
virtual void print (void) {cout << a << endl;}
};
class B: public A
{
int b;
virtual void print (void) {cout << a << "," << b << endl;}
}

I want to have a list that I can call print() on for each member, so I
figured vector <A*>. Is there anyway to get the following with
for_each?

Sure..

struct call_print{
void operator()(A* a){ a->print(); }
};

Using operator<< to do formatted printing of an object is a widely known
idiom, so it's probably better (at least IMO) to use it to do this job.
I'd change the definitions a little bit so the member functions take the
stream to write to as a parameter instead of always writing to
std::cout, and return the stream they're writing to.

class A
{
// I've defined it to take the ostream as a parameter instead of
// always writing to cout.
virtual std::ostream &print (std::ostream &os) const {return os<<a;}

// since we've defined print to be private, make operator<< a friend
// so it can call print.
friend std::ostream &operator<<(std::ostream &, A const *);
protected:
// a can't be private if you're going to access it directly in B
int a;
public:
A(int init) : a(init) {}
};

class B: public A
{
int b;
std::ostream &print(std::ostream &os) const {
return os << a << "," << b;
}
public:
B(int inita, int initb) : A(inita), b(initb) {}
};

and then add the definition of operator<<:

std::ostream &operator<<(std::ostream &os, A const *a) {
return a->print(os);
}

IMO, std::for_each isn't really the best tool for the job at hand
either. We're copying the contents of the vector to a stream, so
std::copy is really the algorithm for the job at hand:

std::ostream_iterator<A*> out(std::cout, "\n");
std::vector<A*> a;

// code to populate 'a' elided.

std::copy(a.begin(), a.end(), out);

--
Later,
Jerry.

The universe is a figment of its own imagination.

[Jonathan Turkanis]

"Jacques Labuschagne" <ja*****@clawshrimp.com> wrote in message
news:0c********************@news02.tsnz.net...

Daniel T. wrote:

vector <A*>::iterator i;
for (i=list.begin(); i<list.end(); ++i) (*i)->print();

for_each( vec.begin(), vec.end(), mem_fun( &A::print ) );

Hang on, it's a vector of pointers... Surely there's no way of

getting around the extra functor to dereference the pointer.

Jacques

mem_fun returns a function object taking a pointer argument, so this
should work. Of course, it only addresses the example, not the general
problem.

Jonathan

[Jacques Labuschagne]

Jonathan Turkanis wrote:

mem_fun returns a function object taking a pointer argument, so this
should work. Of course, it only addresses the example, not the general
problem.

Right you are...

Thanks,
Jacques

[Jumbo]

"Rusty" <ru*****************@shaw.ca> wrote in message
news:b7********************************@4ax.com...

Is there any way to use the STL algorithm for_each if my container
contains pointers? For example,

class A
{
int a;
virtual void print (void) {cout << a << endl;}
};
class B: public A
{
int b;
virtual void print (void) {cout << a << "," << b << endl;}
}

I want to have a list that I can call print() on for each member, so I
figured vector <A*>. Is there anyway to get the following with
for_each?

vector <A*>::iterator i;
for (i=list.begin(); i<list.end(); ++i) (*i)->print();

Russ

Yes see code below:

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

class Print{
public:
void operator()(const int* i)
{
cout<< *i << '\n';
}
};

int main(){
Print print;
vector<int*,allocator<int> > intArr(3);
int x=1;
int y=2;
int z=3;
intArr[0] = &x;
intArr[1] = &y;
intArr[2] = &z;

for_each( intArr.begin(), intArr.end(), print);

return 0;
}
HTH.

[Daniel T.]

Jacques Labuschagne <ja*****@clawshrimp.com> wrote:

Daniel T. wrote:

vector <A*>::iterator i;
for (i=list.begin(); i<list.end(); ++i) (*i)->print();

for_each( vec.begin(), vec.end(), mem_fun( &A::print ) );

Hang on, it's a vector of pointers... Surely there's no way of getting
around the extra functor to dereference the pointer.

mem_fun returns a functor that dereferences the pointer.

[Daniel T.]

"Jonathan Turkanis" <te******@kangaroologic.com> wrote:

"Jacques Labuschagne" <ja*****@clawshrimp.com> wrote:

Daniel T. wrote:

>vector <A*>::iterator i;
>for (i=list.begin(); i<list.end(); ++i) (*i)->print();
for_each( vec.begin(), vec.end(), mem_fun( &A::print ) );
Hang on, it's a vector of pointers... Surely there's no way of

getting

around the extra functor to dereference the pointer.

Jacques

mem_fun returns a function object taking a pointer argument, so this
should work.

Of course it should work, this is exactly the type of problem that
mem_fun was designed to solve.

Of course, it only addresses the example, not the general
problem.
It does address the general problem which was (from the OP): Is there any way to use the STL algorithm for_each if my container
contains pointers?

The answer is, "Yes, one way is to use mem_fun."

[Jonathan Turkanis]

"Daniel T." <po********@eathlink.net> wrote in message
news:po******************************@news02.east. earthlink.net...

"Jonathan Turkanis" <te******@kangaroologic.com> wrote:

"Jacques Labuschagne" <ja*****@clawshrimp.com> wrote:

Daniel T. wrote:
>>vector <A*>::iterator i;
>>for (i=list.begin(); i<list.end(); ++i) (*i)->print();
>
>
> for_each( vec.begin(), vec.end(), mem_fun( &A::print ) );

Hang on, it's a vector of pointers... Surely there's no way of getting

around the extra functor to dereference the pointer.

Jacques

mem_fun returns a function object taking a pointer argument, so this should work.

Of course it should work, this is exactly the type of problem that
mem_fun was designed to solve.

Would you feel better if I said 'does' instead of 'should'? I know it
works; it was a normative 'should'.

Of course, it only addresses the example, not the general
problem.

It does address the general problem which was (from the OP):

Is there any way to use the STL algorithm for_each if my container
contains pointers?

I don't we disagree about anything important. The more general problem
is how to iterate over a container of pointers when the operation you
wish to perform doesn't happen to be a member function.

Jonathan

[Martijn Lievaart]

On Sun, 18 Jan 2004 21:08:56 +0000, Rusty wrote:

Is there any way to use the STL algorithm for_each if my container
contains pointers? For example,

class A
{
int a;
virtual void print (void) {cout << a << endl;}
};
class B: public A
{
int b;
virtual void print (void) {cout << a << "," << b << endl;}
}

I want to have a list that I can call print() on for each member, so I
figured vector <A*>. Is there anyway to get the following with
for_each?

vector <A*>::iterator i;
for (i=list.begin(); i<list.end(); ++i) (*i)->print();

Russ

vector <A*>::iterator i;
for_each (list.begin(), list.end(), mem_fun(&A::print));

HTH,
M4

[Daniel T.]

"Jonathan Turkanis" <te******@kangaroologic.com> wrote:

The more general problem
is how to iterate over a container of pointers when the operation you
wish to perform doesn't happen to be a member function.

That's easy too.

for_each( vec.begin(), vec.end(), myFunc );

for_each works fine with function pointers.

If the function happens to be in a different object. IE

class A { };
class B {
public:
void func( A* a );
};

vector<A*> vec;
B b;

Then one simply does this:

for_each( vec.begin(), vec.end(), bind1st( mem_fun(&B::func), &b ) );

[Jonathan Turkanis]

"Daniel T." <po********@eathlink.net> wrote in message
news:po******************************@news02.east. earthlink.net...

"Jonathan Turkanis" <te******@kangaroologic.com> wrote:

The more general problem
is how to iterate over a container of pointers when the operation you wish to perform doesn't happen to be a member function.

That's easy too.

for_each( vec.begin(), vec.end(), myFunc );

for_each works fine with function pointers.

This is what I mentioned in my original post.

I know how to use the STL. What is your point?

Jonathan

[Jumbo]

"Rusty" <ru*****************@shaw.ca> wrote in message
news:b7********************************@4ax.com...

Is there any way to use the STL algorithm for_each if my container
contains pointers? For example,

class A
{
int a;
virtual void print (void) {cout << a << endl;}
};
class B: public A
{
int b;
virtual void print (void) {cout << a << "," << b << endl;}
}

I want to have a list that I can call print() on for each member, so I
figured vector <A*>. Is there anyway to get the following with
for_each?

vector <A*>::iterator i;
for (i=list.begin(); i<list.end(); ++i) (*i)->print();

Russ

I found I need to use:
for (i=list.begin(); i<list.end(); ++i) i[0]->print();

Although it looks like your only ever indexing the first element it's not ,
it works properly because your indexing the iterator and not the vector.

HTH

[Ron Natalie]

"Jumbo @uko2.co.uk>" <pcr1000011<nospam> wrote in message news:10***************@news.minx.net.uk...

vector <A*>::iterator i;
for (i=list.begin(); i<list.end(); ++i) (*i)->print();

Russ

I found I need to use:
for (i=list.begin(); i<list.end(); ++i) i[0]->print();

Although it looks like your only ever indexing the first element it's not ,
it works properly because your indexing the iterator and not the vector

It won't work properly if "list" is really a list and not a vector.
You're only guaranteed to be able to apply operator[] to random
access iterators.

His original code would have worked fine.

To get back to whether he could use for for_each. You could obviously define
your own functor for the third arg, but C++ provides an adapter already called
mem_fun

for_each(list.begin(), list.end(), mem_fun(&A::print));

[Rusty]

On Sun, 18 Jan 2004 23:51:28 GMT, "Daniel T."
<po********@eathlink.net> wrote:

EXACTLY what I was after - thank you so much!

Russ

Rusty <ru*****************@shaw.ca> wrote:

Is there any way to use the STL algorithm for_each if my container
contains pointers? For example,

class A
{
int a;
virtual void print (void) {cout << a << endl;}
};
class B: public A
{
int b;
virtual void print (void) {cout << a << "," << b << endl;}
}

I want to have a list that I can call print() on for each member, so I
figured vector <A*>. Is there anyway to get the following with
for_each?

vector <A*>::iterator i;
for (i=list.begin(); i<list.end(); ++i) (*i)->print();

for_each( vec.begin(), vec.end(), mem_fun( &A::print ) );

[Martin Eisenberg]

Ron Natalie wrote:

You're only guaranteed to be able to apply operator[] to
random access iterators.

Does *(it + k) work with all iterators?
Thanks,
Martin

[Jonathan Turkanis]

"Martin Eisenberg" <ma*****************@PAMudo.edu> wrote in message
news:10***************@ostenberg.wh.uni-dortmund.de...

Ron Natalie wrote:

You're only guaranteed to be able to apply operator[] to
random access iterators.

Does *(it + k) work with all iterators?

No. Here's a good summary of iterator requirements. It's not
authoritative (e.g., "trivial iterators" aren't mentioned in the
standard) but its pretty good.

Jonathan

[Jonathan Turkanis]

"Jonathan Turkanis" <te******@kangaroologic.com> wrote in message
news:bu************@ID-216073.news.uni-berlin.de...

No. Here's a good summary of iterator requirements. It's not
authoritative (e.g., "trivial iterators" aren't mentioned in the
standard) but its pretty good.

Whoops! Omitted the link:

http://www.sgi.com/tech/stl/Iterators.html

Jonathan

[Ron Natalie]

"Martin Eisenberg" <ma*****************@PAMudo.edu> wrote in message news:10***************@ostenberg.wh.uni-dortmund.de...

Ron Natalie wrote:

You're only guaranteed to be able to apply operator[] to
random access iterators.

Does *(it + k) work with all iterators?

No, for other than random access iterators, you're limited bumping
it forward with ++. You can't add an arbitrary integer.

[Jeff Flinn]

"Martin Eisenberg" <ma*****************@PAMudo.edu> wrote in message
news:10***************@ostenberg.wh.uni-dortmund.de...

Ron Natalie wrote:

You're only guaranteed to be able to apply operator[] to
random access iterators.

Does *(it + k) work with all iterators?

No, but "std::advance( it, k );" does. Note that it will modify "it".
std::advance is(usually) specialized for the various iterator categories,
using the most appropriate method to increment by k.

Jeff F