Searched refs:right_ (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()
65 if (overlay.right_ >= rect.left_ && overlay.right_ <= rect.right_) { in CollectGridLineCoords()
67 if (overlay.right_ == g_XCoords[idx]) { in CollectGridLineCoords()
73 g_XCoords[g_XCount++] = overlay.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()
87 int32_t right_; 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 | 153 to = Point((window_.bounds_.right_ - width), window_.bounds_.GetCenterY()); in Resize()
156 from = Point(window_.bounds_.right_, window_.bounds_.GetCenterY()); in Resize()
169 to = Point(window_.bounds_.right_ - width, window_.bounds_.bottom_ - highth); in Resize()
173 to = Point(window_.bounds_.right_ - width, window_.bounds_.top_ + highth); in Resize()
176 from = Point(window_.bounds_.right_, window_.bounds_.top_); in Resize()
180 from = Point(window_.bounds_.right_, window_.bounds_.bottom_); in Resize()
|
| D | ui_model.cpp | 30 data["right"] = rect.right_; in Rect2JsonStr()
331 << "[" << rect.right_ << "," << rect.bottom_ << "]"; in DfsMarshalWidget()
473 mergedBounds_.right_ = max(mergedBounds_.right_, rootBounds.right_); in PrepareToVisitSubTree()
|
| D | ui_action.cpp | 138 … auto fromPoint1 = Point(rect_.right_ - options.scrollWidgetDeadZone_, rect_.GetCenterY()); in Decompose()
139 auto toPoint1 = Point((rect_.right_ - distanceX0), rect_.GetCenterY()); in Decompose()
|
| D | frontend_api_handler.cpp | 844 data["right"] = bounds.right_; in GenericComponentAttrGetter()
949 data["right"] = snapshot->bounds_.right_; in RegisterUiWindowAttrGetters()
|
| /test/testfwk/arkxtest/uitest/test/ |
| D | rect_algorithm_test.cpp | 47 ASSERT_EQ(150, intersection.right_); in TEST()
54 ASSERT_EQ(200, intersection.right_); in TEST()
61 ASSERT_EQ(180, intersection.right_); in TEST()
|
| D | ui_model_test.cpp | 28 ASSERT_EQ(200, rect.right_); in TEST()
67 ASSERT_EQ(2, bounds.right_); in TEST()
173 ASSERT_EQ(100, bounds.right_); // check converting negative number in TEST()
297 ASSERT_EQ(expectedBound.right_, actualBound.right_); in TEST()
330 …stream << "[" << rect.left_ << "," << rect.top_ << "][" << rect.right_ << "," << rect.bottom_ << "… in CheckMergedTree()
|
| D | ui_action_test.cpp | 253 int32_t expectedPointerX0 = rect.right_ - (disX0 * step) / steps; 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 | 345 << windowBounds.top_ << "," << windowBounds.right_ << "," in RecordInitEnv()
353 g_outFile << windowBounds.right_ << ','; in RecordInitEnv()
|
| /test/testfwk/arkxtest/uitest/server/ |
| D | system_ui_controller.cpp | 176 …stream << "[" << rect.left_ << "," << rect.top_ << "]" << "[" << rect.right_ << "," << rect.bottom… in MarshalAccessibilityNodeAttributes()
|