Searched refs:iterPrev (Results 1 – 7 of 7) sorted by relevance
10 iterPrev, iterNext *mapEntry member51 entry.iterPrev = m.iterLast77 if entry.iterPrev != nil {78 entry.iterPrev.iterNext = entry.iterNext83 entry.iterNext.iterPrev = entry.iterPrev85 m.iterLast = entry.iterPrev120 cur = cur.iterPrev161 if item.iterPrev != nil {162 item.iterPrev.iterNext = nil
57 LPLIST iterPrev = NULL; in list_concat() local73 iterPrev = iter; in list_concat()76 iterPrev->lpNext = lstb; in list_concat()
1208 head.iterPrev = node; in prepend()1210 node.iterPrev = tail; in prepend()1213 node.iterPrev = node; in prepend()1224 node.iterPrev = tail; in append()1225 head.iterPrev = node; in append()1229 node.iterPrev = node; in append()1237 Queue<T> tail = head.iterPrev; in appendList()1240 otherHead.iterPrev = tail; in appendList()1242 head.iterPrev = otherTail; in appendList()1250 node.iterNext.iterPrev = node.iterPrev; in remove()[all …]
175 auto iterNext = tracks.FindLeader(toRemove), iterPrev = iterNext; in DoRemoveTrack() local178 newFocus = *--iterPrev; in DoRemoveTrack()
7159 auto iterPrev = d->steps_.begin(); in toString() local7160 if (iterPrev == d->steps_.end()) { in toString()7163 auto iterCur = iterPrev; in toString()7167 auto &prevStep = *iterPrev; in toString()7189 d->steps_.erase(iterPrev, iterCur); in toString()7202 d->steps_.erase(iterPrev, iterCur); in toString()7219 d->steps_.erase(iterPrev, iterCur); in toString()7236 d->steps_.erase(iterPrev, iterCur); in toString()7259 d->steps_.erase(iterPrev, iterCur); in toString()7357 d->steps_.erase(iterPrev, iterCur); in toString()[all …]