Lines Matching refs:earliest
130 // The tiles themselves are already ordered, so the earliest is at the front of some tile.
132 const Entry* earliest = NULL;
135 if (NULL == earliest || starts[i]->order < earliest->order) {
136 earliest = starts[i];
141 // If we didn't find an earliest entry, there isn't anything left to merge.
142 if (NULL == earliest) {
146 // We did find an earliest entry. Output it, and step forward every tile that contains it.
147 results->push(earliest->data);
149 if (starts[i] < ends[i] && starts[i]->order == earliest->order) {
