Lines Matching full:next
78 for (int i = 0; NULL != cur; ++i, cur = iter.next()) {
119 for (int i = 0; NULL != cur; ++i, cur = iter.next()) {
226 iter.next();
229 Iter next(iter);
230 next.next();
242 if (NULL != next.get()) {
243 REPORTER_ASSERT(reporter, next.prev()->fID == iter.get()->fID);
246 REPORTER_ASSERT(reporter, prev.next()->fID == id);
251 newItem.next();
254 if (NULL != next.get()) {
255 REPORTER_ASSERT(reporter, next.prev()->fID == id);
258 REPORTER_ASSERT(reporter, prev.next()->fID == iter.get()->fID);
272 incrFunc = &Iter::next;
286 // remember the prev and next elements from the element to be removed
288 Iter next = iter;
290 next.next();
293 // make sure the remembered next/prev iters still work
294 Iter pn = prev; pn.next();
295 Iter np = next; np.prev();
296 // pn should match next unless the target node was the head, in which case prev
298 REPORTER_ASSERT(reporter, pn.get() == next.get() || NULL == prev.get());
299 // Similarly, np should match prev unless next originally walked off the tail.
300 REPORTER_ASSERT(reporter, np.get() == prev.get() || NULL == next.get());
