| 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 are | 5 * modification, are permitted provided that the following conditions are |
| 6 * met: | 6 * met: |
| 7 * | 7 * |
| 8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
| (...skipping 12 matching lines...) Expand all Loading... |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 */ | 29 */ |
| 30 | 30 |
| 31 #include "platform/LayoutUnit.h" | 31 #include "platform/LayoutUnit.h" |
| 32 | 32 |
| 33 #include <limits.h> |
| 33 #include "testing/gtest/include/gtest/gtest.h" | 34 #include "testing/gtest/include/gtest/gtest.h" |
| 34 #include <limits.h> | |
| 35 | 35 |
| 36 namespace blink { | 36 namespace blink { |
| 37 | 37 |
| 38 TEST(LayoutUnitTest, LayoutUnitInt) { | 38 TEST(LayoutUnitTest, LayoutUnitInt) { |
| 39 EXPECT_EQ(intMinForLayoutUnit, LayoutUnit(INT_MIN).toInt()); | 39 EXPECT_EQ(intMinForLayoutUnit, LayoutUnit(INT_MIN).toInt()); |
| 40 EXPECT_EQ(intMinForLayoutUnit, LayoutUnit(INT_MIN / 2).toInt()); | 40 EXPECT_EQ(intMinForLayoutUnit, LayoutUnit(INT_MIN / 2).toInt()); |
| 41 EXPECT_EQ(intMinForLayoutUnit, LayoutUnit(intMinForLayoutUnit - 1).toInt()); | 41 EXPECT_EQ(intMinForLayoutUnit, LayoutUnit(intMinForLayoutUnit - 1).toInt()); |
| 42 EXPECT_EQ(intMinForLayoutUnit, LayoutUnit(intMinForLayoutUnit).toInt()); | 42 EXPECT_EQ(intMinForLayoutUnit, LayoutUnit(intMinForLayoutUnit).toInt()); |
| 43 EXPECT_EQ(intMinForLayoutUnit + 1, | 43 EXPECT_EQ(intMinForLayoutUnit + 1, |
| 44 LayoutUnit(intMinForLayoutUnit + 1).toInt()); | 44 LayoutUnit(intMinForLayoutUnit + 1).toInt()); |
| (...skipping 224 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 269 LayoutUnit negativeMax; | 269 LayoutUnit negativeMax; |
| 270 negativeMax.setRawValue(LayoutUnit::min().rawValue() + 1); | 270 negativeMax.setRawValue(LayoutUnit::min().rawValue() + 1); |
| 271 EXPECT_EQ(negativeMax, -LayoutUnit::max()); | 271 EXPECT_EQ(negativeMax, -LayoutUnit::max()); |
| 272 EXPECT_EQ(LayoutUnit::max(), -negativeMax); | 272 EXPECT_EQ(LayoutUnit::max(), -negativeMax); |
| 273 | 273 |
| 274 // -LayoutUnit::min() is saturated to LayoutUnit::max() | 274 // -LayoutUnit::min() is saturated to LayoutUnit::max() |
| 275 EXPECT_EQ(LayoutUnit::max(), -LayoutUnit::min()); | 275 EXPECT_EQ(LayoutUnit::max(), -LayoutUnit::min()); |
| 276 } | 276 } |
| 277 | 277 |
| 278 } // namespace blink | 278 } // namespace blink |
| OLD | NEW |