/haiku/headers/cpp/ |
H A D | algobase.h | 46 using __STD::swap;
|
H A D | stl_algo.h | 717 swap(*__first++, *__first2++); 727 swap (*__first++, *__first2++); 753 swap (*__first++, *--__last); 991 swap(*__first, *__next);
|
H A D | stl_algobase.h | 61 // swap and iter_swap 76 inline void swap(_Tp& __a, _Tp& __b) { function
|
H A D | stl_bvector.h | 68 inline void swap(_Bit_reference __x, _Bit_reference __y) function 683 void swap(__BVECTOR& __x) { function in class:vector 684 __STD::swap(_M_start, __x._M_start); 685 __STD::swap(_M_finish, __x._M_finish); 686 __STD::swap(_M_end_of_storage, __x._M_end_of_storage);
|
H A D | stl_deque.h | 627 void swap(deque& __x) { function in class:_Deque_iterator::deque 628 __STD::swap(_M_start, __x._M_start); 629 __STD::swap(_M_finish, __x._M_finish); 630 __STD::swap(_M_map, __x._M_map); 631 __STD::swap(_M_map_size, __x._M_map_size); 1680 swap(deque<_Tp,_Alloc,__bufsiz>& __x, deque<_Tp,_Alloc,__bufsiz>& __y) function in struct:_Deque_iterator 1682 __x.swap(__y);
|
H A D | stl_hash_map.h | 150 void swap(hash_map& __hs) { _M_ht.swap(__hs._M_ht); } function in class:hash_map 216 swap(hash_map<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm1, function 219 __hm1.swap(__hm2); 333 void swap(hash_multimap& __hs) { _M_ht.swap(__hs._M_ht); } function in class:hash_multimap 397 swap(hash_multimap<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm1, function 400 __hm1.swap(__hm2);
|
H A D | stl_hash_set.h | 148 void swap(hash_set& __hs) { _M_ht.swap(__hs._M_ht); } function in class:hash_set 211 swap(hash_set<_Val,_HashFcn,_EqualKey,_Alloc>& __hs1, function 214 __hs1.swap(__hs2); 327 void swap(hash_multiset& hs) { _M_ht.swap(hs._M_ht); } function in class:hash_multiset 383 swap(hash_multiset<_Val,_HashFcn,_EqualKey,_Alloc>& __hs1, function 385 __hs1.swap(__hs2);
|
H A D | stl_hashtable.h | 307 void swap(hashtable& __ht) function in class:hashtable 309 __STD::swap(_M_hash, __ht._M_hash); 310 __STD::swap(_M_equals, __ht._M_equals); 311 __STD::swap(_M_get_key, __ht._M_get_key); 312 _M_buckets.swap(__ht._M_buckets); 313 __STD::swap(_M_num_elements, __ht._M_num_elements); 689 inline void swap(hashtable<_Val, _Key, _HF, _Extract, _EqKey, _All>& __ht1, function 691 __ht1.swap(__ht2); 937 _M_buckets.swap(__tmp);
|
H A D | stl_list.h | 341 void swap(list<_Tp, _Alloc>& __x) { __STD::swap(_M_node, __x._M_node); } function in class:list 543 swap(list<_Tp, _Alloc>& __x, list<_Tp, _Alloc>& __y) function 545 __x.swap(__y); 739 __carry.swap(__counter[__i++]); 741 __carry.swap(__counter[__i]); 747 swap(__counter[__fill-1]); 815 __carry.swap(__counter[__i++]); 817 __carry.swap(__counter[__i]); 823 swap(__counte [all...] |
H A D | stl_map.h | 157 void swap(map<_Key,_Tp,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); } function in class:map 224 inline void swap(map<_Key,_Tp,_Compare,_Alloc>& __x, function 226 __x.swap(__y);
|
H A D | stl_multimap.h | 147 void swap(multimap<_Key,_Tp,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); } function in class:multimap 214 inline void swap(multimap<_Key,_Tp,_Compare,_Alloc>& __x, function 216 __x.swap(__y);
|
H A D | stl_multiset.h | 135 void swap(multiset<_Key,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); } function in class:multiset 206 inline void swap(multiset<_Key,_Compare,_Alloc>& __x, function 208 __x.swap(__y);
|
H A D | stl_rope.h | 789 inline void swap(_Rope_char_ref_proxy <_CharT, __Alloc > __a, function 797 // definition of swap doesn't work for proxy references. 803 inline void swap(_Rope_char_ref_proxy <_CharT, __Alloc > __a, \ 1940 void swap(rope& __b) { function in class:rope 2494 inline void swap(rope<_CharT,_Alloc>& __x, rope<_CharT,_Alloc>& __y) { function 2495 __x.swap(__y); 2500 inline void swap(crope __x, crope __y) { __x.swap(__y); } function 2501 inline void swap(wrope __x, wrope __y) { __x.swap(__ function [all...] |
H A D | stl_set.h | 129 void swap(set<_Key,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); } function in class:set 198 inline void swap(set<_Key,_Compare,_Alloc>& __x, function 200 __x.swap(__y);
|
H A D | stl_slist.h | 427 void swap(slist& __x) { __STD::swap(_M_head._M_next, __x._M_head._M_next); } function in class:slist 769 inline void swap(slist<_Tp,_Alloc>& __x, slist<_Tp,_Alloc>& __y) { function 770 __x.swap(__y); 845 __carry.swap(__counter[__i]); 848 __carry.swap(__counter[__i]); 855 this->swap(__counter[__fill-1]); 918 __carry.swap(__counter[__i]); 921 __carry.swap(__counter[__i]); 928 this->swap(__counte [all...] |
H A D | stl_tree.h | 338 __STD::swap(__y->_M_color, __z->_M_color); 702 void swap(_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __t) { function in class:_Rb_tree 703 __STD::swap(_M_header, __t._M_header); 704 __STD::swap(_M_node_count, __t._M_node_count); 705 __STD::swap(_M_key_compare, __t._M_key_compare); 784 swap(_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x, function 787 __x.swap(__y);
|
H A D | stl_vector.h | 349 void swap(vector<_Tp, _Alloc>& __x) { function in class:vector 350 __STD::swap(_M_start, __x._M_start); 351 __STD::swap(_M_finish, __x._M_finish); 352 __STD::swap(_M_end_of_storage, __x._M_end_of_storage); 510 inline void swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y) function 512 __x.swap(__y); 547 __tmp.swap(*this);
|
/haiku/headers/private/graphics/radeon/ |
H A D | multimon.h | 18 status_t GetSwapDisplays( BScreen *screen, bool *swap ); 19 status_t SetSwapDisplays( BScreen *screen, bool swap );
|
/haiku/src/add-ons/kernel/network/stack/ |
H A D | simple_net_buffer.cpp | 616 // if we're at an uneven offset, we have to swap the checksum 649 std::swap(buffer->source, buffer->destination);
|
/haiku/src/apps/mediaplayer/media_node_framework/audio/ |
H A D | AudioReader.cpp | 10 using std::swap; 148 swap(front[i], back[i]);
|
/haiku/src/apps/mediaplayer/supplier/ |
H A D | ProxyAudioSupplier.cpp | 23 using std::swap; 352 swap(front[i], back[i]);
|
/haiku/src/kits/debugger/value/ |
H A D | ValueLoader.cpp | 155 std::swap(pieceBuffer[k],
|
/haiku/src/kits/interface/ |
H A D | GridLayout.cpp | 24 using std::swap; 795 swap(grid, fGrid); 796 swap(columnCount, fColumnCount); 797 swap(rowCount, fRowCount);
|
H A D | Layout.cpp | 26 using std::swap; 607 swap(fOwner, owner);
|
/haiku/src/kits/interface/layouter/ |
H A D | LayoutOptimizer.cpp | 251 swap(Type& a, Type& b) function 291 swap(indices[i], indices[pivot]); 292 swap(b[i], b[pivot]); 358 swap(indices[i], indices[pivot]);
|