| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| 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/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| stl_map.h | 480 * @param __k The key for which data should be retrieved.
491 operator[](const key_type& __k)
496 iterator __i = lower_bound(__k);
497 // __i->first is greater than or equivalent to __k.
498 if (__i == end() || key_comp()(__k, (*__i).first))
501 std::tuple<const key_type&>(__k),
504 __i = insert(__i, value_type(__k, mapped_type()));
511 operator[](key_type&& __k)
516 iterator __i = lower_bound(__k);
517 // __i->first is greater than or equivalent to __k
[all...] |
| hashtable.h | 535 bucket(const key_type& __k) const
536 { return _M_bucket_index(__k, this->_M_hash_code(__k)); }
592 find(const key_type& __k);
595 find(const key_type& __k) const;
598 count(const key_type& __k) const;
601 equal_range(const key_type& __k);
604 equal_range(const key_type& __k) const;
613 _M_bucket_index(const key_type& __k, __hash_code __c) const
614 { return __hash_code_base::_M_bucket_index(__k, __c, _M_bucket_count);
1542 const key_type& __k = this->_M_extract()(__node->_M_v()); local
1659 const key_type& __k = this->_M_extract()(__node->_M_v()); local
1715 const key_type& __k = this->_M_extract()(__v); local
[all...] |
| hashtable_policy.h | 570 operator[](const key_type& __k);
573 operator[](key_type&& __k);
578 at(const key_type& __k);
581 at(const key_type& __k) const;
592 operator[](const key_type& __k)
595 __hash_code __code = __h->_M_hash_code(__k);
596 std::size_t __n = __h->_M_bucket_index(__k, __code);
597 __node_type* __p = __h->_M_find_node(__n, __k, __code);
602 std::tuple<const key_type&>(__k),
618 operator[](key_type&& __k)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| 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-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| 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-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| 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/parallel/ |
| 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/ |
| 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/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/ |
| 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;
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/Gimpact/ |
| gim_linear_math.h | 1204 GUINT __ii[4], __jj[4], __k; \
1206 for (__k=0; __k<i; __k++) __ii[__k] = __k; \
1207 for (__k=i; __k<3; __k++) __ii[__k] = __k+1;
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.h | 543 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 {
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...] |
| /prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.h | 543 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 {
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...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-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);
|
| /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);
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/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);
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/profile/ |
| map.h | 244 operator[](const key_type& __k)
247 return _Base::operator[](__k);
252 operator[](key_type&& __k)
255 return _Base::operator[](std::move(__k));
260 at(const key_type& __k)
263 return _Base::at(__k);
267 at(const key_type& __k) const
270 return _Base::at(__k);
|
