Lines Matching defs:next
77 for (int i = 0; NULL != cur; ++i, cur = iter.next()) {
118 for (int i = 0; NULL != cur; ++i, cur = iter.next()) {
225 iter.next();
228 Iter next(iter);
229 next.next();
241 if (NULL != next.get()) {
242 REPORTER_ASSERT(reporter, next.prev()->fID == iter.get()->fID);
245 REPORTER_ASSERT(reporter, prev.next()->fID == id);
250 newItem.next();
253 if (NULL != next.get()) {
254 REPORTER_ASSERT(reporter, next.prev()->fID == id);
257 REPORTER_ASSERT(reporter, prev.next()->fID == iter.get()->fID);
271 incrFunc = &Iter::next;
285 // remember the prev and next elements from the element to be removed
287 Iter next = iter;
289 next.next();
292 // make sure the remembered next/prev iters still work
293 Iter pn = prev; pn.next();
294 Iter np = next; np.prev();
295 // pn should match next unless the target node was the head, in which case prev
297 REPORTER_ASSERT(reporter, pn.get() == next.get() || NULL == prev.get());
298 // Similarly, np should match prev unless next originally walked off the tail.
299 REPORTER_ASSERT(reporter, np.get() == prev.get() || NULL == next.get());
