Home
last modified time | relevance | path

Searched refs:__k (Results 1 – 11 of 11) sorted by relevance

/external/stlport/stlport/stl/
D_tree.h543 iterator find(const _KT& __k) { return iterator(_M_find(__k)); }
545 const_iterator find(const _KT& __k) const { return const_iterator(_M_find(__k)); }
548 _Base_ptr _M_find(const _KT& __k) const {
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 {
572 if (!_M_key_compare(_S_key(__x), __k))
581 _Base_ptr _M_upper_bound(const _KT& __k) const {
586 if (_M_key_compare(__k, _S_key(__x)))
D_function.h402 _STLP_UINT32_T __k = 1; in _M_initialize() local
407 _M_table[__ii] = __k; in _M_initialize()
408 __k = __seed - __k; in _M_initialize()
D_unordered_set.h165 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
315 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
D_map.h175 _Tp& operator[](const _KT& __k) { in _STLP_CREATE_ITERATOR_TRAITS()
176 iterator __i = lower_bound(__k); in _STLP_CREATE_ITERATOR_TRAITS()
178 if (__i == end() || key_comp()(__k, (*__i).first)) in _STLP_CREATE_ITERATOR_TRAITS()
179 __i = insert(__i, value_type(__k, _STLP_DEFAULT_CONSTRUCTED(_Tp))); in _STLP_CREATE_ITERATOR_TRAITS()
D_unordered_map.h179 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
339 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
D_algo.c449 _Distance __k = __middle - __first; in __rotate_aux() local
450 _Distance __l = __n - __k; in __rotate_aux()
453 if (__k == 0) /* __first == middle */ in __rotate_aux()
456 if (__k == __l) { in __rotate_aux()
461 _Distance __d = _STLP_PRIV __gcd(__n, __k); in __rotate_aux()
467 if (__k < __l) { in __rotate_aux()
474 *__p = *(__p + __k); in __rotate_aux()
475 __p += __k; in __rotate_aux()
480 for (_Distance __j = 0; __j < __k/__d - 1; __j ++) { in __rotate_aux()
481 if (__p < __last - __k) { in __rotate_aux()
[all …]
D_algo.h410 _Size __k; in __lg() local
411 for (__k = 0; __n != 1; __n >>= 1) ++__k; in __lg()
412 return __k; in __lg()
D_bitset.h643 typename _Traits::int_type __k = _Traits::to_int_type(__s[__pos + __Nbits - __i - 1]);
645 if (__k == '1')
647 else if (__k != '0')
D_hashtable.h397 size_type bucket(const _KT& __k) const { return _M_bkt_num_key(__k); }
/external/stlport/stlport/stl/debug/
D_tree.h178 iterator find(const _KT& __k) in find() argument
179 { return iterator(&_M_iter_list, _M_non_dbg_impl.find(__k)); } in find()
181 const_iterator find(const _KT& __k) const in find() argument
182 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.find(__k)); } in find()
D_hashtable.h322 size_type bucket(const _KT& __k) const { return _M_non_dbg_impl.bucket(__k); } in bucket() argument