| /aosp12/frameworks/base/graphics/java/android/graphics/ |
| H A D | RectF.java | 58 this.top = top; in RectF()
75 top = r.top; in RectF()
86 top = r.top; in RectF()
205 this.top = top; in set()
218 this.top = src.top; in set()
231 this.top = src.top; in set()
356 if (this.top < top) { in intersect()
357 this.top = top; in intersect()
401 top = Math.max(a.top, b.top); in setIntersect()
485 this.top = top; in union()
[all …]
|
| H A D | Rect.java | 86 this.top = top; in Rect()
103 top = r.top; in Rect()
117 top = r.top; in Rect()
360 this.top = top; in set()
430 top += insets.top; in inset()
442 top += insets.top; in inset()
457 this.top += top; in inset()
535 if (this.top < top) this.top = top; in intersect()
567 top = Math.max(top, other.top); in intersectUnchecked()
588 top = Math.max(a.top, b.top); in setIntersect()
[all …]
|
| H A D | Insets.java | 36 public final int top; field in Insets
42 this.top = top; in Insets()
83 return new Rect(left, top, right, bottom); in toRect()
94 return Insets.of(a.left + b.left, a.top + b.top, a.right + b.right, a.bottom + b.bottom); in add()
105 return Insets.of(a.left - b.left, a.top - b.top, a.right - b.right, a.bottom - b.bottom); in subtract()
116 return Insets.of(Math.max(a.left, b.left), Math.max(a.top, b.top), in max()
128 return Insets.of(Math.min(a.left, b.left), Math.min(a.top, b.top), in min()
150 if (top != insets.top) return false; in equals()
158 result = 31 * result + top; in hashCode()
168 ", top=" + top + in toString()
[all …]
|
| /aosp12/frameworks/base/libs/hwui/ |
| H A D | Rect.h | 43 float top; variable
56 : left(left), top(top), right(right), bottom(bottom) {} in Rect()
91 this->top = top; in set()
121 top = std::max(top, t); in doIntersect()
138 if (top > r.top) top = r.top; in unionWith()
144 top = r.top; in unionWith()
195 top = floorf(top + Vertex::GeometryFudgeFactor()); in snapGeometryToPixelBoundaries()
212 top = floorf(top + 0.5f); in snapToPixelBoundaries()
219 top = floorf(top); in roundOut()
230 top = std::min(top, other.top); in expandToCover()
[all …]
|
| /aosp12/hardware/qcom/sm7250/display/sdm/libs/utils/ |
| H A D | rect.cpp | 45 (rect1.top == rect2.top) && in IsCongruent()
75 res.top = std::max(rect1.top, rect2.top); in Intersection()
94 res.top = rect.top + FLOAT(y_offset); in Reposition()
124 if (rect1.top < rect2.top) { in Subtract()
125 res[0].top = rect1.top; in Subtract()
128 res[0].top = rect2.top; in Subtract()
181 res.top = std::min(rect1.top, rect2.top); in Union()
199 out_rects[count].top = rect_temp.top; in SplitLeftRight()
227 out_rects[count].top = rect_temp.top; in SplitTopBottom()
268 out_rect->top = floor(dst_domain.top + (height_ratio * modified_in_rect.top)); in MapRect()
[all …]
|
| /aosp12/hardware/qcom/sm8150/display/sdm/libs/utils/ |
| H A D | rect.cpp | 45 (rect1.top == rect2.top) && in IsCongruent()
75 res.top = std::max(rect1.top, rect2.top); in Intersection()
94 res.top = rect.top + FLOAT(y_offset); in Reposition()
124 if (rect1.top < rect2.top) { in Subtract()
125 res[0].top = rect1.top; in Subtract()
128 res[0].top = rect2.top; in Subtract()
181 res.top = std::min(rect1.top, rect2.top); in Union()
199 out_rects[count].top = rect_temp.top; in SplitLeftRight()
227 out_rects[count].top = rect_temp.top; in SplitTopBottom()
267 out_rect->top = dst_domain.top + (height_ratio * modified_in_rect.top); in MapRect()
[all …]
|
| /aosp12/hardware/qcom/sm7250/gps/utils/ |
| H A D | LocHeap.cpp | 145 top->mSize--; in pop()
146 if (top->mLeft || top->mRight) { in pop()
150 LocHeapNode*& subTop = (NULL == top->mLeft) ? top->mRight : in pop()
151 ((NULL == top->mRight) ? top->mLeft : in pop()
152 (top->mLeft->outRanks(*(top->mRight)) ? top->mLeft : top->mRight)); in pop()
154 top->swap(*subTop); in pop()
162 top = NULL; in pop()
180 if (top->mLeft) { in remove()
190 top->mSize--; in remove()
242 top = mTree->mData; in peek()
[all …]
|
| /aosp12/hardware/qcom/sm8150/gps/utils/ |
| H A D | LocHeap.cpp | 145 top->mSize--; in pop()
146 if (top->mLeft || top->mRight) { in pop()
150 LocHeapNode*& subTop = (NULL == top->mLeft) ? top->mRight : in pop()
151 ((NULL == top->mRight) ? top->mLeft : in pop()
152 (top->mLeft->outRanks(*(top->mRight)) ? top->mLeft : top->mRight)); in pop()
154 top->swap(*subTop); in pop()
162 top = NULL; in pop()
180 if (top->mLeft) { in remove()
190 top->mSize--; in remove()
242 top = mTree->mData; in peek()
[all …]
|
| /aosp12/hardware/qcom/display/msm8909/sdm/libs/utils/ |
| H A D | rect.cpp | 45 (rect1.top == rect2.top) && in IsCongruent()
63 rect->top = ROUND_UP_ALIGN_UP(rect->top, align_y); in Normalize()
75 res.top = std::max(rect1.top, rect2.top); in Intersection()
94 res.top = rect.top + FLOAT(y_offset); in Reposition()
108 if ((rect1.top == rect2.top) && (rect2.bottom <= rect1.bottom)) { in Subtract()
113 } else if ((rect1.top == rect2.top) && (rect1.bottom == rect2.bottom)) { in Subtract()
140 res.top = std::min(rect1.top, rect2.top); in Union()
158 out_rects[count].top = rect_temp.top; in SplitLeftRight()
186 out_rects[count].top = rect_temp.top; in SplitTopBottom()
226 out_rect->top = dst_domain.top + (height_ratio * modified_in_rect.top); in MapRect()
[all …]
|
| /aosp12/hardware/qcom/display/msm8909w_3100/sdm/libs/utils/ |
| H A D | rect.cpp | 45 (rect1.top == rect2.top) && in IsCongruent()
58 rect->top = ROUND_UP_ALIGN_UP(rect->top, align_y); in Normalize()
70 res.top = std::max(rect1.top, rect2.top); in Intersection()
89 res.top = rect.top + FLOAT(y_offset); in Reposition()
103 if ((rect1.top == rect2.top) && (rect2.bottom <= rect1.bottom)) { in Subtract()
108 } else if ((rect1.top == rect2.top) && (rect1.bottom == rect2.bottom)) { in Subtract()
135 res.top = std::min(rect1.top, rect2.top); in Union()
153 out_rects[count].top = rect_temp.top; in SplitLeftRight()
181 out_rects[count].top = rect_temp.top; in SplitTopBottom()
221 out_rect->top = dst_domain.top + (height_ratio * modified_in_rect.top); in MapRect()
[all …]
|
| /aosp12/hardware/qcom/display/msm8998/sdm/libs/utils/ |
| H A D | rect.cpp | 45 (rect1.top == rect2.top) && in IsCongruent()
58 rect->top = ROUND_UP_ALIGN_UP(rect->top, align_y); in Normalize()
70 res.top = std::max(rect1.top, rect2.top); in Intersection()
89 res.top = rect.top + FLOAT(y_offset); in Reposition()
103 if ((rect1.top == rect2.top) && (rect2.bottom <= rect1.bottom)) { in Subtract()
108 } else if ((rect1.top == rect2.top) && (rect1.bottom == rect2.bottom)) { in Subtract()
135 res.top = std::min(rect1.top, rect2.top); in Union()
153 out_rects[count].top = rect_temp.top; in SplitLeftRight()
181 out_rects[count].top = rect_temp.top; in SplitTopBottom()
221 out_rect->top = dst_domain.top + (height_ratio * modified_in_rect.top); in MapRect()
[all …]
|
| /aosp12/hardware/qcom/sdm845/display/sdm/libs/utils/ |
| H A D | rect.cpp | 45 (rect1.top == rect2.top) && in IsCongruent()
63 rect->top = ROUND_UP_ALIGN_UP(rect->top, align_y); in Normalize()
75 res.top = std::max(rect1.top, rect2.top); in Intersection()
94 res.top = rect.top + FLOAT(y_offset); in Reposition()
108 if ((rect1.top == rect2.top) && (rect2.bottom <= rect1.bottom)) { in Subtract()
113 } else if ((rect1.top == rect2.top) && (rect1.bottom == rect2.bottom)) { in Subtract()
140 res.top = std::min(rect1.top, rect2.top); in Union()
158 out_rects[count].top = rect_temp.top; in SplitLeftRight()
186 out_rects[count].top = rect_temp.top; in SplitTopBottom()
226 out_rect->top = dst_domain.top + (height_ratio * modified_in_rect.top); in MapRect()
[all …]
|
| /aosp12/hardware/qcom/display/msm8996/sdm/libs/utils/ |
| H A D | rect.cpp | 45 (rect1.top == rect2.top) && in IsCongruent()
58 rect->top = ROUND_UP_ALIGN_UP(rect->top, align_y); in Normalize()
70 res.top = std::max(rect1.top, rect2.top); in Intersection()
89 res.top = rect.top + FLOAT(y_offset); in Reposition()
103 if ((rect1.top == rect2.top) && (rect2.bottom <= rect1.bottom)) { in Subtract()
105 } else if ((rect1.bottom == rect2.bottom) && (rect2.top >= rect1.top)) { in Subtract()
108 } else if ((rect1.top == rect2.top) && (rect1.bottom == rect2.bottom)) { in Subtract()
135 res.top = std::min(rect1.top, rect2.top); in Union()
153 out_rects[count].top = rect_temp.top; in SplitLeftRight()
181 out_rects[count].top = rect_temp.top; in SplitTopBottom()
[all …]
|
| /aosp12/hardware/qcom/gps/msm8909/utils/ |
| H A D | LocHeap.cpp | 143 top->mSize--; in pop()
144 if (top->mLeft || top->mRight) { in pop()
148 LocHeapNode*& subTop = (NULL == top->mLeft) ? top->mRight : in pop()
149 ((NULL == top->mRight) ? top->mLeft : in pop()
150 (top->mLeft->outRanks(*(top->mRight)) ? top->mLeft : top->mRight)); in pop()
152 top->swap(*subTop); in pop()
160 top = NULL; in pop()
178 if (top->mLeft) { in remove()
188 top->mSize--; in remove()
240 top = mTree->mData; in peek()
[all …]
|
| /aosp12/hardware/qcom/gps/msm8909w_3100/utils/ |
| H A D | LocHeap.cpp | 143 top->mSize--; in pop()
144 if (top->mLeft || top->mRight) { in pop()
148 LocHeapNode*& subTop = (NULL == top->mLeft) ? top->mRight : in pop()
149 ((NULL == top->mRight) ? top->mLeft : in pop()
150 (top->mLeft->outRanks(*(top->mRight)) ? top->mLeft : top->mRight)); in pop()
152 top->swap(*subTop); in pop()
160 top = NULL; in pop()
178 if (top->mLeft) { in remove()
188 top->mSize--; in remove()
240 top = mTree->mData; in peek()
[all …]
|
| /aosp12/hardware/qcom/gps/msm8996/utils/ |
| H A D | LocHeap.cpp | 143 top->mSize--; in pop()
144 if (top->mLeft || top->mRight) { in pop()
148 LocHeapNode*& subTop = (NULL == top->mLeft) ? top->mRight : in pop()
149 ((NULL == top->mRight) ? top->mLeft : in pop()
150 (top->mLeft->outRanks(*(top->mRight)) ? top->mLeft : top->mRight)); in pop()
152 top->swap(*subTop); in pop()
160 top = NULL; in pop()
178 if (top->mLeft) { in remove()
188 top->mSize--; in remove()
240 top = mTree->mData; in peek()
[all …]
|
| /aosp12/hardware/qcom/gps/msm8998/utils/ |
| H A D | LocHeap.cpp | 143 top->mSize--; in pop()
144 if (top->mLeft || top->mRight) { in pop()
148 LocHeapNode*& subTop = (NULL == top->mLeft) ? top->mRight : in pop()
149 ((NULL == top->mRight) ? top->mLeft : in pop()
150 (top->mLeft->outRanks(*(top->mRight)) ? top->mLeft : top->mRight)); in pop()
152 top->swap(*subTop); in pop()
160 top = NULL; in pop()
178 if (top->mLeft) { in remove()
188 top->mSize--; in remove()
240 top = mTree->mData; in peek()
[all …]
|
| /aosp12/hardware/qcom/sm7150/gps/utils/ |
| H A D | LocHeap.cpp | 143 top->mSize--; in pop()
144 if (top->mLeft || top->mRight) { in pop()
148 LocHeapNode*& subTop = (NULL == top->mLeft) ? top->mRight : in pop()
149 ((NULL == top->mRight) ? top->mLeft : in pop()
150 (top->mLeft->outRanks(*(top->mRight)) ? top->mLeft : top->mRight)); in pop()
152 top->swap(*subTop); in pop()
160 top = NULL; in pop()
178 if (top->mLeft) { in remove()
188 top->mSize--; in remove()
240 top = mTree->mData; in peek()
[all …]
|
| /aosp12/hardware/qcom/sdm845/gps/msm8909/utils/ |
| H A D | LocHeap.cpp | 143 top->mSize--; in pop()
144 if (top->mLeft || top->mRight) { in pop()
148 LocHeapNode*& subTop = (NULL == top->mLeft) ? top->mRight : in pop()
149 ((NULL == top->mRight) ? top->mLeft : in pop()
150 (top->mLeft->outRanks(*(top->mRight)) ? top->mLeft : top->mRight)); in pop()
152 top->swap(*subTop); in pop()
160 top = NULL; in pop()
178 if (top->mLeft) { in remove()
188 top->mSize--; in remove()
240 top = mTree->mData; in peek()
[all …]
|
| /aosp12/hardware/qcom/sdm845/gps/msm8998/utils/ |
| H A D | LocHeap.cpp | 143 top->mSize--; in pop()
144 if (top->mLeft || top->mRight) { in pop()
148 LocHeapNode*& subTop = (NULL == top->mLeft) ? top->mRight : in pop()
149 ((NULL == top->mRight) ? top->mLeft : in pop()
150 (top->mLeft->outRanks(*(top->mRight)) ? top->mLeft : top->mRight)); in pop()
152 top->swap(*subTop); in pop()
160 top = NULL; in pop()
178 if (top->mLeft) { in remove()
188 top->mSize--; in remove()
240 top = mTree->mData; in peek()
[all …]
|
| /aosp12/hardware/qcom/sm8150p/gps/utils/ |
| H A D | LocHeap.cpp | 143 top->mSize--; in pop()
144 if (top->mLeft || top->mRight) { in pop()
148 LocHeapNode*& subTop = (NULL == top->mLeft) ? top->mRight : in pop()
149 ((NULL == top->mRight) ? top->mLeft : in pop()
150 (top->mLeft->outRanks(*(top->mRight)) ? top->mLeft : top->mRight)); in pop()
152 top->swap(*subTop); in pop()
160 top = NULL; in pop()
178 if (top->mLeft) { in remove()
188 top->mSize--; in remove()
240 top = mTree->mData; in peek()
[all …]
|
| /aosp12/hardware/qcom/sdm845/gps/sdm845/utils/ |
| H A D | LocHeap.cpp | 143 top->mSize--; in pop()
144 if (top->mLeft || top->mRight) { in pop()
148 LocHeapNode*& subTop = (NULL == top->mLeft) ? top->mRight : in pop()
149 ((NULL == top->mRight) ? top->mLeft : in pop()
150 (top->mLeft->outRanks(*(top->mRight)) ? top->mLeft : top->mRight)); in pop()
152 top->swap(*subTop); in pop()
160 top = NULL; in pop()
178 if (top->mLeft) { in remove()
188 top->mSize--; in remove()
240 top = mTree->mData; in peek()
[all …]
|
| /aosp12/hardware/qcom/sdm845/gps/msm8996/utils/ |
| H A D | LocHeap.cpp | 143 top->mSize--; in pop()
144 if (top->mLeft || top->mRight) { in pop()
148 LocHeapNode*& subTop = (NULL == top->mLeft) ? top->mRight : in pop()
149 ((NULL == top->mRight) ? top->mLeft : in pop()
150 (top->mLeft->outRanks(*(top->mRight)) ? top->mLeft : top->mRight)); in pop()
152 top->swap(*subTop); in pop()
160 top = NULL; in pop()
178 if (top->mLeft) { in remove()
188 top->mSize--; in remove()
240 top = mTree->mData; in peek()
[all …]
|
| /aosp12/frameworks/native/libs/ui/ |
| H A D | Rect.cpp | 36 top = 0; in makeInvalid()
42 if (top < rhs.top) { in operator <()
44 } else if (top == rhs.top) { in operator <()
62 bottom -= top - y; in offsetTo()
64 top = y; in offsetTo()
70 top += y; in offsetBy()
78 this->top += _top; in inset()
96 result->top = max(top, with.top); in intersect()
114 int top = result.left; in transform() local
127 mask |= (exclude.top > top) ? 2 : 0; in reduce()
[all …]
|
| /aosp12/frameworks/base/services/tests/wmtests/src/com/android/server/wm/ |
| H A D | TaskPositionerTests.java | 117 final Rect r = new Rect(left, top, left + windowSize, top + windowSize); in testMoveWindow()
210 assertNotEquals(r.top, mPositioner.getWindowDragBounds().top); in testFreeWindowResizingTestAllEdges()
219 assertNotEquals(r.top, mPositioner.getWindowDragBounds().top); in testFreeWindowResizingTestAllEdges()
228 assertNotEquals(r.top, mPositioner.getWindowDragBounds().top); in testFreeWindowResizingTestAllEdges()
237 assertEquals(r.top, mPositioner.getWindowDragBounds().top); in testFreeWindowResizingTestAllEdges()
246 assertEquals(r.top, mPositioner.getWindowDragBounds().top); in testFreeWindowResizingTestAllEdges()
255 assertEquals(r.top, mPositioner.getWindowDragBounds().top); in testFreeWindowResizingTestAllEdges()
264 assertEquals(r.top, mPositioner.getWindowDragBounds().top); in testFreeWindowResizingTestAllEdges()
273 assertEquals(r.top, mPositioner.getWindowDragBounds().top); in testFreeWindowResizingTestAllEdges()
342 assertBoundsEquals(new Rect(r.right - w, r.top, r.right, r.top + h), in testLandscapePreservedWindowResizingDragLeft()
[all …]
|