| /haiku/headers/cpp/ |
| H A D | algo.h | 78 using __STD::merge;
|
| H A D | stl_algo.h | 1378 __result = merge(__first, __first + __step_size,
1385 merge(__first, __first + __step_size, __first + __step_size, __last,
1398 __result = merge(__first, __first + __step_size,
1406 merge(__first, __first + __step_size,
1938 // merge, with and without an explicitly supplied comparison function.
1941 _OutputIter merge(_InputIter1 __first1, _InputIter1 __last1, function
1960 _OutputIter merge(_InputIter1 __first1, _InputIter1 __last1, function
2142 merge(__buffer, __buffer_end, __middle, __last, __first);
2185 merge(__buffer, __buffer_end, __middle, __last, __first, __comp);
|
| H A D | stl_list.h | 500 void merge(list& __x);
507 template <class _StrictWeakOrdering> void merge(list&, _StrictWeakOrdering);
692 void list<_Tp, _Alloc>::merge(list<_Tp, _Alloc>& __x) function in class:list
738 __counter[__i].merge(__carry);
746 __counter[__i].merge(__counter[__i-1]);
783 void list<_Tp, _Alloc>::merge(list<_Tp, _Alloc>& __x, function in class:list
814 __counter[__i].merge(__carry, __comp);
822 __counter[__i].merge(__counter[__i-1], __comp);
|
| H A D | stl_slist.h | 666 void merge(slist& __x);
677 void merge(slist&, _StrictWeakOrdering);
818 void slist<_Tp,_Alloc>::merge(slist<_Tp,_Alloc>& __x) function in class:slist
844 __counter[__i].merge(__carry);
854 __counter[__i].merge(__counter[__i-1]);
890 void slist<_Tp,_Alloc>::merge(slist<_Tp,_Alloc>& __x, function in class:slist
917 __counter[__i].merge(__carry, __comp);
927 __counter[__i].merge(__counter[__i-1], __comp);
|
| /haiku/headers/private/net/ |
| H A D | net_buffer.h | 51 status_t (*merge)(net_buffer* buffer, net_buffer* with, bool after); member in struct:net_buffer_module_info
|
| /haiku/src/add-ons/kernel/drivers/graphics/common/ |
| H A D | memory_manager.c | 53 /** merge "block" with successor */
56 merge(mem_info *mem, mem_block *block) function
71 /** free memory block including merge */
83 merge(mem, prev);
89 merge(mem, block);
|
| /haiku/src/add-ons/kernel/bluetooth/hci/ |
| H A D | acl.cpp | 124 gBufferModule->merge(conn->currentRxPacket, nbuf, true);
|
| /haiku/src/add-ons/kernel/network/protocols/ipv4/ |
| H A D | ipv4.cpp | 320 // Now try if we can already merge the fragments together
331 status_t status = gBufferModule->merge(buffer, previous, false);
332 TRACE(" merge previous: %s", strerror(status));
358 status_t status = gBufferModule->merge(buffer, next, true);
359 TRACE(" merge next: %s", strerror(status));
381 // We couldn't merge the fragments, so we need to add it as is
419 status = gBufferModule->merge(fragment, buffer, false);
422 status = gBufferModule->merge(buffer, fragment, true);
|
| /haiku/src/add-ons/kernel/network/protocols/ipv6/ |
| H A D | ipv6.cpp | 359 // Now try if we can already merge the fragments together
370 status_t status = gBufferModule->merge(buffer, previous, false);
371 TRACE(" merge previous: %s", strerror(status));
397 status_t status = gBufferModule->merge(buffer, next, true);
398 TRACE(" merge next: %s", strerror(status));
420 // We couldn't merge the fragments, so we need to add it as is
458 status = gBufferModule->merge(fragment, buffer, false);
461 status = gBufferModule->merge(buffer, fragment, true);
|
| /haiku/src/apps/showimage/ |
| H A D | ShowImageView.cpp | 1038 ShowImageView::_GetMergeRects(BBitmap* merge, BRect selection, BRect& srcRect, argument
1049 srcRect = merge->Bounds().OffsetToCopy(B_ORIGIN);
1068 ShowImageView::_MergeWithBitmap(BBitmap* merge, BRect selection) argument
1083 _GetMergeRects(merge, selection, srcRect, dstRect);
1084 view.DrawBitmap(merge, srcRect, dstRect);
|
| H A D | ShowImageView.h | 124 void _GetMergeRects(BBitmap* merge,
131 void _MergeWithBitmap(BBitmap* merge,
|