62   Rows::const_iterator it1 = rows_.begin();  in Equals()  local
64   while (it1 != rows_.end()) {  in Equals()
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()
71     ++it1;  in Equals()
180   Rows::const_iterator it1 = region1.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()
196       ++it1;  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()
217     if (it1->second->bottom == bottom)  in Intersect()
218       ++it1;  in Intersect()
229   RowSpanSet::const_iterator it1 = set1.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()
244       ++it1;  in IntersectRows()
249     int32_t right = std::min(it1->right, it2->right);  in IntersectRows()
255     if (it1->right == right)  in IntersectRows()
256       ++it1;  in IntersectRows()
260   } while (it1 != end1 && it2 != end2);  in IntersectRows()