26 DesktopRegion::Row::Row(int32_t top, int32_t bottom)  in Row()  argument
27     : top(top), bottom(bottom) {}  in Row()
67         it1->second->bottom != it2->second->bottom ||  in Equals()
94   // we iterate over the rows until it reaches |rect.bottom()|.  in AddRect()
100   while (top < rect.bottom()) {  in AddRect()
104       int32_t bottom = rect.bottom();  in AddRect()  local
105       if (row != rows_.end() && row->second->top < bottom)  in AddRect()
106         bottom = row->second->top;  in AddRect()
107       row = rows_.insert(row, Rows::value_type(bottom, new Row(top, bottom)));  in AddRect()
112       assert(top <= row->second->bottom);  in AddRect()
119     if (rect.bottom() < row->second->bottom) {  in AddRect()
120       // If the bottom of the |rect| falls in the middle of the |row| split  in AddRect()
124           row, Rows::value_type(rect.bottom(), new Row(top, rect.bottom())));  in AddRect()
125       row->second->top = rect.bottom();  in AddRect()
132     top = row->second->bottom;  in AddRect()
159     if (previous_row->second->bottom == row->second->top &&  in MergeWithPrecedingRow()
195     if (it1->second->bottom <= it2->second->top) {  in Intersect()
203     int32_t bottom = std::min(it1->second->bottom, it2->second->bottom);  in Intersect()  local
206         rows_.end(), Rows::value_type(bottom, new Row(top, bottom)));  in Intersect()
217     if (it1->second->bottom == bottom)  in Intersect()
220     if (it2->second->bottom == bottom)  in Intersect()
293     if (row_a->second->bottom <= top) {  in Subtract()
305       assert(top <= row_a->second->bottom);  in Subtract()
314       if (top >= row_b->second->bottom) {  in Subtract()
322     if (row_b->second->bottom < row_a->second->bottom) {  in Subtract()
323       // If the bottom of |row_b| falls in the middle of the |row_a| split  in Subtract()
326       int bottom = row_b->second->bottom;  in Subtract()  local
328           rows_.insert(row_a, Rows::value_type(bottom, new Row(top, bottom)));  in Subtract()
329       row_a->second->top = bottom;  in Subtract()
339     top = row_a->second->bottom;  in Subtract()
341     if (top >= row_b->second->bottom) {  in Subtract()
377     row->bottom += dy;  in Translate()
389       new_rows.insert(new_rows.end(), Rows::value_type(row->bottom, row));  in Translate()
539         previous_row_->second->bottom == row_->second->top &&  in Advance()
553   int bottom;  in UpdateCurrentRect()  local
557     bottom = bottom_row->second->bottom;  in UpdateCurrentRect()
561            previous->second->bottom == bottom_row->second->top &&  in UpdateCurrentRect()
564                                 row_span_->right, bottom);  in UpdateCurrentRect()