diff options
| author | DongHun Kwak <dh0128.kwak@samsung.com> | 2017-09-13 11:05:34 +0900 |
|---|---|---|
| committer | DongHun Kwak <dh0128.kwak@samsung.com> | 2017-09-13 11:06:28 +0900 |
| commit | 34bd32e225e2a8a94104489b31c42e5801cc1f4a (patch) | |
| tree | d021b579a0c190354819974e1eaf0baa54b551f3 /doc/html/boost/movelib/adaptive_merge.html | |
| parent | f763a99a501650eff2c60288aa6f10ef916d769e (diff) | |
| download | boost-34bd32e225e2a8a94104489b31c42e5801cc1f4a.tar.gz boost-34bd32e225e2a8a94104489b31c42e5801cc1f4a.tar.bz2 boost-34bd32e225e2a8a94104489b31c42e5801cc1f4a.zip | |
Imported Upstream version 1.63.0upstream/1.63.0
Change-Id: Iac85556a04b7e58d63ba636dedb0986e3555714a
Signed-off-by: DongHun Kwak <dh0128.kwak@samsung.com>
Diffstat (limited to 'doc/html/boost/movelib/adaptive_merge.html')
| -rw-r--r-- | doc/html/boost/movelib/adaptive_merge.html | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/html/boost/movelib/adaptive_merge.html b/doc/html/boost/movelib/adaptive_merge.html index ede6f8a0b7..8df7906bf2 100644 --- a/doc/html/boost/movelib/adaptive_merge.html +++ b/doc/html/boost/movelib/adaptive_merge.html @@ -38,7 +38,7 @@ <span class="keyword">typename</span> <span class="identifier">iterator_traits</span><span class="special"><</span> <span class="identifier">RandIt</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span> <span class="special">*</span> uninitialized <span class="special">=</span> <span class="number">0</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> uninitialized_len <span class="special">=</span> <span class="number">0</span><span class="special">)</span><span class="special">;</span></pre></div> <div class="refsect1"> -<a name="idm45927887900464"></a><h2>Description</h2> +<a name="idp505911152"></a><h2>Description</h2> <p><span class="bold"><strong>Effects</strong></span>: Merges two consecutive sorted ranges [first, middle) and [middle, last) into one sorted range [first, last) according to the given comparison function comp. The algorithm is stable (if there are equivalent elements in the original two ranges, the elements from the first range (preserving their original order) precede the elements from the second range (preserving their original order).</p> <p><span class="bold"><strong>Requires</strong></span>:</p> <div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> |