quad_f_unittest.cc 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676
  1. // Copyright 2022 The Chromium Authors. All rights reserved.
  2. // Use of this source code is governed by a BSD-style license that can be
  3. // found in the LICENSE file.
  4. #include <stddef.h>
  5. #include "base/cxx17_backports.h"
  6. #include "build/build_config.h"
  7. #include "testing/gtest/include/gtest/gtest.h"
  8. #include "ui/gfx/geometry/quad_f.h"
  9. #include "ui/gfx/geometry/rect_f.h"
  10. namespace gfx {
  11. TEST(QuadFTest, Construction) {
  12. // Verify constructors.
  13. PointF a(1, 1);
  14. PointF b(2, 1);
  15. PointF c(2, 2);
  16. PointF d(1, 2);
  17. PointF e;
  18. QuadF q1;
  19. QuadF q2(e, e, e, e);
  20. QuadF q3(a, b, c, d);
  21. QuadF q4(BoundingRect(a, c));
  22. EXPECT_EQ(q1, q2);
  23. EXPECT_EQ(q3, q4);
  24. // Verify getters.
  25. EXPECT_EQ(q3.p1(), a);
  26. EXPECT_EQ(q3.p2(), b);
  27. EXPECT_EQ(q3.p3(), c);
  28. EXPECT_EQ(q3.p4(), d);
  29. // Verify setters.
  30. q3.set_p1(b);
  31. q3.set_p2(c);
  32. q3.set_p3(d);
  33. q3.set_p4(a);
  34. EXPECT_EQ(q3.p1(), b);
  35. EXPECT_EQ(q3.p2(), c);
  36. EXPECT_EQ(q3.p3(), d);
  37. EXPECT_EQ(q3.p4(), a);
  38. // Verify operator=(Rect)
  39. EXPECT_NE(q1, q4);
  40. q1 = BoundingRect(a, c);
  41. EXPECT_EQ(q1, q4);
  42. // Verify operator=(Quad)
  43. EXPECT_NE(q1, q3);
  44. q1 = q3;
  45. EXPECT_EQ(q1, q3);
  46. }
  47. TEST(QuadFTest, AddingVectors) {
  48. PointF a(1, 1);
  49. PointF b(2, 1);
  50. PointF c(2, 2);
  51. PointF d(1, 2);
  52. Vector2dF v(3.5f, -2.5f);
  53. QuadF q1(a, b, c, d);
  54. QuadF added = q1 + v;
  55. q1 += v;
  56. QuadF expected1(PointF(4.5f, -1.5f), PointF(5.5f, -1.5f), PointF(5.5f, -0.5f),
  57. PointF(4.5f, -0.5f));
  58. EXPECT_EQ(expected1, added);
  59. EXPECT_EQ(expected1, q1);
  60. QuadF q2(a, b, c, d);
  61. QuadF subtracted = q2 - v;
  62. q2 -= v;
  63. QuadF expected2(PointF(-2.5f, 3.5f), PointF(-1.5f, 3.5f), PointF(-1.5f, 4.5f),
  64. PointF(-2.5f, 4.5f));
  65. EXPECT_EQ(expected2, subtracted);
  66. EXPECT_EQ(expected2, q2);
  67. QuadF q3(a, b, c, d);
  68. q3 += v;
  69. q3 -= v;
  70. EXPECT_EQ(QuadF(a, b, c, d), q3);
  71. EXPECT_EQ(q3, (q3 + v - v));
  72. }
  73. TEST(QuadFTest, IsRectilinear) {
  74. PointF a(1, 1);
  75. PointF b(2, 1);
  76. PointF c(2, 2);
  77. PointF d(1, 2);
  78. Vector2dF v(3.5f, -2.5f);
  79. EXPECT_TRUE(QuadF().IsRectilinear());
  80. EXPECT_TRUE(QuadF(a, b, c, d).IsRectilinear());
  81. EXPECT_TRUE((QuadF(a, b, c, d) + v).IsRectilinear());
  82. float epsilon = std::numeric_limits<float>::epsilon();
  83. PointF a2(1 + epsilon / 2, 1 + epsilon / 2);
  84. PointF b2(2 + epsilon / 2, 1 + epsilon / 2);
  85. PointF c2(2 + epsilon / 2, 2 + epsilon / 2);
  86. PointF d2(1 + epsilon / 2, 2 + epsilon / 2);
  87. EXPECT_TRUE(QuadF(a2, b, c, d).IsRectilinear());
  88. EXPECT_TRUE((QuadF(a2, b, c, d) + v).IsRectilinear());
  89. EXPECT_TRUE(QuadF(a, b2, c, d).IsRectilinear());
  90. EXPECT_TRUE((QuadF(a, b2, c, d) + v).IsRectilinear());
  91. EXPECT_TRUE(QuadF(a, b, c2, d).IsRectilinear());
  92. EXPECT_TRUE((QuadF(a, b, c2, d) + v).IsRectilinear());
  93. EXPECT_TRUE(QuadF(a, b, c, d2).IsRectilinear());
  94. EXPECT_TRUE((QuadF(a, b, c, d2) + v).IsRectilinear());
  95. struct {
  96. PointF a_off, b_off, c_off, d_off;
  97. } tests[] = {{PointF(1, 1.00001f), PointF(2, 1.00001f), PointF(2, 2.00001f),
  98. PointF(1, 2.00001f)},
  99. {PointF(1.00001f, 1), PointF(2.00001f, 1), PointF(2.00001f, 2),
  100. PointF(1.00001f, 2)},
  101. {PointF(1.00001f, 1.00001f), PointF(2.00001f, 1.00001f),
  102. PointF(2.00001f, 2.00001f), PointF(1.00001f, 2.00001f)},
  103. {PointF(1, 0.99999f), PointF(2, 0.99999f), PointF(2, 1.99999f),
  104. PointF(1, 1.99999f)},
  105. {PointF(0.99999f, 1), PointF(1.99999f, 1), PointF(1.99999f, 2),
  106. PointF(0.99999f, 2)},
  107. {PointF(0.99999f, 0.99999f), PointF(1.99999f, 0.99999f),
  108. PointF(1.99999f, 1.99999f), PointF(0.99999f, 1.99999f)}};
  109. for (const auto& test : tests) {
  110. PointF a_off = test.a_off;
  111. PointF b_off = test.b_off;
  112. PointF c_off = test.c_off;
  113. PointF d_off = test.d_off;
  114. EXPECT_FALSE(QuadF(a_off, b, c, d).IsRectilinear());
  115. EXPECT_FALSE((QuadF(a_off, b, c, d) + v).IsRectilinear());
  116. EXPECT_FALSE(QuadF(a, b_off, c, d).IsRectilinear());
  117. EXPECT_FALSE((QuadF(a, b_off, c, d) + v).IsRectilinear());
  118. EXPECT_FALSE(QuadF(a, b, c_off, d).IsRectilinear());
  119. EXPECT_FALSE((QuadF(a, b, c_off, d) + v).IsRectilinear());
  120. EXPECT_FALSE(QuadF(a, b, c, d_off).IsRectilinear());
  121. EXPECT_FALSE((QuadF(a, b, c, d_off) + v).IsRectilinear());
  122. EXPECT_FALSE(QuadF(a_off, b, c_off, d).IsRectilinear());
  123. EXPECT_FALSE((QuadF(a_off, b, c_off, d) + v).IsRectilinear());
  124. EXPECT_FALSE(QuadF(a, b_off, c, d_off).IsRectilinear());
  125. EXPECT_FALSE((QuadF(a, b_off, c, d_off) + v).IsRectilinear());
  126. EXPECT_FALSE(QuadF(a, b_off, c_off, d_off).IsRectilinear());
  127. EXPECT_FALSE((QuadF(a, b_off, c_off, d_off) + v).IsRectilinear());
  128. EXPECT_FALSE(QuadF(a_off, b, c_off, d_off).IsRectilinear());
  129. EXPECT_FALSE((QuadF(a_off, b, c_off, d_off) + v).IsRectilinear());
  130. EXPECT_FALSE(QuadF(a_off, b_off, c, d_off).IsRectilinear());
  131. EXPECT_FALSE((QuadF(a_off, b_off, c, d_off) + v).IsRectilinear());
  132. EXPECT_FALSE(QuadF(a_off, b_off, c_off, d).IsRectilinear());
  133. EXPECT_FALSE((QuadF(a_off, b_off, c_off, d) + v).IsRectilinear());
  134. EXPECT_TRUE(QuadF(a_off, b_off, c_off, d_off).IsRectilinear());
  135. EXPECT_TRUE((QuadF(a_off, b_off, c_off, d_off) + v).IsRectilinear());
  136. }
  137. }
  138. TEST(QuadFTest, IsCounterClockwise) {
  139. PointF a1(1, 1);
  140. PointF b1(2, 1);
  141. PointF c1(2, 2);
  142. PointF d1(1, 2);
  143. EXPECT_FALSE(QuadF(a1, b1, c1, d1).IsCounterClockwise());
  144. EXPECT_FALSE(QuadF(b1, c1, d1, a1).IsCounterClockwise());
  145. EXPECT_TRUE(QuadF(a1, d1, c1, b1).IsCounterClockwise());
  146. EXPECT_TRUE(QuadF(c1, b1, a1, d1).IsCounterClockwise());
  147. // Slightly more complicated quads should work just as easily.
  148. PointF a2(1.3f, 1.4f);
  149. PointF b2(-0.7f, 4.9f);
  150. PointF c2(1.8f, 6.2f);
  151. PointF d2(2.1f, 1.6f);
  152. EXPECT_TRUE(QuadF(a2, b2, c2, d2).IsCounterClockwise());
  153. EXPECT_TRUE(QuadF(b2, c2, d2, a2).IsCounterClockwise());
  154. EXPECT_FALSE(QuadF(a2, d2, c2, b2).IsCounterClockwise());
  155. EXPECT_FALSE(QuadF(c2, b2, a2, d2).IsCounterClockwise());
  156. // Quads with 3 collinear points should work correctly, too.
  157. PointF a3(0, 0);
  158. PointF b3(1, 0);
  159. PointF c3(2, 0);
  160. PointF d3(1, 1);
  161. EXPECT_FALSE(QuadF(a3, b3, c3, d3).IsCounterClockwise());
  162. EXPECT_FALSE(QuadF(b3, c3, d3, a3).IsCounterClockwise());
  163. EXPECT_TRUE(QuadF(a3, d3, c3, b3).IsCounterClockwise());
  164. // The next expectation in particular would fail for an implementation
  165. // that incorrectly uses only a cross product of the first 3 vertices.
  166. EXPECT_TRUE(QuadF(c3, b3, a3, d3).IsCounterClockwise());
  167. // Non-convex quads should work correctly, too.
  168. PointF a4(0, 0);
  169. PointF b4(1, 1);
  170. PointF c4(2, 0);
  171. PointF d4(1, 3);
  172. EXPECT_FALSE(QuadF(a4, b4, c4, d4).IsCounterClockwise());
  173. EXPECT_FALSE(QuadF(b4, c4, d4, a4).IsCounterClockwise());
  174. EXPECT_TRUE(QuadF(a4, d4, c4, b4).IsCounterClockwise());
  175. EXPECT_TRUE(QuadF(c4, b4, a4, d4).IsCounterClockwise());
  176. // A quad with huge coordinates should not fail this check due to
  177. // single-precision overflow.
  178. PointF a5(1e30f, 1e30f);
  179. PointF b5(1e35f, 1e30f);
  180. PointF c5(1e35f, 1e35f);
  181. PointF d5(1e30f, 1e35f);
  182. EXPECT_FALSE(QuadF(a5, b5, c5, d5).IsCounterClockwise());
  183. EXPECT_FALSE(QuadF(b5, c5, d5, a5).IsCounterClockwise());
  184. EXPECT_TRUE(QuadF(a5, d5, c5, b5).IsCounterClockwise());
  185. EXPECT_TRUE(QuadF(c5, b5, a5, d5).IsCounterClockwise());
  186. }
  187. TEST(QuadFTest, BoundingBox) {
  188. RectF r(3.2f, 5.4f, 7.007f, 12.01f);
  189. EXPECT_EQ(r, QuadF(r).BoundingBox());
  190. PointF a(1.3f, 1.4f);
  191. PointF b(-0.7f, 4.9f);
  192. PointF c(1.8f, 6.2f);
  193. PointF d(2.1f, 1.6f);
  194. float left = -0.7f;
  195. float top = 1.4f;
  196. float right = 2.1f;
  197. float bottom = 6.2f;
  198. EXPECT_EQ(RectF(left, top, right - left, bottom - top),
  199. QuadF(a, b, c, d).BoundingBox());
  200. }
  201. TEST(QuadFTest, ContainsPoint) {
  202. PointF a(1.3f, 1.4f);
  203. PointF b(-0.8f, 4.4f);
  204. PointF c(1.8f, 6.1f);
  205. PointF d(2.1f, 1.6f);
  206. Vector2dF epsilon_x(2 * std::numeric_limits<float>::epsilon(), 0);
  207. Vector2dF epsilon_y(0, 2 * std::numeric_limits<float>::epsilon());
  208. Vector2dF ac_center = c - a;
  209. ac_center.Scale(0.5f);
  210. Vector2dF bd_center = d - b;
  211. bd_center.Scale(0.5f);
  212. EXPECT_TRUE(QuadF(a, b, c, d).Contains(a + ac_center));
  213. EXPECT_TRUE(QuadF(a, b, c, d).Contains(b + bd_center));
  214. EXPECT_TRUE(QuadF(a, b, c, d).Contains(c - ac_center));
  215. EXPECT_TRUE(QuadF(a, b, c, d).Contains(d - bd_center));
  216. EXPECT_FALSE(QuadF(a, b, c, d).Contains(a - ac_center));
  217. EXPECT_FALSE(QuadF(a, b, c, d).Contains(b - bd_center));
  218. EXPECT_FALSE(QuadF(a, b, c, d).Contains(c + ac_center));
  219. EXPECT_FALSE(QuadF(a, b, c, d).Contains(d + bd_center));
  220. EXPECT_TRUE(QuadF(a, b, c, d).Contains(a));
  221. EXPECT_FALSE(QuadF(a, b, c, d).Contains(a - epsilon_x));
  222. EXPECT_FALSE(QuadF(a, b, c, d).Contains(a - epsilon_y));
  223. EXPECT_FALSE(QuadF(a, b, c, d).Contains(a + epsilon_x));
  224. EXPECT_TRUE(QuadF(a, b, c, d).Contains(a + epsilon_y));
  225. EXPECT_TRUE(QuadF(a, b, c, d).Contains(b));
  226. EXPECT_FALSE(QuadF(a, b, c, d).Contains(b - epsilon_x));
  227. EXPECT_FALSE(QuadF(a, b, c, d).Contains(b - epsilon_y));
  228. EXPECT_TRUE(QuadF(a, b, c, d).Contains(b + epsilon_x));
  229. EXPECT_FALSE(QuadF(a, b, c, d).Contains(b + epsilon_y));
  230. EXPECT_TRUE(QuadF(a, b, c, d).Contains(c));
  231. EXPECT_FALSE(QuadF(a, b, c, d).Contains(c - epsilon_x));
  232. EXPECT_TRUE(QuadF(a, b, c, d).Contains(c - epsilon_y));
  233. EXPECT_FALSE(QuadF(a, b, c, d).Contains(c + epsilon_x));
  234. EXPECT_FALSE(QuadF(a, b, c, d).Contains(c + epsilon_y));
  235. EXPECT_TRUE(QuadF(a, b, c, d).Contains(d));
  236. EXPECT_TRUE(QuadF(a, b, c, d).Contains(d - epsilon_x));
  237. EXPECT_FALSE(QuadF(a, b, c, d).Contains(d - epsilon_y));
  238. EXPECT_FALSE(QuadF(a, b, c, d).Contains(d + epsilon_x));
  239. EXPECT_FALSE(QuadF(a, b, c, d).Contains(d + epsilon_y));
  240. // Test a simple square.
  241. PointF s1(-1, -1);
  242. PointF s2(1, -1);
  243. PointF s3(1, 1);
  244. PointF s4(-1, 1);
  245. // Top edge.
  246. EXPECT_FALSE(QuadF(s1, s2, s3, s4).Contains(PointF(-1.1f, -1.0f)));
  247. EXPECT_TRUE(QuadF(s1, s2, s3, s4).Contains(PointF(-1.0f, -1.0f)));
  248. EXPECT_TRUE(QuadF(s1, s2, s3, s4).Contains(PointF(0.0f, -1.0f)));
  249. EXPECT_TRUE(QuadF(s1, s2, s3, s4).Contains(PointF(1.0f, -1.0f)));
  250. EXPECT_FALSE(QuadF(s1, s2, s3, s4).Contains(PointF(1.1f, -1.0f)));
  251. // Bottom edge.
  252. EXPECT_FALSE(QuadF(s1, s2, s3, s4).Contains(PointF(-1.1f, 1.0f)));
  253. EXPECT_TRUE(QuadF(s1, s2, s3, s4).Contains(PointF(-1.0f, 1.0f)));
  254. EXPECT_TRUE(QuadF(s1, s2, s3, s4).Contains(PointF(0.0f, 1.0f)));
  255. EXPECT_TRUE(QuadF(s1, s2, s3, s4).Contains(PointF(1.0f, 1.0f)));
  256. EXPECT_FALSE(QuadF(s1, s2, s3, s4).Contains(PointF(1.1f, 1.0f)));
  257. // Left edge.
  258. EXPECT_FALSE(QuadF(s1, s2, s3, s4).Contains(PointF(-1.0f, -1.1f)));
  259. EXPECT_TRUE(QuadF(s1, s2, s3, s4).Contains(PointF(-1.0f, -1.0f)));
  260. EXPECT_TRUE(QuadF(s1, s2, s3, s4).Contains(PointF(-1.0f, 0.0f)));
  261. EXPECT_TRUE(QuadF(s1, s2, s3, s4).Contains(PointF(-1.0f, 1.0f)));
  262. EXPECT_FALSE(QuadF(s1, s2, s3, s4).Contains(PointF(-1.0f, 1.1f)));
  263. // Right edge.
  264. EXPECT_FALSE(QuadF(s1, s2, s3, s4).Contains(PointF(1.0f, -1.1f)));
  265. EXPECT_TRUE(QuadF(s1, s2, s3, s4).Contains(PointF(1.0f, -1.0f)));
  266. EXPECT_TRUE(QuadF(s1, s2, s3, s4).Contains(PointF(1.0f, 0.0f)));
  267. EXPECT_TRUE(QuadF(s1, s2, s3, s4).Contains(PointF(1.0f, 1.0f)));
  268. EXPECT_FALSE(QuadF(s1, s2, s3, s4).Contains(PointF(1.0f, 1.1f)));
  269. // Centered inside.
  270. EXPECT_TRUE(QuadF(s1, s2, s3, s4).Contains(PointF(0, 0)));
  271. // Centered outside.
  272. EXPECT_FALSE(QuadF(s1, s2, s3, s4).Contains(PointF(-1.1f, 0)));
  273. EXPECT_FALSE(QuadF(s1, s2, s3, s4).Contains(PointF(1.1f, 0)));
  274. EXPECT_FALSE(QuadF(s1, s2, s3, s4).Contains(PointF(0, -1.1f)));
  275. EXPECT_FALSE(QuadF(s1, s2, s3, s4).Contains(PointF(0, 1.1f)));
  276. }
  277. TEST(QuadFTest, ContainsQuad) {
  278. QuadF quad(PointF(10, 0), PointF(20, 10), PointF(10, 20), PointF(0, 10));
  279. EXPECT_TRUE(quad.ContainsQuad(quad));
  280. EXPECT_TRUE(QuadF(quad.BoundingBox()).ContainsQuad(quad));
  281. EXPECT_FALSE(quad.ContainsQuad(QuadF(quad.BoundingBox())));
  282. EXPECT_FALSE(quad.ContainsQuad(QuadF(RectF(4.9, 4.9, 9.8, 9.8))));
  283. EXPECT_TRUE(quad.ContainsQuad(QuadF(RectF(5.1, 5.1, 9.8, 9.8))));
  284. EXPECT_FALSE(quad.ContainsQuad(QuadF(RectF(5.1, 5.1, 11, 9.8))));
  285. EXPECT_FALSE(quad.ContainsQuad(QuadF(RectF(5.1, 5.1, 9.8, 11))));
  286. EXPECT_FALSE(quad.ContainsQuad(quad + gfx::Vector2dF(0.1, 0)));
  287. EXPECT_FALSE(quad.ContainsQuad(quad + gfx::Vector2dF(0, 0.1)));
  288. EXPECT_FALSE(quad.ContainsQuad(quad - gfx::Vector2dF(0.1, 0)));
  289. EXPECT_FALSE(quad.ContainsQuad(quad - gfx::Vector2dF(0, 0.1)));
  290. }
  291. TEST(QuadFTest, Scale) {
  292. PointF a(1.3f, 1.4f);
  293. PointF b(-0.8f, 4.4f);
  294. PointF c(1.8f, 6.1f);
  295. PointF d(2.1f, 1.6f);
  296. QuadF q1(a, b, c, d);
  297. q1.Scale(1.5f);
  298. PointF a_scaled = ScalePoint(a, 1.5f);
  299. PointF b_scaled = ScalePoint(b, 1.5f);
  300. PointF c_scaled = ScalePoint(c, 1.5f);
  301. PointF d_scaled = ScalePoint(d, 1.5f);
  302. EXPECT_EQ(q1, QuadF(a_scaled, b_scaled, c_scaled, d_scaled));
  303. QuadF q2;
  304. q2.Scale(1.5f);
  305. EXPECT_EQ(q2, q2);
  306. }
  307. TEST(QuadFTest, IntersectsRectClockwise) {
  308. QuadF quad(PointF(10, 0), PointF(20, 10), PointF(10, 20), PointF(0, 10));
  309. // Top-left.
  310. EXPECT_FALSE(quad.IntersectsRect(RectF(0, 0, 4.9, 4.9)));
  311. EXPECT_TRUE(quad.IntersectsRect(RectF(0, 0, 4.9, 6)));
  312. EXPECT_TRUE(quad.IntersectsRect(RectF(0, 0, 5.1, 5.1)));
  313. EXPECT_TRUE(quad.IntersectsRect(RectF(0, 0, 6, 4.9)));
  314. EXPECT_FALSE(quad.IntersectsRect(RectF(0, 0, 2, 6)));
  315. EXPECT_FALSE(quad.IntersectsRect(RectF(0, 0, 6, 2)));
  316. // Top.
  317. EXPECT_FALSE(quad.IntersectsRect(RectF(0, -30, 20, 2)));
  318. // TODO(crbug.com/1283709): For now the result is true.
  319. // EXPECT_FALSE(quad.IntersectsRect(RectF(0, -5, 20, 2)));
  320. // EXPECT_FALSE(quad.IntersectsRect(RectF(0, -5, 20, 4.9)));
  321. EXPECT_TRUE(quad.IntersectsRect(RectF(0, -5, 20, 5.1)));
  322. // Top-right.
  323. EXPECT_FALSE(quad.IntersectsRect(RectF(15.1, 0, 10, 4.9)));
  324. EXPECT_TRUE(quad.IntersectsRect(RectF(15.1, 0, 10, 6)));
  325. EXPECT_TRUE(quad.IntersectsRect(RectF(14.9, 0, 10, 5.1)));
  326. EXPECT_TRUE(quad.IntersectsRect(RectF(14, 0, 10, 4.9)));
  327. EXPECT_FALSE(quad.IntersectsRect(RectF(18, 0, 10, 6)));
  328. EXPECT_FALSE(quad.IntersectsRect(RectF(14, 0, 10, 2)));
  329. // Right.
  330. EXPECT_FALSE(quad.IntersectsRect(RectF(50, 0, 2, 20)));
  331. // TODO(crbug.com/1283709): For now the result is true.
  332. // EXPECT_FALSE(quad.IntersectsRect(RectF(22, 0, 2, 20)));
  333. // EXPECT_FALSE(quad.IntersectsRect(RectF(20.1, 0, 2, 20)));
  334. EXPECT_TRUE(quad.IntersectsRect(RectF(19.9, 0, 2, 20)));
  335. // Bottom-right.
  336. EXPECT_FALSE(quad.IntersectsRect(RectF(15.1, 15.1, 10, 10)));
  337. EXPECT_TRUE(quad.IntersectsRect(RectF(15.1, 14, 10, 10)));
  338. EXPECT_TRUE(quad.IntersectsRect(RectF(14.9, 14.9, 10, 10)));
  339. EXPECT_TRUE(quad.IntersectsRect(RectF(14, 15.1, 10, 10)));
  340. EXPECT_FALSE(quad.IntersectsRect(RectF(18, 14, 10, 10)));
  341. EXPECT_FALSE(quad.IntersectsRect(RectF(14, 18, 10, 10)));
  342. // Bottom.
  343. EXPECT_FALSE(quad.IntersectsRect(RectF(0, 50, 20, 2)));
  344. // TODO(crbug.com/1283709): For now the result is true.
  345. // EXPECT_FALSE(quad.IntersectsRect(RectF(0, 22, 20, 2)));
  346. // EXPECT_FALSE(quad.IntersectsRect(RectF(0, 20.1, 20, 2)));
  347. EXPECT_TRUE(quad.IntersectsRect(RectF(0, 19.9, 20, 2)));
  348. // Bottom-left.
  349. EXPECT_FALSE(quad.IntersectsRect(RectF(0, 15.1, 4.9, 10)));
  350. EXPECT_TRUE(quad.IntersectsRect(RectF(0, 15.1, 6, 10)));
  351. EXPECT_TRUE(quad.IntersectsRect(RectF(0, 14.9, 5.1, 10)));
  352. EXPECT_TRUE(quad.IntersectsRect(RectF(0, 14, 4.9, 10)));
  353. EXPECT_FALSE(quad.IntersectsRect(RectF(0, 18, 6, 10)));
  354. EXPECT_FALSE(quad.IntersectsRect(RectF(0, 14, 2, 10)));
  355. // Left.
  356. EXPECT_FALSE(quad.IntersectsRect(RectF(-30, 0, 2, 20)));
  357. // TODO(crbug.com/1283709): For now the result is true.
  358. // EXPECT_FALSE(quad.IntersectsRect(RectF(-5, 0, 2, 20)));
  359. // EXPECT_FALSE(quad.IntersectsRect(RectF(-5, 0, 4.9, 20)));
  360. EXPECT_TRUE(quad.IntersectsRect(RectF(-5, 0, 5.1, 20)));
  361. // Cover.
  362. EXPECT_TRUE(quad.IntersectsRect(RectF(0, 0, 20, 20)));
  363. }
  364. TEST(QuadFTest, IntersectsRectCounterClockwise) {
  365. QuadF quad(PointF(10, 0), PointF(0, 10), PointF(10, 20), PointF(20, 10));
  366. // Top-left.
  367. EXPECT_FALSE(quad.IntersectsRect(RectF(0, 0, 4.9, 4.9)));
  368. EXPECT_TRUE(quad.IntersectsRect(RectF(0, 0, 4.9, 6)));
  369. EXPECT_TRUE(quad.IntersectsRect(RectF(0, 0, 5.1, 5.1)));
  370. EXPECT_TRUE(quad.IntersectsRect(RectF(0, 0, 6, 4.9)));
  371. EXPECT_FALSE(quad.IntersectsRect(RectF(0, 0, 2, 6)));
  372. EXPECT_FALSE(quad.IntersectsRect(RectF(0, 0, 6, 2)));
  373. // Top.
  374. EXPECT_FALSE(quad.IntersectsRect(RectF(0, -30, 20, 2)));
  375. // TODO(crbug.com/1283709): For now the result is true.
  376. // EXPECT_FALSE(quad.IntersectsRect(RectF(0, -5, 20, 2)));
  377. // EXPECT_FALSE(quad.IntersectsRect(RectF(0, -5, 20, 4.9)));
  378. EXPECT_TRUE(quad.IntersectsRect(RectF(0, -5, 20, 5.1)));
  379. // Top-right.
  380. EXPECT_FALSE(quad.IntersectsRect(RectF(15.1, 0, 10, 4.9)));
  381. EXPECT_TRUE(quad.IntersectsRect(RectF(15.1, 0, 10, 6)));
  382. EXPECT_TRUE(quad.IntersectsRect(RectF(14.9, 0, 10, 5.1)));
  383. EXPECT_TRUE(quad.IntersectsRect(RectF(14, 0, 10, 4.9)));
  384. EXPECT_FALSE(quad.IntersectsRect(RectF(18, 0, 10, 6)));
  385. EXPECT_FALSE(quad.IntersectsRect(RectF(14, 0, 10, 2)));
  386. // Right.
  387. EXPECT_FALSE(quad.IntersectsRect(RectF(50, 0, 2, 20)));
  388. // TODO(crbug.com/1283709): For now the result is true.
  389. // EXPECT_FALSE(quad.IntersectsRect(RectF(22, 0, 2, 20)));
  390. // EXPECT_FALSE(quad.IntersectsRect(RectF(20.1, 0, 2, 20)));
  391. EXPECT_TRUE(quad.IntersectsRect(RectF(19.9, 0, 2, 20)));
  392. // Bottom-right.
  393. EXPECT_FALSE(quad.IntersectsRect(RectF(15.1, 15.1, 10, 10)));
  394. EXPECT_TRUE(quad.IntersectsRect(RectF(15.1, 14, 10, 10)));
  395. EXPECT_TRUE(quad.IntersectsRect(RectF(14.9, 14.9, 10, 10)));
  396. EXPECT_TRUE(quad.IntersectsRect(RectF(14, 15.1, 10, 10)));
  397. EXPECT_FALSE(quad.IntersectsRect(RectF(18, 14, 10, 10)));
  398. EXPECT_FALSE(quad.IntersectsRect(RectF(14, 18, 10, 10)));
  399. // Bottom.
  400. EXPECT_FALSE(quad.IntersectsRect(RectF(0, 50, 20, 2)));
  401. // TODO(crbug.com/1283709): For now the result is true.
  402. // EXPECT_FALSE(quad.IntersectsRect(RectF(0, 22, 20, 2)));
  403. // EXPECT_FALSE(quad.IntersectsRect(RectF(0, 20.1, 20, 2)));
  404. EXPECT_TRUE(quad.IntersectsRect(RectF(0, 19.9, 20, 2)));
  405. // Bottom-left.
  406. EXPECT_FALSE(quad.IntersectsRect(RectF(0, 15.1, 4.9, 10)));
  407. EXPECT_TRUE(quad.IntersectsRect(RectF(0, 15.1, 6, 10)));
  408. EXPECT_TRUE(quad.IntersectsRect(RectF(0, 14.9, 5.1, 10)));
  409. EXPECT_TRUE(quad.IntersectsRect(RectF(0, 14, 4.9, 10)));
  410. EXPECT_FALSE(quad.IntersectsRect(RectF(0, 18, 6, 10)));
  411. EXPECT_FALSE(quad.IntersectsRect(RectF(0, 14, 2, 10)));
  412. // Left.
  413. EXPECT_FALSE(quad.IntersectsRect(RectF(-30, 0, 2, 20)));
  414. // TODO(crbug.com/1283709): For now the result is true.
  415. // EXPECT_FALSE(quad.IntersectsRect(RectF(-5, 0, 2, 20)));
  416. // EXPECT_FALSE(quad.IntersectsRect(RectF(-5, 0, 4.9, 20)));
  417. EXPECT_TRUE(quad.IntersectsRect(RectF(-5, 0, 5.1, 20)));
  418. // Cover.
  419. EXPECT_TRUE(quad.IntersectsRect(RectF(0, 0, 20, 20)));
  420. }
  421. TEST(QuadFTest, RectIntersectionIsInclusive) {
  422. // A rectilinear quad at (10, 10) with dimensions 10x10.
  423. QuadF quad(RectF(10, 10, 10, 10));
  424. // A rect fully contained in the quad should intersect.
  425. EXPECT_TRUE(quad.IntersectsRect(RectF(11, 11, 8, 8)));
  426. // A point fully contained in the quad should intersect.
  427. EXPECT_TRUE(quad.IntersectsRect(RectF(11, 11, 0, 0)));
  428. // A rect that touches the quad only at the point (10, 10) should intersect.
  429. EXPECT_TRUE(quad.IntersectsRect(RectF(9, 9, 1, 1)));
  430. // A rect that touches the quad only on the left edge should intersect.
  431. EXPECT_TRUE(quad.IntersectsRect(RectF(9, 11, 1, 1)));
  432. // A rect that touches the quad only on the top edge should intersect.
  433. EXPECT_TRUE(quad.IntersectsRect(RectF(11, 9, 1, 1)));
  434. // A rect that touches the quad only on the right edge should intersect.
  435. EXPECT_TRUE(quad.IntersectsRect(RectF(20, 11, 1, 1)));
  436. // A rect that touches the quad only on the bottom edge should intersect.
  437. EXPECT_TRUE(quad.IntersectsRect(RectF(11, 20, 1, 1)));
  438. // A rect that is fully outside the quad should not intersect.
  439. EXPECT_FALSE(quad.IntersectsRect(RectF(8, 8, 1, 1)));
  440. // A point that is fully outside the quad should not intersect.
  441. EXPECT_FALSE(quad.IntersectsRect(RectF(9, 9, 0, 0)));
  442. }
  443. TEST(QuadFTest, IntersectsEllipseClockWise) {
  444. QuadF quad(PointF(10, 0), PointF(20, 10), PointF(10, 20), PointF(0, 10));
  445. // Top-left.
  446. EXPECT_FALSE(quad.IntersectsEllipse(PointF(0, 0), SizeF(7, 7)));
  447. EXPECT_TRUE(quad.IntersectsEllipse(PointF(0, 0), SizeF(6, 9)));
  448. EXPECT_TRUE(quad.IntersectsEllipse(PointF(0, 0), SizeF(7.1, 7.1)));
  449. EXPECT_TRUE(quad.IntersectsEllipse(PointF(0, 0), SizeF(9, 6)));
  450. EXPECT_FALSE(quad.IntersectsEllipse(PointF(0, 0), SizeF(2, 8)));
  451. EXPECT_FALSE(quad.IntersectsEllipse(PointF(0, 0), SizeF(8, 2)));
  452. // Top.
  453. EXPECT_FALSE(quad.IntersectsEllipse(PointF(10, -5), SizeF(20, 2)));
  454. EXPECT_FALSE(quad.IntersectsEllipse(PointF(10, -5), SizeF(20, 4.9)));
  455. EXPECT_TRUE(quad.IntersectsEllipse(PointF(10, -5), SizeF(20, 5.1)));
  456. // Top-right.
  457. EXPECT_FALSE(quad.IntersectsEllipse(PointF(20, 0), SizeF(7, 7)));
  458. EXPECT_TRUE(quad.IntersectsEllipse(PointF(20, 0), SizeF(6, 9)));
  459. EXPECT_TRUE(quad.IntersectsEllipse(PointF(20, 0), SizeF(7.1, 7.1)));
  460. EXPECT_TRUE(quad.IntersectsEllipse(PointF(20, 0), SizeF(9, 6)));
  461. EXPECT_FALSE(quad.IntersectsEllipse(PointF(20, 0), SizeF(2, 8)));
  462. EXPECT_FALSE(quad.IntersectsEllipse(PointF(20, 0), SizeF(8, 2)));
  463. // Right.
  464. EXPECT_FALSE(quad.IntersectsEllipse(PointF(25, 10), SizeF(2, 20)));
  465. EXPECT_FALSE(quad.IntersectsEllipse(PointF(25, 10), SizeF(4.9, 20)));
  466. EXPECT_TRUE(quad.IntersectsEllipse(PointF(25, 10), SizeF(5.1, 20)));
  467. // Bottom-right.
  468. EXPECT_FALSE(quad.IntersectsEllipse(PointF(20, 20), SizeF(7, 7)));
  469. EXPECT_TRUE(quad.IntersectsEllipse(PointF(20, 20), SizeF(6, 9)));
  470. EXPECT_TRUE(quad.IntersectsEllipse(PointF(20, 20), SizeF(7.1, 7.1)));
  471. EXPECT_TRUE(quad.IntersectsEllipse(PointF(20, 20), SizeF(9, 6)));
  472. EXPECT_FALSE(quad.IntersectsEllipse(PointF(20, 20), SizeF(2, 8)));
  473. EXPECT_FALSE(quad.IntersectsEllipse(PointF(20, 20), SizeF(8, 2)));
  474. // Bottom.
  475. EXPECT_FALSE(quad.IntersectsEllipse(PointF(10, 25), SizeF(20, 2)));
  476. EXPECT_FALSE(quad.IntersectsEllipse(PointF(10, 25), SizeF(20, 4.9)));
  477. EXPECT_TRUE(quad.IntersectsEllipse(PointF(10, 25), SizeF(20, 5.1)));
  478. // Bottom-left.
  479. EXPECT_FALSE(quad.IntersectsEllipse(PointF(0, 20), SizeF(7, 7)));
  480. EXPECT_TRUE(quad.IntersectsEllipse(PointF(0, 20), SizeF(6, 9)));
  481. EXPECT_TRUE(quad.IntersectsEllipse(PointF(0, 20), SizeF(7.1, 7.1)));
  482. EXPECT_TRUE(quad.IntersectsEllipse(PointF(0, 20), SizeF(9, 6)));
  483. EXPECT_FALSE(quad.IntersectsEllipse(PointF(0, 20), SizeF(2, 8)));
  484. EXPECT_FALSE(quad.IntersectsEllipse(PointF(0, 20), SizeF(8, 2)));
  485. // Left.
  486. EXPECT_FALSE(quad.IntersectsEllipse(PointF(-5, 10), SizeF(2, 20)));
  487. EXPECT_FALSE(quad.IntersectsEllipse(PointF(-5, 10), SizeF(4.9, 20)));
  488. EXPECT_TRUE(quad.IntersectsEllipse(PointF(-5, 10), SizeF(5.1, 20)));
  489. }
  490. TEST(QuadFTest, IntersectsEllipseCounterClockwise) {
  491. QuadF quad(PointF(10, 0), PointF(0, 10), PointF(10, 20), PointF(20, 10));
  492. // Top-left.
  493. EXPECT_FALSE(quad.IntersectsEllipse(PointF(0, 0), SizeF(7, 7)));
  494. EXPECT_TRUE(quad.IntersectsEllipse(PointF(0, 0), SizeF(6, 9)));
  495. EXPECT_TRUE(quad.IntersectsEllipse(PointF(0, 0), SizeF(7.1, 7.1)));
  496. EXPECT_TRUE(quad.IntersectsEllipse(PointF(0, 0), SizeF(9, 6)));
  497. EXPECT_FALSE(quad.IntersectsEllipse(PointF(0, 0), SizeF(2, 8)));
  498. EXPECT_FALSE(quad.IntersectsEllipse(PointF(0, 0), SizeF(8, 2)));
  499. // Top.
  500. EXPECT_FALSE(quad.IntersectsEllipse(PointF(10, -5), SizeF(20, 2)));
  501. EXPECT_FALSE(quad.IntersectsEllipse(PointF(10, -5), SizeF(20, 4.9)));
  502. EXPECT_TRUE(quad.IntersectsEllipse(PointF(10, -5), SizeF(20, 5.1)));
  503. // Top-right.
  504. EXPECT_FALSE(quad.IntersectsEllipse(PointF(20, 0), SizeF(7, 7)));
  505. EXPECT_TRUE(quad.IntersectsEllipse(PointF(20, 0), SizeF(6, 9)));
  506. EXPECT_TRUE(quad.IntersectsEllipse(PointF(20, 0), SizeF(7.1, 7.1)));
  507. EXPECT_TRUE(quad.IntersectsEllipse(PointF(20, 0), SizeF(9, 6)));
  508. EXPECT_FALSE(quad.IntersectsEllipse(PointF(20, 0), SizeF(2, 8)));
  509. EXPECT_FALSE(quad.IntersectsEllipse(PointF(20, 0), SizeF(8, 2)));
  510. // Right.
  511. EXPECT_FALSE(quad.IntersectsEllipse(PointF(25, 10), SizeF(2, 20)));
  512. EXPECT_FALSE(quad.IntersectsEllipse(PointF(25, 10), SizeF(4.9, 20)));
  513. EXPECT_TRUE(quad.IntersectsEllipse(PointF(25, 10), SizeF(5.1, 20)));
  514. // Bottom-right.
  515. EXPECT_FALSE(quad.IntersectsEllipse(PointF(20, 20), SizeF(7, 7)));
  516. EXPECT_TRUE(quad.IntersectsEllipse(PointF(20, 20), SizeF(6, 9)));
  517. EXPECT_TRUE(quad.IntersectsEllipse(PointF(20, 20), SizeF(7.1, 7.1)));
  518. EXPECT_TRUE(quad.IntersectsEllipse(PointF(20, 20), SizeF(9, 6)));
  519. EXPECT_FALSE(quad.IntersectsEllipse(PointF(20, 20), SizeF(2, 8)));
  520. EXPECT_FALSE(quad.IntersectsEllipse(PointF(20, 20), SizeF(8, 2)));
  521. // Bottom.
  522. EXPECT_FALSE(quad.IntersectsEllipse(PointF(10, 25), SizeF(20, 2)));
  523. EXPECT_FALSE(quad.IntersectsEllipse(PointF(10, 25), SizeF(20, 4.9)));
  524. EXPECT_TRUE(quad.IntersectsEllipse(PointF(10, 25), SizeF(20, 5.1)));
  525. // Bottom-left.
  526. EXPECT_FALSE(quad.IntersectsEllipse(PointF(0, 20), SizeF(7, 7)));
  527. EXPECT_TRUE(quad.IntersectsEllipse(PointF(0, 20), SizeF(6, 9)));
  528. EXPECT_TRUE(quad.IntersectsEllipse(PointF(0, 20), SizeF(7.1, 7.1)));
  529. EXPECT_TRUE(quad.IntersectsEllipse(PointF(0, 20), SizeF(9, 6)));
  530. EXPECT_FALSE(quad.IntersectsEllipse(PointF(0, 20), SizeF(2, 8)));
  531. EXPECT_FALSE(quad.IntersectsEllipse(PointF(0, 20), SizeF(8, 2)));
  532. // Left.
  533. EXPECT_FALSE(quad.IntersectsEllipse(PointF(-5, 10), SizeF(2, 20)));
  534. EXPECT_FALSE(quad.IntersectsEllipse(PointF(-5, 10), SizeF(4.9, 20)));
  535. EXPECT_TRUE(quad.IntersectsEllipse(PointF(-5, 10), SizeF(5.1, 20)));
  536. }
  537. TEST(QuadFTest, CircleIntersectionIsInclusive) {
  538. // A rectilinear quad at (10, 10) with dimensions 10x10.
  539. QuadF quad(RectF(10, 10, 10, 10));
  540. // A circle fully contained in the top-left of the quad should intersect.
  541. EXPECT_TRUE(quad.IntersectsCircle(PointF(12, 12), 1));
  542. // A point fully contained in the top-left of the quad should intersect.
  543. EXPECT_TRUE(quad.IntersectsCircle(PointF(12, 12), 0));
  544. // A circle that touches the left edge should intersect.
  545. EXPECT_TRUE(quad.IntersectsCircle(PointF(9, 11), 1));
  546. // A circle that touches the top edge should intersect.
  547. EXPECT_TRUE(quad.IntersectsCircle(PointF(11, 9), 1));
  548. // A circle that touches the right edge should intersect.
  549. EXPECT_TRUE(quad.IntersectsCircle(PointF(21, 11), 1));
  550. // A circle that touches the bottom edge should intersect.
  551. EXPECT_TRUE(quad.IntersectsCircle(PointF(11, 21), 1));
  552. // A point that touches the left edge should intersect.
  553. EXPECT_TRUE(quad.IntersectsCircle(PointF(10, 11), 0));
  554. // A point that touches the top edge should intersect.
  555. EXPECT_TRUE(quad.IntersectsCircle(PointF(11, 10), 0));
  556. // A point that touches the right edge should intersect.
  557. EXPECT_TRUE(quad.IntersectsCircle(PointF(20, 11), 0));
  558. // A point that touches the bottom edge should intersect.
  559. EXPECT_TRUE(quad.IntersectsCircle(PointF(11, 20), 0));
  560. // A circle that is fully outside the quad should not intersect.
  561. EXPECT_FALSE(quad.IntersectsCircle(PointF(9, 9), 1));
  562. // A point that is fully outside the quad should not intersect.
  563. EXPECT_FALSE(quad.IntersectsCircle(PointF(9, 9), 0));
  564. }
  565. TEST(QuadFTest, CenterPoint) {
  566. EXPECT_EQ(PointF(), QuadF().CenterPoint());
  567. EXPECT_EQ(PointF(25.75f, 40.75f),
  568. QuadF(RectF(10.5f, 20.5f, 30.5f, 40.5f)).CenterPoint());
  569. EXPECT_EQ(PointF(10, 10),
  570. QuadF(PointF(10, 0), PointF(20, 10), PointF(10, 20), PointF(0, 10))
  571. .CenterPoint());
  572. }
  573. } // namespace gfx