iterators

[nsgi_2004]

Hello, I made a table class (implemented with an array) and would like to
add iterators so that I can use the std algorithms with it.

I added this to my class:

typedef T* iterator;
iterator begin();
iterator end();

Is that all I need to do?

 

[Victor Bazarov]

Hello, I made a table class (implemented with an array) and would like to
add iterators so that I can use the std algorithms with it.

I added this to my class:

typedef T* iterator;
iterator begin();
iterator end();

Is that all I need to do?

Basically, a pointer to object adheres to the rules set for random-access
iterators, so if your 'iterator' is a pointer, then yes, it's probably all
you need. Why do you ask? Have you encountered any problems?

V

 

[John Harrison]

Hello, I made a table class (implemented with an array) and would like to
add iterators so that I can use the std algorithms with it.

I added this to my class:

typedef T* iterator;
iterator begin();
iterator end();

Is that all I need to do?

That will work since pointers are a kind of iterator. I would also add the
following

typedef const T* const_iterator;
const_iterator begin() const;
const_iterator end() const;

john

 

[nsgi_2004]

Basically, a pointer to object adheres to the rules set for random-access
iterators, so if your 'iterator' is a pointer, then yes, it's probably all
you need. Why do you ask? Have you encountered any problems?

Well, I just sort of "found out" about the std algorithms, functors, and
such. So I just wanted to make sure that, even though it was working, I
wasn't doing anything that went against the STL design as I begin to use the
STL for more than just the containers.

 

[Jeff Flinn]

Hello, I made a table class (implemented with an array) and would like to
add iterators so that I can use the std algorithms with it.

I added this to my class:

typedef T* iterator;
iterator begin();
iterator end();

Is that all I need to do?

In many but not all cases.

See http://www.boost.org/libs/iterator/doc/index.html

Jeff F