Home
last modified time | relevance | path

Searched refs:ComputeIntersection (Results 1 - 4 of 4) sorted by relevance

/test/testfwk/arkxtest/uitest/test/
H A Drect_algorithm_test.cpp43 ASSERT_FALSE(RectAlgorithm::ComputeIntersection(rect0, rect1, intersection)); // no overlap in TEST()
44 ASSERT_FALSE(RectAlgorithm::ComputeIntersection(rect0, rect2, intersection)); // no overlap in TEST()
45 ASSERT_TRUE(RectAlgorithm::ComputeIntersection(rect0, rect3, intersection)); // x,y-overlap in TEST()
52 ASSERT_TRUE(RectAlgorithm::ComputeIntersection(rect0, rect4, intersection)); // x,y-overlap in TEST()
59 ASSERT_TRUE(RectAlgorithm::ComputeIntersection(rect0, rect5, intersection)); // fully contained in TEST()
/test/testfwk/arkxtest/uitest/core/
H A Drect_algorithm.cpp22 bool RectAlgorithm::ComputeIntersection(const Rect &ra, const Rect &rb, Rect &result) in ComputeIntersection() function in OHOS::uitest::RectAlgorithm
165 const auto intersected = RectAlgorithm::ComputeIntersection(rect, overlay, intersection); in ComputeMaxVisibleRegion()
H A Dui_model.h189 static bool ComputeIntersection(const Rect &ra, const Rect &rb, Rect &result);
H A Dselect_strategy.cpp51 if (!RectAlgorithm::ComputeIntersection(widget.GetBounds(), windowBounds_, visibleRect)) { in CalcWidgetVisibleBounds()
66 if (!RectAlgorithm::ComputeIntersection(widget.GetBounds(), find->second, visibleRect)) { in CalcWidgetVisibleBounds()

Completed in 3 milliseconds