Partager via


checked_set_union

Same as set_union but enforces the use of a checked iterator as output iterator. checked_set_union is defined in the stdext namespace.

Notes

This algorithm is a Microsoft extension to the Standard C++ Library. Code implemented using this algorithm will not be portable.

template<class InputIterator1, class InputIterator2, class OutputIterator>
   OutputIterator checked_set_union(
      InputIterator1_First1,
      InputIterator1_Last1,
      InputIterator2_First2,
      InputIterator2_Last2,
      OutputIterator_Result
   );
template<class InputIterator1, class InputIterator2, class OutputIterator, class BinaryPredicate>
   OutputIterator checked_set_union(
      InputIterator1 _First1,
      InputIterator1_Last1,
      InputIterator2_First2,
      InputIterator2_Last2,
      OutputIterator_Result,
      BinaryPredicate_Comp
   );

Parameters

  • _First1
    An input iterator addressing the position of the first element in the first of two sorted source ranges to be united and sorted into a single range representing the union of the two source ranges.

  • _Last1
    An input iterator addressing the position one past the last element in the first of two sorted source ranges to be united and sorted into a single range representing the union of the two source ranges.

  • _First2
    An input iterator addressing the position of the first element in second of two consecutive sorted source ranges to be united and sorted into a single range representing the union of the two source ranges.

  • _Last2
    An input iterator addressing the position one past the last element in second of two consecutive sorted source ranges to be united and sorted into a single range representing the union of the two source ranges.

  • _Result
    An output iterator addressing the position of the first element in the destination range where the two source ranges are to be united into a single sorted range representing the union of the two source ranges.

  • _Comp
    User-defined predicate function object that defines the sense in which one element is greater than another. The binary predicate takes two arguments and should return true when the first element is less than the second element and false otherwise.

Return Value

An output iterator addressing the position one past the last element in the sorted destination range representing the union of the two source ranges.

Remarks

See set_union for a code sample.

For more information on checked iterators, see Checked Iterators.

Requirements

Header: <algorithm>

Namespace: stdext

See Also

Concepts

<algorithm> Members

Standard Template Library