Searched refs:left_ (Results 1 – 12 of 12) sorted by relevance
| /test/testfwk/arkxtest/uitest/core/ |
| D | rect_algorithm.cpp | 24 if (ra.left_ >= rb.right_ || ra.right_ <= rb.left_) { in ComputeIntersection()
30 array<int32_t, INDEX_FOUR> px = {ra.left_, ra.right_, rb.left_, rb.right_}; in ComputeIntersection()
52 if (overlay.left_ >= rect.left_ && overlay.left_ <= rect.right_) { in CollectGridLineCoords()
54 if (overlay.left_ == g_XCoords[idx]) { in CollectGridLineCoords()
60 g_XCoords[g_XCount++] = overlay.left_; in CollectGridLineCoords()
65 if (overlay.right_ >= rect.left_ && overlay.right_ <= rect.right_) { in CollectGridLineCoords()
|
| D | ui_model.h | 81 : left_(left), right_(right), top_(top), bottom_(bottom) in Rect()
83 DCHECK(right_ >= left_ && bottom_ >= top_); in Rect()
86 int32_t left_; member
93 return (left_ + right_) / TWO; in GetCenterX()
103 return right_ - left_; in GetWidth()
125 …return ra.left_ == rb.left_ && ra.right_ == rb.right_ && ra.top_ == rb.top_ && ra.bottom_ == rb.bo… in CheckEqual()
130 if (ra.left_ >= rb.right_ || ra.right_ <= rb.left_) { in CheckIntersectant()
141 if (point.px_ <= rect.left_ || point.px_ >= rect.right_ in IsInnerPoint()
150 if ((point.px_ == rect.left_ || point.px_ == rect.right_) in IsPointOnEdge()
155 && point.px_ >= rect.left_ && point.px_ <= rect.right_) { in IsPointOnEdge()
|
| D | window_operator.cpp | 131 Point from(rect.left_ + step, rect.top_ + step); in MoveTo()
152 from = Point(window_.bounds_.left_, window_.bounds_.GetCenterY()); in Resize()
157 to = Point((window_.bounds_.left_ + width), window_.bounds_.GetCenterY()); in Resize()
168 from = Point(window_.bounds_.left_, window_.bounds_.top_); in Resize()
172 from = Point(window_.bounds_.left_, window_.bounds_.bottom_); in Resize()
177 to = Point(window_.bounds_.left_ + width, window_.bounds_.bottom_ - highth); in Resize()
181 to = Point(window_.bounds_.left_ + width, window_.bounds_.top_ + highth); in Resize()
|
| D | ui_model.cpp | 28 data["left"] = rect.left_; in Rect2JsonStr()
330 stream << "[" << rect.left_ << "," << rect.top_ << "]" in DfsMarshalWidget()
471 mergedBounds_.left_ = min(mergedBounds_.left_, rootBounds.left_); in PrepareToVisitSubTree()
|
| D | ui_action.cpp | 125 const int32_t distanceX0 = abs(rect_.GetCenterX() - rect_.left_) * abs(scale_ - 1); in Decompose()
136 … auto fromPoint0 = Point(rect_.left_ + options.scrollWidgetDeadZone_, rect_.GetCenterY()); in Decompose()
137 auto toPoint0 = Point((rect_.left_ + distanceX0), rect_.GetCenterY()); in Decompose()
|
| D | frontend_api_handler.cpp | 842 data["left"] = bounds.left_; in GenericComponentAttrGetter()
947 data["left"] = snapshot->bounds_.left_; in RegisterUiWindowAttrGetters()
|
| /test/testfwk/arkxtest/uitest/test/ |
| D | rect_algorithm_test.cpp | 46 ASSERT_EQ(100, intersection.left_); in TEST()
53 ASSERT_EQ(150, intersection.left_); in TEST()
60 ASSERT_EQ(120, intersection.left_); in TEST()
|
| D | ui_model_test.cpp | 27 ASSERT_EQ(100, rect.left_); in TEST()
66 ASSERT_EQ(1, bounds.left_); in TEST()
172 ASSERT_EQ(0, bounds.left_); in TEST()
296 ASSERT_EQ(expectedBound.left_, actualBound.left_); in TEST()
330 …stream << "[" << rect.left_ << "," << rect.top_ << "][" << rect.right_ << "," << rect.bottom_ << "… in CheckMergedTree()
|
| D | ui_action_test.cpp | 227 const int32_t disX0 = abs(rect.left_ - rect.GetCenterX()) * abs(scale - 1); in TEST_F()
234 int32_t expectedPointerX0 = rect.left_ + (disX0 * step) / steps; in TEST_F()
367 const int32_t disX0 = abs(rect.left_ - rect.GetCenterX()) * abs(scale - 1); in TEST_F()
|
| /test/testfwk/arkxtest/uitest/record/ |
| D | find_widget.cpp | 38 if (x_ <= rect.right_ && x_ >= rect.left_ && y_ <= rect.bottom_ && y_ >= rect.top_) { in Matches()
|
| D | ui_record.cpp | 344 std::cout<< "windowBounds : (" << windowBounds.left_ << "," in RecordInitEnv()
351 g_outFile << windowBounds.left_ << ','; in RecordInitEnv()
|
| /test/testfwk/arkxtest/uitest/server/ |
| D | system_ui_controller.cpp | 176 …stream << "[" << rect.left_ << "," << rect.top_ << "]" << "[" << rect.right_ << "," << rect.bottom… in MarshalAccessibilityNodeAttributes()
|