I'm trying to design an insert() like the list::insert:
My problem is I can't convert from an Iterator to a Node.Code:iter1 = mlist.insert(iter2, myData);
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.Code:iterator insert(iterator i, const T& d){
/* can't do this: */
Node *c = i.curr;
}
Any thoughts?