Searched refs:__x (Results 1 - 25 of 87) sorted by path

1234

/freebsd-11-stable/contrib/gcc/
H A Dlonglong.h295 } __x; \
297 : "=&r" (__x.__ll) \
299 (xh) = __x.__i.__h; (xl) = __x.__i.__l; \
305 } __x; \
306 __x.__i.__h = n1; __x.__i.__l = n0; \
308 : "=r" (__x.__ll) \
309 : "0" (__x.__ll), "r" (d)); \
310 (q) = __x
[all...]
/freebsd-11-stable/contrib/libc-vis/
H A Dunvis.c56 * __x.
58 #define __arraycount(__x) (sizeof(__x) / sizeof(__x[0]))
/freebsd-11-stable/contrib/libstdc++/config/os/newlib/
H A Dctype_noninline.h71 int __x = __c; local
72 return (this->is(ctype_base::lower, __c) ? (__x - 'a' + 'A') : __x);
89 int __x = __c; local
90 return (this->is(ctype_base::upper, __c) ? (__x - 'A' + 'a') : __x);
/freebsd-11-stable/contrib/libstdc++/include/backward/
H A Ddefalloc.h98 pointer address(reference __x) { return (pointer)&__x; } argument
99 const_pointer const_address(const_reference __x) { argument
100 return (const_pointer)&__x;
/freebsd-11-stable/contrib/libstdc++/include/bits/
H A Dbasic_string.h394 _S_compare(size_type __x, size_type __y) argument
396 if (__x > __y)
398 if (__x < __y)
H A Dboost_concept_check.h63 void (_Concept::*__x)() _IsUnused = &_Concept::__constraints;
224 _To __y _IsUnused = __x;
226 _From __x; member in struct:_ConvertibleConcept
240 bool __x _IsUnused = __t;
H A Dstl_bvector.h75 _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
509 vector(const vector& __x) argument
528 operator =(const vector& __x) argument
547 assign(size_type __n, const bool& __x) argument
684 push_back(bool __x) argument
689 _M_insert_aux(end(), __x); local
693 swap(vector& __x) argument
708 swap(reference __x, reference __y) argument
737 insert(iterator __position, size_type __n, const bool& __x) argument
766 insert(end(), __new_size - size(), __x); local
807 _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) argument
852 _M_fill_assign(size_t __n, bool __x) argument
858 insert(end(), __n - size(), __x); local
902 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, __true_type) argument
915 _M_fill_insert(iterator __position, size_type __n, bool __x) argument
990 _M_insert_aux(iterator __position, bool __x) argument
[all...]
H A Dstl_deque.h124 _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
718 deque(const deque& __x) argument
1044 push_front(const value_type& __x) argument
1065 push_back(const value_type& __x) argument
1141 insert(iterator __position, size_type __n, const value_type& __x) argument
1209 swap(deque& __x) argument
1238 _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) argument
1381 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, __true_type) argument
1561 operator ==(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1579 operator <(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1587 operator !=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1594 operator >(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1601 operator <=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1608 operator >=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1615 swap(deque<_Tp,_Alloc>& __x, deque<_Tp,_Alloc>& __y) argument
[all...]
H A Dstl_function.h137 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 Dstl_iterator.h124 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 Dstl_list.h81 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
458 _M_create_node(const value_type& __x) argument
506 list(const list& __x) argument
744 push_front(const value_type& __x) argument
745 { this->_M_insert(begin(), __x); } local
774 push_back(const value_type& __x) argument
775 { this->_M_insert(end(), __x); } local
819 insert(iterator __position, size_type __n, const value_type& __x) argument
901 swap(list& __x) argument
937 splice(iterator __position, list& __x) argument
957 splice(iterator __position, list& __x, iterator __i) argument
983 splice(iterator __position, list& __x, iterator __first, iterator __last) argument
1114 _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) argument
1133 _M_fill_initialize(size_type __n, const value_type& __x) argument
1170 _M_insert(iterator __position, const value_type& __x) argument
1188 _M_check_equal_allocators(list& __x) argument
1207 operator ==(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) argument
1236 operator <(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) argument
1243 operator !=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) argument
1249 operator >(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) argument
1255 operator <=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) argument
1261 operator >=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) argument
1267 swap(list<_Tp, _Alloc>& __x, list<_Tp, _Alloc>& __y) argument
[all...]
H A Dstl_map.h122 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 Dstl_multimap.h121 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 Dstl_multiset.h183 multiset(const multiset& __x) argument
184 : _M_t(__x._M_t) { }
194 operator=(const multiset& __x) argument
196 _M_t = __x._M_t;
278 swap(multiset& __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 Dstl_pair.h96 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 Dstl_queue.h203 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 Dstl_raw_storage_iter.h79 raw_storage_iterator(_ForwardIterator __x) argument
80 : _M_iter(__x) {}
H A Dstl_relops.h92 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 Dstl_set.h193 set(const set& __x) argument
194 : _M_t(__x._M_t) { }
204 operator=(const set& __x) argument
206 _M_t = __x._M_t;
286 swap(set& __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 Dstl_stack.h178 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 Dstl_tree.h106 _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
513 _S_value(_Const_Link_type __x) argument
517 _S_key(_Const_Link_type __x) argument
521 _S_left(_Base_ptr __x) argument
525 _S_left(_Const_Base_ptr __x) argument
529 _S_right(_Base_ptr __x) argument
533 _S_right(_Const_Base_ptr __x) argument
537 _S_value(_Const_Base_ptr __x) argument
541 _S_key(_Const_Base_ptr __x) argument
545 _S_minimum(_Base_ptr __x) argument
549 _S_minimum(_Const_Base_ptr __x) argument
553 _S_maximum(_Base_ptr __x) argument
557 _S_maximum(_Const_Base_ptr __x) argument
596 _Rb_tree(const _Rb_tree& __x) argument
771 operator ==(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument
781 operator <(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument
791 operator !=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument
798 operator >(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument
805 operator <=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument
812 operator >=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument
819 swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) argument
827 operator =(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x) argument
849 _M_insert(_Base_ptr __x, _Base_ptr __p, const _Val& __v) argument
867 _M_insert_lower(_Base_ptr __x, _Base_ptr __p, const _Val& __v) argument
885 _M_insert(_Const_Base_ptr __x, _Const_Base_ptr __p, const _Val& __v) argument
906 _Link_type __x = _M_begin(); local
923 _Link_type __x = _M_begin(); local
991 _Link_type __x = _M_begin(); local
1289 erase(const _Key& __x) argument
1301 _M_copy(_Const_Link_type __x, _Link_type __p) argument
1337 _M_erase(_Link_type __x) argument
1391 _Link_type __x = _M_begin(); // Current node. local
1412 _Const_Link_type __x = _M_begin(); // Current node. local
1445 _Link_type __x = _M_begin(); // Current node. local
1463 _Const_Link_type __x = _M_begin(); // Current node. local
1481 _Link_type __x = _M_begin(); // Current node. local
1499 _Const_Link_type __x = _M_begin(); // Current node. local
1549 _Const_Link_type __x = static_cast<_Const_Link_type>(__it._M_node); local
[all...]
H A Dstl_uninitialized.h138 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 Dstl_vector.h242 vector(const vector& __x) argument
243 : _Base(__x.size(), __x._M_get_Tp_allocator())
245 std::__uninitialized_copy_a(__x.begin(), __x.end(),
294 operator=(const vector& __x);
430 resize(size_type __new_size, value_type __x = value_type())
435 insert(end(), __new_size - size(), __x); local
611 push_back(const value_type& __x) argument
615 this->_M_impl.construct(this->_M_impl._M_finish, __x);
619 _M_insert_aux(end(), __x); local
666 insert(iterator __position, size_type __n, const value_type& __x) argument
742 swap(vector& __x) argument
953 operator ==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument
970 operator <(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument
977 operator !=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument
983 operator >(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument
989 operator <=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument
995 operator >=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument
1001 swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y) argument
[all...]
H A Dstream_iterator.h109 _M_equal(const istream_iterator& __x) const
110 { return (_M_ok == __x._M_ok) && (!_M_ok || _M_stream == __x._M_stream); }
128 operator==(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x, argument
130 { return __x._M_equal(__y); }
135 operator!=(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x, argument
137 { return !__x._M_equal(__y); }
H A Dvalarray_before.h193 _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...]

Completed in 327 milliseconds

1234