| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright 2015 Google Inc. | 2 * Copyright 2015 Google Inc. |
| 3 * | 3 * |
| 4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
| 5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
| 6 */ | 6 */ |
| 7 | 7 |
| 8 #include "Test.h" | 8 #include "Test.h" |
| 9 #include "Sk2x.h" | 9 #include "Sk2x.h" |
| 10 | 10 |
| (...skipping 33 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 44 REPORTER_ASSERT(r, eq(a + d, 6, 9)); | 44 REPORTER_ASSERT(r, eq(a + d, 6, 9)); |
| 45 REPORTER_ASSERT(r, eq(a - d, 2, -1)); | 45 REPORTER_ASSERT(r, eq(a - d, 2, -1)); |
| 46 REPORTER_ASSERT(r, eq(a * d, 8, 20)); | 46 REPORTER_ASSERT(r, eq(a * d, 8, 20)); |
| 47 | 47 |
| 48 REPORTER_ASSERT(r, nearly_eq(0.001, a.rsqrt(), 0.5, 0.5)); | 48 REPORTER_ASSERT(r, nearly_eq(0.001, a.rsqrt(), 0.5, 0.5)); |
| 49 REPORTER_ASSERT(r, eq(a.sqrt(), 2, 2)); | 49 REPORTER_ASSERT(r, eq(a.sqrt(), 2, 2)); |
| 50 | 50 |
| 51 REPORTER_ASSERT(r, eq(Sk2x<T>::Min(a, d), 2, 4)); | 51 REPORTER_ASSERT(r, eq(Sk2x<T>::Min(a, d), 2, 4)); |
| 52 REPORTER_ASSERT(r, eq(Sk2x<T>::Max(a, d), 4, 5)); | 52 REPORTER_ASSERT(r, eq(Sk2x<T>::Max(a, d), 4, 5)); |
| 53 | 53 |
| 54 REPORTER_ASSERT(r, eq(-d, -2, -5)); |
| 55 |
| 54 // A bit of both. | 56 // A bit of both. |
| 55 a += d; | 57 a += d; |
| 56 a *= d; | 58 a *= d; |
| 57 a -= d; | 59 a -= d; |
| 58 REPORTER_ASSERT(r, eq(a, 10, 40)); | 60 REPORTER_ASSERT(r, eq(a, 10, 40)); |
| 59 } | 61 } |
| 60 | 62 |
| 61 DEF_TEST(Sk2f, r) { test< float>(r); } | 63 DEF_TEST(Sk2f, r) { test< float>(r); } |
| 62 DEF_TEST(Sk2d, r) { test<double>(r); } | 64 DEF_TEST(Sk2d, r) { test<double>(r); } |
| OLD | NEW |