Implementing STL list::insert

[sh3rpa]

I'm trying to design an insert() like the list::insert:

iter1 = mlist.insert(iter2, myData);

My problem is I can't convert from an Iterator to a Node.

iterator insert(iterator i, const T& d){

    /*  can't do this: */
   Node *c = i.curr;
}

and at least right now I can't figure out another way to convert w/out iterating the list (again) which seems silly since the function takes an iterator as an argument.

Any thoughts?

[matsp]

Make it a friend to the iterator class, and you can use the private members of the class.

--
Mats

[sh3rpa]

Is that make iterator a friend class of list?

[sh3rpa]

Nevermind, I got it straightened out.

[matsp]

Nevermind, I got it straightened out.

I take it you made it a friend of your iterator class?

--
Mats

[sh3rpa]

si, muchos gracias

(my spanish is about as good as my french!)

[matsp]

si, muchos gracias

(my spanish is about as good as my french!)

You are welcome - I speak no french or spanish either. [Aside from the few standard phrases that'll get me some food or drink when the staff refuse/can't speak English - and I have to hope that they are wanting to sell me some such, otherwise god knows what I'd end up with]

--
Mats

[sh3rpa]

I'm having trouble w/writing the definition of functions that return an Iter

template <typename T> Iter
List<T>::insert()

/* etc */
}

^
doesn't work

[anon]

Iter is a nested class? Then it should look something like this:

template <typename T>
typename List<T>::Iter List<T>::insert() {}
         //return type  class   method

The second typename is (may be) required to tell the compiler that T is a template parameter.

[sh3rpa]

Iter is a nested class? Then it should look something like this:

 	Code:
 	template <typename T>
typename List<T>::Iter List<T>::insert() {}
         //return type  class   method

The second typename is (may be) required to tell the compiler that T is a template parameter.

worked like a charm! thanx!