OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2012 Google Inc. All rights reserved. | 2 * Copyright (C) 2012 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions | 5 * modification, are permitted provided that the following conditions |
6 * are met: | 6 * are met: |
7 * 1. Redistributions of source code must retain the above copyright | 7 * 1. Redistributions of source code must retain the above copyright |
8 * notice, this list of conditions and the following disclaimer. | 8 * notice, this list of conditions and the following disclaimer. |
9 * 2. Redistributions in binary form must reproduce the above copyright | 9 * 2. Redistributions in binary form must reproduce the above copyright |
10 * notice, this list of conditions and the following disclaimer in the | 10 * notice, this list of conditions and the following disclaimer in the |
(...skipping 10 matching lines...) Expand all Loading... |
21 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS | 21 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
22 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 22 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
23 */ | 23 */ |
24 | 24 |
25 #include "config.h" | 25 #include "config.h" |
26 | 26 |
27 #include "platform/geometry/Region.h" | 27 #include "platform/geometry/Region.h" |
28 | 28 |
29 #include <gtest/gtest.h> | 29 #include <gtest/gtest.h> |
30 | 30 |
31 using namespace WebCore; | 31 using namespace blink; |
32 | 32 |
33 namespace { | 33 namespace { |
34 | 34 |
35 #define TEST_INSIDE_RECT(r, x, y, w, h) \ | 35 #define TEST_INSIDE_RECT(r, x, y, w, h) \ |
36 EXPECT_TRUE(r.contains(IntPoint(x, y))); \ | 36 EXPECT_TRUE(r.contains(IntPoint(x, y))); \ |
37 EXPECT_TRUE(r.contains(IntPoint(x + w - 1, y))); \ | 37 EXPECT_TRUE(r.contains(IntPoint(x + w - 1, y))); \ |
38 EXPECT_TRUE(r.contains(IntPoint(x, y + h - 1))); \ | 38 EXPECT_TRUE(r.contains(IntPoint(x, y + h - 1))); \ |
39 EXPECT_TRUE(r.contains(IntPoint(x + w - 1, y + h - 1))); \ | 39 EXPECT_TRUE(r.contains(IntPoint(x + w - 1, y + h - 1))); \ |
40 EXPECT_TRUE(r.contains(IntPoint(x, y + h / 2))); \ | 40 EXPECT_TRUE(r.contains(IntPoint(x, y + h / 2))); \ |
41 EXPECT_TRUE(r.contains(IntPoint(x + w - 1, y + h / 2))); \ | 41 EXPECT_TRUE(r.contains(IntPoint(x + w - 1, y + h / 2))); \ |
(...skipping 343 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
385 EXPECT_EQ(r, r2); | 385 EXPECT_EQ(r, r2); |
386 | 386 |
387 // A complex region uniting a containing rect gives back the containing rect
. | 387 // A complex region uniting a containing rect gives back the containing rect
. |
388 r = IntRect(0, 0, 50, 50); | 388 r = IntRect(0, 0, 50, 50); |
389 r.unite(IntRect(100, 0, 50, 50)); | 389 r.unite(IntRect(100, 0, 50, 50)); |
390 r. unite(IntRect(0, 0, 500, 500)); | 390 r. unite(IntRect(0, 0, 500, 500)); |
391 EXPECT_EQ(Region(IntRect(0, 0, 500, 500)), r); | 391 EXPECT_EQ(Region(IntRect(0, 0, 500, 500)), r); |
392 } | 392 } |
393 | 393 |
394 } // namespace | 394 } // namespace |
OLD | NEW |