/haiku/headers/cpp/ |
H A D | stl_relops.h | 37 inline bool operator!=(const _Tp& __x, const _Tp& __y) { argument 42 inline bool operator>(const _Tp& __x, const _Tp& __y) { argument 47 inline bool operator<=(const _Tp& __x, const _Tp& __y) { argument 52 inline bool operator>=(const _Tp& __x, const _Tp& __y) { argument
|
H A D | stl_pair.h | 53 inline bool operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument 59 inline bool operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument 66 inline pair<_T1, _T2> make_pair(const _T1& __x, const _T2& __y) argument
|
H A D | stl_raw_storage_iter.h | 47 explicit raw_storage_iterator(_ForwardIterator __x) : _M_iter(__x) {} argument
|
H A D | stl_numeric.h | 180 _Tp __power(_Tp __x, _Integer __n, _MonoidOperation __oper) argument 203 __power(_Tp __x, _Integer __n) argument 212 power(_Tp __x, _Integer __n, _MonoidOperation __oper) argument 218 power(_Tp __x, _Integer __n) argument [all...] |
H A D | stl_stack.h | 61 void push(const value_type& __x) { _M_c.push_back(__x); } argument 66 bool operator==(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y) argument 72 bool operator<(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y) argument 80 bool operator!=(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y) argument 86 bool operator>(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y) argument 92 operator <=(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y) argument 98 operator >=(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y) argument [all...] |
H A D | stl_queue.h | 63 void push(const value_type& __x) { c.push_back(__x); } argument 69 operator==(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) argument 76 operator<(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) argument 85 operator!=(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) argument 92 operator>(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) argument 99 operator <=(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) argument 106 operator >=(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) argument 132 priority_queue(const _Compare& __x) argument 133 priority_queue(const _Compare& __x, const _Sequence& __s) argument 143 priority_queue(_InputIterator __first, _InputIterator __last, const _Compare& __x) argument 149 priority_queue(_InputIterator __first, _InputIterator __last, const _Compare& __x, const _Sequence& __s) argument 161 priority_queue(const value_type* __first, const value_type* __last, const _Compare& __x) argument 166 priority_queue(const value_type* __first, const value_type* __last, const _Compare& __x, const _Sequence& __c) argument 178 push(const value_type& __x) argument [all...] |
H A D | stl_uninitialized.h | 145 __uninitialized_fill_aux(_ForwardIter __first, _ForwardIter __last, const _Tp& __x, __true_type) argument 153 __uninitialized_fill_aux(_ForwardIter __first, _ForwardIter __last, const _Tp& __x, __false_type) argument 165 __uninitialized_fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __x, _Tp1*) argument 174 uninitialized_fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __x) argument 185 __uninitialized_fill_n_aux(_ForwardIter __first, _Size __n, const _Tp& __x, __true_type) argument 193 __uninitialized_fill_n_aux(_ForwardIter __first, _Size __n, const _Tp& __x, __false_type) argument 207 __uninitialized_fill_n(_ForwardIter __first, _Size __n, const _Tp& __x, _Tp1*) argument 215 uninitialized_fill_n(_ForwardIter __first, _Size __n, const _Tp& __x) argument 246 __uninitialized_fill_copy(_ForwardIter __result, _ForwardIter __mid, const _Tp& __x, _InputIter __first, _InputIter __last) argument 262 __uninitialized_copy_fill(_InputIter __first1, _InputIter __last1, _ForwardIter __first2, _ForwardIter __last2, const _Tp& __x) argument [all...] |
H A D | stl_map.h | 66 bool operator()(const value_type& __x, const value_type& __y) const { argument 125 map(const map<_Key,_Tp,_Compare,_Alloc>& __x) : _M_t(__x._M_t) {} argument 127 operator=(const map<_Key, _Tp, _Compare, _Alloc>& __x) argument 157 void swap(map<_Key,_Tp,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); } argument 161 pair<iterator,bool> insert(const value_type& __x) argument 163 insert(iterator position, const value_type& __x) argument 180 erase(const key_type& __x) argument 187 find(const key_type& __x) argument 190 lower_bound(const key_type& __x) argument 194 upper_bound(const key_type& __x) argument 199 equal_range(const key_type& __x) argument 210 operator ==(const map<_Key,_Tp,_Compare,_Alloc>& __x, const map<_Key,_Tp,_Compare,_Alloc>& __y) argument 216 operator <(const map<_Key,_Tp,_Compare,_Alloc>& __x, const map<_Key,_Tp,_Compare,_Alloc>& __y) argument 224 swap(map<_Key,_Tp,_Compare,_Alloc>& __x, map<_Key,_Tp,_Compare,_Alloc>& __y) argument [all...] |
H A D | stl_multimap.h | 65 bool operator()(const value_type& __x, const value_type& __y) const { argument 123 multimap(const multimap<_Key,_Tp,_Compare,_Alloc>& __x) : _M_t(__x._M_t) { } argument 125 operator=(const multimap<_Key,_Tp,_Compare,_Alloc>& __x) { argument 147 void swap(multimap<_Key,_Tp,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); } argument 151 iterator insert(const value_type& __x) { return _M_t.insert_equal(__x); } argument 152 insert(iterator __position, const value_type& __x) argument 169 erase(const key_type& __x) argument 176 find(const key_type& __x) argument 179 lower_bound(const key_type& __x) argument 183 upper_bound(const key_type& __x) argument 187 equal_range(const key_type& __x) argument 200 operator ==(const multimap<_Key,_Tp,_Compare,_Alloc>& __x, const multimap<_Key,_Tp,_Compare,_Alloc>& __y) argument 206 operator <(const multimap<_Key,_Tp,_Compare,_Alloc>& __x, const multimap<_Key,_Tp,_Compare,_Alloc>& __y) argument 214 swap(multimap<_Key,_Tp,_Compare,_Alloc>& __x, multimap<_Key,_Tp,_Compare,_Alloc>& __y) argument [all...] |
H A D | stl_multiset.h | 115 multiset(const multiset<_Key,_Compare,_Alloc>& __x) : _M_t(__x._M_t) {} argument 117 operator=(const multiset<_Key,_Compare,_Alloc>& __x) { argument 135 void swap(multiset<_Key,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); } argument 138 iterator insert(const value_type& __x) { argument 141 iterator insert(iterator __position, const value_type& __x) { argument 163 erase(const key_type& __x) argument 192 operator ==(const multiset<_Key,_Compare,_Alloc>& __x, const multiset<_Key,_Compare,_Alloc>& __y) argument 198 operator <(const multiset<_Key,_Compare,_Alloc>& __x, const multiset<_Key,_Compare,_Alloc>& __y) argument 206 swap(multiset<_Key,_Compare,_Alloc>& __x, multiset<_Key,_Compare,_Alloc>& __y) argument [all...] |
H A D | stl_set.h | 109 set(const set<_Key,_Compare,_Alloc>& __x) : _M_t(__x._M_t) {} argument 110 set<_Key,_Compare,_Alloc>& operator=(const set<_Key, _Compare, _Alloc>& __x) argument 129 void swap(set<_Key,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); } argument 132 pair<iterator,bool> insert(const value_type& __x) { argument 136 iterator insert(iterator __position, const value_type& __x) { argument 157 erase(const key_type& __x) argument 184 operator ==(const set<_Key,_Compare,_Alloc>& __x, const set<_Key,_Compare,_Alloc>& __y) argument 190 operator <(const set<_Key,_Compare,_Alloc>& __x, const set<_Key,_Compare,_Alloc>& __y) argument 198 swap(set<_Key,_Compare,_Alloc>& __x, set<_Key,_Compare,_Alloc>& __y) argument [all...] |
H A D | stl_iterator.h | 358 explicit back_insert_iterator(_Container& __x) : container(&__x) {} argument 381 inline back_insert_iterator<_Container> back_inserter(_Container& __x) { argument 397 explicit front_insert_iterator(_Container& __x) : container(&__x) {} argument 420 inline front_insert_iterator<_Container> front_inserter(_Container& __x) { argument 437 insert_iterator(_Container& __x, typename _Container::iterator __i) argument 463 inserter(_Container& __x, _Iterator __i) argument 489 reverse_bidirectional_iterator(_BidirectionalIterator __x) argument 554 operator ==( const reverse_bidirectional_iterator<_BiIter, _Tp, _Ref, _Distance>& __x, const reverse_bidirectional_iterator<_BiIter, _Tp, _Ref, _Distance>& __y) argument 591 reverse_iterator(iterator_type __x) argument 593 reverse_iterator(const _Self& __x) argument 596 reverse_iterator(const reverse_iterator<_Iter>& __x) argument 646 operator ==(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument 652 operator <(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument 659 operator -(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument 666 operator +(typename reverse_iterator<_Iterator>::difference_type __n, const reverse_iterator<_Iterator>& __x) argument 696 reverse_iterator(_RandomAccessIterator __x) argument 767 operator ==(const reverse_iterator<_RandomAccessIterator, _Tp, _Reference, _Distance>& __x, const reverse_iterator<_RandomAccessIterator, _Tp, _Reference, _Distance>& __y) argument 778 operator <(const reverse_iterator<_RandomAccessIterator, _Tp, _Reference, _Distance>& __x, const reverse_iterator<_RandomAccessIterator, _Tp, _Reference, _Distance>& __y) argument 789 operator -(const reverse_iterator<_RandomAccessIterator, _Tp, _Reference, _Distance>& __x, const reverse_iterator<_RandomAccessIterator, _Tp, _Reference, _Distance>& __y) argument 799 operator +(_Dist __n, const reverse_iterator<_RandAccIter, _Tp, _Ref, _Dist>& __x) argument 867 operator ==(const istream_iterator<_Tp, _Distance>& __x, const istream_iterator<_Tp, _Distance>& __y) argument [all...] |
H A D | stl_bvector.h | 46 _Bit_reference(unsigned int* __x, unsigned int __y) argument 52 _Bit_reference& operator=(bool __x) argument 58 _Bit_reference& operator=(const _Bit_reference& __x) argument 68 swap(_Bit_reference __x, _Bit_reference __y) argument 96 _Bit_iterator(unsigned int* __x, unsigned int __y) argument 179 _Bit_const_iterator(unsigned int* __x, unsigned int __y) argument 181 _Bit_const_iterator(const _Bit_iterator& __x) argument 420 _M_insert_aux(iterator __position, bool __x) argument 541 __BVECTOR(const __BVECTOR& __x) argument 558 _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) argument 591 operator =(const __BVECTOR& __x) argument 607 assign(size_t __n, bool __x) argument 610 insert(end(), __n - size(), __x); local 677 push_back(bool __x) argument 681 _M_insert_aux(end(), __x); local 683 swap(__BVECTOR& __x) argument 707 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, __true_type) argument 763 insert(iterator __position, size_type __n, bool __x) argument 797 insert(end(), __new_size - size(), __x); local 809 operator ==(const bit_vector& __x, const bit_vector& __y) argument 816 operator <(const bit_vector& __x, const bit_vector& __y) argument [all...] |
H A D | stl_function.h | 51 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x + __y; } argument 56 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x - __y; } argument 61 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x * __y; } argument 66 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x / __y; } argument 81 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x argument 93 operator ()(const _Tp& __x, const _Tp& __y) const argument 99 operator ()(const _Tp& __x, const _Tp& __y) const argument 105 operator ()(const _Tp& __x, const _Tp& __y) const argument 111 operator ()(const _Tp& __x, const _Tp& __y) const argument 117 operator ()(const _Tp& __x, const _Tp& __y) const argument 123 operator ()(const _Tp& __x, const _Tp& __y) const argument 129 operator ()(const _Tp& __x, const _Tp& __y) const argument 135 operator ()(const _Tp& __x, const _Tp& __y) const argument 150 unary_negate(const _Predicate& __x) argument 171 binary_negate(const _Predicate& __x) argument 172 operator ()(const typename _Predicate::first_argument_type& __x, const typename _Predicate::second_argument_type& __y) const argument 194 binder1st(const _Operation& __x, const typename _Operation::first_argument_type& __y) argument 205 bind1st(const _Operation& __oper, const _Tp& __x) argument 219 binder2nd(const _Operation& __x, const typename _Operation::second_argument_type& __y) argument 230 bind2nd(const _Operation& __oper, const _Tp& __x) argument 247 unary_compose(const _Operation1& __x, const _Operation2& __y) argument 271 binary_compose(const _Operation1& __x, const _Operation2& __y, const _Operation3& __z) argument 295 pointer_to_unary_function(_Result (__x)_Arg)) argument 300 ptr_fun(_Result (__x)_Arg)) argument 312 pointer_to_binary_function(_Result (__x)_Arg1, _Arg2)) argument 314 operator ()(_Arg1 __x, _Arg2 __y) const argument 321 ptr_fun(_Result (__x)_Arg1, _Arg2)) argument 355 operator ()(const _Arg1& __x, const _Arg2&) const argument [all...] |
H A D | stl_list.h | 65 _List_iterator(_Node* __x) : _M_node(__x) {} argument 67 _List_iterator(const iterator& __x) : _M_node(__x._M_node) {} argument 289 _Node* _M_create_node(const _Tp& __x) argument 341 swap(list<_Tp, _Alloc>& __x) argument 343 insert(iterator __position, const _Tp& __x) argument 356 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, __true_type) argument 379 void push_front(const _Tp& __x) { insert(begin(), __x); } local 381 void push_back(const _Tp& __x) { insert(end(), __x); } local 434 list(const list<_Tp, _Alloc>& __x) argument 484 splice(iterator __position, list& __x) argument 516 operator ==(const list<_Tp,_Alloc>& __x, const list<_Tp,_Alloc>& __y) argument 532 operator <(const list<_Tp,_Alloc>& __x, const list<_Tp,_Alloc>& __y) argument 543 swap(list<_Tp, _Alloc>& __x, list<_Tp, _Alloc>& __y) argument 586 insert(iterator __position, size_type __n, const _Tp& __x) argument 602 resize(size_type __new_size, const _Tp& __x) argument 611 insert(end(), __new_size - __len, __x); local 615 operator =(const list<_Tp, _Alloc>& __x) argument 692 merge(list<_Tp, _Alloc>& __x) argument 783 merge(list<_Tp, _Alloc>& __x, _StrictWeakOrdering __comp) argument [all...] |
H A D | stl_vector.h | 247 vector(const vector<_Tp, _Alloc>& __x) argument 333 void push_back(const _Tp& __x) { argument 339 _M_insert_aux(end(), __x); local 349 swap(vector<_Tp, _Alloc>& __x) argument 355 insert(iterator __position, const _Tp& __x) argument 420 resize(size_type __new_size, const _Tp& __x) argument 424 insert(end(), __new_size - size(), __x); local 493 operator ==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument 501 operator <(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument 510 swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y) argument 519 operator =(const vector<_Tp, _Alloc>& __x) argument 602 _M_insert_aux(iterator __position, const _Tp& __x) argument 664 insert(iterator __position, size_type __n, const _Tp& __x) argument [all...] |
H A D | ropeimpl.h | 32 _S_setbuf( _Rope_iterator_base<_CharT,_Alloc>& __x) argument 78 _S_setcache(_Rope_iterator_base<_CharT,_Alloc>& __x) argument 152 _S_setcache_for_incr(_Rope_iterator_base<_CharT,_Alloc>& __x) argument 257 _Rope_const_iterator( const _Rope_iterator<_CharT,_Alloc>& __x) argument [all...] |
H A D | stl_deque.h | 128 _Deque_iterator(_Tp* __x, _Map_pointer __y) argument 132 _Deque_iterator(const iterator& __x) argument 568 deque(const deque& __x) argument 587 _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) argument 613 operator =(const deque& __x) argument 627 swap(deque& __x) argument 751 insert(iterator position, const value_type& __x) argument 782 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, __true_type) argument 803 resize(size_type __new_size, const value_type& __x) argument 966 insert(iterator __pos, size_type __n, const value_type& __x) argument 1280 _M_insert_aux(iterator __pos, const value_type& __x) argument 1340 _M_insert_aux(iterator __pos, size_type __n, const value_type& __x) argument 1658 operator ==(const deque<_Tp, _Alloc, __bufsiz>& __x, const deque<_Tp, _Alloc, __bufsiz>& __y) argument 1666 operator <(const deque<_Tp, _Alloc, __bufsiz>& __x, const deque<_Tp, _Alloc, __bufsiz>& __y) argument 1680 swap(deque<_Tp,_Alloc,__bufsiz>& __x, deque<_Tp,_Alloc,__bufsiz>& __y) argument [all...] |
H A D | stl_slist.h | 111 _Slist_iterator_base(_Slist_node_base* __x) : _M_node(__x) {} argument 134 _Slist_iterator(_Node* __x) : _Slist_iterator_base(__x) {} argument 136 _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x argument 324 _M_create_node(const value_type& __x) argument 355 slist(size_type __n, const value_type& __x, const allocator_type& __a = allocator_type()) argument 379 slist(const slist& __x) argument 427 swap(slist& __x) argument 438 push_front(const value_type& __x) argument 457 _M_insert_after(_Node_base* __pos, const value_type& __x) argument 465 _M_insert_after_fill(_Node_base* __pos, size_type __n, const value_type& __x) argument 482 _M_insert_after_range(_Node_base* __pos, _Integer __n, _Integer __x, __true_type) argument 519 insert_after(iterator __pos, const value_type& __x) argument 527 insert_after(iterator __pos, size_type __n, const value_type& __x) argument 553 insert(iterator __pos, const value_type& __x) argument 563 insert(iterator __pos, size_type __n, const value_type& __x) argument 564 _M_insert_after_fill(__slist_previous(&_M_head, __pos._M_node), __n, __x); local 635 splice(iterator __pos, slist& __x) argument 642 splice(iterator __pos, slist& __x, iterator __i) argument 650 splice(iterator __pos, slist& __x, iterator __first, iterator __last) argument 685 operator =(const slist<_Tp,_Alloc>& __x) argument 769 swap(slist<_Tp,_Alloc>& __x, slist<_Tp,_Alloc>& __y) argument 777 resize(size_type __len, const _Tp& __x) argument 818 merge(slist<_Tp,_Alloc>& __x) argument 890 merge(slist<_Tp,_Alloc>& __x, _StrictWeakOrdering __comp) argument [all...] |
H A D | stl_tree.h | 81 static _Base_ptr _S_minimum(_Base_ptr __x) argument 87 static _Base_ptr _S_maximum(_Base_ptr __x) argument 164 _Rb_tree_iterator(_Link_type __x) argument 187 operator ==(const _Rb_tree_base_iterator& __x, const _Rb_tree_base_iterator& __y) argument 192 operator !=(const _Rb_tree_base_iterator& __x, const _Rb_tree_base_iterator& __y) argument 217 _Rb_tree_rotate_left(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument 236 _Rb_tree_rotate_right(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument 255 _Rb_tree_rebalance(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root) argument 306 _Rb_tree_node_base* __x = 0; local 552 _M_create_node(const value_type& __x) argument 562 _M_clone_node(_Link_type __x) argument 588 _S_left(_Link_type __x) argument 590 _S_right(_Link_type __x) argument 592 _S_parent(_Link_type __x) argument 594 _S_value(_Link_type __x) argument 596 _S_key(_Link_type __x) argument 598 _S_color(_Link_type __x) argument 601 _S_left(_Base_ptr __x) argument 603 _S_right(_Base_ptr __x) argument 605 _S_parent(_Base_ptr __x) argument 607 _S_value(_Base_ptr __x) argument 609 _S_key(_Base_ptr __x) argument 611 _S_color(_Base_ptr __x) argument 614 _S_minimum(_Link_type __x) argument 617 _S_maximum(_Link_type __x) argument 656 _Rb_tree(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x) argument 762 operator ==(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x, const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __y) argument 772 operator <(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x, const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __y) argument 784 swap(_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x, _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __y) argument 797 operator =(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x) argument 825 _Link_type __x = (_Link_type) __x_; local 862 _Link_type __x = _M_root(); local 880 _Link_type __x = _M_root(); local 1040 erase(const _Key& __x) argument 1052 _M_copy(_Link_type __x, _Link_type __p) argument 1082 _M_erase(_Link_type __x) argument 1118 _Link_type __x = _M_root(); // Current node. local 1137 _Link_type __x = _M_root(); /* Current node. */ local 1169 _Link_type __x = _M_root(); /* Current node. */ local 1187 _Link_type __x = _M_root(); /* Current node. */ local 1205 _Link_type __x = _M_root(); /* Current node. */ local 1223 _Link_type __x = _M_root(); /* Current node. */ local 1280 _Link_type __x = (_Link_type) __it._M_node; local [all...] |
H A D | stl_rope.h | 124 sequence_buffer(const sequence_buffer& __x) { argument 129 sequence_buffer(sequence_buffer& __x) { argument 135 sequence_buffer& operator= (sequence_buffer& __x) { argument 141 operator =(const sequence_buffer& __x) argument 147 push_back(value_type __x) argument 179 put(value_type __x) argument 741 operator =(_Rope_RopeRep<_CharT,_Alloc>* __x) argument 770 _Rope_char_ref_proxy(const _Rope_char_ref_proxy& __x) argument 821 _Rope_char_ptr_proxy(const _Rope_char_ref_proxy<_CharT,_Alloc>& __x) argument 823 _Rope_char_ptr_proxy(const _Rope_char_ptr_proxy& __x) argument 826 _Rope_char_ptr_proxy(_CharT* __x) argument 830 operator =(const _Rope_char_ptr_proxy& __x) argument 916 _Rope_iterator_base(const _Rope_iterator_base& __x) argument 946 _Rope_const_iterator(const _Rope_const_iterator& __x) argument 951 operator =(const _Rope_const_iterator& __x) argument 1058 _Rope_iterator(const _Rope_iterator& __x) argument 1067 operator =(const _Rope_iterator& __x) argument 1533 operator ()(const rope& __x, const rope& __y) argument 1671 rope(const rope& __x, const allocator_type& __a = allocator_type()) argument 1682 operator =(const rope& __x) argument 1694 push_back(_CharT __x) argument 1714 push_front(_CharT __x) argument 2312 operator ==(const _Rope_const_iterator<_CharT,_Alloc>& __x, const _Rope_const_iterator<_CharT,_Alloc>& __y) argument 2319 operator <(const _Rope_const_iterator<_CharT,_Alloc>& __x, const _Rope_const_iterator<_CharT,_Alloc>& __y) argument 2325 operator -(const _Rope_const_iterator<_CharT,_Alloc>& __x, const _Rope_const_iterator<_CharT,_Alloc>& __y) argument 2332 operator -(const _Rope_const_iterator<_CharT,_Alloc>& __x, ptrdiff_t __n) argument 2339 operator +(const _Rope_const_iterator<_CharT,_Alloc>& __x, ptrdiff_t __n) argument 2346 operator +(ptrdiff_t __n, const _Rope_const_iterator<_CharT,_Alloc>& __x) argument 2352 operator ==(const _Rope_iterator<_CharT,_Alloc>& __x, const _Rope_iterator<_CharT,_Alloc>& __y) argument 2359 operator <(const _Rope_iterator<_CharT,_Alloc>& __x, const _Rope_iterator<_CharT,_Alloc>& __y) argument 2365 operator -(const _Rope_iterator<_CharT,_Alloc>& __x, const _Rope_iterator<_CharT,_Alloc>& __y) argument 2372 operator -(const _Rope_iterator<_CharT,_Alloc>& __x, ptrdiff_t __n) argument 2380 operator +(const _Rope_iterator<_CharT,_Alloc>& __x, ptrdiff_t __n) argument 2388 operator +(ptrdiff_t __n, const _Rope_iterator<_CharT,_Alloc>& __x) argument 2470 operator ==(const _Rope_char_ptr_proxy<_CharT,_Alloc>& __x, const _Rope_char_ptr_proxy<_CharT,_Alloc>& __y) argument 2494 swap(rope<_CharT,_Alloc>& __x, rope<_CharT,_Alloc>& __y) argument 2500 swap(crope __x, crope __y) argument 2501 swap(wrope __x, wrope __y) argument [all...] |
/haiku/src/system/libroot/posix/glibc/include/arch/m68k/ |
H A D | mathimpl.h | 37 __m81_defun (double, __ieee754_remainder, (double __x, double __y)) argument 44 __m81_defun (float, __ieee754_remainderf, (float __x, float __y)) argument 59 __m81_defun (double, __ieee754_fmod, (double __x, double __y)) argument 66 __m81_defun (float, __ieee754_fmodf, (float __x, float __y)) argument 51 __m81_defun(long double, __ieee754_remainderl, (long double __x, long double __y)) argument 73 __m81_defun(long double, __ieee754_fmodl, (long double __x, long double __y)) argument [all...] |
/haiku/headers/cpp/std/ |
H A D | std_valarray.h | 239 _Tp operator() (_Tp __x, _Tp __y) const { return __x & __y; } argument 243 _Tp operator() (_Tp __x, _Tp __y) const { return __x | __y; } argument 247 _Tp operator() (_Tp __x, _Tp __y) const { return __x ^ __y; } argument 255 _Tp operator() (_Tp __x, _Tp __y) const { return __x << __y; } argument 259 _Tp operator() (_Tp __x, _Tp __y) const { return __x >> __ argument [all...] |
/haiku/src/system/libroot/posix/glibc/stdlib/ |
H A D | stdlib.h | 511 unsigned short int __x[3]; /* Current state. */ member in struct:drand48_data
|