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 // It is important _not_ to put header guards here. | 8 // It is important _not_ to put header guards here. |
9 // This file will be intentionally included three times. | 9 // This file will be intentionally included three times. |
10 | 10 |
(...skipping 36 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
47 return Sk2x<T>(fVec[0] / o.fVec[0], fVec[1] / o.fVec[1]); | 47 return Sk2x<T>(fVec[0] / o.fVec[0], fVec[1] / o.fVec[1]); |
48 } | 48 } |
49 | 49 |
50 M(Sk2x<T>) Min(const Sk2x<T>& a, const Sk2x<T>& b) { | 50 M(Sk2x<T>) Min(const Sk2x<T>& a, const Sk2x<T>& b) { |
51 return Sk2x<T>(SkTMin(a.fVec[0], b.fVec[0]), SkTMin(a.fVec[1], b.fVec[1])); | 51 return Sk2x<T>(SkTMin(a.fVec[0], b.fVec[0]), SkTMin(a.fVec[1], b.fVec[1])); |
52 } | 52 } |
53 M(Sk2x<T>) Max(const Sk2x<T>& a, const Sk2x<T>& b) { | 53 M(Sk2x<T>) Max(const Sk2x<T>& a, const Sk2x<T>& b) { |
54 return Sk2x<T>(SkTMax(a.fVec[0], b.fVec[0]), SkTMax(a.fVec[1], b.fVec[1])); | 54 return Sk2x<T>(SkTMax(a.fVec[0], b.fVec[0]), SkTMax(a.fVec[1], b.fVec[1])); |
55 } | 55 } |
56 | 56 |
| 57 M(Sk2x<T>) invert() const { return Sk2x<T>((T)1.0 / fVec[0], (T)1.0 / fVec
[1]); } |
| 58 M(Sk2x<T>) approxInvert() const { return this->invert(); } |
| 59 |
57 #undef M | 60 #undef M |
58 | 61 |
59 #define M template <> inline | 62 #define M template <> inline |
60 | 63 |
61 M Sk2f Sk2f::rsqrt() const { return Sk2f(sk_float_rsqrt(fVec[0]), sk_float_rsqrt
(fVec[1])); } | 64 M Sk2f Sk2f::rsqrt() const { return Sk2f(sk_float_rsqrt(fVec[0]), sk_float_rsqrt
(fVec[1])); } |
62 M Sk2f Sk2f:: sqrt() const { return Sk2f( sqrtf(fVec[0]), sqrtf
(fVec[1])); } | 65 M Sk2f Sk2f:: sqrt() const { return Sk2f( sqrtf(fVec[0]), sqrtf
(fVec[1])); } |
63 | 66 |
64 M Sk2d Sk2d::rsqrt() const { return Sk2d(1.0/::sqrt(fVec[0]), 1.0/::sqrt(fVec[1]
)); } | 67 M Sk2d Sk2d::rsqrt() const { return Sk2d(1.0/::sqrt(fVec[0]), 1.0/::sqrt(fVec[1]
)); } |
65 M Sk2d Sk2d:: sqrt() const { return Sk2d( ::sqrt(fVec[0]), ::sqrt(fVec[1]
)); } | 68 M Sk2d Sk2d:: sqrt() const { return Sk2d( ::sqrt(fVec[0]), ::sqrt(fVec[1]
)); } |
66 | 69 |
67 #undef M | 70 #undef M |
68 | 71 |
69 #endif | 72 #endif |
OLD | NEW |