/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/bits/ |
H A D | stl_relops.h | 92 operator!=(const _Tp& __x, const _Tp& __y) argument 93 { return !(__x == __y); } 105 operator>(const _Tp& __x, const _Tp& __y) argument 106 { return __y < __x; } 118 operator<=(const _Tp& __x, const _Tp& __y) argument 119 { return !(__y < __x); } 131 operator>=(const _Tp& __x, const _Tp& __y) argument 132 { return !(__x < __y); }
|
H A D | stl_pair.h | 96 operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument 97 { return __x.first == __y.first && __x.second == __y.second; } 102 operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument 103 { return __x.first < __y.first 104 || (!(__y.first < __x.first) && __x.second < __y.second); } 109 operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument 110 { return !(__x == __y); } 115 operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument 121 operator <=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument 127 operator >=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument 144 make_pair(_T1 __x, _T2 __y) argument [all...] |
H A D | stl_stack.h | 214 operator==(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) argument 215 { return __x.c == __y.c; } 232 operator<(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) argument 233 { return __x.c < __y.c; } 238 operator!=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) argument 239 { return !(__x == __y); } 244 operator>(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) argument 245 { return __y < __x; } 250 operator<=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) argument 251 { return !(__y < __ 256 operator >=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) argument [all...] |
H A D | valarray_before.h | 193 _Tp operator()(const _Tp& __x, const _Tp& __y) const 194 { return __x + __y; } 200 _Tp operator()(const _Tp& __x, const _Tp& __y) const 201 { return __x - __y; } 207 _Tp operator()(const _Tp& __x, const _Tp& __y) const 208 { return __x * __y; } 214 _Tp operator()(const _Tp& __x, const _Tp& __y) const 215 { return __x / __y; } 221 _Tp operator()(const _Tp& __x, const _Tp& __y) const 222 { return __x % __y; } [all...] |
H A D | stl_function.h | 137 operator()(const _Tp& __x, const _Tp& __y) const 138 { return __x + __y; } 146 operator()(const _Tp& __x, const _Tp& __y) const 147 { return __x - __y; } 155 operator()(const _Tp& __x, const _Tp& __y) const 156 { return __x * __y; } 164 operator()(const _Tp& __x, const _Tp& __y) const 165 { return __x / __y; } 173 operator()(const _Tp& __x, const _Tp& __y) const 174 { return __x % __y; } 400 binder1st(const _Operation& __x, const typename _Operation::first_argument_type& __y) argument 434 binder2nd(const _Operation& __x, const typename _Operation::second_argument_type& __y) argument [all...] |
H A D | stl_multimap.h | 121 bool operator()(const value_type& __x, const value_type& __y) const 122 { return comp(__x.first, __y.first); } 613 const multimap<_Key, _Tp, _Compare, _Alloc>& __y) 614 { return __x._M_t == __y._M_t; } 630 const multimap<_Key, _Tp, _Compare, _Alloc>& __y) 631 { return __x._M_t < __y._M_t; } 637 const multimap<_Key, _Tp, _Compare, _Alloc>& __y) 638 { return !(__x == __y); } 644 const multimap<_Key, _Tp, _Compare, _Alloc>& __y) 645 { return __y < __ 612 operator ==(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) argument 629 operator <(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) argument 636 operator !=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) argument 643 operator >(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) argument 650 operator <=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) argument 657 operator >=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) argument 664 swap(multimap<_Key, _Tp, _Compare, _Alloc>& __x, multimap<_Key, _Tp, _Compare, _Alloc>& __y) argument [all...] |
H A D | stl_queue.h | 239 operator==(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) argument 240 { return __x.c == __y.c; } 257 operator<(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) argument 258 { return __x.c < __y.c; } 263 operator!=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) argument 264 { return !(__x == __y); } 269 operator>(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) argument 270 { return __y < __x; } 275 operator<=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) argument 276 { return !(__y < __ 281 operator >=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) argument [all...] |
H A D | stl_iterator.h | 283 const reverse_iterator<_Iterator>& __y) 284 { return __x.base() == __y.base(); } 289 const reverse_iterator<_Iterator>& __y) 290 { return __y.base() < __x.base(); } 295 const reverse_iterator<_Iterator>& __y) 296 { return !(__x == __y); } 301 const reverse_iterator<_Iterator>& __y) 302 { return __y < __x; } 307 const reverse_iterator<_Iterator>& __y) 308 { return !(__y < __ 282 operator ==(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument 288 operator <(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument 294 operator !=(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument 300 operator >(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument 306 operator <=(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument 312 operator >=(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument 318 operator -(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument 332 operator ==(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) argument 338 operator <(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) argument 344 operator !=(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) argument 350 operator >(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) argument 356 operator <=(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) argument 362 operator >=(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) argument 368 operator -(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) argument [all...] |
H A D | stl_deque.h | 124 _Deque_iterator(_Tp* __x, _Map_pointer __y) argument 125 : _M_cur(__x), _M_first(*__y), 126 _M_last(*__y + _S_buffer_size()), _M_node(__y) {} 244 const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) 245 { return __x._M_cur == __y._M_cur; } 251 const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) 252 { return __x._M_cur == __y._M_cur; } 257 const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) 258 { return !(__x == __y); } 243 operator ==(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) argument 250 operator ==(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) argument 256 operator !=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) argument 263 operator !=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) argument 269 operator <(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) argument 277 operator <(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) argument 284 operator >(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) argument 291 operator >(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) argument 297 operator <=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) argument 304 operator <=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) argument 310 operator >=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) argument 317 operator >=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) argument 327 operator -(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) argument 339 operator -(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) argument 1549 operator ==(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument 1567 operator <(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument 1575 operator !=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument 1582 operator >(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument 1589 operator <=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument 1596 operator >=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument 1603 swap(deque<_Tp,_Alloc>& __x, deque<_Tp,_Alloc>& __y) argument [all...] |
H A D | stl_multiset.h | 508 const multiset<_Key, _Compare, _Alloc>& __y) 509 { return __x._M_t == __y._M_t; } 525 const multiset<_Key, _Compare, _Alloc>& __y) 526 { return __x._M_t < __y._M_t; } 532 const multiset<_Key, _Compare, _Alloc>& __y) 533 { return !(__x == __y); } 539 const multiset<_Key,_Compare,_Alloc>& __y) 540 { return __y < __x; } 546 const multiset<_Key, _Compare, _Alloc>& __y) 547 { return !(__y < __ 507 operator ==(const multiset<_Key, _Compare, _Alloc>& __x, const multiset<_Key, _Compare, _Alloc>& __y) argument 524 operator <(const multiset<_Key, _Compare, _Alloc>& __x, const multiset<_Key, _Compare, _Alloc>& __y) argument 531 operator !=(const multiset<_Key, _Compare, _Alloc>& __x, const multiset<_Key, _Compare, _Alloc>& __y) argument 538 operator >(const multiset<_Key,_Compare,_Alloc>& __x, const multiset<_Key,_Compare,_Alloc>& __y) argument 545 operator <=(const multiset<_Key, _Compare, _Alloc>& __x, const multiset<_Key, _Compare, _Alloc>& __y) argument 552 operator >=(const multiset<_Key, _Compare, _Alloc>& __x, const multiset<_Key, _Compare, _Alloc>& __y) argument 559 swap(multiset<_Key, _Compare, _Alloc>& __x, multiset<_Key, _Compare, _Alloc>& __y) argument [all...] |
H A D | stl_set.h | 522 const set<_Key, _Compare, _Alloc>& __y) 523 { return __x._M_t == __y._M_t; } 539 const set<_Key, _Compare, _Alloc>& __y) 540 { return __x._M_t < __y._M_t; } 546 const set<_Key, _Compare, _Alloc>& __y) 547 { return !(__x == __y); } 553 const set<_Key, _Compare, _Alloc>& __y) 554 { return __y < __x; } 560 const set<_Key, _Compare, _Alloc>& __y) 561 { return !(__y < __ 521 operator ==(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) argument 538 operator <(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) argument 545 operator !=(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) argument 552 operator >(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) argument 559 operator <=(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) argument 566 operator >=(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) argument 573 swap(set<_Key, _Compare, _Alloc>& __x, set<_Key, _Compare, _Alloc>& __y) argument [all...] |
H A D | stl_map.h | 122 bool operator()(const value_type& __x, const value_type& __y) const 123 { return comp(__x.first, __y.first); } 683 const map<_Key, _Tp, _Compare, _Alloc>& __y) 684 { return __x._M_t == __y._M_t; } 700 const map<_Key, _Tp, _Compare, _Alloc>& __y) 701 { return __x._M_t < __y._M_t; } 707 const map<_Key, _Tp, _Compare, _Alloc>& __y) 708 { return !(__x == __y); } 714 const map<_Key, _Tp, _Compare, _Alloc>& __y) 715 { return __y < __ 682 operator ==(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) argument 699 operator <(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) argument 706 operator !=(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) argument 713 operator >(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) argument 720 operator <=(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) argument 727 operator >=(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) argument 734 swap(map<_Key, _Tp, _Compare, _Alloc>& __x, map<_Key, _Tp, _Compare, _Alloc>& __y) argument [all...] |
H A D | stl_tree.h | 301 const _Rb_tree_const_iterator<_Val>& __y) 302 { return __x._M_node == __y._M_node; } 307 const _Rb_tree_const_iterator<_Val>& __y) 308 { return __x._M_node != __y._M_node; } 551 _M_insert(_Base_ptr __x, _Base_ptr __y, const value_type& __v); 556 _M_insert_lower(_Base_ptr __x, _Base_ptr __y, const value_type& __v); 559 _M_insert(_Const_Base_ptr __x, _Const_Base_ptr __y, 757 const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) 759 return __x.size() == __y.size() 760 && std::equal(__x.begin(), __x.end(), __y 300 operator ==(const _Rb_tree_iterator<_Val>& __x, const _Rb_tree_const_iterator<_Val>& __y) argument 306 operator !=(const _Rb_tree_iterator<_Val>& __x, const _Rb_tree_const_iterator<_Val>& __y) argument 756 operator ==(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument 766 operator <(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument 776 operator !=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument 783 operator >(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument 790 operator <=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument 797 operator >=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument 804 swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument 892 _Link_type __y = _M_end(); local 909 _Link_type __y = _M_end(); local 977 _Link_type __y = _M_end(); local 1246 _Link_type __y = local 1260 _Link_type __y = local 1299 _Link_type __y = _M_clone_node(__x); local 1326 _Link_type __y = _S_left(__x); local 1375 _Link_type __y = _M_end(); // Last node which is not less than __k. local 1396 _Const_Link_type __y = _M_end(); // Last node which is not less than __k. local 1429 _Link_type __y = _M_end(); // Last node which is not less than __k. local 1447 _Const_Link_type __y = _M_end(); // Last node which is not less than __k. local 1465 _Link_type __y = _M_end(); // Last node which is greater than __k. local 1483 _Const_Link_type __y = _M_end(); // Last node which is greater than __k. local [all...] |
H A D | stl_list.h | 81 swap(_List_node_base& __x, _List_node_base& __y); 266 const _List_const_iterator<_Val>& __y) 267 { return __x._M_node == __y._M_node; } 272 const _List_const_iterator<_Val>& __y) 273 { return __x._M_node != __y._M_node; } 1196 operator==(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) argument 1200 const_iterator __end2 = __y.end(); 1203 const_iterator __i2 = __y.begin(); 1225 operator<(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) argument 1227 __y 265 operator ==(const _List_iterator<_Val>& __x, const _List_const_iterator<_Val>& __y) argument 271 operator !=(const _List_iterator<_Val>& __x, const _List_const_iterator<_Val>& __y) argument 1232 operator !=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) argument 1238 operator >(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) argument 1244 operator <=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) argument 1250 operator >=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) argument 1256 swap(list<_Tp, _Alloc>& __x, list<_Tp, _Alloc>& __y) argument [all...] |
H A D | stl_vector.h | 942 operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument 943 { return (__x.size() == __y.size() 944 && std::equal(__x.begin(), __x.end(), __y.begin())); } 959 operator<(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument 961 __y.begin(), __y.end()); } 966 operator!=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument 967 { return !(__x == __y); } 972 operator>(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument 973 { return __y < __ 978 operator <=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument 984 operator >=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument 990 swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y) argument [all...] |
H A D | stream_iterator.h | 129 const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) 130 { return __x._M_equal(__y); } 136 const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) 137 { return !__x._M_equal(__y); } 128 operator ==(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x, const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) argument 135 operator !=(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x, const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) argument
|
H A D | stl_bvector.h | 75 _Bit_reference(_Bit_type * __x, _Bit_type __y) argument 76 : _M_p(__x), _M_mask(__y) { } 116 _Bit_iterator_base(_Bit_type * __x, unsigned int __y) argument 117 : _M_p(__x), _M_offset(__y) { } 182 operator-(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y) argument 184 return (int(_S_word_bit) * (__x._M_p - __y._M_p) 185 + __x._M_offset - __y._M_offset); 196 _Bit_iterator(_Bit_type * __x, unsigned int __y) argument 197 : _Bit_iterator_base(__x, __y) { } 279 _Bit_const_iterator(_Bit_type * __x, unsigned int __y) argument 696 swap(reference __x, reference __y) argument [all...] |
/macosx-10.10.1/libstdcxx-104.1/src/ |
H A D | tree.cc | 73 _Rb_tree_node_base* __y = __x->_M_parent; local 74 while (__x == __y->_M_right) 76 __x = __y; 77 __y = __y->_M_parent; 79 if (__x->_M_right != __y) 80 __x = __y; 99 _Rb_tree_node_base* __y = __x->_M_left; local 100 while (__y->_M_right != 0) 101 __y 106 _Rb_tree_node_base* __y = __x->_M_parent; local 127 _Rb_tree_node_base* const __y = __x->_M_right; local 148 _Rb_tree_node_base* const __y = __x->_M_left; local 210 _Rb_tree_node_base* const __y = __xpp->_M_right; local 232 _Rb_tree_node_base* const __y = __xpp->_M_left; local 263 _Rb_tree_node_base* __y = __z; local [all...] |
H A D | list.cc | 61 _List_node_base::swap(_List_node_base& __x, _List_node_base& __y) argument 65 if ( __y._M_next != &__y ) 67 // Both __x and __y are not empty. 68 std::swap(__x._M_next,__y._M_next); 69 std::swap(__x._M_prev,__y._M_prev); 71 __y._M_next->_M_prev = __y._M_prev->_M_next = &__y; 75 // __x is not empty, __y i [all...] |
/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/debug/ |
H A D | hash_map.h | 265 const hash_map<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __y) 266 { return __x._M_base() == __y._M_base(); } 272 const hash_map<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __y) 273 { return __x._M_base() != __y._M_base(); } 279 hash_map<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __y) 280 { __x.swap(__y); } 264 operator ==(const hash_map<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __x, const hash_map<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __y) argument 271 operator !=(const hash_map<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __x, const hash_map<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __y) argument 278 swap(hash_map<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __x, hash_map<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __y) argument
|
H A D | hash_multimap.h | 249 const hash_multimap<_Value,_Tp,_HashFcn,_EqualKey,_Alloc>& __y) 250 { return __x._M_base() == __y._M_base(); } 256 const hash_multimap<_Value,_Tp,_HashFcn,_EqualKey,_Alloc>& __y) 257 { return __x._M_base() != __y._M_base(); } 263 hash_multimap<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __y) 264 { __x.swap(__y); } 248 operator ==(const hash_multimap<_Value,_Tp,_HashFcn,_EqualKey,_Alloc>& __x, const hash_multimap<_Value,_Tp,_HashFcn,_EqualKey,_Alloc>& __y) argument 255 operator !=(const hash_multimap<_Value,_Tp,_HashFcn,_EqualKey,_Alloc>& __x, const hash_multimap<_Value,_Tp,_HashFcn,_EqualKey,_Alloc>& __y) argument 262 swap(hash_multimap<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __x, hash_multimap<_Value, _Tp, _HashFcn, _EqualKey, _Alloc>& __y) argument
|
H A D | hash_multiset.h | 226 const hash_multiset<_Value, _HashFcn, _EqualKey, _Alloc>& __y) 227 { return __x._M_base() == __y._M_base(); } 232 const hash_multiset<_Value, _HashFcn, _EqualKey, _Alloc>& __y) 233 { return __x._M_base() != __y._M_base(); } 238 hash_multiset<_Value, _HashFcn, _EqualKey, _Alloc>& __y) 239 { __x.swap(__y); } 225 operator ==(const hash_multiset<_Value, _HashFcn, _EqualKey, _Alloc>& __x, const hash_multiset<_Value, _HashFcn, _EqualKey, _Alloc>& __y) argument 231 operator !=(const hash_multiset<_Value, _HashFcn, _EqualKey, _Alloc>& __x, const hash_multiset<_Value, _HashFcn, _EqualKey, _Alloc>& __y) argument 237 swap(hash_multiset<_Value, _HashFcn, _EqualKey, _Alloc>& __x, hash_multiset<_Value, _HashFcn, _EqualKey, _Alloc>& __y) argument
|
H A D | hash_set.h | 240 const hash_set<_Value, _HashFcn, _EqualKey, _Alloc>& __y) 241 { return __x._M_base() == __y._M_base(); } 247 const hash_set<_Value, _HashFcn, _EqualKey, _Alloc>& __y) 248 { return __x._M_base() != __y._M_base(); } 254 hash_set<_Value, _HashFcn, _EqualKey, _Alloc>& __y) 255 { __x.swap(__y); } 239 operator ==(const hash_set<_Value, _HashFcn, _EqualKey, _Alloc>& __x, const hash_set<_Value, _HashFcn, _EqualKey, _Alloc>& __y) argument 246 operator !=(const hash_set<_Value, _HashFcn, _EqualKey, _Alloc>& __x, const hash_set<_Value, _HashFcn, _EqualKey, _Alloc>& __y) argument 253 swap(hash_set<_Value, _HashFcn, _EqualKey, _Alloc>& __x, hash_set<_Value, _HashFcn, _EqualKey, _Alloc>& __y) argument
|
H A D | multiset.h | 322 multiset<_Key,_Compare,_Allocator>& __y) 323 { return __x.swap(__y); } 321 swap(multiset<_Key,_Compare,_Allocator>& __x, multiset<_Key,_Compare,_Allocator>& __y) argument
|
/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/tr1/ |
H A D | hashtable_policy.h | 78 operator()(_Tp __x, _Up __y) argument 79 { return __x < __y; } 213 const _Node_iterator_base<_Value, __cache>& __y) 214 { return __x._M_cur == __y._M_cur; } 219 const _Node_iterator_base<_Value, __cache>& __y) 220 { return __x._M_cur != __y._M_cur; } 354 const _Hashtable_iterator_base<_Value, __cache>& __y) 355 { return __x._M_cur_node == __y._M_cur_node; } 360 const _Hashtable_iterator_base<_Value, __cache>& __y) 361 { return __x._M_cur_node != __y 212 operator ==(const _Node_iterator_base<_Value, __cache>& __x, const _Node_iterator_base<_Value, __cache>& __y) argument 218 operator !=(const _Node_iterator_base<_Value, __cache>& __x, const _Node_iterator_base<_Value, __cache>& __y) argument 353 operator ==(const _Hashtable_iterator_base<_Value, __cache>& __x, const _Hashtable_iterator_base<_Value, __cache>& __y) argument 359 operator !=(const _Hashtable_iterator_base<_Value, __cache>& __x, const _Hashtable_iterator_base<_Value, __cache>& __y) argument [all...] |