SkNx: kth<...>() -> [...]

src/opts/SkNx_neon.h

 /*
  * Copyright 2015 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #ifndef SkNx_neon_DEFINED
 #define SkNx_neon_DEFINED
 
@@ skipping 93 matching lines @@
     #else
         return *this * this->rsqrt2();
     #endif
     }
 
     float operator[](int k) const {
         SkASSERT(0 <= k && k < 2);
         union { float32x2_t v; float fs[2]; } pun = {fVec};
         return pun.fs[k&1];
     }
-    template <int k> float kth() const { return (*this)[k]; }
 
     bool allTrue() const {
         auto v = vreinterpret_u32_f32(fVec);
         return vget_lane_u32(v,0) && vget_lane_u32(v,1);
     }
     bool anyTrue() const {
         auto v = vreinterpret_u32_f32(fVec);
         return vget_lane_u32(v,0) || vget_lane_u32(v,1);
     }
 
@@ skipping 71 matching lines @@
     #else
         return *this * this->rsqrt2();
     #endif
     }
 
     float operator[](int k) const {
         SkASSERT(0 <= k && k < 4);
         union { float32x4_t v; float fs[4]; } pun = {fVec};
         return pun.fs[k&3];
     }
-    template <int k> float kth() const { return (*this)[k]; }
 
     bool allTrue() const {
         auto v = vreinterpretq_u32_f32(fVec);
         return vgetq_lane_u32(v,0) && vgetq_lane_u32(v,1)
             && vgetq_lane_u32(v,2) && vgetq_lane_u32(v,3);
     }
     bool anyTrue() const {
         auto v = vreinterpretq_u32_f32(fVec);
         return vgetq_lane_u32(v,0) || vgetq_lane_u32(v,1)
             || vgetq_lane_u32(v,2) || vgetq_lane_u32(v,3);
@@ skipping 31 matching lines @@
     SkNx operator << (int bits) const { SHIFT16(vshl_n_u16, fVec, bits); }
     SkNx operator >> (int bits) const { SHIFT16(vshr_n_u16, fVec, bits); }
 
     static SkNx Min(const SkNx& a, const SkNx& b) { return vmin_u16(a.fVec, b.fVec); }
 
     uint16_t operator[](int k) const {
         SkASSERT(0 <= k && k < 4);
         union { uint16x4_t v; uint16_t us[4]; } pun = {fVec};
         return pun.us[k&3];
     }
-    template <int k> uint16_t kth() const { return (*this)[k]; }
 
     SkNx thenElse(const SkNx& t, const SkNx& e) const {
         return vbsl_u16(fVec, t.fVec, e.fVec);
     }
 
     uint16x4_t fVec;
 };
 
 template <>
 class SkNx<8, uint16_t> {
@@ skipping 18 matching lines @@
     SkNx operator << (int bits) const { SHIFT16(vshlq_n_u16, fVec, bits); }
     SkNx operator >> (int bits) const { SHIFT16(vshrq_n_u16, fVec, bits); }
 
     static SkNx Min(const SkNx& a, const SkNx& b) { return vminq_u16(a.fVec, b.fVec); }
 
     uint16_t operator[](int k) const {
         SkASSERT(0 <= k && k < 8);
         union { uint16x8_t v; uint16_t us[8]; } pun = {fVec};
         return pun.us[k&7];
     }
-    template <int k> uint16_t kth() const { return (*this)[k]; }
 
     SkNx thenElse(const SkNx& t, const SkNx& e) const {
         return vbslq_u16(fVec, t.fVec, e.fVec);
     }
 
     uint16x8_t fVec;
 };
 
 template <>
 class SkNx<4, uint8_t> {
@@ skipping 37 matching lines @@
     SkNx operator - (const SkNx& o) const { return vsubq_u8(fVec, o.fVec); }
 
     static SkNx Min(const SkNx& a, const SkNx& b) { return vminq_u8(a.fVec, b.fVec); }
     SkNx operator < (const SkNx& o) const { return vcltq_u8(fVec, o.fVec); }
 
     uint8_t operator[](int k) const {
         SkASSERT(0 <= k && k < 16);
         union { uint8x16_t v; uint8_t us[16]; } pun = {fVec};
         return pun.us[k&15];
     }
-    template <int k> uint8_t kth() const { return (*this)[k]; }
 
     SkNx thenElse(const SkNx& t, const SkNx& e) const {
         return vbslq_u8(fVec, t.fVec, e.fVec);
     }
 
     uint8x16_t fVec;
 };
 
 #undef SHIFT32
 #undef SHIFT16
@@ skipping 29 matching lines @@
 
 template<> inline Sk4h SkNx_cast<uint16_t, uint8_t>(const Sk4b& src) {
     return vget_low_u16(vmovl_u8(src.fVec));
 }
 
 template<> inline Sk4b SkNx_cast<uint8_t, uint16_t>(const Sk4h& src) {
     return vmovn_u16(vcombine_u16(src.fVec, src.fVec));
 }
 
 #endif//SkNx_neon_DEFINED