63   Rows::const_iterator it2 = region.rows_.begin();  in Equals()  local
65     if (it2 == region.rows_.end() || it1->first != it2->first ||  in Equals()
66         it1->second->top != it2->second->top ||  in Equals()
67         it1->second->bottom != it2->second->bottom ||  in Equals()
68         it1->second->spans != it2->second->spans) {  in Equals()
72     ++it2;  in Equals()
74   return it2 == region.rows_.end();  in Equals()
182   Rows::const_iterator it2 = region2.rows_.begin();  in Intersect()  local
184   if (it1 == end1 || it2 == end2)  in Intersect()
187   while (it1 != end1 && it2 != end2) {  in Intersect()
189     if (it2->second->top < it1->second->top) {  in Intersect()
190       std::swap(it1, it2);  in Intersect()
195     if (it1->second->bottom <= it2->second->top) {  in Intersect()
202     int32_t top = it2->second->top;  in Intersect()
203     int32_t bottom = std::min(it1->second->bottom, it2->second->bottom);  in Intersect()
207     IntersectRows(it1->second->spans, it2->second->spans,  in Intersect()
220     if (it2->second->bottom == bottom)  in Intersect()
221       ++it2;  in Intersect()
231   RowSpanSet::const_iterator it2 = set2.begin();  in IntersectRows()  local
233   assert(it1 != end1 && it2 != end2);  in IntersectRows()
237     if (it2->left < it1->left) {  in IntersectRows()
238       std::swap(it1, it2);  in IntersectRows()
243     if (it1->right <= it2->left) {  in IntersectRows()
248     int32_t left = it2->left;  in IntersectRows()
249     int32_t right = std::min(it1->right, it2->right);  in IntersectRows()
258     if (it2->right == right)  in IntersectRows()
259       ++it2;  in IntersectRows()
260   } while (it1 != end1 && it2 != end2);  in IntersectRows()