Lines Matching full:prev
81 for (int i = 0; NULL != cur; ++i, cur = iter.prev()) {
226 Iter prev(iter);
229 prev.prev();
237 newItem.prev();
241 REPORTER_ASSERT(reporter, next.prev()->fID == iter.get()->fID);
243 if (NULL != prev.get()) {
244 REPORTER_ASSERT(reporter, prev.next()->fID == id);
253 REPORTER_ASSERT(reporter, next.prev()->fID == id);
255 if (NULL != prev.get()) {
256 REPORTER_ASSERT(reporter, prev.next()->fID == iter.get()->fID);
273 incrFunc = &Iter::prev;
284 // remember the prev and next elements from the element to be removed
285 Iter prev = iter;
287 prev.prev();
291 // make sure the remembered next/prev iters still work
292 Iter pn = prev; pn.next();
293 Iter np = next; np.prev();
294 // pn should match next unless the target node was the head, in which case prev
296 REPORTER_ASSERT(reporter, pn.get() == next.get() || NULL == prev.get());
297 // Similarly, np should match prev unless next originally walked off the tail.
298 REPORTER_ASSERT(reporter, np.get() == prev.get() || NULL == next.get());
