| /ndk/sources/cxx-stl/llvm-libc++/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/9/sources/cxx-stl/gnu-libstdc++/4.8/include/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;
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| hashtable_policy.h | 520 operator[](const _Key& __k);
523 operator[](_Key&& __k);
528 at(const _Key& __k);
531 at(const _Key& __k) const;
538 operator[](const _Key& __k)
541 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
542 std::size_t __n = __h->_M_bucket_index(__k, __code,
546 __h->_M_find_node(__h->_M_buckets[__n], __k, __code);
548 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
557 operator[](_Key&& __k)
[all...] |
| stl_map.h | 445 operator[](const key_type& __k)
450 iterator __i = lower_bound(__k);
451 // __i->first is greater than or equivalent to __k.
452 if (__i == end() || key_comp()(__k, (*__i).first))
453 __i = insert(__i, value_type(__k, mapped_type()));
459 operator[](key_type&& __k)
464 iterator __i = lower_bound(__k);
465 // __i->first is greater than or equivalent to __k.
466 if (__i == end() || key_comp()(__k, (*__i).first))
467 __i = insert(__i, std::make_pair(std::move(__k), mapped_type()))
[all...] |
| hashtable.h | 302 bucket(const key_type& __k) const
304 return this->_M_bucket_index(__k, this->_M_hash_code(__k),
352 find(const key_type& __k);
355 find(const key_type& __k) const;
358 count(const key_type& __k) const;
361 equal_range(const key_type& __k);
364 equal_range(const key_type& __k) const;
761 find(const key_type& __k)
763 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k);
922 const key_type& __k = this->_M_extract(__v); local
964 const key_type& __k = this->_M_extract(__v); local
993 const key_type& __k = this->_M_extract(__v); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| hashtable_policy.h | 520 operator[](const _Key& __k);
523 operator[](_Key&& __k);
528 at(const _Key& __k);
531 at(const _Key& __k) const;
538 operator[](const _Key& __k)
541 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
542 std::size_t __n = __h->_M_bucket_index(__k, __code,
546 __h->_M_find_node(__h->_M_buckets[__n], __k, __code);
548 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
557 operator[](_Key&& __k)
[all...] |
| stl_map.h | 445 operator[](const key_type& __k)
450 iterator __i = lower_bound(__k);
451 // __i->first is greater than or equivalent to __k.
452 if (__i == end() || key_comp()(__k, (*__i).first))
453 __i = insert(__i, value_type(__k, mapped_type()));
459 operator[](key_type&& __k)
464 iterator __i = lower_bound(__k);
465 // __i->first is greater than or equivalent to __k.
466 if (__i == end() || key_comp()(__k, (*__i).first))
467 __i = insert(__i, std::make_pair(std::move(__k), mapped_type()))
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| hashtable_policy.h | 520 operator[](const _Key& __k);
523 operator[](_Key&& __k);
528 at(const _Key& __k);
531 at(const _Key& __k) const;
538 operator[](const _Key& __k)
541 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
542 std::size_t __n = __h->_M_bucket_index(__k, __code,
546 __h->_M_find_node(__h->_M_buckets[__n], __k, __code);
548 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
557 operator[](_Key&& __k)
[all...] |
| stl_map.h | 445 operator[](const key_type& __k)
450 iterator __i = lower_bound(__k);
451 // __i->first is greater than or equivalent to __k.
452 if (__i == end() || key_comp()(__k, (*__i).first))
453 __i = insert(__i, value_type(__k, mapped_type()));
459 operator[](key_type&& __k)
464 iterator __i = lower_bound(__k);
465 // __i->first is greater than or equivalent to __k.
466 if (__i == end() || key_comp()(__k, (*__i).first))
467 __i = insert(__i, std::make_pair(std::move(__k), mapped_type()))
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| hashtable_policy.h | 520 operator[](const _Key& __k);
523 operator[](_Key&& __k);
528 at(const _Key& __k);
531 at(const _Key& __k) const;
538 operator[](const _Key& __k)
541 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
542 std::size_t __n = __h->_M_bucket_index(__k, __code,
546 __h->_M_find_node(__h->_M_buckets[__n], __k, __code);
548 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
557 operator[](_Key&& __k)
[all...] |
| stl_map.h | 445 operator[](const key_type& __k)
450 iterator __i = lower_bound(__k);
451 // __i->first is greater than or equivalent to __k.
452 if (__i == end() || key_comp()(__k, (*__i).first))
453 __i = insert(__i, value_type(__k, mapped_type()));
459 operator[](key_type&& __k)
464 iterator __i = lower_bound(__k);
465 // __i->first is greater than or equivalent to __k.
466 if (__i == end() || key_comp()(__k, (*__i).first))
467 __i = insert(__i, std::make_pair(std::move(__k), mapped_type()))
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_map.h | 439 * @param __k The key for which data should be retrieved.
450 operator[](const key_type& __k)
455 iterator __i = lower_bound(__k);
456 // __i->first is greater than or equivalent to __k.
457 if (__i == end() || key_comp()(__k, (*__i).first))
458 __i = insert(__i, value_type(__k, mapped_type()));
464 operator[](key_type&& __k)
469 iterator __i = lower_bound(__k);
470 // __i->first is greater than or equivalent to __k.
471 if (__i == end() || key_comp()(__k, (*__i).first)
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_map.h | 439 * @param __k The key for which data should be retrieved.
450 operator[](const key_type& __k)
455 iterator __i = lower_bound(__k);
456 // __i->first is greater than or equivalent to __k.
457 if (__i == end() || key_comp()(__k, (*__i).first))
458 __i = insert(__i, value_type(__k, mapped_type()));
464 operator[](key_type&& __k)
469 iterator __i = lower_bound(__k);
470 // __i->first is greater than or equivalent to __k.
471 if (__i == end() || key_comp()(__k, (*__i).first)
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/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...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/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...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/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...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/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...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/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...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/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...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/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...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1_impl/ |
| hashtable_policy.h | 547 operator[](const _Key& __k);
553 at(const _Key& __k);
556 at(const _Key& __k) const;
564 operator[](const _Key& __k)
567 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
568 std::size_t __n = __h->_M_bucket_index(__k, __code,
572 __h->_M_find_node(__h->_M_buckets[__n], __k, __code);
574 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
584 at(const _Key& __k)
587 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
| hashtable_policy.h | 547 operator[](const _Key& __k);
553 at(const _Key& __k);
556 at(const _Key& __k) const;
564 operator[](const _Key& __k)
567 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
568 std::size_t __n = __h->_M_bucket_index(__k, __code,
572 __h->_M_find_node(__h->_M_buckets[__n], __k, __code);
574 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
584 at(const _Key& __k)
587 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
| hashtable_policy.h | 547 operator[](const _Key& __k);
553 at(const _Key& __k);
556 at(const _Key& __k) const;
564 operator[](const _Key& __k)
567 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
568 std::size_t __n = __h->_M_bucket_index(__k, __code,
572 __h->_M_find_node(__h->_M_buckets[__n], __k, __code);
574 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
584 at(const _Key& __k)
587 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
| hashtable_policy.h | 547 operator[](const _Key& __k);
553 at(const _Key& __k);
556 at(const _Key& __k) const;
564 operator[](const _Key& __k)
567 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
568 std::size_t __n = __h->_M_bucket_index(__k, __code,
572 __h->_M_find_node(__h->_M_buckets[__n], __k, __code);
574 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
584 at(const _Key& __k)
587 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/tr1_impl/ |
| hashtable_policy.h | 547 operator[](const _Key& __k);
553 at(const _Key& __k);
556 at(const _Key& __k) const;
564 operator[](const _Key& __k)
567 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
568 std::size_t __n = __h->_M_bucket_index(__k, __code,
572 __h->_M_find_node(__h->_M_buckets[__n], __k, __code);
574 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
584 at(const _Key& __k)
587 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
[all...] |
