// Algorithm implementation -*- C++ -*-
-// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
+// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
// Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
+// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING. If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
+// Under Section 7 of GPL version 3, you are granted additional
+// permissions described in the GCC Runtime Library Exception, version
+// 3.1, as published by the Free Software Foundation.
-// As a special exception, you may use this file as part of a free software
-// library without restriction. Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License. This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
+// You should have received a copy of the GNU General Public License and
+// a copy of the GCC Runtime Library Exception along with this program;
+// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
+// <http://www.gnu.org/licenses/>.
/*
*
#include <bits/algorithmfwd.h>
#include <bits/stl_heap.h>
#include <bits/stl_tempbuf.h> // for _Temporary_buffer
-#include <debug/debug.h>
// See concept_check.h for the __glibcxx_*_requires macros.
_GLIBCXX_BEGIN_NAMESPACE(std)
- /**
- * @brief Find the median of three values.
- * @param a A value.
- * @param b A value.
- * @param c A value.
- * @return One of @p a, @p b or @p c.
- *
- * If @c {l,m,n} is some convolution of @p {a,b,c} such that @c l<=m<=n
- * then the value returned will be @c m.
- * This is an SGI extension.
- * @ingroup SGIextensions
- */
- template<typename _Tp>
- inline const _Tp&
- __median(const _Tp& __a, const _Tp& __b, const _Tp& __c)
+ /// Swaps the median value of *__a, *__b and *__c to *__a
+ template<typename _Iterator>
+ void
+ __move_median_first(_Iterator __a, _Iterator __b, _Iterator __c)
{
// concept requirements
- __glibcxx_function_requires(_LessThanComparableConcept<_Tp>)
- if (__a < __b)
- if (__b < __c)
- return __b;
- else if (__a < __c)
- return __c;
- else
- return __a;
- else if (__a < __c)
- return __a;
- else if (__b < __c)
- return __c;
+ __glibcxx_function_requires(_LessThanComparableConcept<
+ typename iterator_traits<_Iterator>::value_type>)
+
+ if (*__a < *__b)
+ {
+ if (*__b < *__c)
+ std::iter_swap(__a, __b);
+ else if (*__a < *__c)
+ std::iter_swap(__a, __c);
+ }
+ else if (*__a < *__c)
+ return;
+ else if (*__b < *__c)
+ std::iter_swap(__a, __c);
else
- return __b;
+ std::iter_swap(__a, __b);
}
- /**
- * @brief Find the median of three values using a predicate for comparison.
- * @param a A value.
- * @param b A value.
- * @param c A value.
- * @param comp A binary predicate.
- * @return One of @p a, @p b or @p c.
- *
- * If @c {l,m,n} is some convolution of @p {a,b,c} such that @p comp(l,m)
- * and @p comp(m,n) are both true then the value returned will be @c m.
- * This is an SGI extension.
- * @ingroup SGIextensions
- */
- template<typename _Tp, typename _Compare>
- inline const _Tp&
- __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)
+ /// Swaps the median value of *__a, *__b and *__c under __comp to *__a
+ template<typename _Iterator, typename _Compare>
+ void
+ __move_median_first(_Iterator __a, _Iterator __b, _Iterator __c,
+ _Compare __comp)
{
// concept requirements
__glibcxx_function_requires(_BinaryFunctionConcept<_Compare, bool,
- _Tp, _Tp>)
- if (__comp(__a, __b))
- if (__comp(__b, __c))
- return __b;
- else if (__comp(__a, __c))
- return __c;
- else
- return __a;
- else if (__comp(__a, __c))
- return __a;
- else if (__comp(__b, __c))
- return __c;
+ typename iterator_traits<_Iterator>::value_type,
+ typename iterator_traits<_Iterator>::value_type>)
+
+ if (__comp(*__a, *__b))
+ {
+ if (__comp(*__b, *__c))
+ std::iter_swap(__a, __b);
+ else if (__comp(*__a, *__c))
+ std::iter_swap(__a, __c);
+ }
+ else if (__comp(*__a, *__c))
+ return;
+ else if (__comp(*__b, *__c))
+ std::iter_swap(__a, __c);
else
- return __b;
+ std::iter_swap(__a, __b);
}
// for_each
/**
* @brief Find last matching subsequence in a sequence.
+ * @ingroup non_mutating_algorithms
* @param first1 Start of range to search.
* @param last1 End of range to search.
* @param first2 Start of sequence to match.
/**
* @brief Find last matching subsequence in a sequence using a predicate.
+ * @ingroup non_mutating_algorithms
* @param first1 Start of range to search.
* @param last1 End of range to search.
* @param first2 Start of sequence to match.
/**
* @brief Checks that a predicate is true for all the elements
* of a sequence.
+ * @ingroup non_mutating_algorithms
* @param first An input iterator.
* @param last An input iterator.
* @param pred A predicate.
/**
* @brief Checks that a predicate is false for all the elements
* of a sequence.
+ * @ingroup non_mutating_algorithms
* @param first An input iterator.
* @param last An input iterator.
* @param pred A predicate.
/**
* @brief Checks that a predicate is false for at least an element
* of a sequence.
+ * @ingroup non_mutating_algorithms
* @param first An input iterator.
* @param last An input iterator.
* @param pred A predicate.
/**
* @brief Find the first element in a sequence for which a
* predicate is false.
+ * @ingroup non_mutating_algorithms
* @param first An input iterator.
* @param last An input iterator.
* @param pred A predicate.
/**
* @brief Checks whether the sequence is partitioned.
+ * @ingroup mutating_algorithms
* @param first An input iterator.
* @param last An input iterator.
* @param pred A predicate.
__first = std::find_if_not(__first, __last, __pred);
return std::none_of(__first, __last, __pred);
}
+
+ /**
+ * @brief Find the partition point of a partitioned range.
+ * @ingroup mutating_algorithms
+ * @param first An iterator.
+ * @param last Another iterator.
+ * @param pred A predicate.
+ * @return An iterator @p mid such that @p all_of(first, mid, pred)
+ * and @p none_of(mid, last, pred) are both true.
+ */
+ template<typename _ForwardIterator, typename _Predicate>
+ _ForwardIterator
+ partition_point(_ForwardIterator __first, _ForwardIterator __last,
+ _Predicate __pred)
+ {
+ // concept requirements
+ __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
+ __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
+ typename iterator_traits<_ForwardIterator>::value_type>)
+
+ // A specific debug-mode test will be necessary...
+ __glibcxx_requires_valid_range(__first, __last);
+
+ typedef typename iterator_traits<_ForwardIterator>::difference_type
+ _DistanceType;
+
+ _DistanceType __len = std::distance(__first, __last);
+ _DistanceType __half;
+ _ForwardIterator __middle;
+
+ while (__len > 0)
+ {
+ __half = __len >> 1;
+ __middle = __first;
+ std::advance(__middle, __half);
+ if (__pred(*__middle))
+ {
+ __first = __middle;
+ ++__first;
+ __len = __len - __half - 1;
+ }
+ else
+ __len = __half;
+ }
+ return __first;
+ }
#endif
/**
* @brief Copy a sequence, removing elements of a given value.
+ * @ingroup mutating_algorithms
* @param first An input iterator.
* @param last An input iterator.
* @param result An output iterator.
/**
* @brief Copy a sequence, removing elements for which a predicate is true.
+ * @ingroup mutating_algorithms
* @param first An input iterator.
* @param last An input iterator.
* @param result An output iterator.
#ifdef __GXX_EXPERIMENTAL_CXX0X__
/**
* @brief Copy the elements of a sequence for which a predicate is true.
+ * @ingroup mutating_algorithms
* @param first An input iterator.
* @param last An input iterator.
* @param result An output iterator.
return __result;
}
+
+ template<typename _InputIterator, typename _Size, typename _OutputIterator>
+ _OutputIterator
+ __copy_n(_InputIterator __first, _Size __n,
+ _OutputIterator __result, input_iterator_tag)
+ {
+ for (; __n > 0; --__n)
+ {
+ *__result = *__first;
+ ++__first;
+ ++__result;
+ }
+ return __result;
+ }
+
+ template<typename _RandomAccessIterator, typename _Size,
+ typename _OutputIterator>
+ inline _OutputIterator
+ __copy_n(_RandomAccessIterator __first, _Size __n,
+ _OutputIterator __result, random_access_iterator_tag)
+ { return std::copy(__first, __first + __n, __result); }
+
+ /**
+ * @brief Copies the range [first,first+n) into [result,result+n).
+ * @ingroup mutating_algorithms
+ * @param first An input iterator.
+ * @param n The number of elements to copy.
+ * @param result An output iterator.
+ * @return result+n.
+ *
+ * This inline function will boil down to a call to @c memmove whenever
+ * possible. Failing that, if random access iterators are passed, then the
+ * loop count will be known (and therefore a candidate for compiler
+ * optimizations such as unrolling).
+ */
+ template<typename _InputIterator, typename _Size, typename _OutputIterator>
+ inline _OutputIterator
+ copy_n(_InputIterator __first, _Size __n, _OutputIterator __result)
+ {
+ // concept requirements
+ __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
+ __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
+ typename iterator_traits<_InputIterator>::value_type>)
+
+ return std::__copy_n(__first, __n, __result,
+ std::__iterator_category(__first));
+ }
+
/**
* @brief Copy the elements of a sequence to separate output sequences
* depending on the truth value of a predicate.
+ * @ingroup mutating_algorithms
* @param first An input iterator.
* @param last An input iterator.
* @param out_true An output iterator.
/**
* @brief Remove elements from a sequence.
+ * @ingroup mutating_algorithms
* @param first An input iterator.
* @param last An input iterator.
* @param value The value to be removed.
/**
* @brief Remove elements from a sequence using a predicate.
+ * @ingroup mutating_algorithms
* @param first A forward iterator.
* @param last A forward iterator.
* @param pred A predicate.
/**
* @brief Remove consecutive duplicate values from a sequence.
+ * @ingroup mutating_algorithms
* @param first A forward iterator.
* @param last A forward iterator.
* @return An iterator designating the end of the resulting sequence.
/**
* @brief Remove consecutive values from a sequence using a predicate.
+ * @ingroup mutating_algorithms
* @param first A forward iterator.
* @param last A forward iterator.
* @param binary_pred A binary predicate.
/**
* @brief Reverse a sequence.
+ * @ingroup mutating_algorithms
* @param first A bidirectional iterator.
* @param last A bidirectional iterator.
* @return reverse() returns no value.
/**
* @brief Copy a sequence, reversing its elements.
+ * @ingroup mutating_algorithms
* @param first A bidirectional iterator.
* @param last A bidirectional iterator.
* @param result An output iterator.
typedef typename iterator_traits<_RandomAccessIterator>::value_type
_ValueType;
- const _Distance __n = __last - __first;
- const _Distance __k = __middle - __first;
- const _Distance __l = __n - __k;
+ _Distance __n = __last - __first;
+ _Distance __k = __middle - __first;
- if (__k == __l)
+ if (__k == __n - __k)
{
std::swap_ranges(__first, __middle, __middle);
return;
}
- const _Distance __d = std::__gcd(__n, __k);
+ _RandomAccessIterator __p = __first;
- for (_Distance __i = 0; __i < __d; __i++)
+ for (;;)
{
- _ValueType __tmp = _GLIBCXX_MOVE(*__first);
- _RandomAccessIterator __p = __first;
-
- if (__k < __l)
+ if (__k < __n - __k)
{
- for (_Distance __j = 0; __j < __l / __d; __j++)
+ if (__is_pod(_ValueType) && __k == 1)
+ {
+ _ValueType __t = _GLIBCXX_MOVE(*__p);
+ _GLIBCXX_MOVE3(__p + 1, __p + __n, __p);
+ *(__p + __n - 1) = _GLIBCXX_MOVE(__t);
+ return;
+ }
+ _RandomAccessIterator __q = __p + __k;
+ for (_Distance __i = 0; __i < __n - __k; ++ __i)
{
- if (__p > __first + __l)
- {
- *__p = _GLIBCXX_MOVE(*(__p - __l));
- __p -= __l;
- }
-
- *__p = _GLIBCXX_MOVE(*(__p + __k));
- __p += __k;
+ std::iter_swap(__p, __q);
+ ++__p;
+ ++__q;
}
+ __n %= __k;
+ if (__n == 0)
+ return;
+ std::swap(__n, __k);
+ __k = __n - __k;
}
else
{
- for (_Distance __j = 0; __j < __k / __d - 1; __j ++)
+ __k = __n - __k;
+ if (__is_pod(_ValueType) && __k == 1)
{
- if (__p < __last - __k)
- {
- *__p = _GLIBCXX_MOVE(*(__p + __k));
- __p += __k;
- }
- *__p = _GLIBCXX_MOVE(*(__p - __l));
- __p -= __l;
+ _ValueType __t = _GLIBCXX_MOVE(*(__p + __n - 1));
+ _GLIBCXX_MOVE_BACKWARD3(__p, __p + __n - 1, __p + __n);
+ *__p = _GLIBCXX_MOVE(__t);
+ return;
}
+ _RandomAccessIterator __q = __p + __n;
+ __p = __q - __k;
+ for (_Distance __i = 0; __i < __n - __k; ++ __i)
+ {
+ --__p;
+ --__q;
+ std::iter_swap(__p, __q);
+ }
+ __n %= __k;
+ if (__n == 0)
+ return;
+ std::swap(__n, __k);
}
-
- *__p = _GLIBCXX_MOVE(__tmp);
- ++__first;
}
}
/**
* @brief Rotate the elements of a sequence.
+ * @ingroup mutating_algorithms
* @param first A forward iterator.
* @param middle A forward iterator.
* @param last A forward iterator.
/**
* @brief Copy a sequence, rotating its elements.
+ * @ingroup mutating_algorithms
* @param first A forward iterator.
* @param middle A forward iterator.
* @param last A forward iterator.
for (; __first != __last; ++__first)
if (__pred(*__first))
{
- *__result1 = *__first;
+ *__result1 = _GLIBCXX_MOVE(*__first);
++__result1;
}
else
{
- *__result2 = *__first;
+ *__result2 = _GLIBCXX_MOVE(*__first);
++__result2;
}
- std::copy(__buffer, __result2, __result1);
+ _GLIBCXX_MOVE3(__buffer, __result2, __result1);
return __result1;
}
else
/**
* @brief Move elements for which a predicate is true to the beginning
* of a sequence, preserving relative ordering.
+ * @ingroup mutating_algorithms
* @param first A forward iterator.
* @param last A forward iterator.
* @param pred A predicate functor.
/**
* @brief Copy the smallest elements of a sequence.
+ * @ingroup sorting_algorithms
* @param first An iterator.
* @param last Another iterator.
* @param result_first A random-access iterator.
/**
* @brief Copy the smallest elements of a sequence using a predicate for
* comparison.
+ * @ingroup sorting_algorithms
* @param first An input iterator.
* @param last Another input iterator.
* @param result_first A random-access iterator.
}
/// This is a helper function for the sort routine.
- template<typename _RandomAccessIterator, typename _Tp>
+ template<typename _RandomAccessIterator>
void
- __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val)
+ __unguarded_linear_insert(_RandomAccessIterator __last)
{
+ typename iterator_traits<_RandomAccessIterator>::value_type
+ __val = _GLIBCXX_MOVE(*__last);
_RandomAccessIterator __next = __last;
--__next;
while (__val < *__next)
{
- *__last = *__next;
+ *__last = _GLIBCXX_MOVE(*__next);
__last = __next;
--__next;
}
- *__last = __val;
+ *__last = _GLIBCXX_MOVE(__val);
}
/// This is a helper function for the sort routine.
- template<typename _RandomAccessIterator, typename _Tp, typename _Compare>
+ template<typename _RandomAccessIterator, typename _Compare>
void
- __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val,
+ __unguarded_linear_insert(_RandomAccessIterator __last,
_Compare __comp)
{
+ typename iterator_traits<_RandomAccessIterator>::value_type
+ __val = _GLIBCXX_MOVE(*__last);
_RandomAccessIterator __next = __last;
--__next;
while (__comp(__val, *__next))
{
- *__last = *__next;
+ *__last = _GLIBCXX_MOVE(*__next);
__last = __next;
--__next;
}
- *__last = __val;
+ *__last = _GLIBCXX_MOVE(__val);
}
/// This is a helper function for the sort routine.
for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
{
- typename iterator_traits<_RandomAccessIterator>::value_type
- __val = *__i;
- if (__val < *__first)
+ if (*__i < *__first)
{
- std::copy_backward(__first, __i, __i + 1);
- *__first = __val;
+ typename iterator_traits<_RandomAccessIterator>::value_type
+ __val = _GLIBCXX_MOVE(*__i);
+ _GLIBCXX_MOVE_BACKWARD3(__first, __i, __i + 1);
+ *__first = _GLIBCXX_MOVE(__val);
}
else
- std::__unguarded_linear_insert(__i, __val);
+ std::__unguarded_linear_insert(__i);
}
}
for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
{
- typename iterator_traits<_RandomAccessIterator>::value_type
- __val = *__i;
- if (__comp(__val, *__first))
+ if (__comp(*__i, *__first))
{
- std::copy_backward(__first, __i, __i + 1);
- *__first = __val;
+ typename iterator_traits<_RandomAccessIterator>::value_type
+ __val = _GLIBCXX_MOVE(*__i);
+ _GLIBCXX_MOVE_BACKWARD3(__first, __i, __i + 1);
+ *__first = _GLIBCXX_MOVE(__val);
}
else
- std::__unguarded_linear_insert(__i, __val, __comp);
+ std::__unguarded_linear_insert(__i, __comp);
}
}
_ValueType;
for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
- std::__unguarded_linear_insert(__i, _ValueType(*__i));
+ std::__unguarded_linear_insert(__i);
}
/// This is a helper function for the sort routine.
_ValueType;
for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
- std::__unguarded_linear_insert(__i, _ValueType(*__i), __comp);
+ std::__unguarded_linear_insert(__i, __comp);
}
/**
template<typename _RandomAccessIterator, typename _Tp>
_RandomAccessIterator
__unguarded_partition(_RandomAccessIterator __first,
- _RandomAccessIterator __last, _Tp __pivot)
+ _RandomAccessIterator __last, const _Tp& __pivot)
{
while (true)
{
_RandomAccessIterator
__unguarded_partition(_RandomAccessIterator __first,
_RandomAccessIterator __last,
- _Tp __pivot, _Compare __comp)
+ const _Tp& __pivot, _Compare __comp)
{
while (true)
{
}
}
+ /// This is a helper function...
+ template<typename _RandomAccessIterator>
+ inline _RandomAccessIterator
+ __unguarded_partition_pivot(_RandomAccessIterator __first,
+ _RandomAccessIterator __last)
+ {
+ _RandomAccessIterator __mid = __first + (__last - __first) / 2;
+ std::__move_median_first(__first, __mid, (__last - 1));
+ return std::__unguarded_partition(__first + 1, __last, *__first);
+ }
+
+
+ /// This is a helper function...
+ template<typename _RandomAccessIterator, typename _Compare>
+ inline _RandomAccessIterator
+ __unguarded_partition_pivot(_RandomAccessIterator __first,
+ _RandomAccessIterator __last, _Compare __comp)
+ {
+ _RandomAccessIterator __mid = __first + (__last - __first) / 2;
+ std::__move_median_first(__first, __mid, (__last - 1), __comp);
+ return std::__unguarded_partition(__first + 1, __last, *__first, __comp);
+ }
+
/// This is a helper function for the sort routine.
template<typename _RandomAccessIterator, typename _Size>
void
_RandomAccessIterator __last,
_Size __depth_limit)
{
- typedef typename iterator_traits<_RandomAccessIterator>::value_type
- _ValueType;
-
while (__last - __first > int(_S_threshold))
{
if (__depth_limit == 0)
}
--__depth_limit;
_RandomAccessIterator __cut =
- std::__unguarded_partition(__first, __last,
- _ValueType(std::__median(*__first,
- *(__first
- + (__last
- - __first)
- / 2),
- *(__last
- - 1))));
+ std::__unguarded_partition_pivot(__first, __last);
std::__introsort_loop(__cut, __last, __depth_limit);
__last = __cut;
}
_RandomAccessIterator __last,
_Size __depth_limit, _Compare __comp)
{
- typedef typename iterator_traits<_RandomAccessIterator>::value_type
- _ValueType;
-
while (__last - __first > int(_S_threshold))
{
if (__depth_limit == 0)
}
--__depth_limit;
_RandomAccessIterator __cut =
- std::__unguarded_partition(__first, __last,
- _ValueType(std::__median(*__first,
- *(__first
- + (__last
- - __first)
- / 2),
- *(__last - 1),
- __comp)),
- __comp);
+ std::__unguarded_partition_pivot(__first, __last, __comp);
std::__introsort_loop(__cut, __last, __depth_limit, __comp);
__last = __cut;
}
}
--__depth_limit;
_RandomAccessIterator __cut =
- std::__unguarded_partition(__first, __last,
- _ValueType(std::__median(*__first,
- *(__first
- + (__last
- - __first)
- / 2),
- *(__last
- - 1))));
+ std::__unguarded_partition_pivot(__first, __last);
if (__cut <= __nth)
__first = __cut;
else
}
--__depth_limit;
_RandomAccessIterator __cut =
- std::__unguarded_partition(__first, __last,
- _ValueType(std::__median(*__first,
- *(__first
- + (__last
- - __first)
- / 2),
- *(__last - 1),
- __comp)),
- __comp);
+ std::__unguarded_partition_pivot(__first, __last, __comp);
if (__cut <= __nth)
__first = __cut;
else
* @param first An iterator.
* @param last Another iterator.
* @param val The search term.
- * @return An iterator pointing to the first element "not less
- * than" @a val, or end() if every element is less than
+ * @return An iterator pointing to the first element <em>not less
+ * than</em> @a val, or end() if every element is less than
* @a val.
- * @ingroup binarysearch
+ * @ingroup binary_search_algorithms
*/
template<typename _ForwardIterator, typename _Tp>
_ForwardIterator
/**
* @brief Finds the first position in which @a val could be inserted
* without changing the ordering.
+ * @ingroup binary_search_algorithms
* @param first An iterator.
* @param last Another iterator.
* @param val The search term.
* @param comp A functor to use for comparisons.
- * @return An iterator pointing to the first element "not less than" @a val,
- * or end() if every element is less than @a val.
- * @ingroup binarysearch
+ * @return An iterator pointing to the first element <em>not less
+ * than</em> @a val, or end() if every element is less
+ * than @a val.
+ * @ingroup binary_search_algorithms
*
* The comparison function should have the same effects on ordering as
* the function used for the initial sort.
/**
* @brief Finds the last position in which @a val could be inserted
* without changing the ordering.
+ * @ingroup binary_search_algorithms
* @param first An iterator.
* @param last Another iterator.
* @param val The search term.
* @return An iterator pointing to the first element greater than @a val,
* or end() if no elements are greater than @a val.
- * @ingroup binarysearch
+ * @ingroup binary_search_algorithms
*/
template<typename _ForwardIterator, typename _Tp>
_ForwardIterator
/**
* @brief Finds the last position in which @a val could be inserted
* without changing the ordering.
+ * @ingroup binary_search_algorithms
* @param first An iterator.
* @param last Another iterator.
* @param val The search term.
* @param comp A functor to use for comparisons.
* @return An iterator pointing to the first element greater than @a val,
* or end() if no elements are greater than @a val.
- * @ingroup binarysearch
+ * @ingroup binary_search_algorithms
*
* The comparison function should have the same effects on ordering as
* the function used for the initial sort.
/**
* @brief Finds the largest subrange in which @a val could be inserted
* at any place in it without changing the ordering.
+ * @ingroup binary_search_algorithms
* @param first An iterator.
* @param last Another iterator.
* @param val The search term.
* @return An pair of iterators defining the subrange.
- * @ingroup binarysearch
+ * @ingroup binary_search_algorithms
*
* This is equivalent to
* @code
* @param val The search term.
* @param comp A functor to use for comparisons.
* @return An pair of iterators defining the subrange.
- * @ingroup binarysearch
+ * @ingroup binary_search_algorithms
*
* This is equivalent to
* @code
/**
* @brief Determines whether an element exists in a range.
+ * @ingroup binary_search_algorithms
* @param first An iterator.
* @param last Another iterator.
* @param val The search term.
* @return True if @a val (or its equivalent) is in [@a first,@a last ].
- * @ingroup binarysearch
*
* Note that this does not actually return an iterator to @a val. For
* that, use std::find or a container's specialized find member functions.
/**
* @brief Determines whether an element exists in a range.
+ * @ingroup binary_search_algorithms
* @param first An iterator.
* @param last Another iterator.
* @param val The search term.
* @param comp A functor to use for comparisons.
* @return True if @a val (or its equivalent) is in [@a first,@a last ].
- * @ingroup binarysearch
*
* Note that this does not actually return an iterator to @a val. For
* that, use std::find or a container's specialized find member functions.
_BidirectionalIterator2 __buffer_end;
if (__len1 > __len2 && __len2 <= __buffer_size)
{
- __buffer_end = std::copy(__middle, __last, __buffer);
- std::copy_backward(__first, __middle, __last);
- return std::copy(__buffer, __buffer_end, __first);
+ __buffer_end = _GLIBCXX_MOVE3(__middle, __last, __buffer);
+ _GLIBCXX_MOVE_BACKWARD3(__first, __middle, __last);
+ return _GLIBCXX_MOVE3(__buffer, __buffer_end, __first);
}
else if (__len1 <= __buffer_size)
{
- __buffer_end = std::copy(__first, __middle, __buffer);
- std::copy(__middle, __last, __first);
- return std::copy_backward(__buffer, __buffer_end, __last);
+ __buffer_end = _GLIBCXX_MOVE3(__first, __middle, __buffer);
+ _GLIBCXX_MOVE3(__middle, __last, __first);
+ return _GLIBCXX_MOVE_BACKWARD3(__buffer, __buffer_end, __last);
}
else
{
{
if (__len1 <= __len2 && __len1 <= __buffer_size)
{
- _Pointer __buffer_end = std::copy(__first, __middle, __buffer);
- _GLIBCXX_STD_P::merge(__buffer, __buffer_end, __middle, __last,
+ _Pointer __buffer_end = _GLIBCXX_MOVE3(__first, __middle, __buffer);
+ _GLIBCXX_STD_P::merge(_GLIBCXX_MAKE_MOVE_ITERATOR(__buffer),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__buffer_end),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__middle),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__last),
__first);
}
else if (__len2 <= __buffer_size)
{
- _Pointer __buffer_end = std::copy(__middle, __last, __buffer);
- std::__merge_backward(__first, __middle, __buffer,
- __buffer_end, __last);
+ _Pointer __buffer_end = _GLIBCXX_MOVE3(__middle, __last, __buffer);
+ std::__merge_backward(_GLIBCXX_MAKE_MOVE_ITERATOR(__first),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__middle),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__buffer),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__buffer_end),
+ __last);
}
else
{
{
if (__len1 <= __len2 && __len1 <= __buffer_size)
{
- _Pointer __buffer_end = std::copy(__first, __middle, __buffer);
- _GLIBCXX_STD_P::merge(__buffer, __buffer_end, __middle, __last,
+ _Pointer __buffer_end = _GLIBCXX_MOVE3(__first, __middle, __buffer);
+ _GLIBCXX_STD_P::merge(_GLIBCXX_MAKE_MOVE_ITERATOR(__buffer),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__buffer_end),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__middle),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__last),
__first, __comp);
}
else if (__len2 <= __buffer_size)
{
- _Pointer __buffer_end = std::copy(__middle, __last, __buffer);
- std::__merge_backward(__first, __middle, __buffer, __buffer_end,
- __last, __comp);
+ _Pointer __buffer_end = _GLIBCXX_MOVE3(__middle, __last, __buffer);
+ std::__merge_backward(_GLIBCXX_MAKE_MOVE_ITERATOR(__first),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__middle),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__buffer),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__buffer_end),
+ __last,__comp);
}
else
{
/**
* @brief Merges two sorted ranges in place.
+ * @ingroup sorting_algorithms
* @param first An iterator.
* @param middle Another iterator.
* @param last Another iterator.
/**
* @brief Merges two sorted ranges in place.
+ * @ingroup sorting_algorithms
* @param first An iterator.
* @param middle Another iterator.
* @param last Another iterator.
while (__last - __first >= __two_step)
{
- __result = _GLIBCXX_STD_P::merge(__first, __first + __step_size,
- __first + __step_size,
- __first + __two_step,
- __result);
+ __result = _GLIBCXX_STD_P::merge(
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__first),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__first + __step_size),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__first + __step_size),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__first + __two_step),
+ __result);
__first += __two_step;
}
__step_size = std::min(_Distance(__last - __first), __step_size);
- _GLIBCXX_STD_P::merge(__first, __first + __step_size,
- __first + __step_size, __last,
+ _GLIBCXX_STD_P::merge(_GLIBCXX_MAKE_MOVE_ITERATOR(__first),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__first +
+ __step_size),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__first +
+ __step_size),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__last),
__result);
}
while (__last - __first >= __two_step)
{
- __result = _GLIBCXX_STD_P::merge(__first, __first + __step_size,
- __first + __step_size, __first + __two_step,
- __result,
- __comp);
+ __result = _GLIBCXX_STD_P::merge(
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__first),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__first + __step_size),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__first + __step_size),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__first + __two_step),
+ __result, __comp);
__first += __two_step;
}
__step_size = std::min(_Distance(__last - __first), __step_size);
- _GLIBCXX_STD_P::merge(__first, __first + __step_size,
- __first + __step_size, __last, __result, __comp);
+ _GLIBCXX_STD_P::merge(_GLIBCXX_MAKE_MOVE_ITERATOR(__first),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__first +
+ __step_size),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__first +
+ __step_size),
+ _GLIBCXX_MAKE_MOVE_ITERATOR(__last),
+ __result, __comp);
}
template<typename _RandomAccessIterator, typename _Distance>
* @param last2 End of sequence.
* @return True if each element in [first2,last2) is contained in order
* within [first1,last1). False otherwise.
- * @ingroup setoperations
+ * @ingroup set_algorithms
*
* This operation expects both [first1,last1) and [first2,last2) to be
* sorted. Searches for the presence of each element in [first2,last2)
/**
* @brief Determines whether all elements of a sequence exists in a range
* using comparison.
+ * @ingroup set_algorithms
* @param first1 Start of search range.
* @param last1 End of search range.
* @param first2 Start of sequence
* @param comp Comparison function to use.
* @return True if each element in [first2,last2) is contained in order
* within [first1,last1) according to comp. False otherwise.
- * @ingroup setoperations
+ * @ingroup set_algorithms
*
* This operation expects both [first1,last1) and [first2,last2) to be
* sorted. Searches for the presence of each element in [first2,last2)
// max_element
/**
- * @brief Permute range into the next "dictionary" ordering.
+ * @brief Permute range into the next @a dictionary ordering.
+ * @ingroup sorting_algorithms
* @param first Start of range.
* @param last End of range.
* @return False if wrapped to first permutation, true otherwise.
*
- * Treats all permutations of the range as a set of "dictionary" sorted
+ * Treats all permutations of the range as a set of @a dictionary sorted
* sequences. Permutes the current sequence into the next one of this set.
* Returns true if there are more sequences to generate. If the sequence
* is the largest of the set, the smallest is generated and false returned.
}
/**
- * @brief Permute range into the next "dictionary" ordering using
+ * @brief Permute range into the next @a dictionary ordering using
* comparison functor.
+ * @ingroup sorting_algorithms
* @param first Start of range.
* @param last End of range.
* @param comp A comparison functor.
* @return False if wrapped to first permutation, true otherwise.
*
* Treats all permutations of the range [first,last) as a set of
- * "dictionary" sorted sequences ordered by @a comp. Permutes the current
+ * @a dictionary sorted sequences ordered by @a comp. Permutes the current
* sequence into the next one of this set. Returns true if there are more
* sequences to generate. If the sequence is the largest of the set, the
* smallest is generated and false returned.
}
/**
- * @brief Permute range into the previous "dictionary" ordering.
+ * @brief Permute range into the previous @a dictionary ordering.
+ * @ingroup sorting_algorithms
* @param first Start of range.
* @param last End of range.
* @return False if wrapped to last permutation, true otherwise.
*
- * Treats all permutations of the range as a set of "dictionary" sorted
+ * Treats all permutations of the range as a set of @a dictionary sorted
* sequences. Permutes the current sequence into the previous one of this
* set. Returns true if there are more sequences to generate. If the
* sequence is the smallest of the set, the largest is generated and false
}
/**
- * @brief Permute range into the previous "dictionary" ordering using
+ * @brief Permute range into the previous @a dictionary ordering using
* comparison functor.
+ * @ingroup sorting_algorithms
* @param first Start of range.
* @param last End of range.
* @param comp A comparison functor.
* @return False if wrapped to last permutation, true otherwise.
*
* Treats all permutations of the range [first,last) as a set of
- * "dictionary" sorted sequences ordered by @a comp. Permutes the current
+ * @a dictionary sorted sequences ordered by @a comp. Permutes the current
* sequence into the previous one of this set. Returns true if there are
* more sequences to generate. If the sequence is the smallest of the set,
* the largest is generated and false returned.
/**
* @brief Copy a sequence, replacing each value for which a predicate
* returns true with another value.
+ * @ingroup mutating_algorithms
* @param first An input iterator.
* @param last An input iterator.
* @param result An output iterator.
#ifdef __GXX_EXPERIMENTAL_CXX0X__
/**
* @brief Determines whether the elements of a sequence are sorted.
+ * @ingroup sorting_algorithms
* @param first An iterator.
* @param last Another iterator.
* @return True if the elements are sorted, false otherwise.
/**
* @brief Determines whether the elements of a sequence are sorted
* according to a comparison functor.
+ * @ingroup sorting_algorithms
* @param first An iterator.
* @param last Another iterator.
* @param comp A comparison functor.
/**
* @brief Determines the end of a sorted sequence.
+ * @ingroup sorting_algorithms
* @param first An iterator.
* @param last Another iterator.
* @return An iterator pointing to the last iterator i in [first, last)
/**
* @brief Determines the end of a sorted sequence using comparison functor.
+ * @ingroup sorting_algorithms
* @param first An iterator.
* @param last Another iterator.
* @param comp A comparison functor.
/**
* @brief Determines min and max at once as an ordered pair.
+ * @ingroup sorting_algorithms
* @param a A thing of arbitrary type.
* @param b Another thing of arbitrary type.
* @return A pair(b, a) if b is smaller than a, pair(a, b) otherwise.
/**
* @brief Determines min and max at once as an ordered pair.
+ * @ingroup sorting_algorithms
* @param a A thing of arbitrary type.
* @param b Another thing of arbitrary type.
- * @param comp A @link s20_3_3_comparisons comparison functor@endlink.
+ * @param comp A @link comparison_functor comparison functor@endlink.
* @return A pair(b, a) if b is smaller than a, pair(a, b) otherwise.
*/
template<typename _Tp, typename _Compare>
/**
* @brief Return a pair of iterators pointing to the minimum and maximum
* elements in a range.
+ * @ingroup sorting_algorithms
* @param first Start of range.
* @param last End of range.
* @return make_pair(m, M), where m is the first iterator i in
/**
* @brief Return a pair of iterators pointing to the minimum and maximum
* elements in a range.
+ * @ingroup sorting_algorithms
* @param first Start of range.
* @param last End of range.
* @param comp Comparison functor.
return std::make_pair(__min, __max);
}
+
+ // N2722 + DR 915.
+ template<typename _Tp>
+ inline _Tp
+ min(initializer_list<_Tp> __l)
+ { return *std::min_element(__l.begin(), __l.end()); }
+
+ template<typename _Tp, typename _Compare>
+ inline _Tp
+ min(initializer_list<_Tp> __l, _Compare __comp)
+ { return *std::min_element(__l.begin(), __l.end(), __comp); }
+
+ template<typename _Tp>
+ inline _Tp
+ max(initializer_list<_Tp> __l)
+ { return *std::max_element(__l.begin(), __l.end()); }
+
+ template<typename _Tp, typename _Compare>
+ inline _Tp
+ max(initializer_list<_Tp> __l, _Compare __comp)
+ { return *std::max_element(__l.begin(), __l.end(), __comp); }
+
+ template<typename _Tp>
+ inline pair<_Tp, _Tp>
+ minmax(initializer_list<_Tp> __l)
+ {
+ pair<const _Tp*, const _Tp*> __p =
+ std::minmax_element(__l.begin(), __l.end());
+ return std::make_pair(*__p.first, *__p.second);
+ }
+
+ template<typename _Tp, typename _Compare>
+ inline pair<_Tp, _Tp>
+ minmax(initializer_list<_Tp> __l, _Compare __comp)
+ {
+ pair<const _Tp*, const _Tp*> __p =
+ std::minmax_element(__l.begin(), __l.end(), __comp);
+ return std::make_pair(*__p.first, *__p.second);
+ }
#endif // __GXX_EXPERIMENTAL_CXX0X__
_GLIBCXX_END_NAMESPACE
/**
* @brief Apply a function to every element of a sequence.
+ * @ingroup non_mutating_algorithms
* @param first An input iterator.
* @param last An input iterator.
* @param f A unary function object.
- * @return @p f.
+ * @return @p f (std::move(@p f) in C++0x).
*
* Applies the function object @p f to each element in the range
* @p [first,last). @p f must not modify the order of the sequence.
__glibcxx_requires_valid_range(__first, __last);
for (; __first != __last; ++__first)
__f(*__first);
- return __f;
+ return _GLIBCXX_MOVE(__f);
}
/**
* @brief Find the first occurrence of a value in a sequence.
+ * @ingroup non_mutating_algorithms
* @param first An input iterator.
* @param last An input iterator.
* @param val The value to find.
/**
* @brief Find the first element in a sequence for which a
* predicate is true.
+ * @ingroup non_mutating_algorithms
* @param first An input iterator.
* @param last An input iterator.
* @param pred A predicate.
/**
* @brief Find element from a set in a sequence.
+ * @ingroup non_mutating_algorithms
* @param first1 Start of range to search.
* @param last1 End of range to search.
* @param first2 Start of match candidates.
/**
* @brief Find element from a set in a sequence using a predicate.
+ * @ingroup non_mutating_algorithms
* @param first1 Start of range to search.
* @param last1 End of range to search.
* @param first2 Start of match candidates.
/**
* @brief Find two adjacent values in a sequence that are equal.
+ * @ingroup non_mutating_algorithms
* @param first A forward iterator.
* @param last A forward iterator.
* @return The first iterator @c i such that @c i and @c i+1 are both
/**
* @brief Find two adjacent values in a sequence using a predicate.
+ * @ingroup non_mutating_algorithms
* @param first A forward iterator.
* @param last A forward iterator.
* @param binary_pred A binary predicate.
/**
* @brief Count the number of copies of a value in a sequence.
+ * @ingroup non_mutating_algorithms
* @param first An input iterator.
* @param last An input iterator.
* @param value The value to be counted.
/**
* @brief Count the elements of a sequence for which a predicate is true.
+ * @ingroup non_mutating_algorithms
* @param first An input iterator.
* @param last An input iterator.
* @param pred A predicate.
/**
* @brief Search a sequence for a matching sub-sequence.
+ * @ingroup non_mutating_algorithms
* @param first1 A forward iterator.
* @param last1 A forward iterator.
* @param first2 A forward iterator.
/**
* @brief Search a sequence for a matching sub-sequence using a predicate.
+ * @ingroup non_mutating_algorithms
* @param first1 A forward iterator.
* @param last1 A forward iterator.
* @param first2 A forward iterator.
/**
* @brief Search a sequence for a number of consecutive values.
+ * @ingroup non_mutating_algorithms
* @param first A forward iterator.
* @param last A forward iterator.
* @param count The number of consecutive values.
/**
* @brief Search a sequence for a number of consecutive values using a
* predicate.
+ * @ingroup non_mutating_algorithms
* @param first A forward iterator.
* @param last A forward iterator.
* @param count The number of consecutive values.
/**
* @brief Perform an operation on a sequence.
+ * @ingroup mutating_algorithms
* @param first An input iterator.
* @param last An input iterator.
* @param result An output iterator.
/**
* @brief Perform an operation on corresponding elements of two sequences.
+ * @ingroup mutating_algorithms
* @param first1 An input iterator.
* @param last1 An input iterator.
* @param first2 An input iterator.
/**
* @brief Replace each occurrence of one value in a sequence with another
* value.
+ * @ingroup mutating_algorithms
* @param first A forward iterator.
* @param last A forward iterator.
* @param old_value The value to be replaced.
/**
* @brief Replace each value in a sequence for which a predicate returns
* true with another value.
+ * @ingroup mutating_algorithms
* @param first A forward iterator.
* @param last A forward iterator.
* @param pred A predicate.
/**
* @brief Assign the result of a function object to each value in a
* sequence.
+ * @ingroup mutating_algorithms
* @param first A forward iterator.
* @param last A forward iterator.
* @param gen A function object taking no arguments and returning
/**
* @brief Assign the result of a function object to each value in a
* sequence.
+ * @ingroup mutating_algorithms
* @param first A forward iterator.
* @param n The length of the sequence.
* @param gen A function object taking no arguments and returning
*
* Performs the assignment @c *i = @p gen() for each @c i in the range
* @p [first,first+n).
+ *
+ * _GLIBCXX_RESOLVE_LIB_DEFECTS
+ * DR 865. More algorithms that throw away information
*/
template<typename _OutputIterator, typename _Size, typename _Generator>
_OutputIterator
/**
* @brief Copy a sequence, removing consecutive duplicate values.
+ * @ingroup mutating_algorithms
* @param first An input iterator.
* @param last An input iterator.
* @param result An output iterator.
/**
* @brief Copy a sequence, removing consecutive values using a predicate.
+ * @ingroup mutating_algorithms
* @param first An input iterator.
* @param last An input iterator.
* @param result An output iterator.
/**
* @brief Randomly shuffle the elements of a sequence.
+ * @ingroup mutating_algorithms
* @param first A forward iterator.
* @param last A forward iterator.
* @return Nothing.
/**
* @brief Shuffle the elements of a sequence using a random number
* generator.
+ * @ingroup mutating_algorithms
* @param first A forward iterator.
* @param last A forward iterator.
* @param rand The RNG functor or function.
/**
* @brief Move elements for which a predicate is true to the beginning
* of a sequence.
+ * @ingroup mutating_algorithms
* @param first A forward iterator.
* @param last A forward iterator.
* @param pred A predicate functor.
/**
* @brief Sort the smallest elements of a sequence.
+ * @ingroup sorting_algorithms
* @param first An iterator.
* @param middle Another iterator.
* @param last Another iterator.
/**
* @brief Sort the smallest elements of a sequence using a predicate
* for comparison.
+ * @ingroup sorting_algorithms
* @param first An iterator.
* @param middle Another iterator.
* @param last Another iterator.
/**
* @brief Sort a sequence just enough to find a particular position.
+ * @ingroup sorting_algorithms
* @param first An iterator.
* @param nth Another iterator.
* @param last Another iterator.
/**
* @brief Sort a sequence just enough to find a particular position
* using a predicate for comparison.
+ * @ingroup sorting_algorithms
* @param first An iterator.
* @param nth Another iterator.
* @param last Another iterator.
/**
* @brief Sort the elements of a sequence.
+ * @ingroup sorting_algorithms
* @param first An iterator.
* @param last Another iterator.
* @return Nothing.
/**
* @brief Sort the elements of a sequence using a predicate for comparison.
+ * @ingroup sorting_algorithms
* @param first An iterator.
* @param last Another iterator.
* @param comp A comparison functor.
/**
* @brief Merges two sorted ranges.
+ * @ingroup sorting_algorithms
* @param first1 An iterator.
* @param first2 Another iterator.
* @param last1 Another iterator.
* @param last2 Another iterator.
* @param result An iterator pointing to the end of the merged range.
- * @return An iterator pointing to the first element "not less
- * than" @a val.
+ * @return An iterator pointing to the first element <em>not less
+ * than</em> @a val.
*
* Merges the ranges [first1,last1) and [first2,last2) into the sorted range
* [result, result + (last1-first1) + (last2-first2)). Both input ranges
/**
* @brief Merges two sorted ranges.
+ * @ingroup sorting_algorithms
* @param first1 An iterator.
* @param first2 Another iterator.
* @param last1 Another iterator.
/**
* @brief Sort the elements of a sequence, preserving the relative order
* of equivalent elements.
+ * @ingroup sorting_algorithms
* @param first An iterator.
* @param last Another iterator.
* @return Nothing.
/**
* @brief Sort the elements of a sequence using a predicate for comparison,
* preserving the relative order of equivalent elements.
+ * @ingroup sorting_algorithms
* @param first An iterator.
* @param last Another iterator.
* @param comp A comparison functor.
/**
* @brief Return the union of two sorted ranges.
+ * @ingroup set_algorithms
* @param first1 Start of first range.
* @param last1 End of first range.
* @param first2 Start of second range.
* @param last2 End of second range.
* @return End of the output range.
- * @ingroup setoperations
+ * @ingroup set_algorithms
*
* This operation iterates over both ranges, copying elements present in
* each range in order to the output range. Iterators increment for each
/**
* @brief Return the union of two sorted ranges using a comparison functor.
+ * @ingroup set_algorithms
* @param first1 Start of first range.
* @param last1 End of first range.
* @param first2 Start of second range.
* @param last2 End of second range.
* @param comp The comparison functor.
* @return End of the output range.
- * @ingroup setoperations
+ * @ingroup set_algorithms
*
* This operation iterates over both ranges, copying elements present in
* each range in order to the output range. Iterators increment for each
/**
* @brief Return the intersection of two sorted ranges.
+ * @ingroup set_algorithms
* @param first1 Start of first range.
* @param last1 End of first range.
* @param first2 Start of second range.
* @param last2 End of second range.
* @return End of the output range.
- * @ingroup setoperations
+ * @ingroup set_algorithms
*
* This operation iterates over both ranges, copying elements present in
* both ranges in order to the output range. Iterators increment for each
/**
* @brief Return the intersection of two sorted ranges using comparison
* functor.
+ * @ingroup set_algorithms
* @param first1 Start of first range.
* @param last1 End of first range.
* @param first2 Start of second range.
* @param last2 End of second range.
* @param comp The comparison functor.
* @return End of the output range.
- * @ingroup setoperations
+ * @ingroup set_algorithms
*
* This operation iterates over both ranges, copying elements present in
* both ranges in order to the output range. Iterators increment for each
/**
* @brief Return the difference of two sorted ranges.
+ * @ingroup set_algorithms
* @param first1 Start of first range.
* @param last1 End of first range.
* @param first2 Start of second range.
* @param last2 End of second range.
* @return End of the output range.
- * @ingroup setoperations
+ * @ingroup set_algorithms
*
* This operation iterates over both ranges, copying elements present in
* the first range but not the second in order to the output range.
/**
* @brief Return the difference of two sorted ranges using comparison
* functor.
+ * @ingroup set_algorithms
* @param first1 Start of first range.
* @param last1 End of first range.
* @param first2 Start of second range.
* @param last2 End of second range.
* @param comp The comparison functor.
* @return End of the output range.
- * @ingroup setoperations
+ * @ingroup set_algorithms
*
* This operation iterates over both ranges, copying elements present in
* the first range but not the second in order to the output range.
/**
* @brief Return the symmetric difference of two sorted ranges.
+ * @ingroup set_algorithms
* @param first1 Start of first range.
* @param last1 End of first range.
* @param first2 Start of second range.
* @param last2 End of second range.
* @return End of the output range.
- * @ingroup setoperations
+ * @ingroup set_algorithms
*
* This operation iterates over both ranges, copying elements present in
* one range but not the other in order to the output range. Iterators
/**
* @brief Return the symmetric difference of two sorted ranges using
* comparison functor.
+ * @ingroup set_algorithms
* @param first1 Start of first range.
* @param last1 End of first range.
* @param first2 Start of second range.
* @param last2 End of second range.
* @param comp The comparison functor.
* @return End of the output range.
- * @ingroup setoperations
+ * @ingroup set_algorithms
*
* This operation iterates over both ranges, copying elements present in
* one range but not the other in order to the output range. Iterators
/**
* @brief Return the minimum element in a range.
+ * @ingroup sorting_algorithms
* @param first Start of range.
* @param last End of range.
* @return Iterator referencing the first instance of the smallest value.
/**
* @brief Return the minimum element in a range using comparison functor.
+ * @ingroup sorting_algorithms
* @param first Start of range.
* @param last End of range.
* @param comp Comparison functor.
/**
* @brief Return the maximum element in a range.
+ * @ingroup sorting_algorithms
* @param first Start of range.
* @param last End of range.
* @return Iterator referencing the first instance of the largest value.
/**
* @brief Return the maximum element in a range using comparison functor.
+ * @ingroup sorting_algorithms
* @param first Start of range.
* @param last End of range.
* @param comp Comparison functor.
OSDN Git Service
