HomeSort by relevance Sort by last modified time
    Searched refs:__k (Results 101 - 125 of 185) sorted by null

1 2 3 45 6 7 8

  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
valarray_array.h 335 for (size_t __k = 0; __k < __n; ++__k)
617 for (size_t __k = 0; __k<__n; ++__k, ++__j) \
618 __a._M_data[*__j] _Op##= __e[__k]; \
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
valarray_array.h 335 for (size_t __k = 0; __k < __n; ++__k)
617 for (size_t __k = 0; __k<__n; ++__k, ++__j) \
618 __a._M_data[*__j] _Op##= __e[__k]; \
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
valarray_array.h 335 for (size_t __k = 0; __k < __n; ++__k)
617 for (size_t __k = 0; __k<__n; ++__k, ++__j) \
618 __a._M_data[*__j] _Op##= __e[__k]; \
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/
valarray_array.h 333 for (size_t __k = 0; __k < __n; ++__k)
615 for (size_t __k = 0; __k<__n; ++__k, ++__j) \
616 __a._M_data[*__j] _Op##= __e[__k]; \
  /external/stlport/stlport/stl/
_map.h 175 _Tp& operator[](const _KT& __k) {
176 iterator __i = lower_bound(__k);
177 // __i->first is greater than or equivalent to __k.
178 if (__i == end() || key_comp()(__k, (*__i).first))
179 __i = insert(__i, value_type(__k, _STLP_DEFAULT_CONSTRUCTED(_Tp)));
_unordered_map.h 179 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
339 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
_unordered_set.h 165 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
315 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_map.h 175 _Tp& operator[](const _KT& __k) {
176 iterator __i = lower_bound(__k);
177 // __i->first is greater than or equivalent to __k.
178 if (__i == end() || key_comp()(__k, (*__i).first))
179 __i = insert(__i, value_type(__k, _STLP_DEFAULT_CONSTRUCTED(_Tp)));
_unordered_map.h 179 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
339 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
_unordered_set.h 165 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
315 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_map.h 175 _Tp& operator[](const _KT& __k) {
176 iterator __i = lower_bound(__k);
177 // __i->first is greater than or equivalent to __k.
178 if (__i == end() || key_comp()(__k, (*__i).first))
179 __i = insert(__i, value_type(__k, _STLP_DEFAULT_CONSTRUCTED(_Tp)));
_unordered_map.h 179 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
339 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
_unordered_set.h 165 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
315 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
  /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/
_map.h 175 _Tp& operator[](const _KT& __k) {
176 iterator __i = lower_bound(__k);
177 // __i->first is greater than or equivalent to __k.
178 if (__i == end() || key_comp()(__k, (*__i).first))
179 __i = insert(__i, value_type(__k, _STLP_DEFAULT_CONSTRUCTED(_Tp)));
_unordered_map.h 179 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
339 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
_unordered_set.h 165 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
315 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
  /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/
_map.h 175 _Tp& operator[](const _KT& __k) {
176 iterator __i = lower_bound(__k);
177 // __i->first is greater than or equivalent to __k.
178 if (__i == end() || key_comp()(__k, (*__i).first))
179 __i = insert(__i, value_type(__k, _STLP_DEFAULT_CONSTRUCTED(_Tp)));
_unordered_map.h 179 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
339 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
_unordered_set.h 165 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
315 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
  /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/
_map.h 175 _Tp& operator[](const _KT& __k) {
176 iterator __i = lower_bound(__k);
177 // __i->first is greater than or equivalent to __k.
178 if (__i == end() || key_comp()(__k, (*__i).first))
179 __i = insert(__i, value_type(__k, _STLP_DEFAULT_CONSTRUCTED(_Tp)));
_unordered_map.h 179 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
339 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
_unordered_set.h 165 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
315 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
  /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/
_map.h 175 _Tp& operator[](const _KT& __k) {
176 iterator __i = lower_bound(__k);
177 // __i->first is greater than or equivalent to __k.
178 if (__i == end() || key_comp()(__k, (*__i).first))
179 __i = insert(__i, value_type(__k, _STLP_DEFAULT_CONSTRUCTED(_Tp)));
_unordered_map.h 179 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
339 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
_unordered_set.h 165 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
315 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }

Completed in 828 milliseconds

1 2 3 45 6 7 8