gcc/libstdc++-v3/testsuite/25_algorithms
Paolo Carlini e9e90c1f98 PR libstdc++/30449 (fill, fill_n)
2007-01-21  Paolo Carlini  <pcarlini@suse.de>

	PR libstdc++/30449 (fill, fill_n)
	* include/bits/stl_algobase.h (__fill_aux(wchar_t*, wchar_t*,
	const wchar_t&), __fill_n_aux(wchar_t*, _Size, const wchar_t&)): New.
	(fill(signed char*, signed char*, const signed char&),
	fill(unsigned char*, unsigned char*, const unsigned char&),
	fill(char*, char*, char&), fill_n(signed char*, _Size,
	const signed char&), fill_n(unsigned char*, _Size,
	const unsigned char&), fill_n(char*, _Size, char&)): Rename to
	__*_aux.
	(__fill_normal, __fill_n_normal): New, call the latter.
	(fill, fill_n): Adjust, call the latter.	
	* testsuite/25_algorithms/fill/4.cc: New.
	* testsuite/25_algorithms/fill/5.cc: New.

From-SVN: r121027
2007-01-21 09:57:42 +00:00
..
adjacent_find
binary_search
copy re PR libstdc++/25482 (Specialize (overload) std::copy/find for streambuf iterators) 2006-03-21 12:25:11 +00:00
count
count_if
equal
equal_range
fill PR libstdc++/30449 (fill, fill_n) 2007-01-21 09:57:42 +00:00
find re PR libstdc++/25482 (Specialize (overload) std::copy/find for streambuf iterators) 2006-03-21 12:25:11 +00:00
find_end
find_first_of
find_if
heap c++config: Simplify debug namespaces. 2006-02-22 00:57:24 +00:00
includes
inplace_merge
iter_swap
lexicographical_compare
lower_bound
max_element
merge
min_element
mismatch
next_permutation
nth_element 2.cc: New. 2006-08-28 13:26:22 +00:00
partial_sort
partial_sort_copy
partition
prev_permutation
remove
remove_if
replace
replace_copy
replace_copy_if
replace_if
rotate
search
search_n
set_difference
set_intersection
set_symmetric_difference
set_union
stable_sort
swap_ranges
unique
unique_copy DR 538, [Ready] 2006-04-10 10:05:51 +00:00
upper_bound
binary_search.cc
min_max.cc
sort.cc