Kyle Lutz fab7be5f43 Add inplace_merge() algorithm ...

This adds a simple inplace_merge() algorithm which merges
two contiguous sorted ranges in-place.

For now, the implementation simply copies the ranges to
two temporary vectors and calls merge().

2013-05-20 20:50:12 -04:00

..

accumulate.xml

Initial commit

2013-03-02 15:14:17 -05:00

adjacent_difference.xml

Initial commit

2013-03-02 15:14:17 -05:00

adjacent_find.xml

Initial commit

2013-03-02 15:14:17 -05:00

all_of.xml

Initial commit

2013-03-02 15:14:17 -05:00

any_of.xml

Initial commit

2013-03-02 15:14:17 -05:00

binary_search.xml

Initial commit

2013-03-02 15:14:17 -05:00

copy_if.xml

Initial commit

2013-03-02 15:14:17 -05:00

copy_n.xml

Initial commit

2013-03-02 15:14:17 -05:00

copy.xml

Add system-wide default command queue

2013-05-15 20:59:56 -04:00

count_if.xml

Initial commit

2013-03-02 15:14:17 -05:00

count.xml

Initial commit

2013-03-02 15:14:17 -05:00

equal_range.xml

Initial commit

2013-03-02 15:14:17 -05:00

equal.xml

Initial commit

2013-03-02 15:14:17 -05:00

exclusive_scan.xml

Initial commit

2013-03-02 15:14:17 -05:00

fill_n.xml

Initial commit

2013-03-02 15:14:17 -05:00

fill.xml

Initial commit

2013-03-02 15:14:17 -05:00

find_if_not.xml

Initial commit

2013-03-02 15:14:17 -05:00

find_if.xml

Initial commit

2013-03-02 15:14:17 -05:00

find.xml

Initial commit

2013-03-02 15:14:17 -05:00

for_each.xml

Initial commit

2013-03-02 15:14:17 -05:00

gather.xml

Initial commit

2013-03-02 15:14:17 -05:00

generate_n.xml

Initial commit

2013-03-02 15:14:17 -05:00

generate.xml

Initial commit

2013-03-02 15:14:17 -05:00

inclusive_scan.xml

Initial commit

2013-03-02 15:14:17 -05:00

inner_product.xml

Initial commit

2013-03-02 15:14:17 -05:00

inplace_merge.xml

Add inplace_merge() algorithm

2013-05-20 20:50:12 -04:00

iota.xml

Initial commit

2013-03-02 15:14:17 -05:00

is_partitioned.xml

Initial commit

2013-03-02 15:14:17 -05:00

is_sorted.xml

Initial commit

2013-03-02 15:14:17 -05:00

iter_swap.xml

Initial commit

2013-03-02 15:14:17 -05:00

lower_bound.xml

Initial commit

2013-03-02 15:14:17 -05:00

max_element.xml

Initial commit

2013-03-02 15:14:17 -05:00

merge.xml

Add merge() algorithm

2013-03-10 20:10:58 -04:00

min_element.xml

Initial commit

2013-03-02 15:14:17 -05:00

minmax_element.xml

Initial commit

2013-03-02 15:14:17 -05:00

mismatch.xml

Initial commit

2013-03-02 15:14:17 -05:00

none_of.xml

Initial commit

2013-03-02 15:14:17 -05:00

partial_sum.xml

Initial commit

2013-03-02 15:14:17 -05:00

partition_copy.xml

Initial commit

2013-03-02 15:14:17 -05:00

partition.xml

Initial commit

2013-03-02 15:14:17 -05:00

random_shuffle.xml

Initial commit

2013-03-02 15:14:17 -05:00

reduce.xml

Initial commit

2013-03-02 15:14:17 -05:00

remove_if.xml

Initial commit

2013-03-02 15:14:17 -05:00

remove.xml

Initial commit

2013-03-02 15:14:17 -05:00

replace_copy.xml

Initial commit

2013-03-02 15:14:17 -05:00

replace.xml

Initial commit

2013-03-02 15:14:17 -05:00

reverse_copy.xml

Initial commit

2013-03-02 15:14:17 -05:00

reverse.xml

Initial commit

2013-03-02 15:14:17 -05:00

scatter.xml

Initial commit

2013-03-02 15:14:17 -05:00

sort.xml

Initial commit

2013-03-02 15:14:17 -05:00

stable_sort.xml

Initial commit

2013-03-02 15:14:17 -05:00

swap_ranges.xml

Initial commit

2013-03-02 15:14:17 -05:00

transform_reduce.xml

Initial commit

2013-03-02 15:14:17 -05:00

transform.xml

Initial commit

2013-03-02 15:14:17 -05:00

upper_bound.xml

Initial commit

2013-03-02 15:14:17 -05:00