Commit 3bd2644c by François Dumont

stl_algo.h (remove_copy, [...]): Declare inline.

2013-09-28  François Dumont  <fdumont@gcc.gnu.org>

	* include/bits/stl_algo.h (remove_copy, remove_copy_if): Declare
	inline.
	(rotate_copy, stable_partition, partial_sort_copy): Likewise.
	(lower_bound, upper_bound, equal_range, inplace_merge): Likewise.
	(includes, next_permutation, prev_permutation): Likewise.
	(replace_copy, replace_copy_if, is_sorted_until): Likewise.
	(minmax_element, is_permutation, adjacent_find): Likewise.
	(count, count_if, search, search_n, merge): Likewise.
	(set_intersection, set_difference): Likewise.
	(set_symmetric_difference, min_element, max_element): Likewise.
	* include/bits/stl_algobase.h (lower_bound): Likewise.
	(lexicographical_compare, mismatch): Likewise.

From-SVN: r203008
parent 7540a2c7
2013-09-28 François Dumont <fdumont@gcc.gnu.org>
* include/bits/stl_algo.h (remove_copy, remove_copy_if): Declare
inline.
(rotate_copy, stable_partition, partial_sort_copy): Likewise.
(lower_bound, upper_bound, equal_range, inplace_merge): Likewise.
(includes, next_permutation, prev_permutation): Likewise.
(replace_copy, replace_copy_if, is_sorted_until): Likewise.
(minmax_element, is_permutation, adjacent_find): Likewise.
(count, count_if, search, search_n, merge): Likewise.
(set_intersection, set_difference): Likewise.
(set_symmetric_difference, min_element, max_element): Likewise.
* include/bits/stl_algobase.h (lower_bound): Likewise.
(lexicographical_compare, mismatch): Likewise.
2013-09-28 Tim Shen <timshen91@gmail.com> 2013-09-28 Tim Shen <timshen91@gmail.com>
* include/bits/regex_scanner.tcc (_Scanner<>::_M_eat_escape_posix): * include/bits/regex_scanner.tcc (_Scanner<>::_M_eat_escape_posix):
......
...@@ -898,9 +898,9 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION ...@@ -898,9 +898,9 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
__lexicographical_compare<_BoolType>:: __lexicographical_compare<_BoolType>::
__lc(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2) __lc(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2)
{ {
return std::__lexicographical_compare_impl( return std::__lexicographical_compare_impl(__first1, __last1,
__first1, __last1, __first2, __last2, __first2, __last2,
__gnu_cxx::__ops::__iter_less_iter()); __gnu_cxx::__ops::__iter_less_iter());
} }
template<> template<>
...@@ -976,7 +976,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION ...@@ -976,7 +976,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
* @ingroup binary_search_algorithms * @ingroup binary_search_algorithms
*/ */
template<typename _ForwardIterator, typename _Tp> template<typename _ForwardIterator, typename _Tp>
_ForwardIterator inline _ForwardIterator
lower_bound(_ForwardIterator __first, _ForwardIterator __last, lower_bound(_ForwardIterator __first, _ForwardIterator __last,
const _Tp& __val) const _Tp& __val)
{ {
...@@ -1226,7 +1226,7 @@ _GLIBCXX_BEGIN_NAMESPACE_ALGO ...@@ -1226,7 +1226,7 @@ _GLIBCXX_BEGIN_NAMESPACE_ALGO
* comp parameter instead of @c <. * comp parameter instead of @c <.
*/ */
template<typename _II1, typename _II2, typename _Compare> template<typename _II1, typename _II2, typename _Compare>
bool inline bool
lexicographical_compare(_II1 __first1, _II1 __last1, lexicographical_compare(_II1 __first1, _II1 __last1,
_II2 __first2, _II2 __last2, _Compare __comp) _II2 __first2, _II2 __last2, _Compare __comp)
{ {
...@@ -1269,7 +1269,7 @@ _GLIBCXX_BEGIN_NAMESPACE_ALGO ...@@ -1269,7 +1269,7 @@ _GLIBCXX_BEGIN_NAMESPACE_ALGO
* to by the iterators are not equal. * to by the iterators are not equal.
*/ */
template<typename _InputIterator1, typename _InputIterator2> template<typename _InputIterator1, typename _InputIterator2>
pair<_InputIterator1, _InputIterator2> inline pair<_InputIterator1, _InputIterator2>
mismatch(_InputIterator1 __first1, _InputIterator1 __last1, mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
_InputIterator2 __first2) _InputIterator2 __first2)
{ {
...@@ -1303,7 +1303,7 @@ _GLIBCXX_BEGIN_NAMESPACE_ALGO ...@@ -1303,7 +1303,7 @@ _GLIBCXX_BEGIN_NAMESPACE_ALGO
*/ */
template<typename _InputIterator1, typename _InputIterator2, template<typename _InputIterator1, typename _InputIterator2,
typename _BinaryPredicate> typename _BinaryPredicate>
pair<_InputIterator1, _InputIterator2> inline pair<_InputIterator1, _InputIterator2>
mismatch(_InputIterator1 __first1, _InputIterator1 __last1, mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
_InputIterator2 __first2, _BinaryPredicate __binary_pred) _InputIterator2 __first2, _BinaryPredicate __binary_pred)
{ {
...@@ -1349,7 +1349,7 @@ _GLIBCXX_BEGIN_NAMESPACE_ALGO ...@@ -1349,7 +1349,7 @@ _GLIBCXX_BEGIN_NAMESPACE_ALGO
* to by the iterators are not equal. * to by the iterators are not equal.
*/ */
template<typename _InputIterator1, typename _InputIterator2> template<typename _InputIterator1, typename _InputIterator2>
pair<_InputIterator1, _InputIterator2> inline pair<_InputIterator1, _InputIterator2>
mismatch(_InputIterator1 __first1, _InputIterator1 __last1, mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
_InputIterator2 __first2, _InputIterator2 __last2) _InputIterator2 __first2, _InputIterator2 __last2)
{ {
...@@ -1385,7 +1385,7 @@ _GLIBCXX_BEGIN_NAMESPACE_ALGO ...@@ -1385,7 +1385,7 @@ _GLIBCXX_BEGIN_NAMESPACE_ALGO
*/ */
template<typename _InputIterator1, typename _InputIterator2, template<typename _InputIterator1, typename _InputIterator2,
typename _BinaryPredicate> typename _BinaryPredicate>
pair<_InputIterator1, _InputIterator2> inline pair<_InputIterator1, _InputIterator2>
mismatch(_InputIterator1 __first1, _InputIterator1 __last1, mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
_InputIterator2 __first2, _InputIterator2 __last2, _InputIterator2 __first2, _InputIterator2 __last2,
_BinaryPredicate __binary_pred) _BinaryPredicate __binary_pred)
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment