Lines Matching full:iterator
68 * Iterator for walking through the list.
99 // this will handle conversions from iterator to const_iterator
114 * Iterator comparison.
123 * handle comparisons between iterator and const_iterator
175 typedef _ListIterator<T, NON_CONST_ITERATOR> iterator;
190 * _Node* we're returning is converted to an "iterator" by a
193 inline iterator begin() {
194 return iterator(mpMiddle->getNext());
199 inline iterator end() {
200 return iterator(mpMiddle);
210 /* insert before the current node; returns iterator at new node */
211 iterator insert(iterator posn, const T& val)
218 return iterator(newNode);
222 void insert(iterator posn, const_iterator first, const_iterator last) {
227 /* remove one entry; returns iterator at next node */
228 iterator erase(iterator posn) {
234 return iterator(pNext);
238 iterator erase(iterator first, iterator last) {
241 return iterator(last);
263 * FIXME: This is actually a generic iterator function. It should be a
299 * It sits in the middle of a circular list of nodes. The iterator
317 iterator firstDst = begin();
318 iterator lastDst = end();
