Home
last modified time | relevance | path

Searched refs:top_ (Results 1 – 11 of 11) sorted by relevance

/test/testfwk/arkxtest/uitest/core/
Drect_algorithm.cpp27 if (ra.top_ >= rb.bottom_ || ra.bottom_ <= rb.top_) { in ComputeIntersection()
31 array<int32_t, INDEX_FOUR> py = {ra.top_, ra.bottom_, rb.top_, rb.bottom_}; in ComputeIntersection()
78 if (overlay.top_ >= rect.top_ && overlay.top_ <= rect.bottom_) { in CollectGridLineCoords()
80 if (overlay.top_ == g_YCoords[idx]) { in CollectGridLineCoords()
86 g_YCoords[g_YCount++] = overlay.top_; in CollectGridLineCoords()
91 if (overlay.bottom_ >= rect.top_ && overlay.bottom_ <= rect.bottom_) { in CollectGridLineCoords()
Dui_model.h81 : left_(left), right_(right), top_(top), bottom_(bottom) in Rect()
83 DCHECK(right_ >= left_ && bottom_ >= top_); in Rect()
88 int32_t top_; member
98 return (top_ + bottom_) / TWO; in GetCenterY()
108 return bottom_ - top_; in GetHeight()
125 …return ra.left_ == rb.left_ && ra.right_ == rb.right_ && ra.top_ == rb.top_ && ra.bottom_ == rb.bo… in CheckEqual()
133 if (ra.top_ >= rb.bottom_ || ra.bottom_ <= rb.top_) { in CheckIntersectant()
142 || point.py_ <= rect.top_ || point.py_ >= rect.bottom_) { in IsInnerPoint()
151 && point.py_ >= rect.top_ && point.py_ <= rect.bottom_) { in IsPointOnEdge()
154 if ((point.py_ == rect.top_ || point.py_ == rect.bottom_) in IsPointOnEdge()
Dwindow_operator.cpp103 Point from(rect.GetCenterX(), rect.top_ + step1); in CallBar()
104 Point to(rect.GetCenterX(), rect.top_ + step2); in CallBar()
117 Point focus(rect.GetCenterX(), rect.top_ + step); in Focus()
131 Point from(rect.left_ + step, rect.top_ + step); in MoveTo()
160 from = Point(window_.bounds_.GetCenterX(), window_.bounds_.top_); in Resize()
165 to = Point(window_.bounds_.GetCenterX(), window_.bounds_.top_ + highth); in Resize()
168 from = Point(window_.bounds_.left_, window_.bounds_.top_); 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()
181 to = Point(window_.bounds_.left_ + width, window_.bounds_.top_ + highth); in Resize()
Dwidget_operator.cpp111 bounds.top_ += options_.scrollWidgetDeadZone_; in ScrollToEnd()
114 Point topPoint(bounds.GetCenterX(), bounds.top_); in ScrollToEnd()
271 bounds.top_ += options_.scrollWidgetDeadZone_; in ScrollFindWidget()
274 Point topPoint(bounds.GetCenterX(), bounds.top_); in ScrollFindWidget()
Dui_model.cpp29 data["top"] = rect.top_; in Rect2JsonStr()
330 stream << "[" << rect.left_ << "," << rect.top_ << "]" in DfsMarshalWidget()
472 mergedBounds_.top_ = min(mergedBounds_.top_, rootBounds.top_); in PrepareToVisitSubTree()
Dfrontend_api_handler.cpp843 data["top"] = bounds.top_; in GenericComponentAttrGetter()
948 data["top"] = snapshot->bounds_.top_; in RegisterUiWindowAttrGetters()
/test/testfwk/arkxtest/uitest/test/
Drect_algorithm_test.cpp48 ASSERT_EQ(300, intersection.top_); in TEST()
55 ASSERT_EQ(350, intersection.top_); in TEST()
62 ASSERT_EQ(320, intersection.top_); in TEST()
Dui_model_test.cpp29 ASSERT_EQ(300, rect.top_); in TEST()
68 ASSERT_EQ(3, bounds.top_); in TEST()
174 ASSERT_EQ(-50, bounds.top_); in TEST()
298 ASSERT_EQ(expectedBound.top_, actualBound.top_); in TEST()
330 …stream << "[" << rect.left_ << "," << rect.top_ << "][" << rect.right_ << "," << rect.bottom_ << "… in CheckMergedTree()
/test/testfwk/arkxtest/uitest/record/
Dfind_widget.cpp38 if (x_ <= rect.right_ && x_ >= rect.left_ && y_ <= rect.bottom_ && y_ >= rect.top_) { in Matches()
Dui_record.cpp345 << windowBounds.top_ << "," << windowBounds.right_ << "," in RecordInitEnv()
352 g_outFile << windowBounds.top_ << ','; in RecordInitEnv()
/test/testfwk/arkxtest/uitest/server/
Dsystem_ui_controller.cpp176 …stream << "[" << rect.left_ << "," << rect.top_ << "]" << "[" << rect.right_ << "," << rect.bottom… in MarshalAccessibilityNodeAttributes()