Sprout/libs/algorithm/test
2015-05-11 10:34:12 +09:00
..
adjacent_find.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
algorithm.cpp add tested compiler 2015-01-12 02:03:30 +09:00
all_of.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
all_of_equal.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
any_of.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
any_of_equal.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
binary_search.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
bogo_sort.cpp add tested compiler 2015-01-12 02:03:30 +09:00
bogo_sort_result.cpp add tested compiler 2015-01-12 02:03:30 +09:00
bozo_sort.cpp add tested compiler 2015-01-12 02:03:30 +09:00
bozo_sort_result.cpp add tested compiler 2015-01-12 02:03:30 +09:00
clamp.cpp add tested compiler 2015-01-12 02:03:30 +09:00
clamp_range.cpp add tested compiler 2015-01-12 02:03:30 +09:00
clamp_range_copy.cpp add tested compiler 2015-01-12 02:03:30 +09:00
CMakeLists.txt fix math::cos 2013-12-18 17:58:27 +09:00
copy.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
copy_backward.cpp add tested compiler 2015-01-12 02:03:30 +09:00
copy_if.cpp add tested compiler 2015-01-12 02:03:30 +09:00
copy_n.cpp add tested compiler 2015-01-12 02:03:30 +09:00
copy_until.cpp add tested compiler 2015-01-12 02:03:30 +09:00
copy_while.cpp add tested compiler 2015-01-12 02:03:30 +09:00
count.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
count_if.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
equal.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
equal_range.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
fill.cpp add tested compiler 2015-01-12 02:03:30 +09:00
fill_n.cpp add tested compiler 2015-01-12 02:03:30 +09:00
find.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
find_end.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
find_first_of.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
find_if.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
find_if_not.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
generate.cpp add tested compiler 2015-01-12 02:03:30 +09:00
generate_n.cpp add tested compiler 2015-01-12 02:03:30 +09:00
includes.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
inplace_merge.cpp add tested compiler 2015-01-12 02:03:30 +09:00
is_decreasing.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
is_heap.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
is_heap_until.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
is_increasing.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
is_partitioned.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
is_permutation.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
is_sorted.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
is_sorted_until.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
is_strictly_decreasing.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
is_strictly_increasing.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
lexicographical_compare.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
lower_bound.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
make_heap.cpp add tested compiler 2015-01-12 02:03:30 +09:00
make_partial_heap.cpp add tested compiler 2015-01-12 02:03:30 +09:00
max.cpp add tested compiler 2015-01-12 02:03:30 +09:00
max_element.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
merge.cpp add tested compiler 2015-01-12 02:03:30 +09:00
min.cpp add tested compiler 2015-01-12 02:03:30 +09:00
min_element.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
minmax.cpp add tested compiler 2015-01-12 02:03:30 +09:00
minmax_element.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
mismatch.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
modifying.cpp add tested compiler 2015-01-12 02:03:30 +09:00
next_permutation.cpp add tested compiler 2015-01-12 02:03:30 +09:00
non_modifying.cpp add tested compiler 2015-01-12 02:03:30 +09:00
none_of.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
none_of_equal.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
nth_element.cpp add tested compiler 2015-01-12 02:03:30 +09:00
one_of.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
one_of_equal.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
partial_sort.cpp add tested compiler 2015-01-12 02:03:30 +09:00
partition.cpp add tested compiler 2015-01-12 02:03:30 +09:00
partition_copy.cpp add tested compiler 2015-01-12 02:03:30 +09:00
partition_point.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
pop_heap.cpp add tested compiler 2015-01-12 02:03:30 +09:00
prev_permutation.cpp add tested compiler 2015-01-12 02:03:30 +09:00
push_heap.cpp add tested compiler 2015-01-12 02:03:30 +09:00
random_swap.cpp add tested compiler 2015-01-12 02:03:30 +09:00
random_swap_result.cpp add tested compiler 2015-01-12 02:03:30 +09:00
recurrence.cpp add tested compiler 2015-01-12 02:03:30 +09:00
recurrence_n.cpp add tested compiler 2015-01-12 02:03:30 +09:00
remove.cpp add tested compiler 2015-01-12 02:03:30 +09:00
remove_copy.cpp add tested compiler 2015-01-12 02:03:30 +09:00
remove_copy_if.cpp add tested compiler 2015-01-12 02:03:30 +09:00
remove_if.cpp add tested compiler 2015-01-12 02:03:30 +09:00
replace.cpp add tested compiler 2015-01-12 02:03:30 +09:00
replace_copy.cpp add tested compiler 2015-01-12 02:03:30 +09:00
replace_copy_if.cpp add tested compiler 2015-01-12 02:03:30 +09:00
replace_if.cpp add tested compiler 2015-01-12 02:03:30 +09:00
reverse.cpp add tested compiler 2015-01-12 02:03:30 +09:00
reverse_copy.cpp add tested compiler 2015-01-12 02:03:30 +09:00
rotate.cpp fix rotate_copy 2015-04-08 00:24:12 +09:00
rotate_copy.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
search.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
search_n.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
set_difference.cpp add tested compiler 2015-01-12 02:03:30 +09:00
set_intersection.cpp add tested compiler 2015-01-12 02:03:30 +09:00
set_symmetric_difference.cpp add tested compiler 2015-01-12 02:03:30 +09:00
set_union.cpp add tested compiler 2015-01-12 02:03:30 +09:00
shuffle.cpp add tested compiler 2015-01-12 02:03:30 +09:00
shuffle_result.cpp add tested compiler 2015-01-12 02:03:30 +09:00
sort.cpp add tested compiler 2015-01-12 02:03:30 +09:00
sort_heap.cpp add tested compiler 2015-01-12 02:03:30 +09:00
stable_partition.cpp add tested compiler 2015-01-12 02:03:30 +09:00
stable_partition_copy.cpp add tested compiler 2015-01-12 02:03:30 +09:00
stable_sort.cpp add tested compiler 2015-01-12 02:03:30 +09:00
swap_element.cpp add tested compiler 2015-01-12 02:03:30 +09:00
swap_element_copy.cpp add tested compiler 2015-01-12 02:03:30 +09:00
transform.cpp add tested compiler 2015-01-12 02:03:30 +09:00
tristate_lexicographical_compare.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00
unfold.cpp add tested compiler 2015-01-12 02:03:30 +09:00
unfold_n.cpp add tested compiler 2015-01-12 02:03:30 +09:00
unique.cpp add tested compiler 2015-01-12 02:03:30 +09:00
unique_copy.cpp add tested compiler 2015-01-12 02:03:30 +09:00
upper_bound.cpp rename reduct_iterator -> reduce_iterator 2015-05-11 10:34:12 +09:00