Lines Matching refs:it2
61 Rows::const_iterator it2 = region.rows_.begin();
63 if (it2 == region.rows_.end() ||
64 it1->first != it2->first ||
65 it1->second->top != it2->second->top ||
66 it1->second->bottom != it2->second->bottom ||
67 it1->second->spans != it2->second->spans) {
71 ++it2;
73 return it2 == region.rows_.end();
182 Rows::const_iterator it2 = region2.rows_.begin();
184 if (it1 == end1 || it2 == end2)
187 while (it1 != end1 && it2 != end2) {
189 if (it2->second->top < it1->second->top) {
190 std::swap(it1, it2);
194 // Skip |it1| if it doesn't intersect |it2| at all.
195 if (it1->second->bottom <= it2->second->top) {
200 // Top of the |it1| row is above the top of |it2|, so top of the
201 // intersection is always the top of |it2|.
202 int32_t top = it2->second->top;
203 int32_t bottom = std::min(it1->second->bottom, it2->second->bottom);
207 IntersectRows(it1->second->spans, it2->second->spans,
219 // If |it2| was completely consumed, move to the next one.
220 if (it2->second->bottom == bottom)
221 ++it2;
231 RowSpanSet::const_iterator it2 = set2.begin();
233 assert(it1 != end1 && it2 != end2);
237 if (it2->left < it1->left) {
238 std::swap(it1, it2);
242 // Skip |it1| if it doesn't intersect |it2| at all.
243 if (it1->right <= it2->left) {
248 int32_t left = it2->left;
249 int32_t right = std::min(it1->right, it2->right);
257 // If |it2| was completely consumed, move to the next one.
258 if (it2->right == right)
259 ++it2;
260 } while (it1 != end1 && it2 != end2);
