Lines Matching full:mid

110     // Divide [Begin, End) into two. Let Mid be the start index of the
118     size_t mid = bound - chunks.begin();
120     // Split [Begin, End) into [Begin, Mid) and [Mid, End). We use Mid as an
122     for (size_t i = begin; i < mid; ++i)
123       chunks[i]->eqClass[(cnt + 1) % 2] = mid;
126     if (mid != end)
129     begin = mid;
222     size_t mid = findBoundary(begin, end);
223     fn(begin, mid);
224     begin = mid;