Lines Matching defs:curr
97 Event::insertBefore(Event *event, Event *curr)
102 if (!curr || *event < *curr) {
104 event->nextBin = curr;
108 event->nextBin = curr->nextBin; // curr->nextBin can now become stale
111 event->nextInBin = curr;
129 Event *curr = head->nextBin;
130 while (curr && *curr < *event) {
131 prev = curr;
132 curr = curr->nextBin;
137 prev->nextBin = Event::insertBefore(event, curr);
143 Event *curr = top;
162 curr = next;
167 curr->nextInBin = next->nextInBin;
188 Event *curr = head->nextBin;
189 while (curr && *curr < *event) {
190 prev = curr;
191 curr = curr->nextBin;
194 if (!curr || *curr != *event)
197 // curr points to the top item of the the correct 'in bin' list, when
200 prev->nextBin = Event::removeItem(event, curr);