SHA_Sort::MergeInPlace< IT > Class Template Reference
#include <merge.hxx>
Public Member Functions | |
void | operator() (IT begin, IT middle, IT end) |
Detailed Description
template<typename IT>
class SHA_Sort::MergeInPlace< IT >
MergeInplace - Inplace merging of two ordered sequences of a collection Proceed a in place merge of two sequences of elements contained in [begin, middle[ and [middle, end[.
- Warning
- Both sequence [bengin, middle[ and [middle, end[ need to be ordered.
- Remarks
- use MergeWithBuffer to proceed the merge using a buffer: Takes higher memory consumption and lower computation consumption.
- Complexity
- O(N * M)
- Template Parameters
-
IT type.
- Parameters
-
begin,middle,end iterators to the initial and final positions of the sequence to be sorted. The range used is [first,last), which contains all the elements between first and last, including the element pointed by first but not the element pointed by last.
- Returns
- void.
Member Function Documentation
template<typename IT>
|
inline |
The documentation for this class was generated from the following file: