Searched refs:__k (Results 1 - 12 of 12) sorted by relevance

/ndk/sources/cxx-stl/llvm-libc++/libcxx/src/
H A Dvalarray.cpp22 size_t __k = __size_.size() != 0; local
24 __k *= __size_[__i];
25 __1d_.resize(__k);
28 __k = 0;
29 __1d_[__k] = __start;
37 ++__k;
38 __1d_[__k] = __1d_[__k-1] + __stride_[__i];
40 __1d_[__k] -= __stride_[__j] * (__size_[__j] - 1);
/ndk/sources/cxx-stl/stlport/stlport/stl/
H A D_tree.h543 iterator find(const _KT& __k) { return iterator(_M_find(__k)); } argument
545 const_iterator find(const _KT& __k) const { return const_iterator(_M_find(__k)); }
548 _Base_ptr _M_find(const _KT& __k) const {
549 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); // Last node which is not less than __k.
553 if (!_M_key_compare(_S_key(__x), __k))
559 if (_M_key_compare(__k, _S_key(__y))) {
567 _Base_ptr _M_lower_bound(const _KT& __k) const {
568 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); /* Last node which is not less than __k
[all...]
H A D_function.h402 _STLP_UINT32_T __k = 1; local
407 _M_table[__ii] = __k;
408 __k = __seed - __k;
H A D_map.h175 _Tp& operator[](const _KT& __k) { argument
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)));
H A D_unordered_map.h179 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); }
H A D_unordered_set.h165 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); }
H A D_algo.c449 _Distance __k = __middle - __first; local
450 _Distance __l = __n - __k;
453 if (__k == 0) /* __first == middle */
456 if (__k == __l) {
461 _Distance __d = _STLP_PRIV __gcd(__n, __k);
467 if (__k < __l) {
474 *__p = *(__p + __k);
475 __p += __k;
480 for (_Distance __j = 0; __j < __k/__d - 1; __j ++) {
481 if (__p < __last - __k) {
[all...]
H A D_algo.h410 _Size __k; local
411 for (__k = 0; __n != 1; __n >>= 1) ++__k;
412 return __k;
H A D_hashtable.h397 size_type bucket(const _KT& __k) const { return _M_bkt_num_key(__k); }
H A D_bitset.h643 typename _Traits::int_type __k = _Traits::to_int_type(__s[__pos + __Nbits - __i - 1]); local
645 if (__k == '1')
647 else if (__k != '0')
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/
H A D_tree.h178 iterator find(const _KT& __k) argument
179 { return iterator(&_M_iter_list, _M_non_dbg_impl.find(__k)); }
181 const_iterator find(const _KT& __k) const
182 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.find(__k)); }
H A D_hashtable.h322 size_type bucket(const _KT& __k) const { return _M_non_dbg_impl.bucket(__k); }

Completed in 95 milliseconds