/haiku-buildtools/legacy/gcc/libstdc++/ |
H A D | valarray.cc | 31 for (size_t __k=0; __k<__n; ++__k) 32 __i[__j] += __s[__k]*__t[__k]; 34 for (size_t __k=__n-1; __k; --__k) { 35 if (__t[__k] >= __l[__k]) { [all...] |
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/other/ |
H A D | static1.C | 9 void operator[](const int& __k);
|
H A D | crash-8.C | 98 mapped_type& operator[](const key_type& __k) { argument 99 insert(value_type(__k, mapped_type()));
|
/haiku-buildtools/gcc/libstdc++-v3/include/parallel/ |
H A D | search.h | 59 _DifferenceType __k = 0; local 62 while ((__k >= 0) && !(__elements[__k] == __elements[__j-1])) 63 __k = __off[__k]; 64 __off[__j] = ++__k;
|
H A D | losertree.h | 91 * @param __k The number of sequences to merge. 94 _LoserTreeBase(unsigned int __k, _Compare __comp) argument 97 _M_ik = __k; 179 _LoserTree(unsigned int __k, _Compare __comp) argument 180 : _Base::_LoserTreeBase(__k, __comp) 272 _LoserTree(unsigned int __k, _Compare __comp) argument 273 : _Base::_LoserTreeBase(__k, __comp) 373 _LoserTreePointerBase(unsigned int __k, argument 377 _M_ik = __k; 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 D | 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...] |
H A D | base.h | 104 _Size __k; local 105 for (__k = 0; __n > 1; __n >>= 1) 106 ++__k; 107 return __k;
|
/haiku-buildtools/gcc/libstdc++-v3/include/bits/ |
H A D | stl_tree.h | 726 _M_get_insert_unique_pos(const key_type& __k); 729 _M_get_insert_equal_pos(const key_type& __k); 733 const key_type& __k); 737 const key_type& __k); 791 const _Key& __k); 795 const _Key& __k) const; 799 const _Key& __k); 803 const _Key& __k) const; 1081 find(const key_type& __k); 1084 find(const key_type& __k) cons [all...] |
H A D | stl_map.h | 463 * @param __k The key for which data should be retrieved. 474 operator[](const key_type& __k) argument 479 iterator __i = lower_bound(__k); 480 // __i->first is greater than or equivalent to __k. 481 if (__i == end() || key_comp()(__k, (*__i).first)) 484 std::tuple<const key_type&>(__k), 487 __i = insert(__i, value_type(__k, mapped_type())); 494 operator[](key_type&& __k) argument 499 iterator __i = lower_bound(__k); 500 // __i->first is greater than or equivalent to __k 519 at(const key_type& __k) argument [all...] |
H A D | hashtable.h | 542 bucket(const key_type& __k) const 543 { return _M_bucket_index(__k, this->_M_hash_code(__k)); } 599 find(const key_type& __k); 602 find(const key_type& __k) const; 605 count(const key_type& __k) const; 608 equal_range(const key_type& __k); 611 equal_range(const key_type& __k) const; 620 _M_bucket_index(const key_type& __k, __hash_code __c) const argument 621 { return __hash_code_base::_M_bucket_index(__k, __ 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 D | hashtable_policy.h | 567 operator[](const key_type& __k); 570 operator[](key_type&& __k); 575 at(const key_type& __k); 578 at(const key_type& __k) const; 587 operator[](const key_type& __k) 591 __hash_code __code = __h->_M_hash_code(__k); 592 std::size_t __n = __h->_M_bucket_index(__k, __code); 593 __node_type* __p = __h->_M_find_node(__n, __k, __code); 598 std::tuple<const key_type&>(__k), 612 operator[](key_type&& __k) 1080 _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 D | unordered_map.h | 656 * @param __k The key for which data should be retrieved. 667 operator[](const key_type& __k) argument 668 { return _M_h[__k]; } 671 operator[](key_type&& __k) argument 672 { return _M_h[std::move(__k)]; } 678 * @param __k The key for which data should be retrieved. 679 * @return A reference to the data whose key is equal to @a __k, if 684 at(const key_type& __k) argument 685 { return _M_h.at(__k); } 688 at(const key_type& __k) cons [all...] |
H A D | valarray_array.h | 333 for (size_t __k = 0; __k < __n; ++__k) 615 for (size_t __k = 0; __k<__n; ++__k, ++__j) \ 616 __a._M_data[*__j] _Op##= __e[__k]; \
|
H A D | stl_algo.h | 1345 _Distance __k = __middle - __first; local 1347 if (__k == __n - __k) 1358 if (__k < __n - __k) 1360 if (__is_pod(_ValueType) && __k == 1) 1367 _RandomAccessIterator __q = __p + __k; 1368 for (_Distance __i = 0; __i < __n - __k; ++ __i) 1374 __n %= __k; 1377 std::swap(__n, __k); [all...] |
/haiku-buildtools/gcc/libstdc++-v3/include/tr1/ |
H A D | hashtable_policy.h | 513 operator[](const _Key& __k); 520 operator[](const _Key& __k) argument 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, argument 598 { return _M_ranged_hash(__k, __n); } 606 _M_compare(const _Key& __k, _Hash_code_type, argument 608 { return _M_eq(__k, _M_extrac 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...] |
H A D | 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) argument 696 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k); 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...] |
/haiku-buildtools/gcc/libstdc++-v3/config/locale/gnu/ |
H A D | ctype_members.cc | 294 for (size_t __k = 0; __k <= 11; ++__k) 296 _M_bit[__k] = static_cast<mask>(_ISbit(__k)); 297 _M_wmask[__k] = _M_convert_to_wmask(_M_bit[__k]);
|
/haiku-buildtools/gcc/libstdc++-v3/src/c++98/ |
H A D | locale.cc | 273 for (size_t __k = 0; __k < _S_categories_size; ++__k) 274 _M_names[__k] = 0; 348 for (size_t __k = _M_facets_size; __k < __new_size; ++__k) 349 __newc[__k] = 0;
|
H A D | mt_allocator.cc | 522 const size_t __k = sizeof(_Thread_record) local 524 __v = ::operator new(__k); 717 const size_t __k = sizeof(_Thread_record) local 719 __v = ::operator new(__k);
|
/haiku-buildtools/gcc/libstdc++-v3/include/profile/ |
H A D | map.h | 228 operator[](const key_type& __k) argument 231 return _Base::operator[](__k); 236 operator[](key_type&& __k) argument 239 return _Base::operator[](std::move(__k)); 244 at(const key_type& __k) argument 247 return _Base::at(__k); 251 at(const key_type& __k) const 254 return _Base::at(__k);
|
/haiku-buildtools/legacy/gcc/libstdc++/stl/ |
H A D | stl_tree.h | 1115 _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::find(const _Key& __k) argument 1117 _Link_type __y = _M_header; // Last node which is not less than __k. 1121 if (!_M_key_compare(_S_key(__x), __k)) 1127 return (__j == end() || _M_key_compare(__k, _S_key(__j._M_node))) ? 1134 _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::find(const _Key& __k) const 1136 _Link_type __y = _M_header; /* Last node which is not less than __k. */ 1140 if (!_M_key_compare(_S_key(__x), __k)) 1146 return (__j == end() || _M_key_compare(__k, _S_key(__j._M_node))) ? 1154 ::count(const _Key& __k) const 1156 pair<const_iterator, const_iterator> __p = equal_range(__k); 1166 lower_bound(const _Key& __k) argument 1202 upper_bound(const _Key& __k) argument 1240 equal_range(const _Key& __k) argument [all...] |
H A D | stl_map.h | 150 _Tp& operator[](const key_type& __k) { argument 151 iterator __i = lower_bound(__k); 152 // __i->first is greater than or equivalent to __k. 153 if (__i == end() || key_comp()(__k, (*__i).first)) 154 __i = insert(__i, value_type(__k, _Tp()));
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/cpp0x/ |
H A D | variadic98.C | 283 iterator _M_lower_bound(_Link_type __x, _Link_type __y, const _Key& __k); 284 iterator _M_upper_bound(_Link_type __x, _Link_type __y, const _Key& __k); 292 size_type count(const key_type& __k) const; 293 pair<iterator, iterator> equal_range(const key_type& __k); 294 pair<const_iterator, const_iterator> equal_range(const key_type& __k) const; 307 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 311 if (_M_impl._M_key_compare(_S_key(__x), __k)) __x = _S_right(__x); 314 return pair<iterator, iterator>(_M_lower_bound(__x, __y, __k), _M_upper_bound(__xu, __yu, __k)); 318 template<typename _Key, typename _Val, typename _KeyOfValue, typename _Compare, typename _Alloc> pair<typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator, typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: equal_range(const _Key& __k) cons [all...] |
/haiku-buildtools/legacy/gcc/libstdc++/std/ |
H A D | valarray_array.h | 270 for (size_t __k=0; __k<__n; ++__k, ++__j) \ 271 __a._M_data[*__j] _Op##= __e[__k]; \
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/lto/ |
H A D | pr47333.C | 815 const _Key& __k); 819 const _Key& __k) const; 839 find(const key_type& __k); 864 const _Key& __k) 867 if (!_M_impl._M_key_compare(_S_key(__x), __k)) 879 find(const _Key& __k) argument 881 iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k); 883 || _M_impl._M_key_compare(__k, 863 _M_lower_bound(_Link_type __x, _Link_type __y, const _Key& __k) argument
|