Home
last modified time | relevance | path

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

/ndk/sources/cxx-stl/llvm-libc++/libcxx/src/
Dvalarray.cpp24 size_t __k = __size_.size() != 0; in __init() local
26 __k *= __size_[__i]; in __init()
27 __1d_.resize(__k); in __init()
30 __k = 0; in __init()
31 __1d_[__k] = __start; in __init()
39 ++__k; in __init()
40 __1d_[__k] = __1d_[__k-1] + __stride_[__i]; in __init()
42 __1d_[__k] -= __stride_[__j] * (__size_[__j] - 1); in __init()
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
Dset628 size_type erase(const key_type& __k)
629 {return __tree_.__erase_unique(__k);}
649 iterator find(const key_type& __k) {return __tree_.find(__k);}
651 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
656 find(const _K2& __k) {return __tree_.find(__k);}
660 find(const _K2& __k) const {return __tree_.find(__k);}
664 size_type count(const key_type& __k) const
665 {return __tree_.__count_unique(__k);}
667 iterator lower_bound(const key_type& __k)
668 {return __tree_.lower_bound(__k);}
[all …]
Dmap1006 mapped_type& operator[](const key_type& __k);
1008 mapped_type& operator[](key_type&& __k);
1011 mapped_type& at(const key_type& __k);
1012 const mapped_type& at(const key_type& __k) const;
1076 size_type erase(const key_type& __k)
1077 {return __tree_.__erase_unique(__k);}
1090 iterator find(const key_type& __k) {return __tree_.find(__k);}
1092 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
1097 find(const _K2& __k) {return __tree_.find(__k);}
1101 find(const _K2& __k) const {return __tree_.find(__k);}
[all …]
Dunordered_map950 size_type erase(const key_type& __k) {return __table_.__erase_unique(__k);}
970 iterator find(const key_type& __k) {return __table_.find(__k);}
972 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
974 size_type count(const key_type& __k) const {return __table_.__count_unique(__k);}
976 pair<iterator, iterator> equal_range(const key_type& __k)
977 {return __table_.__equal_range_unique(__k);}
979 pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
980 {return __table_.__equal_range_unique(__k);}
982 mapped_type& operator[](const key_type& __k);
984 mapped_type& operator[](key_type&& __k);
[all …]
Dunordered_set540 size_type erase(const key_type& __k) {return __table_.__erase_unique(__k);}
558 iterator find(const key_type& __k) {return __table_.find(__k);}
560 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
562 size_type count(const key_type& __k) const {return __table_.__count_unique(__k);}
564 pair<iterator, iterator> equal_range(const key_type& __k)
565 {return __table_.__equal_range_unique(__k);}
567 pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
568 {return __table_.__equal_range_unique(__k);}
578 size_type bucket(const key_type& __k) const {return __table_.bucket(__k);}
1042 size_type erase(const key_type& __k) {return __table_.__erase_multi(__k);}
[all …]
D__hash_table951 size_type bucket(const _Key& __k) const
955 return __constrain_hash(hash_function()(__k), bucket_count());
969 size_type __erase_unique(const _Key& __k);
971 size_type __erase_multi(const _Key& __k);
975 size_type __count_unique(const _Key& __k) const;
977 size_type __count_multi(const _Key& __k) const;
981 __equal_range_unique(const _Key& __k);
984 __equal_range_unique(const _Key& __k) const;
988 __equal_range_multi(const _Key& __k);
991 __equal_range_multi(const _Key& __k) const;
[all …]
D__tree973 size_type __erase_unique(const _Key& __k);
975 size_type __erase_multi(const _Key& __k);
987 size_type __count_unique(const _Key& __k) const;
989 size_type __count_multi(const _Key& __k) const;
1025 __equal_range_unique(const _Key& __k);
1028 __equal_range_unique(const _Key& __k) const;
1032 __equal_range_multi(const _Key& __k);
1035 __equal_range_multi(const _Key& __k) const;
2002 __tree<_Tp, _Compare, _Allocator>::__erase_unique(const _Key& __k)
2004 iterator __i = find(__k);
[all …]
Drandom1955 const unsigned __k = 1;
1956 uint32_t __ar[__k+3];
1957 __q.generate(__ar, __ar + __k + 3);
1968 const unsigned __k = 2;
1969 uint32_t __ar[__k+3];
1970 __q.generate(__ar, __ar + __k + 3);
2324 const unsigned __k = 1;
2325 uint32_t __ar[__n * __k];
2326 __q.generate(__ar, __ar + __n * __k);
2349 const unsigned __k = 2;
[all …]
Dalgorithm2920 for (size_t __k = 0; __k < __n0_; ++__k)
2933 for (size_t __k = __n0_; __k < __n_; ++__k)
3704 for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j)
3705 *__j = _VSTD::move(*__k);
3723 _RandomAccessIterator __k = __j;
3727 *__j = _VSTD::move(*__k);
3728 __j = __k;
3729 } while (__j != __first && __comp(__t, *--__k));
3769 _RandomAccessIterator __k = __j;
3773 *__j = _VSTD::move(*__k);
[all …]
Dlist2020 for (__node_pointer __k = __f.__ptr_;
2021 __k != __l.__ptr_; __k = __k->__next_)
2023 if (__j->__ptr_ == __k)
Dmemory3100 _Size __k = __loadword<_Size>(__data);
3101 __k *= __m;
3102 __k ^= __k >> __r;
3103 __k *= __m;
3105 __h ^= __k;
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ext/
Dhash_set290 size_type erase(const key_type& __k) {return __table_.__erase_unique(__k);}
306 iterator find(const key_type& __k) {return __table_.find(__k);}
308 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
310 size_type count(const key_type& __k) const {return __table_.__count_unique(__k);}
312 pair<iterator, iterator> equal_range(const key_type& __k)
313 {return __table_.__equal_range_unique(__k);}
315 pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
316 {return __table_.__equal_range_unique(__k);}
510 size_type erase(const key_type& __k) {return __table_.__erase_multi(__k);}
526 iterator find(const key_type& __k) {return __table_.find(__k);}
[all …]
Dhash_map576 size_type erase(const key_type& __k) {return __table_.__erase_unique(__k);}
594 iterator find(const key_type& __k) {return __table_.find(__k);}
596 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
598 size_type count(const key_type& __k) const {return __table_.__count_unique(__k);}
600 pair<iterator, iterator> equal_range(const key_type& __k)
601 {return __table_.__equal_range_unique(__k);}
603 pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
604 {return __table_.__equal_range_unique(__k);}
606 mapped_type& operator[](const key_type& __k);
621 __node_holder __construct_node(const key_type& __k);
[all …]
/ndk/sources/cxx-stl/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); }
/ndk/sources/cxx-stl/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