26 DesktopRegion::Row::Row(int32_t top, int32_t bottom)  in Row()  argument
27     : top(top), bottom(bottom) {}  in Row()
66         it1->second->top != it2->second->top ||  in Equals()
93   // Top of the part of the |rect| that hasn't been inserted yet. Increased as  in AddRect()
95   int top = rect.top();  in AddRect()  local
99   Rows::iterator row = rows_.upper_bound(top);  in AddRect()
100   while (top < rect.bottom()) {  in AddRect()
101     if (row == rows_.end() || top < row->second->top) {  in AddRect()
102       // If |top| is above the top of the current |row| then add a new row above  in AddRect()
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()
108     } else if (top > row->second->top) {  in AddRect()
109       // If the |top| falls in the middle of the |row| then split |row| into  in AddRect()
110       // two, at |top|, and leave |row| referring to the lower of the two,  in AddRect()
112       assert(top <= row->second->bottom);  in AddRect()
114           row, Rows::value_type(top, new Row(row->second->top, top)));  in AddRect()
115       row->second->top = top;  in AddRect()
121       // |row| into two, at |top|, and leave |row| referring to the upper of  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()
161       row->second->top = previous_row->second->top;  in MergeWithPrecedingRow()
188     // Arrange for |it1| to always be the top-most of the rows.  in Intersect()
189     if (it2->second->top < it1->second->top) {  in Intersect()
195     if (it1->second->bottom <= it2->second->top) {  in Intersect()
200     // Top of the |it1| row is above the top of |it2|, so top of the  in Intersect()
201     // intersection is always the top of |it2|.  in Intersect()
202     int32_t top = it2->second->top;  in Intersect()  local
206         rows_.end(), Rows::value_type(bottom, new Row(top, bottom)));  in Intersect()
283   int top = row_b->second->top;  in Subtract()  local
286   // above |top|.  in Subtract()
287   Rows::iterator row_a = rows_.upper_bound(top);  in Subtract()
293     if (row_a->second->bottom <= top) {  in Subtract()
301     if (top > row_a->second->top) {  in Subtract()
302       // If |top| falls in the middle of |row_a| then split |row_a| into two, at  in Subtract()
303       // |top|, and leave |row_a| referring to the lower of the two, ready to  in Subtract()
305       assert(top <= row_a->second->bottom);  in Subtract()
307           row_a, Rows::value_type(top, new Row(row_a->second->top, top)));  in Subtract()
308       row_a->second->top = top;  in Subtract()
310     } else if (top < row_a->second->top) {  in Subtract()
311       // If the |top| is above |row_a| then skip the range between |top| and  in Subtract()
312       // top of |row_a| because it's empty.  in Subtract()
313       top = row_a->second->top;  in Subtract()
314       if (top >= row_b->second->bottom) {  in Subtract()
317           top = row_b->second->top;  in Subtract()
324       // |row_a| into two, at |top|, and leave |row_a| referring to the upper of  in Subtract()
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()
344         top = row_b->second->top;  in Subtract()
376     row->top += dy;  in Translate()
539         previous_row_->second->bottom == row_->second->top &&  in Advance()
561            previous->second->bottom == bottom_row->second->top &&  in UpdateCurrentRect()
563   rect_ = DesktopRect::MakeLTRB(row_span_->left, row_->second->top,  in UpdateCurrentRect()