Lines Matching defs:iterator
100 // this will handle conversions from iterator to const_iterator
124 * handle comparisons between iterator and const_iterator
176 typedef _ListIterator<T, NON_CONST_ITERATOR> iterator;
191 * _Node* we're returning is converted to an "iterator" by a
194 inline iterator begin() {
195 return iterator(mpMiddle->getNext());
200 inline iterator end() {
201 return iterator(mpMiddle);
211 /* insert before the current node; returns iterator at new node */
212 iterator insert(iterator posn, const T& val)
219 return iterator(newNode);
223 void insert(iterator posn, const_iterator first, const_iterator last) {
228 /* remove one entry; returns iterator at next node */
229 iterator erase(iterator posn) {
235 return iterator(pNext);
239 iterator erase(iterator first, iterator last) {
242 return iterator(last);
264 * FIXME: This is actually a generic iterator function. It should be a
300 * It sits in the middle of a circular list of nodes. The iterator
318 iterator firstDst = begin();
319 iterator lastDst = end();