Home
last modified time | relevance | path

Searched refs:ra (Results 1 – 2 of 2) sorted by relevance

/test/testfwk/arkxtest/uitest/core/
Dui_model.h115 FORCE_INLINE static bool CheckEqual(const Rect &ra, const Rect &rb);
116 FORCE_INLINE static bool CheckIntersectant(const Rect &ra, const Rect &rb);
119 static bool ComputeIntersection(const Rect &ra, const Rect &rb, Rect &result);
123 FORCE_INLINE bool RectAlgorithm::CheckEqual(const Rect &ra, const Rect &rb) in CheckEqual() argument
125 …return ra.left_ == rb.left_ && ra.right_ == rb.right_ && ra.top_ == rb.top_ && ra.bottom_ == rb.bo… in CheckEqual()
128 FORCE_INLINE bool RectAlgorithm::CheckIntersectant(const Rect &ra, const Rect &rb) in CheckIntersectant() argument
130 if (ra.left_ >= rb.right_ || ra.right_ <= rb.left_) { in CheckIntersectant()
133 if (ra.top_ >= rb.bottom_ || ra.bottom_ <= rb.top_) { in CheckIntersectant()
Drect_algorithm.cpp22 bool RectAlgorithm::ComputeIntersection(const Rect &ra, const Rect &rb, Rect &result) in ComputeIntersection() argument
24 if (ra.left_ >= rb.right_ || ra.right_ <= rb.left_) { in ComputeIntersection()
27 if (ra.top_ >= rb.bottom_ || ra.bottom_ <= rb.top_) { in ComputeIntersection()
30 array<int32_t, INDEX_FOUR> px = {ra.left_, ra.right_, rb.left_, rb.right_}; in ComputeIntersection()
31 array<int32_t, INDEX_FOUR> py = {ra.top_, ra.bottom_, rb.top_, rb.bottom_}; in ComputeIntersection()