/macosx-10.10/libstdcxx-104.1/src/ |
H A D | tree.cc | 63 _Rb_tree_increment(_Rb_tree_node_base* __x) argument 65 if (__x->_M_right != 0) 67 __x = __x->_M_right; 68 while (__x->_M_left != 0) 69 __x = __x->_M_left; 73 _Rb_tree_node_base* __y = __x->_M_parent; 74 while (__x == __y->_M_right) 76 __x 86 _Rb_tree_increment(const _Rb_tree_node_base* __x) argument 92 _Rb_tree_decrement(_Rb_tree_node_base* __x) argument 118 _Rb_tree_decrement(const _Rb_tree_node_base* __x) argument 124 _Rb_tree_rotate_left(_Rb_tree_node_base* const __x, _Rb_tree_node_base*& __root) argument 145 _Rb_tree_rotate_right(_Rb_tree_node_base* const __x, _Rb_tree_node_base*& __root) argument 166 _Rb_tree_insert_and_rebalance(const bool __insert_left, _Rb_tree_node_base* __x, _Rb_tree_node_base* __p, _Rb_tree_node_base& __header) argument 264 _Rb_tree_node_base* __x = 0; local [all...] |
H A D | list.cc | 61 _List_node_base::swap(_List_node_base& __x, _List_node_base& __y) argument 63 if ( __x._M_next != &__x ) 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); 70 __x._M_next->_M_prev = __x._M_prev->_M_next = &__x; 75 // __x i [all...] |
/macosx-10.10/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, cons 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_multimap.h | 121 bool operator()(const value_type& __x, const value_type& __y) const argument 122 { return comp(__x.first, __y.first); } 173 multimap(const multimap& __x) argument 174 : _M_t(__x._M_t) { } 225 operator=(const multimap& __x) argument 227 _M_t = __x._M_t; 339 insert(const value_type& __x) argument 340 { return _M_t._M_insert_equal(__x); } 363 insert(iterator __position, const value_type& __x) argument 364 { return _M_t._M_insert_equal(__position, __x); } 405 erase(const key_type& __x) argument 435 swap(multimap& __x) argument 478 find(const key_type& __x) argument 517 lower_bound(const key_type& __x) argument 542 upper_bound(const key_type& __x) argument 569 equal_range(const key_type& __x) argument 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_multiset.h | 183 multiset(const multiset<_Key,_Compare,_Alloc>& __x) argument 184 : _M_t(__x._M_t) { } 194 operator=(const multiset<_Key,_Compare,_Alloc>& __x) argument 196 _M_t = __x._M_t; 278 swap(multiset<_Key, _Compare, _Alloc>& __x) argument 279 { _M_t.swap(__x._M_t); } 294 insert(const value_type& __x) argument 295 { return _M_t._M_insert_equal(__x); } 318 insert(iterator __position, const value_type& __x) argument 319 { return _M_t._M_insert_equal(__position, __x); } 360 erase(const key_type& __x) argument 414 find(const key_type& __x) argument 435 lower_bound(const key_type& __x) argument 451 upper_bound(const key_type& __x) argument 476 equal_range(const key_type& __x) argument 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 | 193 set(const set<_Key,_Compare,_Alloc>& __x) argument 194 : _M_t(__x._M_t) { } 204 operator=(const set<_Key, _Compare, _Alloc>& __x) argument 206 _M_t = __x._M_t; 286 swap(set<_Key,_Compare,_Alloc>& __x) argument 287 { _M_t.swap(__x._M_t); } 304 insert(const value_type& __x) argument 307 _M_t._M_insert_unique(__x); 331 insert(iterator __position, const value_type& __x) argument 332 { return _M_t._M_insert_unique(__position, __x); } 372 erase(const key_type& __x) argument 429 find(const key_type& __x) argument 450 lower_bound(const key_type& __x) argument 466 upper_bound(const key_type& __x) argument 491 equal_range(const key_type& __x) argument 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_function.h | 137 operator()(const _Tp& __x, const _Tp& __y) const argument 138 { return __x + __y; } 146 operator()(const _Tp& __x, const _Tp& __y) const argument 147 { return __x - __y; } 155 operator()(const _Tp& __x, const _Tp& __y) const argument 156 { return __x * __y; } 164 operator()(const _Tp& __x, const _Tp& __y) const argument 165 { return __x / __y; } 173 operator()(const _Tp& __x, const _Tp& __y) const argument 174 { return __x 199 operator ()(const _Tp& __x, const _Tp& __y) const argument 208 operator ()(const _Tp& __x, const _Tp& __y) const argument 217 operator ()(const _Tp& __x, const _Tp& __y) const argument 226 operator ()(const _Tp& __x, const _Tp& __y) const argument 235 operator ()(const _Tp& __x, const _Tp& __y) const argument 244 operator ()(const _Tp& __x, const _Tp& __y) const argument 260 operator ()(const _Tp& __x, const _Tp& __y) const argument 269 operator ()(const _Tp& __x, const _Tp& __y) const argument 319 unary_negate(const _Predicate& __x) argument 343 binary_negate(const _Predicate& __x) argument 347 operator ()(const typename _Predicate::first_argument_type& __x, const typename _Predicate::second_argument_type& __y) const argument 400 binder1st(const _Operation& __x, const typename _Operation::first_argument_type& __y) argument 418 bind1st(const _Operation& __fn, const _Tp& __x) argument 434 binder2nd(const _Operation& __x, const typename _Operation::second_argument_type& __y) argument 452 bind2nd(const _Operation& __fn, const _Tp& __x) argument 489 pointer_to_unary_function(_Result (__x)_Arg)) argument 500 ptr_fun(_Result (__x)_Arg)) argument 514 pointer_to_binary_function(_Result (__x)_Arg1, _Arg2)) argument 518 operator ()(_Arg1 __x, _Arg2 __y) const argument 525 ptr_fun(_Result (__x)_Arg1, _Arg2)) argument [all...] |
H A D | stl_tree.h | 106 _S_minimum(_Base_ptr __x) argument 108 while (__x->_M_left != 0) __x = __x->_M_left; 109 return __x; 113 _S_minimum(_Const_Base_ptr __x) argument 115 while (__x->_M_left != 0) __x = __x->_M_left; 116 return __x; 120 _S_maximum(_Base_ptr __x) argument 127 _S_maximum(_Const_Base_ptr __x) argument 171 _Rb_tree_iterator(_Link_type __x) argument 243 _Rb_tree_const_iterator(_Link_type __x) argument 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 376 _M_create_node(const value_type& __x) argument 390 _M_clone_node(_Const_Link_type __x) argument 495 _S_value(_Const_Link_type __x) argument 499 _S_key(_Const_Link_type __x) argument 503 _S_left(_Base_ptr __x) argument 507 _S_left(_Const_Base_ptr __x) argument 511 _S_right(_Base_ptr __x) argument 515 _S_right(_Const_Base_ptr __x) argument 519 _S_value(_Const_Base_ptr __x) argument 523 _S_key(_Const_Base_ptr __x) argument 527 _S_minimum(_Base_ptr __x) argument 531 _S_minimum(_Const_Base_ptr __x) argument 535 _S_maximum(_Base_ptr __x) argument 539 _S_maximum(_Const_Base_ptr __x) argument 581 _Rb_tree(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x) 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 812 operator =(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x) argument 834 _M_insert(_Base_ptr __x, _Base_ptr __p, const _Val& __v) argument 852 _M_insert_lower(_Base_ptr __x, _Base_ptr __p, const _Val& __v) argument 870 _M_insert(_Const_Base_ptr __x, _Const_Base_ptr __p, const _Val& __v) argument 891 _Link_type __x = _M_begin(); local 908 _Link_type __x = _M_begin(); local 976 _Link_type __x = _M_begin(); local 1272 erase(const _Key& __x) argument 1284 _M_copy(_Const_Link_type __x, _Link_type __p) argument 1320 _M_erase(_Link_type __x) argument 1374 _Link_type __x = _M_begin(); // Current node. local 1395 _Const_Link_type __x = _M_begin(); // Current node. local 1428 _Link_type __x = _M_begin(); // Current node. local 1446 _Const_Link_type __x = _M_begin(); // Current node. local 1464 _Link_type __x = _M_begin(); // Current node. local 1482 _Const_Link_type __x = _M_begin(); // Current node. local 1532 _Const_Link_type __x = static_cast<_Const_Link_type>(__it._M_node); local [all...] |
H A D | stl_stack.h | 178 push(const value_type& __x) argument 179 { c.push_back(__x); } 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 256 operator >=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) argument [all...] |
H A D | stl_list.h | 81 swap(_List_node_base& __x, _List_node_base& __y); 127 _List_iterator(_List_node_base* __x) argument 128 : _M_node(__x) { } 170 operator==(const _Self& __x) const 171 { return _M_node == __x._M_node; } 174 operator!=(const _Self& __x) const 175 { return _M_node != __x._M_node; } 205 _List_const_iterator(const _List_node_base* __x) argument 206 : _M_node(__x) { } 208 _List_const_iterator(const iterator& __x) argument 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 450 _M_create_node(const value_type& __x) argument 495 list(const list& __x) argument 733 push_front(const value_type& __x) argument 734 { this->_M_insert(begin(), __x); } local 763 push_back(const value_type& __x) argument 764 { this->_M_insert(end(), __x); } local 808 insert(iterator __position, size_type __n, const value_type& __x) argument 890 swap(list& __x) argument 926 splice(iterator __position, list& __x) argument 946 splice(iterator __position, list& __x, iterator __i) argument 972 splice(iterator __position, list& __x, iterator __first, iterator __last) argument 1103 _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) argument 1122 _M_fill_initialize(size_type __n, const value_type& __x) argument 1159 _M_insert(iterator __position, const value_type& __x) argument 1177 _M_check_equal_allocators(list& __x) argument 1196 operator ==(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) argument 1225 operator <(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __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_map.h | 122 bool operator()(const value_type& __x, const value_type& __y) const argument 123 { return comp(__x.first, __y.first); } 175 map(const map& __x) argument 176 : _M_t(__x._M_t) { } 226 operator=(const map& __x) argument 228 _M_t = __x._M_t; 399 insert(const value_type& __x) argument 400 { return _M_t._M_insert_unique(__x); } 426 insert(iterator __position, const value_type& __x) argument 427 { return _M_t._M_insert_unique(__position, __x); } 468 erase(const key_type& __x) argument 498 swap(map& __x) argument 541 find(const key_type& __x) argument 583 lower_bound(const key_type& __x) argument 608 upper_bound(const key_type& __x) argument 637 equal_range(const key_type& __x) argument 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_queue.h | 203 push(const value_type& __x) argument 204 { c.push_back(__x); } 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 281 operator >=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) argument 413 push(const value_type& __x) argument [all...] |
H A D | stl_bvector.h | 75 _Bit_reference(_Bit_type * __x, _Bit_type __y) argument 76 : _M_p(__x), _M_mask(__y) { } 84 operator=(bool __x) argument 86 if (__x) 94 operator=(const _Bit_reference& __x) argument 95 { return *this = bool(__x); } 98 operator==(const _Bit_reference& __x) const 99 { return bool(*this) == bool(__x); } 102 operator<(const _Bit_reference& __x) const 103 { return !bool(*this) && bool(__x); } 116 _Bit_iterator_base(_Bit_type * __x, unsigned int __y) argument 182 operator -(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y) argument 196 _Bit_iterator(_Bit_type * __x, unsigned int __y) argument 267 operator +(ptrdiff_t __n, const _Bit_iterator& __x) argument 279 _Bit_const_iterator(_Bit_type * __x, unsigned int __y) argument 282 _Bit_const_iterator(const _Bit_iterator& __x) argument 353 operator +(ptrdiff_t __n, const _Bit_const_iterator& __x) argument 357 __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x) argument 364 fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x) argument 370 __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x); local 497 vector(const vector& __x) argument 516 operator =(const vector& __x) argument 535 assign(size_type __n, const bool& __x) argument 672 push_back(bool __x) argument 677 _M_insert_aux(end(), __x); local 681 swap(vector<bool, _Alloc>& __x) argument 696 swap(reference __x, reference __y) argument 725 insert(iterator __position, size_type __n, const bool& __x) argument 754 insert(end(), __new_size - size(), __x); local 795 _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) argument 840 _M_fill_assign(size_t __n, bool __x) argument 846 insert(end(), __n - size(), __x); local 890 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, __true_type) argument 903 _M_fill_insert(iterator __position, size_type __n, bool __x) argument 978 _M_insert_aux(iterator __position, bool __x) argument [all...] |
H A D | stl_iterator.h | 124 reverse_iterator(iterator_type __x) : current(__x) { } argument 129 reverse_iterator(const reverse_iterator& __x) argument 130 : current(__x.current) { } 137 reverse_iterator(const reverse_iterator<_Iter>& __x) argument 138 : current(__x.base()) { } 282 operator==(const reverse_iterator<_Iterator>& __x, argument 284 { return __x.base() == __y.base(); } 288 operator<(const reverse_iterator<_Iterator>& __x, argument 290 { return __y.base() < __x 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 324 operator +(typename reverse_iterator<_Iterator>::difference_type __n, const reverse_iterator<_Iterator>& __x) 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 397 back_insert_iterator(_Container& __x) argument 446 back_inserter(_Container& __x) argument 471 front_insert_iterator(_Container& __x) argument 520 front_inserter(_Container& __x) argument 553 insert_iterator(_Container& __x, typename _Container::iterator __i) argument 616 inserter(_Container& __x, _Iterator __i) argument [all...] |
H A D | stl_uninitialized.h | 138 const _Tp& __x, __true_type) 139 { std::fill(__first, __last, __x); } 144 const _Tp& __x, __false_type) 150 std::_Construct(&*__cur, __x); 171 const _Tp& __x) 175 std::__uninitialized_fill_aux(__first, __last, __x, _Is_POD()); 183 const _Tp& __x, __true_type) 184 { std::fill_n(__first, __n, __x); } 189 const _Tp& __x, __false_type) 195 std::_Construct(&*__cur, __x); 136 __uninitialized_fill_aux(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x, __true_type) argument 143 __uninitialized_fill_aux(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x, __false_type) argument 170 uninitialized_fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x) argument 182 __uninitialized_fill_n_aux(_ForwardIterator __first, _Size __n, const _Tp& __x, __true_type) argument 188 __uninitialized_fill_n_aux(_ForwardIterator __first, _Size __n, const _Tp& __x, __false_type) argument 215 uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x) argument 258 __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x, _Allocator __alloc) argument 276 __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x, allocator<_Tp2>) argument 283 __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, const _Tp& __x, _Allocator __alloc) argument 303 __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, const _Tp& __x, allocator<_Tp2>) argument 348 __uninitialized_fill_copy(_ForwardIterator __result, _ForwardIterator __mid, const _Tp& __x, _InputIterator __first, _InputIterator __last, _Allocator __alloc) argument 371 __uninitialized_copy_fill(_InputIterator __first1, _InputIterator __last1, _ForwardIterator __first2, _ForwardIterator __last2, const _Tp& __x, _Allocator __alloc) argument [all...] |
H A D | stl_raw_storage_iter.h | 79 raw_storage_iterator(_ForwardIterator __x) argument 80 : _M_iter(__x) {}
|
H A D | stl_deque.h | 124 _Deque_iterator(_Tp* __x, _Map_pointer __y) argument 125 : _M_cur(__x), _M_first(*__y), 130 _Deque_iterator(const iterator& __x) argument 131 : _M_cur(__x._M_cur), _M_first(__x._M_first), 132 _M_last(__x._M_last), _M_node(__x._M_node) {} 243 operator==(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, argument 245 { return __x._M_cur == __y._M_cur; } 250 operator==(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, 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 350 operator +(ptrdiff_t __n, const _Deque_iterator<_Tp, _Ref, _Ptr>& __x) argument 706 deque(const deque& __x) argument 1032 push_front(const value_type& __x) argument 1053 push_back(const value_type& __x) argument 1129 insert(iterator __position, size_type __n, const value_type& __x) argument 1197 swap(deque& __x) argument 1226 _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) argument 1369 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, __true_type) 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 | valarray_before.h | 193 _Tp operator()(const _Tp& __x, const _Tp& __y) const argument 194 { return __x + __y; } 200 _Tp operator()(const _Tp& __x, const _Tp& __y) const argument 201 { return __x - __y; } 207 _Tp operator()(const _Tp& __x, const _Tp& __y) const argument 208 { return __x * __y; } 214 _Tp operator()(const _Tp& __x, const _Tp& __y) const argument 215 { return __x / __y; } 221 _Tp operator()(const _Tp& __x, const _Tp& __y) const argument 222 { return __x 228 operator ()(const _Tp& __x, const _Tp& __y) const argument 235 operator ()(const _Tp& __x, const _Tp& __y) const argument 242 operator ()(const _Tp& __x, const _Tp& __y) const argument 249 operator ()(const _Tp& __x, const _Tp& __y) const argument 256 operator ()(const _Tp& __x, const _Tp& __y) const argument 263 operator ()(const _Tp& __x, const _Tp& __y) const argument 270 operator ()(const _Tp& __x, const _Tp& __y) const argument 283 operator ()(const _Tp& __x, const _Tp& __y) const argument 290 operator ()(const _Tp& __x, const _Tp& __y) const argument 297 operator ()(const _Tp& __x, const _Tp& __y) const argument 304 operator ()(const _Tp& __x, const _Tp& __y) const argument 311 operator ()(const _Tp& __x, const _Tp& __y) const argument 318 operator ()(const _Tp& __x, const _Tp& __y) const argument 326 operator ()(const _Tp& __x, const _Tp& __y) const argument 333 operator ()(const _Tp& __x, const _Tp& __y) const argument [all...] |
/macosx-10.10/libstdcxx-104.1/include/c++/4.2.1/ext/ |
H A D | hash_fun.h | 102 operator()(char __x) const 103 { return __x; } 110 operator()(unsigned char __x) const 111 { return __x; } 118 operator()(unsigned char __x) const 119 { return __x; } 126 operator()(short __x) const 127 { return __x; } 134 operator()(unsigned short __x) const 135 { return __x; } [all...] |
/macosx-10.10/libstdcxx-104.1/include/c++/4.2.1/debug/ |
H A D | multiset.h | 89 multiset(const multiset<_Key,_Compare,_Allocator>& __x) argument 90 : _Base(__x), _Safe_base() { } 92 multiset(const _Base& __x) : _Base(__x), _Safe_base() { } argument 97 operator=(const multiset<_Key,_Compare,_Allocator>& __x) argument 99 *static_cast<_Base*>(this) = __x; 146 insert(const value_type& __x) argument 147 { return iterator(_Base::insert(__x), this); } 150 insert(iterator __position, const value_type& __x) argument 153 return iterator(_Base::insert(__position.base(), __x), thi 173 erase(const key_type& __x) argument 198 swap(multiset<_Key,_Compare,_Allocator>& __x) argument 214 find(const key_type& __x) argument 226 lower_bound(const key_type& __x) argument 236 upper_bound(const key_type& __x) argument 246 equal_range(const key_type& __x) argument 321 swap(multiset<_Key,_Compare,_Allocator>& __x, multiset<_Key,_Compare,_Allocator>& __y) argument [all...] |
H A D | set.h | 89 set(const set<_Key,_Compare,_Allocator>& __x) argument 90 : _Base(__x), _Safe_base() { } 92 set(const _Base& __x) : _Base(__x), _Safe_base() { } argument 97 operator=(const set<_Key,_Compare,_Allocator>& __x) argument 99 *static_cast<_Base*>(this) = __x; 146 insert(const value_type& __x) argument 149 std::pair<_Base_iterator, bool> __res = _Base::insert(__x); 155 insert(iterator __position, const value_type& __x) argument 158 return iterator(_Base::insert(__position.base(), __x), thi 178 erase(const key_type& __x) argument 203 swap(set<_Key,_Compare,_Allocator>& __x) argument 219 find(const key_type& __x) argument 231 lower_bound(const key_type& __x) argument 241 upper_bound(const key_type& __x) argument 251 equal_range(const key_type& __x) argument 326 swap(set<_Key,_Compare,_Allocator>& __x, set<_Key,_Compare,_Allocator>& __y) argument [all...] |
H A D | map.h | 91 map(const map<_Key,_Tp,_Compare,_Allocator>& __x) argument 92 : _Base(__x), _Safe_base() { } 94 map(const _Base& __x) : _Base(__x), _Safe_base() { } argument 99 operator=(const map<_Key,_Tp,_Compare,_Allocator>& __x) argument 101 *static_cast<_Base*>(this) = __x; 157 insert(const value_type& __x) argument 160 std::pair<_Base_iterator, bool> __res = _Base::insert(__x); 166 insert(iterator __position, const value_type& __x) argument 169 return iterator(_Base::insert(__position.base(), __x), thi 189 erase(const key_type& __x) argument 213 swap(map<_Key,_Tp,_Compare,_Allocator>& __x) argument 229 find(const key_type& __x) argument 239 lower_bound(const key_type& __x) argument 247 upper_bound(const key_type& __x) argument 255 equal_range(const key_type& __x) argument [all...] |
H A D | multimap.h | 91 multimap(const multimap<_Key,_Tp,_Compare,_Allocator>& __x) argument 92 : _Base(__x), _Safe_base() { } 94 multimap(const _Base& __x) : _Base(__x), _Safe_base() { } argument 99 operator=(const multimap<_Key,_Tp,_Compare,_Allocator>& __x) argument 101 *static_cast<_Base*>(this) = __x; 148 insert(const value_type& __x) argument 149 { return iterator(_Base::insert(__x), this); } 152 insert(iterator __position, const value_type& __x) argument 155 return iterator(_Base::insert(__position.base(), __x), thi 175 erase(const key_type& __x) argument 200 swap(multimap<_Key,_Tp,_Compare,_Allocator>& __x) argument 216 find(const key_type& __x) argument 226 lower_bound(const key_type& __x) argument 234 upper_bound(const key_type& __x) argument 242 equal_range(const key_type& __x) argument [all...] |
/macosx-10.10/libstdcxx-104.1/include/c++/4.2.1/backward/ |
H A D | defalloc.h | 98 pointer address(reference __x) { return (pointer)&__x; } argument 99 const_pointer const_address(const_reference __x) { argument 100 return (const_pointer)&__x;
|