Lines Matching defs:vectors
246 TimeVector vectors[3];
247 GetTimesOnTheDayOfTheWeek(1, week, max_results, &vectors[0]);
249 GetTimesOnTheDayOfTheWeek(i, week, max_results, &vectors[(i - 1) % 3]);
250 UniteTimeVectors(vectors[(i - 2) % 3], vectors[(i - 1) % 3],
251 &vectors[i % 3]);
252 if (max_results && vectors[i % 3].size() > max_results)
253 vectors[i % 3].resize(max_results);
254 vectors[i % 3].swap(vectors[(i - 1) % 3]);
257 times->swap(vectors[1]);
265 // The vectors are sorted going back in time, but each pair has |first| as the
274 const TimeVector* vectors[2] = { &vector1, &vector2 };
276 vi[0] < vectors[0]->size() && vi[1] < vectors[1]->size();) {
281 // vectors[iterator_index][vi[iterator_index]] f---s
282 // vectors[1 - iterator_index][vi[1 - iterator_index]] f---s
285 // vectors[iterator_index][vi[iterator_index]] f---s
286 // vectors[1 - iterator_index][vi[1 - iterator_index]] f-s
289 ((*vectors[0])[vi[0]].second >= (*vectors[1])[vi[1]].second) ? 0 : 1;
290 united_timeslot = (*vectors[iterator_index])[vi[iterator_index]];
297 if (vi[i] < vectors[i]->size() &&
298 (*vectors[i])[vi[i]].second >= united_timeslot.first) {
299 // vectors[i][vi[i]] f---s
304 if ((*vectors[i])[vi[i]].first < united_timeslot.first) {
305 // vectors[i][vi[i]] f---s
309 united_timeslot.first = (*vectors[i])[vi[i]].first;
318 for (; vi[i] < vectors[i]->size(); ++vi[i])
319 result->push_back((*vectors[i])[vi[i]]);
