| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| stl_tree.h | 640 const _Key& __k);
644 const _Key& __k) const;
648 const _Key& __k);
652 const _Key& __k) const;
858 find(const key_type& __k);
861 find(const key_type& __k) const;
864 count(const key_type& __k) const;
867 lower_bound(const key_type& __k)
868 { return _M_lower_bound(_M_begin(), _M_end(), __k); }
871 lower_bound(const key_type& __k) cons
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_tree.h | 607 const _Key& __k);
611 const _Key& __k) const;
615 const _Key& __k);
619 const _Key& __k) const;
825 find(const key_type& __k);
828 find(const key_type& __k) const;
831 count(const key_type& __k) const;
834 lower_bound(const key_type& __k)
835 { return _M_lower_bound(_M_begin(), _M_end(), __k); }
838 lower_bound(const key_type& __k) cons
[all...] |
| hashtable.h | 393 bucket(const key_type& __k) const
394 { return _M_bucket_index(__k, this->_M_hash_code(__k)); }
443 find(const key_type& __k);
446 find(const key_type& __k) const;
449 count(const key_type& __k) const;
452 equal_range(const key_type& __k);
455 equal_range(const key_type& __k) const;
464 _M_bucket_index(const key_type& __k,
466 { return _HCBase::_M_bucket_index(__k, __c, _M_bucket_count);
1175 const key_type& __k = this->_M_extract()(__new_node->_M_v); local
1233 const key_type& __k = this->_M_extract()(__new_node->_M_v); local
1288 const key_type& __k = this->_M_extract()(__v); local
1330 const key_type& __k = this->_M_extract()(__v); local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| stl_tree.h | 640 const _Key& __k);
644 const _Key& __k) const;
648 const _Key& __k);
652 const _Key& __k) const;
858 find(const key_type& __k);
861 find(const key_type& __k) const;
864 count(const key_type& __k) const;
867 lower_bound(const key_type& __k)
868 { return _M_lower_bound(_M_begin(), _M_end(), __k); }
871 lower_bound(const key_type& __k) cons
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_tree.h | 607 const _Key& __k);
611 const _Key& __k) const;
615 const _Key& __k);
619 const _Key& __k) const;
825 find(const key_type& __k);
828 find(const key_type& __k) const;
831 count(const key_type& __k) const;
834 lower_bound(const key_type& __k)
835 { return _M_lower_bound(_M_begin(), _M_end(), __k); }
838 lower_bound(const key_type& __k) cons
[all...] |
| hashtable.h | 393 bucket(const key_type& __k) const
394 { return _M_bucket_index(__k, this->_M_hash_code(__k)); }
443 find(const key_type& __k);
446 find(const key_type& __k) const;
449 count(const key_type& __k) const;
452 equal_range(const key_type& __k);
455 equal_range(const key_type& __k) const;
464 _M_bucket_index(const key_type& __k,
466 { return _HCBase::_M_bucket_index(__k, __c, _M_bucket_count);
1175 const key_type& __k = this->_M_extract()(__new_node->_M_v); local
1233 const key_type& __k = this->_M_extract()(__new_node->_M_v); local
1288 const key_type& __k = this->_M_extract()(__v); local
1330 const key_type& __k = this->_M_extract()(__v); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| 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...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/ |
| 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...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/ |
| 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...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/ |
| 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...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/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/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/9/sources/cxx-stl/gnu-libstdc++/4.8/include/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...] |
| /prebuilts/ndk/9/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 | 500 bucket(const key_type& __k) const
501 { return _M_bucket_index(__k, this->_M_hash_code(__k)); }
557 find(const key_type& __k);
560 find(const key_type& __k) const;
563 count(const key_type& __k) const;
566 equal_range(const key_type& __k);
569 equal_range(const key_type& __k) const;
578 _M_bucket_index(const key_type& __k, __hash_code __c) const
579 { return __hash_code_base::_M_bucket_index(__k, __c, _M_bucket_count);
1488 const key_type& __k = this->_M_extract()(__node->_M_v()); local
1605 const key_type& __k = this->_M_extract()(__node->_M_v()); local
1661 const key_type& __k = this->_M_extract()(__v); local
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_map.h | 442 operator[](const key_type& __k)
447 iterator __i = lower_bound(__k);
448 // __i->first is greater than or equivalent to __k.
449 if (__i == end() || key_comp()(__k, (*__i).first))
450 __i = insert(__i, value_type(__k, mapped_type()));
464 at(const key_type& __k)
466 iterator __i = lower_bound(__k);
467 if (__i == end() || key_comp()(__k, (*__i).first))
473 at(const key_type& __k) const
475 const_iterator __i = lower_bound(__k);
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_map.h | 442 operator[](const key_type& __k)
447 iterator __i = lower_bound(__k);
448 // __i->first is greater than or equivalent to __k.
449 if (__i == end() || key_comp()(__k, (*__i).first))
450 __i = insert(__i, value_type(__k, mapped_type()));
464 at(const key_type& __k)
466 iterator __i = lower_bound(__k);
467 if (__i == end() || key_comp()(__k, (*__i).first))
473 at(const key_type& __k) const
475 const_iterator __i = lower_bound(__k);
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_map.h | 442 operator[](const key_type& __k)
447 iterator __i = lower_bound(__k);
448 // __i->first is greater than or equivalent to __k.
449 if (__i == end() || key_comp()(__k, (*__i).first))
450 __i = insert(__i, value_type(__k, mapped_type()));
464 at(const key_type& __k)
466 iterator __i = lower_bound(__k);
467 if (__i == end() || key_comp()(__k, (*__i).first))
473 at(const key_type& __k) const
475 const_iterator __i = lower_bound(__k);
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
| stl_map.h | 442 operator[](const key_type& __k)
447 iterator __i = lower_bound(__k);
448 // __i->first is greater than or equivalent to __k.
449 if (__i == end() || key_comp()(__k, (*__i).first))
450 __i = insert(__i, value_type(__k, mapped_type()));
464 at(const key_type& __k)
466 iterator __i = lower_bound(__k);
467 if (__i == end() || key_comp()(__k, (*__i).first))
473 at(const key_type& __k) const
475 const_iterator __i = lower_bound(__k);
[all...] |
