| .. |
|
fit
|
add sub_window, add sub_offset
|
2013-02-26 16:14:04 +09:00 |
|
fixed
|
fix libs/random/example/array.cpp
|
2013-04-11 15:50:14 +09:00 |
|
string
|
add case_conv algorithms
|
2013-04-09 19:27:06 +09:00 |
|
adjacent_find.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
all_of.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
all_of_equal.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
any_of.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
any_of_equal.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
binary_search.hpp
|
add test: some algorithms
|
2013-01-11 03:17:06 +09:00 |
|
bogo_sort.hpp
|
|
|
|
bogo_sort_result.hpp
|
|
|
|
bozo_sort.hpp
|
|
|
|
bozo_sort_result.hpp
|
|
|
|
clamp.hpp
|
add identity
|
2013-03-21 22:11:40 +09:00 |
|
clamp_range.hpp
|
|
|
|
clamp_range_copy.hpp
|
|
|
|
copy.hpp
|
|
|
|
copy_backward.hpp
|
|
|
|
copy_if.hpp
|
|
|
|
copy_n.hpp
|
|
|
|
copy_until.hpp
|
|
|
|
copy_while.hpp
|
|
|
|
count.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
count_if.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
equal.hpp
|
add is_permutation algorithm: robust version (N3607)
|
2013-05-16 19:03:27 +09:00 |
|
equal_range.hpp
|
support hash: floating point
|
2013-02-07 23:12:57 +09:00 |
|
fill.hpp
|
|
|
|
fill_n.hpp
|
|
|
|
find.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
find_difference.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
find_end.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
find_first_of.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
find_if.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
find_if_not.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
find_intersection.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
find_symmetric_difference.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
fit.hpp
|
add back_inserter, front_inserter
|
2013-02-26 10:43:27 +09:00 |
|
fixed.hpp
|
add new signatures: some algorithms
|
2013-01-20 20:49:37 +09:00 |
|
generate.hpp
|
|
|
|
generate_n.hpp
|
|
|
|
includes.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
inplace_merge.hpp
|
|
|
|
is_decreasing.hpp
|
fix recursion depth: all algorithms
|
2013-01-12 03:41:13 +09:00 |
|
is_heap.hpp
|
fix recursion depth: is_heap, is_heap_until
|
2012-12-16 18:20:24 +09:00 |
|
is_heap_until.hpp
|
fix recursion depth O(logN): some algorithms
|
2013-01-03 17:01:50 +09:00 |
|
is_increasing.hpp
|
fix recursion depth: all algorithms
|
2013-01-12 03:41:13 +09:00 |
|
is_partitioned.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
is_permutation.hpp
|
add is_permutation algorithm: robust version (N3607)
|
2013-05-16 19:03:27 +09:00 |
|
is_sorted.hpp
|
add sub_window, add sub_offset
|
2013-02-26 16:14:04 +09:00 |
|
is_sorted_until.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
is_strictly_decreasing.hpp
|
fix recursion depth: all algorithms
|
2013-01-12 03:41:13 +09:00 |
|
is_strictly_increasing.hpp
|
fix recursion depth: all algorithms
|
2013-01-12 03:41:13 +09:00 |
|
lexicographical_compare.hpp
|
add mismatch algorithm: robust version (N3607)
|
2013-05-16 15:13:49 +09:00 |
|
lower_bound.hpp
|
add test: some algorithms
|
2013-01-11 03:17:06 +09:00 |
|
make_heap.hpp
|
|
|
|
make_partial_heap.hpp
|
|
|
|
max.hpp
|
|
|
|
max_element.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
merge.hpp
|
|
|
|
min.hpp
|
|
|
|
min_element.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
minmax.hpp
|
support hash: floating point
|
2013-02-07 23:12:57 +09:00 |
|
minmax_element.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
mismatch.hpp
|
add mismatch algorithm: robust version (N3607)
|
2013-05-16 15:13:49 +09:00 |
|
modifying.hpp
|
|
|
|
next_difference.hpp
|
support hash: floating point
|
2013-02-07 23:12:57 +09:00 |
|
next_intersection.hpp
|
support hash: floating point
|
2013-02-07 23:12:57 +09:00 |
|
next_permutation.hpp
|
|
|
|
next_symmetric_difference.hpp
|
support hash: floating point
|
2013-02-07 23:12:57 +09:00 |
|
next_union.hpp
|
support hash: floating point
|
2013-02-07 23:12:57 +09:00 |
|
non_modifying.hpp
|
support STL container: set operation algorithms
|
2013-01-26 21:30:29 +09:00 |
|
none_of.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
none_of_equal.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
nth_element.hpp
|
|
|
|
one_of.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
one_of_equal.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
partial_sort.hpp
|
|
|
|
partition.hpp
|
|
|
|
partition_copy.hpp
|
|
|
|
partition_point.hpp
|
fix recursion depth: some algorithms
|
2013-01-11 02:55:19 +09:00 |
|
pop_heap.hpp
|
|
|
|
prev_permutation.hpp
|
|
|
|
push_heap.hpp
|
|
|
|
random_swap.hpp
|
|
|
|
random_swap_result.hpp
|
|
|
|
recurrence.hpp
|
|
|
|
recurrence_n.hpp
|
|
|
|
remove.hpp
|
|
|
|
remove_copy.hpp
|
|
|
|
remove_copy_if.hpp
|
|
|
|
remove_if.hpp
|
|
|
|
replace.hpp
|
|
|
|
replace_copy.hpp
|
|
|
|
replace_copy_if.hpp
|
|
|
|
replace_if.hpp
|
|
|
|
reverse.hpp
|
|
|
|
reverse_copy.hpp
|
|
|
|
rotate.hpp
|
|
|
|
rotate_copy.hpp
|
|
|
|
search.hpp
|
fix for GCC4.8 RC
|
2013-03-21 20:00:42 +09:00 |
|
search_n.hpp
|
fix iterator implementation
|
2013-02-23 15:21:27 +09:00 |
|
set_difference.hpp
|
|
|
|
set_intersection.hpp
|
|
|
|
set_intersection_iterator.hpp
|
support hash: floating point
|
2013-02-07 23:12:57 +09:00 |
|
set_symmetric_difference.hpp
|
|
|
|
set_union.hpp
|
|
|
|
shuffle.hpp
|
|
|
|
shuffle_result.hpp
|
|
|
|
sort.hpp
|
|
|
|
sort_heap.hpp
|
|
|
|
stable_partition.hpp
|
|
|
|
stable_partition_copy.hpp
|
|
|
|
stable_sort.hpp
|
|
|
|
string.hpp
|
add case_conv algorithms
|
2013-04-09 19:27:06 +09:00 |
|
swap_element.hpp
|
|
|
|
swap_element_copy.hpp
|
|
|
|
transform.hpp
|
|
|
|
tristate_lexicographical_compare.hpp
|
add mismatch algorithm: robust version (N3607)
|
2013-05-16 15:13:49 +09:00 |
|
unfold.hpp
|
|
|
|
unfold_n.hpp
|
|
|
|
unique.hpp
|
|
|
|
unique_copy.hpp
|
|
|
|
upper_bound.hpp
|
add test: some algorithms
|
2013-01-11 03:17:06 +09:00 |
