| /external/libcxx/src/ |
| valarray.cpp | 22 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);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/src/ |
| valarray.cpp | 25 size_t __k = __size_.size() != 0; local
27 __k *= __size_[__i];
28 __1d_.resize(__k);
31 __k = 0;
32 __1d_[__k] = __start;
40 ++__k;
41 __1d_[__k] = __1d_[__k-1] + __stride_[__i];
43 __1d_[__k] -= __stride_[__j] * (__size_[__j] - 1);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| search.h | 59 _DifferenceType __k = 0; local
62 while ((__k >= 0) && !(__elements[__k] == __elements[__j-1]))
63 __k = __off[__k];
64 __off[__j] = ++__k;
|
| losertree.h | 91 * @param __k The number of sequences to merge.
94 _LoserTreeBase(unsigned int __k, _Compare __comp)
97 _M_ik = __k;
179 _LoserTree(unsigned int __k, _Compare __comp)
180 : _Base::_LoserTreeBase(__k, __comp)
272 _LoserTree(unsigned int __k, _Compare __comp)
273 : _Base::_LoserTreeBase(__k, __comp)
373 _LoserTreePointerBase(unsigned int __k,
377 _M_ik = __k;
418 _LoserTreePointer(unsigned int __k, _Compare __comp = std::less<_Tp>()
[all...] |
| multiway_merge.h | 507 _SeqNumber __k = static_cast<_SeqNumber>(__seqs_end - __seqs_begin); local
509 _LT __lt(__k, __comp);
514 for (_SeqNumber __t = 0; __t < __k; ++__t)
521 for (_SeqNumber __t = 0; __t < __k; ++__t)
594 _SeqNumber __k = __seqs_end - __seqs_begin; local
596 _LT __lt(__k, __sentinel, __comp);
598 for (_SeqNumber __t = 0; __t < __k; ++__t)
622 _GLIBCXX_PARALLEL_ASSERT(0 <= __source && __source < __k);
957 _SeqNumber __k = static_cast<_SeqNumber>(__seqs_end - __seqs_begin); local
959 switch (__k)
1051 const _SeqNumber __k local
1136 const _SeqNumber __k = __seqs_end - __seqs_begin; local
1251 _SeqNumber __k = 0; local
[all...] |
| base.h | 104 _Size __k; local
105 for (__k = 0; __n > 1; __n >>= 1)
106 ++__k;
107 return __k;
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/ |
| search.h | 59 _DifferenceType __k = 0; local
62 while ((__k >= 0) && !(__elements[__k] == __elements[__j-1]))
63 __k = __off[__k];
64 __off[__j] = ++__k;
|
| losertree.h | 91 * @param __k The number of sequences to merge.
94 _LoserTreeBase(unsigned int __k, _Compare __comp)
97 _M_ik = __k;
179 _LoserTree(unsigned int __k, _Compare __comp)
180 : _Base::_LoserTreeBase(__k, __comp)
272 _LoserTree(unsigned int __k, _Compare __comp)
273 : _Base::_LoserTreeBase(__k, __comp)
373 _LoserTreePointerBase(unsigned int __k,
377 _M_ik = __k;
418 _LoserTreePointer(unsigned int __k, _Compare __comp = std::less<_Tp>()
[all...] |
| multiway_merge.h | 507 _SeqNumber __k = static_cast<_SeqNumber>(__seqs_end - __seqs_begin); local
509 _LT __lt(__k, __comp);
514 for (_SeqNumber __t = 0; __t < __k; ++__t)
521 for (_SeqNumber __t = 0; __t < __k; ++__t)
594 _SeqNumber __k = __seqs_end - __seqs_begin; local
596 _LT __lt(__k, __sentinel, __comp);
598 for (_SeqNumber __t = 0; __t < __k; ++__t)
622 _GLIBCXX_PARALLEL_ASSERT(0 <= __source && __source < __k);
957 _SeqNumber __k = static_cast<_SeqNumber>(__seqs_end - __seqs_begin); local
959 switch (__k)
1051 const _SeqNumber __k local
1136 const _SeqNumber __k = __seqs_end - __seqs_begin; local
1251 _SeqNumber __k = 0; local
[all...] |
| base.h | 104 _Size __k; local
105 for (__k = 0; __n > 1; __n >>= 1)
106 ++__k;
107 return __k;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/tr1/ |
| hashtable_policy.h | 513 operator[](const _Key& __k);
520 operator[](const _Key& __k)
523 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
524 std::size_t __n = __h->_M_bucket_index(__k, __code,
528 __h->_M_find_node(__h->_M_buckets[__n], __k, __code);
530 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
596 _M_bucket_index(const _Key& __k, _Hash_code_type,
598 { return _M_ranged_hash(__k, __n); }
606 _M_compare(const _Key& __k, _Hash_code_type,
608 { return _M_eq(__k, _M_extract(__n->_M_v));
[all...] |
| hashtable.h | 284 bucket(const key_type& __k) const
286 return this->_M_bucket_index(__k, this->_M_hash_code(__k),
325 find(const key_type& __k);
328 find(const key_type& __k) const;
331 count(const key_type& __k) const;
334 equal_range(const key_type& __k);
337 equal_range(const key_type& __k) const;
694 find(const key_type& __k)
696 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k);
860 const key_type& __k = this->_M_extract(__v); local
891 const key_type& __k = this->_M_extract(__v); local
918 const key_type& __k = this->_M_extract(__v); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/tr1/ |
| hashtable_policy.h | 513 operator[](const _Key& __k);
520 operator[](const _Key& __k)
523 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
524 std::size_t __n = __h->_M_bucket_index(__k, __code,
528 __h->_M_find_node(__h->_M_buckets[__n], __k, __code);
530 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
596 _M_bucket_index(const _Key& __k, _Hash_code_type,
598 { return _M_ranged_hash(__k, __n); }
606 _M_compare(const _Key& __k, _Hash_code_type,
608 { return _M_eq(__k, _M_extract(__n->_M_v));
[all...] |
| hashtable.h | 284 bucket(const key_type& __k) const
286 return this->_M_bucket_index(__k, this->_M_hash_code(__k),
325 find(const key_type& __k);
328 find(const key_type& __k) const;
331 count(const key_type& __k) const;
334 equal_range(const key_type& __k);
337 equal_range(const key_type& __k) const;
694 find(const key_type& __k)
696 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k);
860 const key_type& __k = this->_M_extract(__v); local
891 const key_type& __k = this->_M_extract(__v); local
918 const key_type& __k = this->_M_extract(__v); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_tree.h | 576 _M_get_insert_unique_pos(const key_type& __k);
579 _M_get_insert_equal_pos(const key_type& __k);
583 const key_type& __k);
587 const key_type& __k);
632 const _Key& __k);
636 const _Key& __k) const;
640 const _Key& __k);
644 const _Key& __k) const;
869 find(const key_type& __k);
872 find(const key_type& __k) const
[all...] |
| stl_map.h | 445 * @param __k The key for which data should be retrieved.
456 operator[](const key_type& __k)
461 iterator __i = lower_bound(__k);
462 // __i->first is greater than or equivalent to __k.
463 if (__i == end() || key_comp()(__k, (*__i).first))
466 std::tuple<const key_type&>(__k),
469 __i = insert(__i, value_type(__k, mapped_type()));
476 operator[](key_type&& __k)
481 iterator __i = lower_bound(__k);
482 // __i->first is greater than or equivalent to __k
[all...] |
| hashtable.h | 514 bucket(const key_type& __k) const
515 { return _M_bucket_index(__k, this->_M_hash_code(__k)); }
571 find(const key_type& __k);
574 find(const key_type& __k) const;
577 count(const key_type& __k) const;
580 equal_range(const key_type& __k);
583 equal_range(const key_type& __k) const;
592 _M_bucket_index(const key_type& __k, __hash_code __c) const
593 { return __hash_code_base::_M_bucket_index(__k, __c, _M_bucket_count);
1261 const key_type& __k = this->_M_extract()(__node->_M_v); local
1376 const key_type& __k = this->_M_extract()(__node->_M_v); local
1417 const key_type& __k = this->_M_extract()(__v); local
[all...] |
| hashtable_policy.h | 462 operator[](const key_type& __k);
465 operator[](key_type&& __k);
470 at(const key_type& __k);
473 at(const key_type& __k) const;
484 operator[](const key_type& __k)
487 __hash_code __code = __h->_M_hash_code(__k);
488 std::size_t __n = __h->_M_bucket_index(__k, __code);
489 __node_type* __p = __h->_M_find_node(__n, __k, __code);
494 std::tuple<const key_type&>(__k),
510 operator[](key_type&& __k)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| stl_tree.h | 576 _M_get_insert_unique_pos(const key_type& __k);
579 _M_get_insert_equal_pos(const key_type& __k);
583 const key_type& __k);
587 const key_type& __k);
632 const _Key& __k);
636 const _Key& __k) const;
640 const _Key& __k);
644 const _Key& __k) const;
869 find(const key_type& __k);
872 find(const key_type& __k) const
[all...] |
| stl_map.h | 445 * @param __k The key for which data should be retrieved.
456 operator[](const key_type& __k)
461 iterator __i = lower_bound(__k);
462 // __i->first is greater than or equivalent to __k.
463 if (__i == end() || key_comp()(__k, (*__i).first))
466 std::tuple<const key_type&>(__k),
469 __i = insert(__i, value_type(__k, mapped_type()));
476 operator[](key_type&& __k)
481 iterator __i = lower_bound(__k);
482 // __i->first is greater than or equivalent to __k
[all...] |
| hashtable.h | 514 bucket(const key_type& __k) const
515 { return _M_bucket_index(__k, this->_M_hash_code(__k)); }
571 find(const key_type& __k);
574 find(const key_type& __k) const;
577 count(const key_type& __k) const;
580 equal_range(const key_type& __k);
583 equal_range(const key_type& __k) const;
592 _M_bucket_index(const key_type& __k, __hash_code __c) const
593 { return __hash_code_base::_M_bucket_index(__k, __c, _M_bucket_count);
1261 const key_type& __k = this->_M_extract()(__node->_M_v); local
1376 const key_type& __k = this->_M_extract()(__node->_M_v); local
1417 const key_type& __k = this->_M_extract()(__v); local
[all...] |
| hashtable_policy.h | 462 operator[](const key_type& __k);
465 operator[](key_type&& __k);
470 at(const key_type& __k);
473 at(const key_type& __k) const;
484 operator[](const key_type& __k)
487 __hash_code __code = __h->_M_hash_code(__k);
488 std::size_t __n = __h->_M_bucket_index(__k, __code);
489 __node_type* __p = __h->_M_find_node(__n, __k, __code);
494 std::tuple<const key_type&>(__k),
510 operator[](key_type&& __k)
[all...] |
| /external/libcxx/benchmarks/ |
| unordered_set_operations.bench.cpp | 85 uint32_t __k = data; local
86 __k *= __m;
87 __k ^= __k >> __r;
88 __k *= __m;
90 __h ^= __k;
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/benchmarks/ |
| unordered_set_operations.bench.cpp | 85 uint32_t __k = data; local
86 __k *= __m;
87 __k ^= __k >> __r;
88 __k *= __m;
90 __h ^= __k;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/profile/ |
| map.h | 214 operator[](const key_type& __k)
217 return _Base::operator[](__k);
222 operator[](key_type&& __k)
225 return _Base::operator[](std::move(__k));
230 at(const key_type& __k)
233 return _Base::at(__k);
237 at(const key_type& __k) const
240 return _Base::at(__k);
|
