Searched defs:__k (Results 1 - 21 of 21) sorted by relevance

/haiku-buildtools/gcc/libstdc++-v3/include/parallel/
H A Dsearch.h59 _DifferenceType __k = 0; local
H A Dbase.h104 _Size __k; local
H A Dlosertree.h94 _LoserTreeBase(unsigned int __k, _Compare __comp) argument
179 _LoserTree(unsigned int __k, _Compare __comp) argument
272 _LoserTree(unsigned int __k, _Compare __comp) argument
373 _LoserTreePointerBase(unsigned int __k, argument
418 _LoserTreePointer(unsigned int __k, _Compar argument
500 _LoserTreePointer(unsigned int __k, _Compare __comp = std::less<_Tp>()) argument
588 _LoserTreeUnguardedBase(unsigned int __k, const _Tp& __sentinel, _Compare __comp = std::less<_Tp>()) argument
655 _LoserTreeUnguarded(unsigned int __k, const _Tp& __sentinel, _Compare __comp = std::less<_Tp>()) argument
743 _LoserTreeUnguarded(unsigned int __k, const _Tp& __sentinel, _Compare __comp = std::less<_Tp>()) argument
843 _LoserTreePointerUnguardedBase(unsigned int __k, const _Tp& __sentinel, _Compare __comp = std::less<_Tp>()) argument
900 _LoserTreePointerUnguarded(unsigned int __k, const _Tp& __sentinel, _Compare __comp = std::less<_Tp>()) argument
986 _LoserTreePointerUnguarded(unsigned int __k, const _Tp& __sentinel, _Compare __comp = std::less<_Tp>()) argument
[all...]
H A Dmultiway_merge.h507 _SeqNumber __k = static_cast<_SeqNumber>(__seqs_end - __seqs_begin); local
594 _SeqNumber __k = __seqs_end - __seqs_begin; local
957 _SeqNumber __k = static_cast<_SeqNumber>(__seqs_end - __seqs_begin); local
1051 const _SeqNumber __k local
1136 const _SeqNumber __k = __seqs_end - __seqs_begin; local
1251 _SeqNumber __k = 0; local
[all...]
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/other/
H A Dcrash-8.C98 mapped_type& operator[](const key_type& __k) { argument
/haiku-buildtools/legacy/gcc/libstdc++/stl/
H A Dstl_map.h150 _Tp& operator[](const key_type& __k) { argument
H A Dstl_function.h441 unsigned int __k = 1; local
H A Dstl_tree.h1115 _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::find(const _Key& __k) argument
1166 lower_bound(const _Key& __k) argument
1202 upper_bound(const _Key& __k) argument
1240 equal_range(const _Key& __k) argument
[all...]
H A Dstl_algo.h772 _Distance __k = __middle - __first; local
1267 _Size __k; local
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/bits/
H A Dunordered_map.h667 operator[](const key_type& __k) argument
671 operator[](key_type&& __k) argument
684 at(const key_type& __k) argument
[all...]
H A Dstl_map.h474 operator[](const key_type& __k) argument
494 operator[](key_type&& __k) argument
519 at(const key_type& __k) argument
[all...]
H A Dhashtable.h620 _M_bucket_index(const key_type& __k, __hash_code __c) const argument
748 erase(const key_type& __k) argument
1527 const key_type& __k = this->_M_extract()(__node->_M_v()); local
1641 const key_type& __k = this->_M_extract()(__node->_M_v()); local
1695 const key_type& __k = this->_M_extract()(__v); local
[all...]
H A Dhashtable_policy.h1080 _M_bucket_index(const _Key& __k, __hash_code, std::size_t __n) const argument
1320 _S_equals(const _Equal& __eq, const _ExtractKey& __extract, const _Key& __k, _HashCodeType __c, _Hash_node<_Value, true>* __n) argument
1331 _S_equals(const _Equal& __eq, const _ExtractKey& __extract, const _Key& __k, _HashCodeType, _Hash_node<_Value, false>* __n) argument
1701 _M_equals(const _Key& __k, __hash_code __c, __node_type* __n) const argument
[all...]
H A Dstl_algo.h1345 _Distance __k = __middle - __first; local
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/profile/
H A Dmap.h228 operator[](const key_type& __k) argument
236 operator[](key_type&& __k) argument
244 at(const key_type& __k) argument
/haiku-buildtools/gcc/libstdc++-v3/src/c++98/
H A Dmt_allocator.cc522 const size_t __k = sizeof(_Thread_record) local
717 const size_t __k = sizeof(_Thread_record) local
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/tree-ssa/
H A Dpr27291.C316 mapped_type & operator[] (const key_type & __k) argument
/haiku-buildtools/gcc/libstdc++-v3/include/tr1/
H A Dhashtable.h694 find(const key_type& __k) argument
753 equal_range(const key_type& __k) argument
826 _M_find_node(_Node* __p, const key_type& __k, typename _Hashtable::_Hash_code_type __code) const argument
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
1034 erase(const key_type& __k) argument
[all...]
H A Dhashtable_policy.h520 operator[](const _Key& __k) argument
596 _M_bucket_index(const _Key& __k, _Hash_code_type, argument
606 _M_compare(const _Key& __k, _Hash_code_type, argument
685 _M_compare(const _Key& __k, _Hash_code_type, _Hash_node<_Value, false>* __n) const argument
752 _M_compare(const _Key& __k, _Hash_code_type __c, _Hash_node<_Value, true>* __n) const argument
[all...]
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/cpp0x/
H A Dvariadic98.C307 template<typename _Key, typename _Val, typename _KeyOfValue, typename _Compare, typename _Alloc> pair<typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator, typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: equal_range(const _Key& __k) { argument
[all...]
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/lto/
H A Dpr47333.C879 find(const _Key& __k) argument
863 _M_lower_bound(_Link_type __x, _Link_type __y, const _Key& __k) argument

Completed in 140 milliseconds